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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:43:09,831 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:43:09,834 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:43:09,848 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:43:09,848 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:43:09,850 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:43:09,851 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:43:09,855 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:43:09,857 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:43:09,858 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:43:09,859 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:43:09,859 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:43:09,860 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:43:09,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:43:09,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:43:09,863 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:43:09,864 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:43:09,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:43:09,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:43:09,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:43:09,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:43:09,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:43:09,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:43:09,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:43:09,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:43:09,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:43:09,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:43:09,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:43:09,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:43:09,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:43:09,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:43:09,881 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:43:09,881 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:43:09,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:43:09,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:43:09,883 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:43:09,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:43:09,913 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:43:09,913 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:43:09,915 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:43:09,915 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:43:09,916 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:43:09,916 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:43:09,917 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:43:09,917 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:43:09,917 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:43:09,917 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:43:09,917 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:43:09,918 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:43:09,918 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:43:09,918 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:43:09,918 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:43:09,918 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:43:09,919 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:43:09,920 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:43:09,920 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:43:09,920 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:43:09,921 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:43:09,921 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:43:09,921 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:43:09,921 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:43:09,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:43:09,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:43:09,922 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:43:09,922 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:43:09,922 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:43:09,923 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:43:09,923 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:43:09,983 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:43:10,006 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:43:10,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:43:10,013 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:43:10,013 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:43:10,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-14 18:43:10,078 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f22b54eb/8e94a076a9ec4d1bbd494809160d446d/FLAGe2bbe1aec [2018-11-14 18:43:10,499 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:43:10,500 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-14 18:43:10,505 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f22b54eb/8e94a076a9ec4d1bbd494809160d446d/FLAGe2bbe1aec [2018-11-14 18:43:10,522 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f22b54eb/8e94a076a9ec4d1bbd494809160d446d [2018-11-14 18:43:10,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:43:10,533 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:43:10,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:43:10,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:43:10,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:43:10,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d509981 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10, skipping insertion in model container [2018-11-14 18:43:10,543 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,551 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:43:10,571 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:43:10,836 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:43:10,841 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:43:10,868 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:43:10,898 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:43:10,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10 WrapperNode [2018-11-14 18:43:10,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:43:10,900 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:43:10,900 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:43:10,900 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:43:10,915 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,939 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,941 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... [2018-11-14 18:43:10,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:43:10,943 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:43:10,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:43:10,944 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:43:10,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:43:11,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:43:11,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:43:11,088 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:43:11,089 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:43:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:43:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:43:11,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:43:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:43:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:43:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:43:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:43:11,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:43:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:43:11,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:43:11,626 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:43:11,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:43:11 BoogieIcfgContainer [2018-11-14 18:43:11,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:43:11,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:43:11,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:43:11,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:43:11,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:43:10" (1/3) ... [2018-11-14 18:43:11,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20706529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:43:11, skipping insertion in model container [2018-11-14 18:43:11,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:43:10" (2/3) ... [2018-11-14 18:43:11,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20706529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:43:11, skipping insertion in model container [2018-11-14 18:43:11,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:43:11" (3/3) ... [2018-11-14 18:43:11,637 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_true-unreach-call_ground.i [2018-11-14 18:43:11,647 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:43:11,657 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:43:11,677 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:43:11,712 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:43:11,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:43:11,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:43:11,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:43:11,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:43:11,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:43:11,714 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:43:11,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:43:11,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:43:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 18:43:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 18:43:11,742 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:11,743 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:11,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:11,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:11,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1032870253, now seen corresponding path program 1 times [2018-11-14 18:43:11,755 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:11,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:11,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:11,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:11,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:11,993 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 18:43:11,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28#true} is VALID [2018-11-14 18:43:11,998 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 18:43:11,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #50#return; {28#true} is VALID [2018-11-14 18:43:11,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret2 := main(); {28#true} is VALID [2018-11-14 18:43:12,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {28#true} is VALID [2018-11-14 18:43:12,019 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-14 18:43:12,020 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0; {29#false} is VALID [2018-11-14 18:43:12,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume true; {29#false} is VALID [2018-11-14 18:43:12,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {29#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {29#false} is VALID [2018-11-14 18:43:12,021 INFO L256 TraceCheckUtils]: 10: Hoare triple {29#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {29#false} is VALID [2018-11-14 18:43:12,022 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-14 18:43:12,022 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume ~cond == 0; {29#false} is VALID [2018-11-14 18:43:12,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 18:43:12,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:12,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:43:12,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:43:12,037 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:43:12,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:12,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:43:12,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:12,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:43:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:43:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:43:12,116 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-14 18:43:12,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:12,230 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 18:43:12,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:43:12,231 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 18:43:12,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:12,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:43:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-14 18:43:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:43:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-14 18:43:12,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-14 18:43:12,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:12,560 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:43:12,560 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 18:43:12,564 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-14 18:43:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 18:43:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 18:43:12,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:12,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 18:43:12,627 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:43:12,627 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:43:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:12,631 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 18:43:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:43:12,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:12,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:12,632 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 18:43:12,632 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 18:43:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:12,636 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 18:43:12,636 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:43:12,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:12,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:12,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:12,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:43:12,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 18:43:12,641 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 18:43:12,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:12,642 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 18:43:12,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:43:12,642 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 18:43:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:43:12,643 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:12,643 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:12,643 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:12,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:12,644 INFO L82 PathProgramCache]: Analyzing trace with hash -2053791372, now seen corresponding path program 1 times [2018-11-14 18:43:12,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:12,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:12,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:12,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:12,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:12,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {153#true} call ULTIMATE.init(); {153#true} is VALID [2018-11-14 18:43:12,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {153#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {153#true} is VALID [2018-11-14 18:43:12,730 INFO L273 TraceCheckUtils]: 2: Hoare triple {153#true} assume true; {153#true} is VALID [2018-11-14 18:43:12,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {153#true} {153#true} #50#return; {153#true} is VALID [2018-11-14 18:43:12,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {153#true} call #t~ret2 := main(); {153#true} is VALID [2018-11-14 18:43:12,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {155#(= main_~i~0 0)} is VALID [2018-11-14 18:43:12,733 INFO L273 TraceCheckUtils]: 6: Hoare triple {155#(= main_~i~0 0)} assume true; {155#(= main_~i~0 0)} is VALID [2018-11-14 18:43:12,738 INFO L273 TraceCheckUtils]: 7: Hoare triple {155#(= main_~i~0 0)} assume !(~i~0 < 100000); {154#false} is VALID [2018-11-14 18:43:12,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {154#false} havoc ~x~0;~x~0 := 0; {154#false} is VALID [2018-11-14 18:43:12,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {154#false} assume true; {154#false} is VALID [2018-11-14 18:43:12,739 INFO L273 TraceCheckUtils]: 10: Hoare triple {154#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {154#false} is VALID [2018-11-14 18:43:12,739 INFO L256 TraceCheckUtils]: 11: Hoare triple {154#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {154#false} is VALID [2018-11-14 18:43:12,739 INFO L273 TraceCheckUtils]: 12: Hoare triple {154#false} ~cond := #in~cond; {154#false} is VALID [2018-11-14 18:43:12,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {154#false} assume ~cond == 0; {154#false} is VALID [2018-11-14 18:43:12,740 INFO L273 TraceCheckUtils]: 14: Hoare triple {154#false} assume !false; {154#false} is VALID [2018-11-14 18:43:12,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:12,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:43:12,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:43:12,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:43:12,745 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:12,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:43:12,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:12,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:43:12,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:43:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:43:12,801 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2018-11-14 18:43:13,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:13,004 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-14 18:43:13,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:43:13,004 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 18:43:13,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:13,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:43:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-14 18:43:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:43:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2018-11-14 18:43:13,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 36 transitions. [2018-11-14 18:43:13,152 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-14 18:43:13,154 INFO L225 Difference]: With dead ends: 34 [2018-11-14 18:43:13,154 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 18:43:13,155 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-14 18:43:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 18:43:13,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 18:43:13,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:13,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 18:43:13,185 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:43:13,185 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:43:13,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:13,187 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 18:43:13,187 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 18:43:13,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:13,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:13,188 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 18:43:13,189 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 18:43:13,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:13,191 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-14 18:43:13,191 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 18:43:13,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:13,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:13,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:13,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:43:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-14 18:43:13,194 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2018-11-14 18:43:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:13,195 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-14 18:43:13,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:43:13,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-14 18:43:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 18:43:13,196 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:13,196 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:13,196 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:13,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1979507662, now seen corresponding path program 1 times [2018-11-14 18:43:13,197 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:13,197 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:13,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:13,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:13,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-14 18:43:13,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-14 18:43:13,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 18:43:13,477 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #50#return; {279#true} is VALID [2018-11-14 18:43:13,478 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2018-11-14 18:43:13,479 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {281#(= main_~i~0 0)} is VALID [2018-11-14 18:43:13,479 INFO L273 TraceCheckUtils]: 6: Hoare triple {281#(= main_~i~0 0)} assume true; {281#(= main_~i~0 0)} is VALID [2018-11-14 18:43:13,489 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {282#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:13,490 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= main_~i~0 1)} assume true; {282#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:13,494 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-14 18:43:13,494 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-14 18:43:13,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume true; {280#false} is VALID [2018-11-14 18:43:13,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {280#false} is VALID [2018-11-14 18:43:13,495 INFO L256 TraceCheckUtils]: 13: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {280#false} is VALID [2018-11-14 18:43:13,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-14 18:43:13,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume ~cond == 0; {280#false} is VALID [2018-11-14 18:43:13,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-14 18:43:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:13,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:13,498 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-14 18:43:13,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:13,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:13,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2018-11-14 18:43:13,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {279#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {279#true} is VALID [2018-11-14 18:43:13,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2018-11-14 18:43:13,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #50#return; {279#true} is VALID [2018-11-14 18:43:13,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2018-11-14 18:43:13,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {279#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {301#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:13,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {301#(<= main_~i~0 0)} assume true; {301#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:13,671 INFO L273 TraceCheckUtils]: 7: Hoare triple {301#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {282#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:13,673 INFO L273 TraceCheckUtils]: 8: Hoare triple {282#(<= main_~i~0 1)} assume true; {282#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:13,673 INFO L273 TraceCheckUtils]: 9: Hoare triple {282#(<= main_~i~0 1)} assume !(~i~0 < 100000); {280#false} is VALID [2018-11-14 18:43:13,674 INFO L273 TraceCheckUtils]: 10: Hoare triple {280#false} havoc ~x~0;~x~0 := 0; {280#false} is VALID [2018-11-14 18:43:13,674 INFO L273 TraceCheckUtils]: 11: Hoare triple {280#false} assume true; {280#false} is VALID [2018-11-14 18:43:13,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {280#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {280#false} is VALID [2018-11-14 18:43:13,675 INFO L256 TraceCheckUtils]: 13: Hoare triple {280#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {280#false} is VALID [2018-11-14 18:43:13,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2018-11-14 18:43:13,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {280#false} assume ~cond == 0; {280#false} is VALID [2018-11-14 18:43:13,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2018-11-14 18:43:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:13,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:13,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-14 18:43:13,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 18:43:13,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:13,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:43:13,868 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-14 18:43:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:43:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:43:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:43:13,870 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-11-14 18:43:14,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:14,294 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 18:43:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:43:14,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-14 18:43:14,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:43:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 18:43:14,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:43:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 18:43:14,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-14 18:43:14,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:14,468 INFO L225 Difference]: With dead ends: 36 [2018-11-14 18:43:14,468 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:43:14,469 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:43:14,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:43:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:43:14,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:14,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:43:14,511 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:43:14,511 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:43:14,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:14,515 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 18:43:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 18:43:14,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:14,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:14,516 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:43:14,516 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:43:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:14,518 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-14 18:43:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 18:43:14,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:14,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:14,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:14,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:43:14,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-14 18:43:14,522 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 17 [2018-11-14 18:43:14,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:14,522 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-14 18:43:14,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:43:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-14 18:43:14,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:43:14,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:14,523 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:14,524 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:14,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:14,524 INFO L82 PathProgramCache]: Analyzing trace with hash -375588952, now seen corresponding path program 2 times [2018-11-14 18:43:14,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:14,524 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:14,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:14,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:14,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:14,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-14 18:43:14,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {465#true} is VALID [2018-11-14 18:43:14,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-14 18:43:14,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2018-11-14 18:43:14,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-14 18:43:14,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {467#(= main_~i~0 0)} is VALID [2018-11-14 18:43:14,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#(= main_~i~0 0)} assume true; {467#(= main_~i~0 0)} is VALID [2018-11-14 18:43:14,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {467#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {468#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:14,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} assume true; {468#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:14,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {469#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:14,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume true; {469#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:14,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} assume !(~i~0 < 100000); {466#false} is VALID [2018-11-14 18:43:14,683 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} havoc ~x~0;~x~0 := 0; {466#false} is VALID [2018-11-14 18:43:14,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume true; {466#false} is VALID [2018-11-14 18:43:14,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {466#false} is VALID [2018-11-14 18:43:14,684 INFO L256 TraceCheckUtils]: 15: Hoare triple {466#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {466#false} is VALID [2018-11-14 18:43:14,684 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-14 18:43:14,685 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} assume ~cond == 0; {466#false} is VALID [2018-11-14 18:43:14,685 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-14 18:43:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:14,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:14,687 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-14 18:43:14,696 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:43:14,712 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:43:14,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:14,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:14,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {465#true} is VALID [2018-11-14 18:43:14,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {465#true} is VALID [2018-11-14 18:43:14,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2018-11-14 18:43:14,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2018-11-14 18:43:14,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret2 := main(); {465#true} is VALID [2018-11-14 18:43:14,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:14,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {488#(<= main_~i~0 0)} assume true; {488#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:14,831 INFO L273 TraceCheckUtils]: 7: Hoare triple {488#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {468#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:14,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(<= main_~i~0 1)} assume true; {468#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:14,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {469#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:14,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {469#(<= main_~i~0 2)} assume true; {469#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:14,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {469#(<= main_~i~0 2)} assume !(~i~0 < 100000); {466#false} is VALID [2018-11-14 18:43:14,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {466#false} havoc ~x~0;~x~0 := 0; {466#false} is VALID [2018-11-14 18:43:14,834 INFO L273 TraceCheckUtils]: 13: Hoare triple {466#false} assume true; {466#false} is VALID [2018-11-14 18:43:14,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {466#false} is VALID [2018-11-14 18:43:14,834 INFO L256 TraceCheckUtils]: 15: Hoare triple {466#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {466#false} is VALID [2018-11-14 18:43:14,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {466#false} ~cond := #in~cond; {466#false} is VALID [2018-11-14 18:43:14,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {466#false} assume ~cond == 0; {466#false} is VALID [2018-11-14 18:43:14,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {466#false} assume !false; {466#false} is VALID [2018-11-14 18:43:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:14,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:14,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-14 18:43:14,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 18:43:14,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:14,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:43:14,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:14,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:43:14,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:43:14,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:43:14,890 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-11-14 18:43:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,094 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 18:43:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:43:15,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 18:43:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:43:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 18:43:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:43:15,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2018-11-14 18:43:15,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2018-11-14 18:43:15,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:15,164 INFO L225 Difference]: With dead ends: 38 [2018-11-14 18:43:15,164 INFO L226 Difference]: Without dead ends: 26 [2018-11-14 18:43:15,165 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:43:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-14 18:43:15,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-14 18:43:15,179 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:15,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-14 18:43:15,180 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 18:43:15,180 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 18:43:15,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,182 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 18:43:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 18:43:15,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:15,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:15,183 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-14 18:43:15,183 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-14 18:43:15,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,186 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-14 18:43:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 18:43:15,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:15,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:15,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:15,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:43:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-14 18:43:15,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2018-11-14 18:43:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:15,190 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-14 18:43:15,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:43:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 18:43:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 18:43:15,191 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:15,191 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:15,191 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:15,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -175670014, now seen corresponding path program 3 times [2018-11-14 18:43:15,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:15,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:15,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:15,194 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:15,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:15,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-14 18:43:15,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {668#true} is VALID [2018-11-14 18:43:15,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-14 18:43:15,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #50#return; {668#true} is VALID [2018-11-14 18:43:15,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-14 18:43:15,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {670#(= main_~i~0 0)} is VALID [2018-11-14 18:43:15,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {670#(= main_~i~0 0)} assume true; {670#(= main_~i~0 0)} is VALID [2018-11-14 18:43:15,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {670#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {671#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(<= main_~i~0 1)} assume true; {671#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {671#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {672#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(<= main_~i~0 2)} assume true; {672#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,325 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {673#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,326 INFO L273 TraceCheckUtils]: 12: Hoare triple {673#(<= main_~i~0 3)} assume true; {673#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,327 INFO L273 TraceCheckUtils]: 13: Hoare triple {673#(<= main_~i~0 3)} assume !(~i~0 < 100000); {669#false} is VALID [2018-11-14 18:43:15,328 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} havoc ~x~0;~x~0 := 0; {669#false} is VALID [2018-11-14 18:43:15,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume true; {669#false} is VALID [2018-11-14 18:43:15,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {669#false} is VALID [2018-11-14 18:43:15,329 INFO L256 TraceCheckUtils]: 17: Hoare triple {669#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {669#false} is VALID [2018-11-14 18:43:15,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-14 18:43:15,330 INFO L273 TraceCheckUtils]: 19: Hoare triple {669#false} assume ~cond == 0; {669#false} is VALID [2018-11-14 18:43:15,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-14 18:43:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:15,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:15,333 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-14 18:43:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:43:15,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-14 18:43:15,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:15,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:15,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:15,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {668#true} call ULTIMATE.init(); {668#true} is VALID [2018-11-14 18:43:15,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {668#true} is VALID [2018-11-14 18:43:15,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {668#true} assume true; {668#true} is VALID [2018-11-14 18:43:15,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {668#true} {668#true} #50#return; {668#true} is VALID [2018-11-14 18:43:15,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {668#true} call #t~ret2 := main(); {668#true} is VALID [2018-11-14 18:43:15,521 INFO L273 TraceCheckUtils]: 5: Hoare triple {668#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {692#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:15,527 INFO L273 TraceCheckUtils]: 6: Hoare triple {692#(<= main_~i~0 0)} assume true; {692#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:15,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {692#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {671#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {671#(<= main_~i~0 1)} assume true; {671#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,531 INFO L273 TraceCheckUtils]: 9: Hoare triple {671#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {672#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {672#(<= main_~i~0 2)} assume true; {672#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {672#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {673#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {673#(<= main_~i~0 3)} assume true; {673#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,535 INFO L273 TraceCheckUtils]: 13: Hoare triple {673#(<= main_~i~0 3)} assume !(~i~0 < 100000); {669#false} is VALID [2018-11-14 18:43:15,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {669#false} havoc ~x~0;~x~0 := 0; {669#false} is VALID [2018-11-14 18:43:15,536 INFO L273 TraceCheckUtils]: 15: Hoare triple {669#false} assume true; {669#false} is VALID [2018-11-14 18:43:15,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {669#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {669#false} is VALID [2018-11-14 18:43:15,537 INFO L256 TraceCheckUtils]: 17: Hoare triple {669#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {669#false} is VALID [2018-11-14 18:43:15,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {669#false} ~cond := #in~cond; {669#false} is VALID [2018-11-14 18:43:15,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {669#false} assume ~cond == 0; {669#false} is VALID [2018-11-14 18:43:15,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {669#false} assume !false; {669#false} is VALID [2018-11-14 18:43:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:15,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:15,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-14 18:43:15,561 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 18:43:15,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:15,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:43:15,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:15,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:43:15,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:43:15,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:43:15,611 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2018-11-14 18:43:15,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,699 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-14 18:43:15,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:43:15,700 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2018-11-14 18:43:15,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:15,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:43:15,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 18:43:15,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:43:15,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 18:43:15,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-14 18:43:15,801 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-14 18:43:15,804 INFO L225 Difference]: With dead ends: 40 [2018-11-14 18:43:15,804 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 18:43:15,804 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:43:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 18:43:15,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 18:43:15,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:15,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 18:43:15,818 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:43:15,818 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:43:15,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,820 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 18:43:15,821 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 18:43:15,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:15,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:15,822 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 18:43:15,822 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 18:43:15,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:15,824 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-14 18:43:15,825 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 18:43:15,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:15,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:15,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:15,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:43:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-14 18:43:15,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2018-11-14 18:43:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:15,828 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-14 18:43:15,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:43:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-14 18:43:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-14 18:43:15,829 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:15,829 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:15,830 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:15,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:15,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1327098916, now seen corresponding path program 4 times [2018-11-14 18:43:15,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:15,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:15,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:15,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:15,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:15,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {888#true} call ULTIMATE.init(); {888#true} is VALID [2018-11-14 18:43:15,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {888#true} is VALID [2018-11-14 18:43:15,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {888#true} assume true; {888#true} is VALID [2018-11-14 18:43:15,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {888#true} {888#true} #50#return; {888#true} is VALID [2018-11-14 18:43:15,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {888#true} call #t~ret2 := main(); {888#true} is VALID [2018-11-14 18:43:15,950 INFO L273 TraceCheckUtils]: 5: Hoare triple {888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {890#(= main_~i~0 0)} is VALID [2018-11-14 18:43:15,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {890#(= main_~i~0 0)} assume true; {890#(= main_~i~0 0)} is VALID [2018-11-14 18:43:15,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {890#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {891#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume true; {891#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:15,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {892#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,953 INFO L273 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume true; {892#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:15,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {893#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {893#(<= main_~i~0 3)} assume true; {893#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:15,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {894#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:15,957 INFO L273 TraceCheckUtils]: 14: Hoare triple {894#(<= main_~i~0 4)} assume true; {894#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:15,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {894#(<= main_~i~0 4)} assume !(~i~0 < 100000); {889#false} is VALID [2018-11-14 18:43:15,965 INFO L273 TraceCheckUtils]: 16: Hoare triple {889#false} havoc ~x~0;~x~0 := 0; {889#false} is VALID [2018-11-14 18:43:15,965 INFO L273 TraceCheckUtils]: 17: Hoare triple {889#false} assume true; {889#false} is VALID [2018-11-14 18:43:15,965 INFO L273 TraceCheckUtils]: 18: Hoare triple {889#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {889#false} is VALID [2018-11-14 18:43:15,966 INFO L256 TraceCheckUtils]: 19: Hoare triple {889#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {889#false} is VALID [2018-11-14 18:43:15,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {889#false} ~cond := #in~cond; {889#false} is VALID [2018-11-14 18:43:15,966 INFO L273 TraceCheckUtils]: 21: Hoare triple {889#false} assume ~cond == 0; {889#false} is VALID [2018-11-14 18:43:15,966 INFO L273 TraceCheckUtils]: 22: Hoare triple {889#false} assume !false; {889#false} is VALID [2018-11-14 18:43:15,967 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:15,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:15,968 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-14 18:43:15,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:43:15,995 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:43:15,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:16,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:16,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {888#true} call ULTIMATE.init(); {888#true} is VALID [2018-11-14 18:43:16,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {888#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {888#true} is VALID [2018-11-14 18:43:16,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {888#true} assume true; {888#true} is VALID [2018-11-14 18:43:16,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {888#true} {888#true} #50#return; {888#true} is VALID [2018-11-14 18:43:16,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {888#true} call #t~ret2 := main(); {888#true} is VALID [2018-11-14 18:43:16,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {888#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {913#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:16,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {913#(<= main_~i~0 0)} assume true; {913#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:16,179 INFO L273 TraceCheckUtils]: 7: Hoare triple {913#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {891#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,179 INFO L273 TraceCheckUtils]: 8: Hoare triple {891#(<= main_~i~0 1)} assume true; {891#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,180 INFO L273 TraceCheckUtils]: 9: Hoare triple {891#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {892#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,181 INFO L273 TraceCheckUtils]: 10: Hoare triple {892#(<= main_~i~0 2)} assume true; {892#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,181 INFO L273 TraceCheckUtils]: 11: Hoare triple {892#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {893#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {893#(<= main_~i~0 3)} assume true; {893#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {893#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {894#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {894#(<= main_~i~0 4)} assume true; {894#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,184 INFO L273 TraceCheckUtils]: 15: Hoare triple {894#(<= main_~i~0 4)} assume !(~i~0 < 100000); {889#false} is VALID [2018-11-14 18:43:16,184 INFO L273 TraceCheckUtils]: 16: Hoare triple {889#false} havoc ~x~0;~x~0 := 0; {889#false} is VALID [2018-11-14 18:43:16,185 INFO L273 TraceCheckUtils]: 17: Hoare triple {889#false} assume true; {889#false} is VALID [2018-11-14 18:43:16,185 INFO L273 TraceCheckUtils]: 18: Hoare triple {889#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {889#false} is VALID [2018-11-14 18:43:16,185 INFO L256 TraceCheckUtils]: 19: Hoare triple {889#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {889#false} is VALID [2018-11-14 18:43:16,186 INFO L273 TraceCheckUtils]: 20: Hoare triple {889#false} ~cond := #in~cond; {889#false} is VALID [2018-11-14 18:43:16,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {889#false} assume ~cond == 0; {889#false} is VALID [2018-11-14 18:43:16,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {889#false} assume !false; {889#false} is VALID [2018-11-14 18:43:16,188 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:16,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:16,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-14 18:43:16,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 18:43:16,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:16,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 18:43:16,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 18:43:16,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 18:43:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:43:16,243 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 8 states. [2018-11-14 18:43:16,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:16,475 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-14 18:43:16,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:43:16,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-11-14 18:43:16,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:16,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:43:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-14 18:43:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 18:43:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 44 transitions. [2018-11-14 18:43:16,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 44 transitions. [2018-11-14 18:43:16,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:16,583 INFO L225 Difference]: With dead ends: 42 [2018-11-14 18:43:16,584 INFO L226 Difference]: Without dead ends: 30 [2018-11-14 18:43:16,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 18:43:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-14 18:43:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-14 18:43:16,599 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:16,599 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-14 18:43:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 18:43:16,599 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 18:43:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:16,602 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-14 18:43:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 18:43:16,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:16,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:16,603 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-14 18:43:16,603 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-14 18:43:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:16,605 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-14 18:43:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 18:43:16,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:16,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:16,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:16,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:43:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-14 18:43:16,609 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 23 [2018-11-14 18:43:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:16,609 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-14 18:43:16,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 18:43:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-14 18:43:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:43:16,610 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:16,610 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:16,611 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:16,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:16,611 INFO L82 PathProgramCache]: Analyzing trace with hash 251288630, now seen corresponding path program 5 times [2018-11-14 18:43:16,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:16,611 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:16,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:16,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:16,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:16,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-14 18:43:16,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1125#true} is VALID [2018-11-14 18:43:16,754 INFO L273 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-14 18:43:16,754 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #50#return; {1125#true} is VALID [2018-11-14 18:43:16,755 INFO L256 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret2 := main(); {1125#true} is VALID [2018-11-14 18:43:16,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1127#(= main_~i~0 0)} is VALID [2018-11-14 18:43:16,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {1127#(= main_~i~0 0)} assume true; {1127#(= main_~i~0 0)} is VALID [2018-11-14 18:43:16,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {1127#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {1128#(<= main_~i~0 1)} assume true; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {1128#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {1129#(<= main_~i~0 2)} assume true; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {1129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {1130#(<= main_~i~0 3)} assume true; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,768 INFO L273 TraceCheckUtils]: 13: Hoare triple {1130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,775 INFO L273 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 4)} assume true; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:16,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {1132#(<= main_~i~0 5)} assume true; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:16,783 INFO L273 TraceCheckUtils]: 17: Hoare triple {1132#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1126#false} is VALID [2018-11-14 18:43:16,783 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#false} havoc ~x~0;~x~0 := 0; {1126#false} is VALID [2018-11-14 18:43:16,784 INFO L273 TraceCheckUtils]: 19: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 18:43:16,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {1126#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1126#false} is VALID [2018-11-14 18:43:16,784 INFO L256 TraceCheckUtils]: 21: Hoare triple {1126#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1126#false} is VALID [2018-11-14 18:43:16,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-14 18:43:16,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {1126#false} assume ~cond == 0; {1126#false} is VALID [2018-11-14 18:43:16,785 INFO L273 TraceCheckUtils]: 24: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-14 18:43:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:16,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:16,788 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-14 18:43:16,798 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:43:16,858 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-14 18:43:16,858 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:16,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:16,975 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-14 18:43:16,975 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1125#true} is VALID [2018-11-14 18:43:16,976 INFO L273 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-14 18:43:16,976 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #50#return; {1125#true} is VALID [2018-11-14 18:43:16,976 INFO L256 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret2 := main(); {1125#true} is VALID [2018-11-14 18:43:16,977 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1151#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:16,978 INFO L273 TraceCheckUtils]: 6: Hoare triple {1151#(<= main_~i~0 0)} assume true; {1151#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:16,978 INFO L273 TraceCheckUtils]: 7: Hoare triple {1151#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {1128#(<= main_~i~0 1)} assume true; {1128#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:16,980 INFO L273 TraceCheckUtils]: 9: Hoare triple {1128#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,981 INFO L273 TraceCheckUtils]: 10: Hoare triple {1129#(<= main_~i~0 2)} assume true; {1129#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:16,985 INFO L273 TraceCheckUtils]: 11: Hoare triple {1129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,987 INFO L273 TraceCheckUtils]: 12: Hoare triple {1130#(<= main_~i~0 3)} assume true; {1130#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:16,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {1130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 4)} assume true; {1131#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:16,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:16,990 INFO L273 TraceCheckUtils]: 16: Hoare triple {1132#(<= main_~i~0 5)} assume true; {1132#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:16,994 INFO L273 TraceCheckUtils]: 17: Hoare triple {1132#(<= main_~i~0 5)} assume !(~i~0 < 100000); {1126#false} is VALID [2018-11-14 18:43:16,994 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#false} havoc ~x~0;~x~0 := 0; {1126#false} is VALID [2018-11-14 18:43:16,994 INFO L273 TraceCheckUtils]: 19: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 18:43:16,994 INFO L273 TraceCheckUtils]: 20: Hoare triple {1126#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1126#false} is VALID [2018-11-14 18:43:16,995 INFO L256 TraceCheckUtils]: 21: Hoare triple {1126#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1126#false} is VALID [2018-11-14 18:43:16,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-14 18:43:16,995 INFO L273 TraceCheckUtils]: 23: Hoare triple {1126#false} assume ~cond == 0; {1126#false} is VALID [2018-11-14 18:43:16,995 INFO L273 TraceCheckUtils]: 24: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-14 18:43:16,996 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:17,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:17,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-14 18:43:17,018 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 18:43:17,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:17,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:43:17,047 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:17,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:43:17,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:43:17,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:43:17,048 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2018-11-14 18:43:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:17,260 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 18:43:17,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 18:43:17,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-14 18:43:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:17,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:43:17,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-14 18:43:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:43:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2018-11-14 18:43:17,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2018-11-14 18:43:17,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:17,323 INFO L225 Difference]: With dead ends: 44 [2018-11-14 18:43:17,324 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 18:43:17,325 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:43:17,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 18:43:17,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-14 18:43:17,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:17,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-14 18:43:17,337 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:43:17,337 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:43:17,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:17,340 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 18:43:17,341 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:43:17,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:17,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:17,342 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-14 18:43:17,342 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-14 18:43:17,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:17,344 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 18:43:17,344 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:43:17,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:17,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:17,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:17,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:43:17,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-14 18:43:17,347 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2018-11-14 18:43:17,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:17,347 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-14 18:43:17,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:43:17,348 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 18:43:17,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:43:17,349 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:17,349 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:17,349 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:17,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:17,350 INFO L82 PathProgramCache]: Analyzing trace with hash 958264848, now seen corresponding path program 6 times [2018-11-14 18:43:17,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:17,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:17,351 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:17,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:17,560 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-14 18:43:17,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1379#true} is VALID [2018-11-14 18:43:17,561 INFO L273 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-14 18:43:17,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #50#return; {1379#true} is VALID [2018-11-14 18:43:17,562 INFO L256 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret2 := main(); {1379#true} is VALID [2018-11-14 18:43:17,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {1379#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1381#(= main_~i~0 0)} is VALID [2018-11-14 18:43:17,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {1381#(= main_~i~0 0)} assume true; {1381#(= main_~i~0 0)} is VALID [2018-11-14 18:43:17,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {1381#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:17,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {1382#(<= main_~i~0 1)} assume true; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:17,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:17,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {1383#(<= main_~i~0 2)} assume true; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:17,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:17,568 INFO L273 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume true; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:17,569 INFO L273 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:17,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume true; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:17,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:17,575 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#(<= main_~i~0 5)} assume true; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:17,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:17,585 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(<= main_~i~0 6)} assume true; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:17,585 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1380#false} is VALID [2018-11-14 18:43:17,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} havoc ~x~0;~x~0 := 0; {1380#false} is VALID [2018-11-14 18:43:17,586 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume true; {1380#false} is VALID [2018-11-14 18:43:17,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1380#false} is VALID [2018-11-14 18:43:17,586 INFO L256 TraceCheckUtils]: 23: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1380#false} is VALID [2018-11-14 18:43:17,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-14 18:43:17,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume ~cond == 0; {1380#false} is VALID [2018-11-14 18:43:17,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-14 18:43:17,588 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:17,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:17,588 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-14 18:43:17,598 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:43:17,627 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-14 18:43:17,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:17,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:17,893 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-14 18:43:17,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1379#true} is VALID [2018-11-14 18:43:17,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-14 18:43:17,894 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1379#true} {1379#true} #50#return; {1379#true} is VALID [2018-11-14 18:43:17,894 INFO L256 TraceCheckUtils]: 4: Hoare triple {1379#true} call #t~ret2 := main(); {1379#true} is VALID [2018-11-14 18:43:17,895 INFO L273 TraceCheckUtils]: 5: Hoare triple {1379#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1406#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:17,895 INFO L273 TraceCheckUtils]: 6: Hoare triple {1406#(<= main_~i~0 0)} assume true; {1406#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:17,896 INFO L273 TraceCheckUtils]: 7: Hoare triple {1406#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:17,897 INFO L273 TraceCheckUtils]: 8: Hoare triple {1382#(<= main_~i~0 1)} assume true; {1382#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:17,897 INFO L273 TraceCheckUtils]: 9: Hoare triple {1382#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:17,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {1383#(<= main_~i~0 2)} assume true; {1383#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:17,898 INFO L273 TraceCheckUtils]: 11: Hoare triple {1383#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:17,899 INFO L273 TraceCheckUtils]: 12: Hoare triple {1384#(<= main_~i~0 3)} assume true; {1384#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:17,899 INFO L273 TraceCheckUtils]: 13: Hoare triple {1384#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:17,900 INFO L273 TraceCheckUtils]: 14: Hoare triple {1385#(<= main_~i~0 4)} assume true; {1385#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:17,901 INFO L273 TraceCheckUtils]: 15: Hoare triple {1385#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:17,902 INFO L273 TraceCheckUtils]: 16: Hoare triple {1386#(<= main_~i~0 5)} assume true; {1386#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:17,903 INFO L273 TraceCheckUtils]: 17: Hoare triple {1386#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:17,903 INFO L273 TraceCheckUtils]: 18: Hoare triple {1387#(<= main_~i~0 6)} assume true; {1387#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:17,904 INFO L273 TraceCheckUtils]: 19: Hoare triple {1387#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1380#false} is VALID [2018-11-14 18:43:17,904 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} havoc ~x~0;~x~0 := 0; {1380#false} is VALID [2018-11-14 18:43:17,904 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume true; {1380#false} is VALID [2018-11-14 18:43:17,905 INFO L273 TraceCheckUtils]: 22: Hoare triple {1380#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1380#false} is VALID [2018-11-14 18:43:17,905 INFO L256 TraceCheckUtils]: 23: Hoare triple {1380#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1380#false} is VALID [2018-11-14 18:43:17,905 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-14 18:43:17,906 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume ~cond == 0; {1380#false} is VALID [2018-11-14 18:43:17,906 INFO L273 TraceCheckUtils]: 26: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-14 18:43:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:17,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:17,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-14 18:43:17,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 18:43:17,938 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:17,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 18:43:17,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:17,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 18:43:17,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 18:43:17,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:43:17,973 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 10 states. [2018-11-14 18:43:18,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:18,131 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-14 18:43:18,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 18:43:18,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2018-11-14 18:43:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:18,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:43:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-14 18:43:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 18:43:18,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 48 transitions. [2018-11-14 18:43:18,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 48 transitions. [2018-11-14 18:43:18,265 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-14 18:43:18,266 INFO L225 Difference]: With dead ends: 46 [2018-11-14 18:43:18,267 INFO L226 Difference]: Without dead ends: 34 [2018-11-14 18:43:18,268 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 18:43:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-14 18:43:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-14 18:43:18,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:18,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-14 18:43:18,293 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 18:43:18,293 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 18:43:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:18,296 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-14 18:43:18,296 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 18:43:18,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:18,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:18,297 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-14 18:43:18,297 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-14 18:43:18,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:18,299 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-14 18:43:18,299 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 18:43:18,299 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:18,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:18,300 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:18,300 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:43:18,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-14 18:43:18,302 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 27 [2018-11-14 18:43:18,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:18,302 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-14 18:43:18,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 18:43:18,302 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-14 18:43:18,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:43:18,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:18,303 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:18,303 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:18,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:18,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1757577578, now seen corresponding path program 7 times [2018-11-14 18:43:18,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:18,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:18,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:18,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:18,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 18:43:18,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1650#true} is VALID [2018-11-14 18:43:18,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 18:43:18,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #50#return; {1650#true} is VALID [2018-11-14 18:43:18,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret2 := main(); {1650#true} is VALID [2018-11-14 18:43:18,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1652#(= main_~i~0 0)} is VALID [2018-11-14 18:43:18,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {1652#(= main_~i~0 0)} assume true; {1652#(= main_~i~0 0)} is VALID [2018-11-14 18:43:18,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {1652#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:18,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {1653#(<= main_~i~0 1)} assume true; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:18,488 INFO L273 TraceCheckUtils]: 9: Hoare triple {1653#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:18,490 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= main_~i~0 2)} assume true; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:18,491 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:18,492 INFO L273 TraceCheckUtils]: 12: Hoare triple {1655#(<= main_~i~0 3)} assume true; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:18,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:18,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(<= main_~i~0 4)} assume true; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:18,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:18,496 INFO L273 TraceCheckUtils]: 16: Hoare triple {1657#(<= main_~i~0 5)} assume true; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:18,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {1657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:18,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#(<= main_~i~0 6)} assume true; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:18,498 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:18,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {1659#(<= main_~i~0 7)} assume true; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:18,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {1659#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1651#false} is VALID [2018-11-14 18:43:18,500 INFO L273 TraceCheckUtils]: 22: Hoare triple {1651#false} havoc ~x~0;~x~0 := 0; {1651#false} is VALID [2018-11-14 18:43:18,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {1651#false} assume true; {1651#false} is VALID [2018-11-14 18:43:18,500 INFO L273 TraceCheckUtils]: 24: Hoare triple {1651#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1651#false} is VALID [2018-11-14 18:43:18,501 INFO L256 TraceCheckUtils]: 25: Hoare triple {1651#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1651#false} is VALID [2018-11-14 18:43:18,501 INFO L273 TraceCheckUtils]: 26: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 18:43:18,502 INFO L273 TraceCheckUtils]: 27: Hoare triple {1651#false} assume ~cond == 0; {1651#false} is VALID [2018-11-14 18:43:18,502 INFO L273 TraceCheckUtils]: 28: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 18:43:18,503 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:18,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:18,504 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-14 18:43:18,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:18,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:18,783 INFO L256 TraceCheckUtils]: 0: Hoare triple {1650#true} call ULTIMATE.init(); {1650#true} is VALID [2018-11-14 18:43:18,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {1650#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1650#true} is VALID [2018-11-14 18:43:18,784 INFO L273 TraceCheckUtils]: 2: Hoare triple {1650#true} assume true; {1650#true} is VALID [2018-11-14 18:43:18,784 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1650#true} {1650#true} #50#return; {1650#true} is VALID [2018-11-14 18:43:18,784 INFO L256 TraceCheckUtils]: 4: Hoare triple {1650#true} call #t~ret2 := main(); {1650#true} is VALID [2018-11-14 18:43:18,785 INFO L273 TraceCheckUtils]: 5: Hoare triple {1650#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1678#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:18,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1678#(<= main_~i~0 0)} assume true; {1678#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:18,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1678#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:18,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1653#(<= main_~i~0 1)} assume true; {1653#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:18,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {1653#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:18,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1654#(<= main_~i~0 2)} assume true; {1654#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:18,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {1654#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:18,790 INFO L273 TraceCheckUtils]: 12: Hoare triple {1655#(<= main_~i~0 3)} assume true; {1655#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:18,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {1655#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:18,792 INFO L273 TraceCheckUtils]: 14: Hoare triple {1656#(<= main_~i~0 4)} assume true; {1656#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:18,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {1656#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:18,794 INFO L273 TraceCheckUtils]: 16: Hoare triple {1657#(<= main_~i~0 5)} assume true; {1657#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:18,795 INFO L273 TraceCheckUtils]: 17: Hoare triple {1657#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:18,795 INFO L273 TraceCheckUtils]: 18: Hoare triple {1658#(<= main_~i~0 6)} assume true; {1658#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:18,797 INFO L273 TraceCheckUtils]: 19: Hoare triple {1658#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:18,797 INFO L273 TraceCheckUtils]: 20: Hoare triple {1659#(<= main_~i~0 7)} assume true; {1659#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:18,798 INFO L273 TraceCheckUtils]: 21: Hoare triple {1659#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1651#false} is VALID [2018-11-14 18:43:18,799 INFO L273 TraceCheckUtils]: 22: Hoare triple {1651#false} havoc ~x~0;~x~0 := 0; {1651#false} is VALID [2018-11-14 18:43:18,799 INFO L273 TraceCheckUtils]: 23: Hoare triple {1651#false} assume true; {1651#false} is VALID [2018-11-14 18:43:18,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {1651#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1651#false} is VALID [2018-11-14 18:43:18,800 INFO L256 TraceCheckUtils]: 25: Hoare triple {1651#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1651#false} is VALID [2018-11-14 18:43:18,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {1651#false} ~cond := #in~cond; {1651#false} is VALID [2018-11-14 18:43:18,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {1651#false} assume ~cond == 0; {1651#false} is VALID [2018-11-14 18:43:18,801 INFO L273 TraceCheckUtils]: 28: Hoare triple {1651#false} assume !false; {1651#false} is VALID [2018-11-14 18:43:18,803 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:18,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:18,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-14 18:43:18,825 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 18:43:18,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:18,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 18:43:18,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:18,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 18:43:18,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 18:43:18,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:43:18,875 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2018-11-14 18:43:19,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:19,247 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-14 18:43:19,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 18:43:19,247 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2018-11-14 18:43:19,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:43:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-14 18:43:19,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 18:43:19,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 50 transitions. [2018-11-14 18:43:19,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 50 transitions. [2018-11-14 18:43:19,404 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:19,405 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:43:19,406 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 18:43:19,406 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-14 18:43:19,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 18:43:19,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-14 18:43:19,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:19,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-14 18:43:19,458 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 18:43:19,458 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 18:43:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:19,459 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 18:43:19,459 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 18:43:19,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:19,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:19,460 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-14 18:43:19,460 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-14 18:43:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:19,462 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-14 18:43:19,462 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 18:43:19,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:19,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:19,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:19,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:43:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-14 18:43:19,464 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2018-11-14 18:43:19,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:19,464 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-14 18:43:19,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 18:43:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-14 18:43:19,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 18:43:19,465 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:19,465 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:19,466 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:19,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:19,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1097965124, now seen corresponding path program 8 times [2018-11-14 18:43:19,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:19,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:19,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:19,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:19,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-14 18:43:19,714 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1938#true} is VALID [2018-11-14 18:43:19,715 INFO L273 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-14 18:43:19,715 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #50#return; {1938#true} is VALID [2018-11-14 18:43:19,715 INFO L256 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-14 18:43:19,716 INFO L273 TraceCheckUtils]: 5: Hoare triple {1938#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1940#(= main_~i~0 0)} is VALID [2018-11-14 18:43:19,720 INFO L273 TraceCheckUtils]: 6: Hoare triple {1940#(= main_~i~0 0)} assume true; {1940#(= main_~i~0 0)} is VALID [2018-11-14 18:43:19,721 INFO L273 TraceCheckUtils]: 7: Hoare triple {1940#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:19,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 1)} assume true; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:19,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:19,722 INFO L273 TraceCheckUtils]: 10: Hoare triple {1942#(<= main_~i~0 2)} assume true; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:19,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:19,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {1943#(<= main_~i~0 3)} assume true; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:19,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {1943#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:19,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {1944#(<= main_~i~0 4)} assume true; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:19,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {1944#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:19,726 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 5)} assume true; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:19,727 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:19,728 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 6)} assume true; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:19,729 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:19,730 INFO L273 TraceCheckUtils]: 20: Hoare triple {1947#(<= main_~i~0 7)} assume true; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:19,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {1947#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:19,731 INFO L273 TraceCheckUtils]: 22: Hoare triple {1948#(<= main_~i~0 8)} assume true; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:19,732 INFO L273 TraceCheckUtils]: 23: Hoare triple {1948#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1939#false} is VALID [2018-11-14 18:43:19,733 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#false} havoc ~x~0;~x~0 := 0; {1939#false} is VALID [2018-11-14 18:43:19,733 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#false} assume true; {1939#false} is VALID [2018-11-14 18:43:19,733 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1939#false} is VALID [2018-11-14 18:43:19,733 INFO L256 TraceCheckUtils]: 27: Hoare triple {1939#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1939#false} is VALID [2018-11-14 18:43:19,734 INFO L273 TraceCheckUtils]: 28: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-14 18:43:19,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {1939#false} assume ~cond == 0; {1939#false} is VALID [2018-11-14 18:43:19,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-14 18:43:19,736 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:19,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:19,736 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-14 18:43:19,748 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:43:19,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:43:19,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:19,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:20,537 INFO L256 TraceCheckUtils]: 0: Hoare triple {1938#true} call ULTIMATE.init(); {1938#true} is VALID [2018-11-14 18:43:20,538 INFO L273 TraceCheckUtils]: 1: Hoare triple {1938#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1938#true} is VALID [2018-11-14 18:43:20,538 INFO L273 TraceCheckUtils]: 2: Hoare triple {1938#true} assume true; {1938#true} is VALID [2018-11-14 18:43:20,539 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1938#true} {1938#true} #50#return; {1938#true} is VALID [2018-11-14 18:43:20,540 INFO L256 TraceCheckUtils]: 4: Hoare triple {1938#true} call #t~ret2 := main(); {1938#true} is VALID [2018-11-14 18:43:20,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {1938#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1967#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:20,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {1967#(<= main_~i~0 0)} assume true; {1967#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:20,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {1967#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:20,545 INFO L273 TraceCheckUtils]: 8: Hoare triple {1941#(<= main_~i~0 1)} assume true; {1941#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:20,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {1941#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:20,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {1942#(<= main_~i~0 2)} assume true; {1942#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:20,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {1942#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:20,547 INFO L273 TraceCheckUtils]: 12: Hoare triple {1943#(<= main_~i~0 3)} assume true; {1943#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:20,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {1943#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:20,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {1944#(<= main_~i~0 4)} assume true; {1944#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:20,549 INFO L273 TraceCheckUtils]: 15: Hoare triple {1944#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:20,549 INFO L273 TraceCheckUtils]: 16: Hoare triple {1945#(<= main_~i~0 5)} assume true; {1945#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:20,550 INFO L273 TraceCheckUtils]: 17: Hoare triple {1945#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:20,551 INFO L273 TraceCheckUtils]: 18: Hoare triple {1946#(<= main_~i~0 6)} assume true; {1946#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:20,552 INFO L273 TraceCheckUtils]: 19: Hoare triple {1946#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:20,552 INFO L273 TraceCheckUtils]: 20: Hoare triple {1947#(<= main_~i~0 7)} assume true; {1947#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:20,553 INFO L273 TraceCheckUtils]: 21: Hoare triple {1947#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:20,554 INFO L273 TraceCheckUtils]: 22: Hoare triple {1948#(<= main_~i~0 8)} assume true; {1948#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:20,554 INFO L273 TraceCheckUtils]: 23: Hoare triple {1948#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1939#false} is VALID [2018-11-14 18:43:20,555 INFO L273 TraceCheckUtils]: 24: Hoare triple {1939#false} havoc ~x~0;~x~0 := 0; {1939#false} is VALID [2018-11-14 18:43:20,555 INFO L273 TraceCheckUtils]: 25: Hoare triple {1939#false} assume true; {1939#false} is VALID [2018-11-14 18:43:20,555 INFO L273 TraceCheckUtils]: 26: Hoare triple {1939#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {1939#false} is VALID [2018-11-14 18:43:20,555 INFO L256 TraceCheckUtils]: 27: Hoare triple {1939#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {1939#false} is VALID [2018-11-14 18:43:20,555 INFO L273 TraceCheckUtils]: 28: Hoare triple {1939#false} ~cond := #in~cond; {1939#false} is VALID [2018-11-14 18:43:20,556 INFO L273 TraceCheckUtils]: 29: Hoare triple {1939#false} assume ~cond == 0; {1939#false} is VALID [2018-11-14 18:43:20,556 INFO L273 TraceCheckUtils]: 30: Hoare triple {1939#false} assume !false; {1939#false} is VALID [2018-11-14 18:43:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:20,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:20,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-14 18:43:20,579 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:43:20,579 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:20,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 18:43:20,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:20,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 18:43:20,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 18:43:20,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:43:20,648 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 12 states. [2018-11-14 18:43:21,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:21,016 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-14 18:43:21,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:43:21,016 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 18:43:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:43:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 18:43:21,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 18:43:21,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 52 transitions. [2018-11-14 18:43:21,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 52 transitions. [2018-11-14 18:43:21,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:21,107 INFO L225 Difference]: With dead ends: 50 [2018-11-14 18:43:21,107 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:43:21,108 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-14 18:43:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:43:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-14 18:43:21,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:21,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-14 18:43:21,133 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:43:21,133 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:43:21,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:21,135 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-14 18:43:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 18:43:21,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:21,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:21,136 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-14 18:43:21,136 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-14 18:43:21,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:21,137 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-14 18:43:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 18:43:21,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:21,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:21,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:21,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:21,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:43:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-14 18:43:21,139 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 31 [2018-11-14 18:43:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:21,140 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-14 18:43:21,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 18:43:21,140 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-14 18:43:21,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-14 18:43:21,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:21,141 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:21,141 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:21,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:21,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1429410658, now seen corresponding path program 9 times [2018-11-14 18:43:21,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:21,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:21,142 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:21,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:21,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2243#true} is VALID [2018-11-14 18:43:21,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {2243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2243#true} is VALID [2018-11-14 18:43:21,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2018-11-14 18:43:21,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #50#return; {2243#true} is VALID [2018-11-14 18:43:21,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret2 := main(); {2243#true} is VALID [2018-11-14 18:43:21,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {2243#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2245#(= main_~i~0 0)} is VALID [2018-11-14 18:43:21,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {2245#(= main_~i~0 0)} assume true; {2245#(= main_~i~0 0)} is VALID [2018-11-14 18:43:21,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {2245#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:21,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {2246#(<= main_~i~0 1)} assume true; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:21,330 INFO L273 TraceCheckUtils]: 9: Hoare triple {2246#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:21,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {2247#(<= main_~i~0 2)} assume true; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:21,331 INFO L273 TraceCheckUtils]: 11: Hoare triple {2247#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:21,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {2248#(<= main_~i~0 3)} assume true; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:21,332 INFO L273 TraceCheckUtils]: 13: Hoare triple {2248#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:21,333 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 4)} assume true; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:21,334 INFO L273 TraceCheckUtils]: 15: Hoare triple {2249#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:21,334 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 5)} assume true; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:21,335 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:21,336 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 6)} assume true; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:21,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:21,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {2252#(<= main_~i~0 7)} assume true; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:21,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:21,343 INFO L273 TraceCheckUtils]: 22: Hoare triple {2253#(<= main_~i~0 8)} assume true; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:21,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {2253#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:21,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {2254#(<= main_~i~0 9)} assume true; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:21,344 INFO L273 TraceCheckUtils]: 25: Hoare triple {2254#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2244#false} is VALID [2018-11-14 18:43:21,344 INFO L273 TraceCheckUtils]: 26: Hoare triple {2244#false} havoc ~x~0;~x~0 := 0; {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L273 TraceCheckUtils]: 27: Hoare triple {2244#false} assume true; {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L273 TraceCheckUtils]: 28: Hoare triple {2244#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L256 TraceCheckUtils]: 29: Hoare triple {2244#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L273 TraceCheckUtils]: 30: Hoare triple {2244#false} ~cond := #in~cond; {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L273 TraceCheckUtils]: 31: Hoare triple {2244#false} assume ~cond == 0; {2244#false} is VALID [2018-11-14 18:43:21,345 INFO L273 TraceCheckUtils]: 32: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2018-11-14 18:43:21,347 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:21,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:21,347 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-14 18:43:21,356 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:43:21,400 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-14 18:43:21,401 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:21,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:21,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2243#true} is VALID [2018-11-14 18:43:21,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {2243#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2243#true} is VALID [2018-11-14 18:43:21,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2018-11-14 18:43:21,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #50#return; {2243#true} is VALID [2018-11-14 18:43:21,532 INFO L256 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret2 := main(); {2243#true} is VALID [2018-11-14 18:43:21,533 INFO L273 TraceCheckUtils]: 5: Hoare triple {2243#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2273#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:21,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {2273#(<= main_~i~0 0)} assume true; {2273#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:21,534 INFO L273 TraceCheckUtils]: 7: Hoare triple {2273#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:21,535 INFO L273 TraceCheckUtils]: 8: Hoare triple {2246#(<= main_~i~0 1)} assume true; {2246#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:21,536 INFO L273 TraceCheckUtils]: 9: Hoare triple {2246#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:21,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {2247#(<= main_~i~0 2)} assume true; {2247#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:21,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {2247#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:21,543 INFO L273 TraceCheckUtils]: 12: Hoare triple {2248#(<= main_~i~0 3)} assume true; {2248#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:21,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {2248#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:21,544 INFO L273 TraceCheckUtils]: 14: Hoare triple {2249#(<= main_~i~0 4)} assume true; {2249#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:21,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {2249#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:21,545 INFO L273 TraceCheckUtils]: 16: Hoare triple {2250#(<= main_~i~0 5)} assume true; {2250#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:21,545 INFO L273 TraceCheckUtils]: 17: Hoare triple {2250#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:21,546 INFO L273 TraceCheckUtils]: 18: Hoare triple {2251#(<= main_~i~0 6)} assume true; {2251#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:21,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2251#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:21,548 INFO L273 TraceCheckUtils]: 20: Hoare triple {2252#(<= main_~i~0 7)} assume true; {2252#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:21,549 INFO L273 TraceCheckUtils]: 21: Hoare triple {2252#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:21,550 INFO L273 TraceCheckUtils]: 22: Hoare triple {2253#(<= main_~i~0 8)} assume true; {2253#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:21,551 INFO L273 TraceCheckUtils]: 23: Hoare triple {2253#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:21,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {2254#(<= main_~i~0 9)} assume true; {2254#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:21,552 INFO L273 TraceCheckUtils]: 25: Hoare triple {2254#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2244#false} is VALID [2018-11-14 18:43:21,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {2244#false} havoc ~x~0;~x~0 := 0; {2244#false} is VALID [2018-11-14 18:43:21,553 INFO L273 TraceCheckUtils]: 27: Hoare triple {2244#false} assume true; {2244#false} is VALID [2018-11-14 18:43:21,553 INFO L273 TraceCheckUtils]: 28: Hoare triple {2244#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2244#false} is VALID [2018-11-14 18:43:21,553 INFO L256 TraceCheckUtils]: 29: Hoare triple {2244#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2244#false} is VALID [2018-11-14 18:43:21,554 INFO L273 TraceCheckUtils]: 30: Hoare triple {2244#false} ~cond := #in~cond; {2244#false} is VALID [2018-11-14 18:43:21,554 INFO L273 TraceCheckUtils]: 31: Hoare triple {2244#false} assume ~cond == 0; {2244#false} is VALID [2018-11-14 18:43:21,554 INFO L273 TraceCheckUtils]: 32: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2018-11-14 18:43:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:21,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:21,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-14 18:43:21,577 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 18:43:21,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:21,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:43:21,609 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-14 18:43:21,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:43:21,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:43:21,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:43:21,610 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2018-11-14 18:43:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:22,259 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-14 18:43:22,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 18:43:22,259 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-14 18:43:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:43:22,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-14 18:43:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:43:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 54 transitions. [2018-11-14 18:43:22,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 54 transitions. [2018-11-14 18:43:22,317 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:22,318 INFO L225 Difference]: With dead ends: 52 [2018-11-14 18:43:22,318 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 18:43:22,319 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:43:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 18:43:22,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 18:43:22,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:22,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 18:43:22,332 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:43:22,332 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:43:22,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:22,334 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-14 18:43:22,334 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 18:43:22,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:22,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:22,335 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 18:43:22,335 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 18:43:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:22,336 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-14 18:43:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 18:43:22,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:22,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:22,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:22,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 18:43:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-14 18:43:22,338 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 33 [2018-11-14 18:43:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:22,338 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-14 18:43:22,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:43:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-14 18:43:22,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:43:22,339 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:22,339 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:22,339 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:22,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:22,340 INFO L82 PathProgramCache]: Analyzing trace with hash 713952376, now seen corresponding path program 10 times [2018-11-14 18:43:22,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:22,340 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:22,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:22,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:22,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:22,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-14 18:43:22,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-14 18:43:22,918 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-14 18:43:22,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #50#return; {2565#true} is VALID [2018-11-14 18:43:22,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-14 18:43:22,919 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2567#(= main_~i~0 0)} is VALID [2018-11-14 18:43:22,920 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#(= main_~i~0 0)} assume true; {2567#(= main_~i~0 0)} is VALID [2018-11-14 18:43:22,921 INFO L273 TraceCheckUtils]: 7: Hoare triple {2567#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:22,921 INFO L273 TraceCheckUtils]: 8: Hoare triple {2568#(<= main_~i~0 1)} assume true; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:22,922 INFO L273 TraceCheckUtils]: 9: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:22,922 INFO L273 TraceCheckUtils]: 10: Hoare triple {2569#(<= main_~i~0 2)} assume true; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:22,923 INFO L273 TraceCheckUtils]: 11: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:22,923 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(<= main_~i~0 3)} assume true; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:22,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:22,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(<= main_~i~0 4)} assume true; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:22,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:22,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {2572#(<= main_~i~0 5)} assume true; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:22,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:22,928 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#(<= main_~i~0 6)} assume true; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:22,929 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:22,929 INFO L273 TraceCheckUtils]: 20: Hoare triple {2574#(<= main_~i~0 7)} assume true; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:22,930 INFO L273 TraceCheckUtils]: 21: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:22,931 INFO L273 TraceCheckUtils]: 22: Hoare triple {2575#(<= main_~i~0 8)} assume true; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:22,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:22,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {2576#(<= main_~i~0 9)} assume true; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:22,933 INFO L273 TraceCheckUtils]: 25: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:22,934 INFO L273 TraceCheckUtils]: 26: Hoare triple {2577#(<= main_~i~0 10)} assume true; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:22,934 INFO L273 TraceCheckUtils]: 27: Hoare triple {2577#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-14 18:43:22,935 INFO L273 TraceCheckUtils]: 28: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-14 18:43:22,935 INFO L273 TraceCheckUtils]: 29: Hoare triple {2566#false} assume true; {2566#false} is VALID [2018-11-14 18:43:22,935 INFO L273 TraceCheckUtils]: 30: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2566#false} is VALID [2018-11-14 18:43:22,935 INFO L256 TraceCheckUtils]: 31: Hoare triple {2566#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2566#false} is VALID [2018-11-14 18:43:22,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-14 18:43:22,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {2566#false} assume ~cond == 0; {2566#false} is VALID [2018-11-14 18:43:22,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-14 18:43:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:22,938 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:22,938 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-14 18:43:22,954 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:43:22,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:43:22,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:23,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:23,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:23,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-14 18:43:23,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-14 18:43:23,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-14 18:43:23,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #50#return; {2565#true} is VALID [2018-11-14 18:43:23,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-14 18:43:23,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2596#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:23,212 INFO L273 TraceCheckUtils]: 6: Hoare triple {2596#(<= main_~i~0 0)} assume true; {2596#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:23,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {2596#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:23,213 INFO L273 TraceCheckUtils]: 8: Hoare triple {2568#(<= main_~i~0 1)} assume true; {2568#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:23,213 INFO L273 TraceCheckUtils]: 9: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:23,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {2569#(<= main_~i~0 2)} assume true; {2569#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:23,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:23,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(<= main_~i~0 3)} assume true; {2570#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:23,216 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:23,216 INFO L273 TraceCheckUtils]: 14: Hoare triple {2571#(<= main_~i~0 4)} assume true; {2571#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:23,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:23,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {2572#(<= main_~i~0 5)} assume true; {2572#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:23,219 INFO L273 TraceCheckUtils]: 17: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:23,219 INFO L273 TraceCheckUtils]: 18: Hoare triple {2573#(<= main_~i~0 6)} assume true; {2573#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:23,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:23,221 INFO L273 TraceCheckUtils]: 20: Hoare triple {2574#(<= main_~i~0 7)} assume true; {2574#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:23,222 INFO L273 TraceCheckUtils]: 21: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:23,222 INFO L273 TraceCheckUtils]: 22: Hoare triple {2575#(<= main_~i~0 8)} assume true; {2575#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:23,223 INFO L273 TraceCheckUtils]: 23: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:23,224 INFO L273 TraceCheckUtils]: 24: Hoare triple {2576#(<= main_~i~0 9)} assume true; {2576#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:23,225 INFO L273 TraceCheckUtils]: 25: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:23,225 INFO L273 TraceCheckUtils]: 26: Hoare triple {2577#(<= main_~i~0 10)} assume true; {2577#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:23,226 INFO L273 TraceCheckUtils]: 27: Hoare triple {2577#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-14 18:43:23,226 INFO L273 TraceCheckUtils]: 28: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-14 18:43:23,226 INFO L273 TraceCheckUtils]: 29: Hoare triple {2566#false} assume true; {2566#false} is VALID [2018-11-14 18:43:23,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2566#false} is VALID [2018-11-14 18:43:23,227 INFO L256 TraceCheckUtils]: 31: Hoare triple {2566#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2566#false} is VALID [2018-11-14 18:43:23,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-14 18:43:23,227 INFO L273 TraceCheckUtils]: 33: Hoare triple {2566#false} assume ~cond == 0; {2566#false} is VALID [2018-11-14 18:43:23,227 INFO L273 TraceCheckUtils]: 34: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-14 18:43:23,229 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:23,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:23,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-14 18:43:23,253 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 18:43:23,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:23,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 18:43:23,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:23,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 18:43:23,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 18:43:23,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:43:23,292 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 14 states. [2018-11-14 18:43:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:23,407 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-14 18:43:23,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 18:43:23,407 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2018-11-14 18:43:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:23,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:43:23,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-14 18:43:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 18:43:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2018-11-14 18:43:23,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2018-11-14 18:43:23,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:23,466 INFO L225 Difference]: With dead ends: 54 [2018-11-14 18:43:23,466 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 18:43:23,467 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-14 18:43:23,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 18:43:23,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 18:43:23,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:23,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 18:43:23,488 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:43:23,488 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:43:23,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:23,490 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-14 18:43:23,490 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 18:43:23,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:23,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:23,490 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 18:43:23,490 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 18:43:23,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:23,491 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-14 18:43:23,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 18:43:23,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:23,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:23,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:23,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:23,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 18:43:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-14 18:43:23,493 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 35 [2018-11-14 18:43:23,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:23,493 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-14 18:43:23,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 18:43:23,493 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-14 18:43:23,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 18:43:23,494 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:23,494 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:23,494 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:23,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:23,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1098474030, now seen corresponding path program 11 times [2018-11-14 18:43:23,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:23,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:23,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:23,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:23,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-14 18:43:23,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2904#true} is VALID [2018-11-14 18:43:23,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-14 18:43:23,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2904#true} {2904#true} #50#return; {2904#true} is VALID [2018-11-14 18:43:23,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-14 18:43:23,775 INFO L273 TraceCheckUtils]: 5: Hoare triple {2904#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2906#(= main_~i~0 0)} is VALID [2018-11-14 18:43:23,775 INFO L273 TraceCheckUtils]: 6: Hoare triple {2906#(= main_~i~0 0)} assume true; {2906#(= main_~i~0 0)} is VALID [2018-11-14 18:43:23,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {2906#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:23,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {2907#(<= main_~i~0 1)} assume true; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:23,777 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:23,777 INFO L273 TraceCheckUtils]: 10: Hoare triple {2908#(<= main_~i~0 2)} assume true; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:23,778 INFO L273 TraceCheckUtils]: 11: Hoare triple {2908#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:23,778 INFO L273 TraceCheckUtils]: 12: Hoare triple {2909#(<= main_~i~0 3)} assume true; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:23,779 INFO L273 TraceCheckUtils]: 13: Hoare triple {2909#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:23,779 INFO L273 TraceCheckUtils]: 14: Hoare triple {2910#(<= main_~i~0 4)} assume true; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:23,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {2910#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:23,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {2911#(<= main_~i~0 5)} assume true; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:23,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {2911#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:23,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {2912#(<= main_~i~0 6)} assume true; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:23,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {2912#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:23,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {2913#(<= main_~i~0 7)} assume true; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:23,785 INFO L273 TraceCheckUtils]: 21: Hoare triple {2913#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:23,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {2914#(<= main_~i~0 8)} assume true; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:23,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {2914#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:23,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {2915#(<= main_~i~0 9)} assume true; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:23,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {2915#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:23,788 INFO L273 TraceCheckUtils]: 26: Hoare triple {2916#(<= main_~i~0 10)} assume true; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:23,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {2916#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:23,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {2917#(<= main_~i~0 11)} assume true; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:23,817 INFO L273 TraceCheckUtils]: 29: Hoare triple {2917#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2905#false} is VALID [2018-11-14 18:43:23,817 INFO L273 TraceCheckUtils]: 30: Hoare triple {2905#false} havoc ~x~0;~x~0 := 0; {2905#false} is VALID [2018-11-14 18:43:23,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-14 18:43:23,817 INFO L273 TraceCheckUtils]: 32: Hoare triple {2905#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2905#false} is VALID [2018-11-14 18:43:23,817 INFO L256 TraceCheckUtils]: 33: Hoare triple {2905#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2905#false} is VALID [2018-11-14 18:43:23,818 INFO L273 TraceCheckUtils]: 34: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-14 18:43:23,818 INFO L273 TraceCheckUtils]: 35: Hoare triple {2905#false} assume ~cond == 0; {2905#false} is VALID [2018-11-14 18:43:23,818 INFO L273 TraceCheckUtils]: 36: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-14 18:43:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:23,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:23,820 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-14 18:43:23,833 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:43:23,877 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-14 18:43:23,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:23,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:24,003 INFO L256 TraceCheckUtils]: 0: Hoare triple {2904#true} call ULTIMATE.init(); {2904#true} is VALID [2018-11-14 18:43:24,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {2904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2904#true} is VALID [2018-11-14 18:43:24,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {2904#true} assume true; {2904#true} is VALID [2018-11-14 18:43:24,004 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2904#true} {2904#true} #50#return; {2904#true} is VALID [2018-11-14 18:43:24,004 INFO L256 TraceCheckUtils]: 4: Hoare triple {2904#true} call #t~ret2 := main(); {2904#true} is VALID [2018-11-14 18:43:24,005 INFO L273 TraceCheckUtils]: 5: Hoare triple {2904#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2936#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:24,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {2936#(<= main_~i~0 0)} assume true; {2936#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:24,006 INFO L273 TraceCheckUtils]: 7: Hoare triple {2936#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:24,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {2907#(<= main_~i~0 1)} assume true; {2907#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:24,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {2907#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:24,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {2908#(<= main_~i~0 2)} assume true; {2908#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:24,012 INFO L273 TraceCheckUtils]: 11: Hoare triple {2908#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:24,012 INFO L273 TraceCheckUtils]: 12: Hoare triple {2909#(<= main_~i~0 3)} assume true; {2909#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:24,013 INFO L273 TraceCheckUtils]: 13: Hoare triple {2909#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:24,013 INFO L273 TraceCheckUtils]: 14: Hoare triple {2910#(<= main_~i~0 4)} assume true; {2910#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:24,014 INFO L273 TraceCheckUtils]: 15: Hoare triple {2910#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:24,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {2911#(<= main_~i~0 5)} assume true; {2911#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:24,015 INFO L273 TraceCheckUtils]: 17: Hoare triple {2911#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:24,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {2912#(<= main_~i~0 6)} assume true; {2912#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:24,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {2912#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:24,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {2913#(<= main_~i~0 7)} assume true; {2913#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:24,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {2913#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:24,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {2914#(<= main_~i~0 8)} assume true; {2914#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:24,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {2914#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:24,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {2915#(<= main_~i~0 9)} assume true; {2915#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:24,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {2915#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:24,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {2916#(<= main_~i~0 10)} assume true; {2916#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:24,022 INFO L273 TraceCheckUtils]: 27: Hoare triple {2916#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:24,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {2917#(<= main_~i~0 11)} assume true; {2917#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:24,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {2917#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2905#false} is VALID [2018-11-14 18:43:24,023 INFO L273 TraceCheckUtils]: 30: Hoare triple {2905#false} havoc ~x~0;~x~0 := 0; {2905#false} is VALID [2018-11-14 18:43:24,023 INFO L273 TraceCheckUtils]: 31: Hoare triple {2905#false} assume true; {2905#false} is VALID [2018-11-14 18:43:24,024 INFO L273 TraceCheckUtils]: 32: Hoare triple {2905#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {2905#false} is VALID [2018-11-14 18:43:24,024 INFO L256 TraceCheckUtils]: 33: Hoare triple {2905#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {2905#false} is VALID [2018-11-14 18:43:24,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {2905#false} ~cond := #in~cond; {2905#false} is VALID [2018-11-14 18:43:24,024 INFO L273 TraceCheckUtils]: 35: Hoare triple {2905#false} assume ~cond == 0; {2905#false} is VALID [2018-11-14 18:43:24,025 INFO L273 TraceCheckUtils]: 36: Hoare triple {2905#false} assume !false; {2905#false} is VALID [2018-11-14 18:43:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:24,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:24,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-14 18:43:24,048 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 18:43:24,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:24,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 18:43:24,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:24,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 18:43:24,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 18:43:24,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-14 18:43:24,085 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-11-14 18:43:24,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:24,217 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-14 18:43:24,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-14 18:43:24,217 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2018-11-14 18:43:24,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:24,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:43:24,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-14 18:43:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 18:43:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 58 transitions. [2018-11-14 18:43:24,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 58 transitions. [2018-11-14 18:43:24,268 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:24,269 INFO L225 Difference]: With dead ends: 56 [2018-11-14 18:43:24,269 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 18:43:24,270 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 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-14 18:43:24,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 18:43:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 18:43:24,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:24,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 18:43:24,299 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 18:43:24,299 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 18:43:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:24,300 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-14 18:43:24,300 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 18:43:24,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:24,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:24,300 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 18:43:24,300 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 18:43:24,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:24,301 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-14 18:43:24,301 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 18:43:24,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:24,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:24,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:24,302 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:43:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-14 18:43:24,303 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 37 [2018-11-14 18:43:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:24,303 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-14 18:43:24,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 18:43:24,303 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-14 18:43:24,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 18:43:24,303 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:24,304 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:24,304 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:24,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:24,304 INFO L82 PathProgramCache]: Analyzing trace with hash 916471980, now seen corresponding path program 12 times [2018-11-14 18:43:24,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:24,305 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:24,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:24,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:24,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:24,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:24,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {3260#true} call ULTIMATE.init(); {3260#true} is VALID [2018-11-14 18:43:24,786 INFO L273 TraceCheckUtils]: 1: Hoare triple {3260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3260#true} is VALID [2018-11-14 18:43:24,786 INFO L273 TraceCheckUtils]: 2: Hoare triple {3260#true} assume true; {3260#true} is VALID [2018-11-14 18:43:24,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3260#true} {3260#true} #50#return; {3260#true} is VALID [2018-11-14 18:43:24,787 INFO L256 TraceCheckUtils]: 4: Hoare triple {3260#true} call #t~ret2 := main(); {3260#true} is VALID [2018-11-14 18:43:24,787 INFO L273 TraceCheckUtils]: 5: Hoare triple {3260#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3262#(= main_~i~0 0)} is VALID [2018-11-14 18:43:24,796 INFO L273 TraceCheckUtils]: 6: Hoare triple {3262#(= main_~i~0 0)} assume true; {3262#(= main_~i~0 0)} is VALID [2018-11-14 18:43:24,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {3262#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:24,802 INFO L273 TraceCheckUtils]: 8: Hoare triple {3263#(<= main_~i~0 1)} assume true; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:24,802 INFO L273 TraceCheckUtils]: 9: Hoare triple {3263#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:24,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {3264#(<= main_~i~0 2)} assume true; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:24,804 INFO L273 TraceCheckUtils]: 11: Hoare triple {3264#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:24,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {3265#(<= main_~i~0 3)} assume true; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:24,806 INFO L273 TraceCheckUtils]: 13: Hoare triple {3265#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:24,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {3266#(<= main_~i~0 4)} assume true; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:24,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {3266#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:24,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {3267#(<= main_~i~0 5)} assume true; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:24,817 INFO L273 TraceCheckUtils]: 17: Hoare triple {3267#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:24,817 INFO L273 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~0 6)} assume true; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:24,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {3268#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:24,818 INFO L273 TraceCheckUtils]: 20: Hoare triple {3269#(<= main_~i~0 7)} assume true; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:24,819 INFO L273 TraceCheckUtils]: 21: Hoare triple {3269#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:24,819 INFO L273 TraceCheckUtils]: 22: Hoare triple {3270#(<= main_~i~0 8)} assume true; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:24,823 INFO L273 TraceCheckUtils]: 23: Hoare triple {3270#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:24,823 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#(<= main_~i~0 9)} assume true; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:24,824 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:24,824 INFO L273 TraceCheckUtils]: 26: Hoare triple {3272#(<= main_~i~0 10)} assume true; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:24,825 INFO L273 TraceCheckUtils]: 27: Hoare triple {3272#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:24,825 INFO L273 TraceCheckUtils]: 28: Hoare triple {3273#(<= main_~i~0 11)} assume true; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:24,826 INFO L273 TraceCheckUtils]: 29: Hoare triple {3273#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:24,826 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#(<= main_~i~0 12)} assume true; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:24,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3261#false} is VALID [2018-11-14 18:43:24,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {3261#false} havoc ~x~0;~x~0 := 0; {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {3261#false} assume true; {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {3261#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L256 TraceCheckUtils]: 35: Hoare triple {3261#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L273 TraceCheckUtils]: 36: Hoare triple {3261#false} ~cond := #in~cond; {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {3261#false} assume ~cond == 0; {3261#false} is VALID [2018-11-14 18:43:24,827 INFO L273 TraceCheckUtils]: 38: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2018-11-14 18:43:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:24,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:24,829 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-14 18:43:24,845 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:43:24,981 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-14 18:43:24,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:24,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:25,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {3260#true} call ULTIMATE.init(); {3260#true} is VALID [2018-11-14 18:43:25,129 INFO L273 TraceCheckUtils]: 1: Hoare triple {3260#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3260#true} is VALID [2018-11-14 18:43:25,129 INFO L273 TraceCheckUtils]: 2: Hoare triple {3260#true} assume true; {3260#true} is VALID [2018-11-14 18:43:25,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3260#true} {3260#true} #50#return; {3260#true} is VALID [2018-11-14 18:43:25,130 INFO L256 TraceCheckUtils]: 4: Hoare triple {3260#true} call #t~ret2 := main(); {3260#true} is VALID [2018-11-14 18:43:25,130 INFO L273 TraceCheckUtils]: 5: Hoare triple {3260#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3293#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:25,131 INFO L273 TraceCheckUtils]: 6: Hoare triple {3293#(<= main_~i~0 0)} assume true; {3293#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:25,131 INFO L273 TraceCheckUtils]: 7: Hoare triple {3293#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:25,132 INFO L273 TraceCheckUtils]: 8: Hoare triple {3263#(<= main_~i~0 1)} assume true; {3263#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:25,132 INFO L273 TraceCheckUtils]: 9: Hoare triple {3263#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:25,133 INFO L273 TraceCheckUtils]: 10: Hoare triple {3264#(<= main_~i~0 2)} assume true; {3264#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:25,133 INFO L273 TraceCheckUtils]: 11: Hoare triple {3264#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:25,133 INFO L273 TraceCheckUtils]: 12: Hoare triple {3265#(<= main_~i~0 3)} assume true; {3265#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:25,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {3265#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:25,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {3266#(<= main_~i~0 4)} assume true; {3266#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:25,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {3266#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:25,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {3267#(<= main_~i~0 5)} assume true; {3267#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:25,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {3267#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:25,138 INFO L273 TraceCheckUtils]: 18: Hoare triple {3268#(<= main_~i~0 6)} assume true; {3268#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:25,139 INFO L273 TraceCheckUtils]: 19: Hoare triple {3268#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:25,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {3269#(<= main_~i~0 7)} assume true; {3269#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:25,140 INFO L273 TraceCheckUtils]: 21: Hoare triple {3269#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:25,141 INFO L273 TraceCheckUtils]: 22: Hoare triple {3270#(<= main_~i~0 8)} assume true; {3270#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:25,141 INFO L273 TraceCheckUtils]: 23: Hoare triple {3270#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:25,142 INFO L273 TraceCheckUtils]: 24: Hoare triple {3271#(<= main_~i~0 9)} assume true; {3271#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:25,143 INFO L273 TraceCheckUtils]: 25: Hoare triple {3271#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:25,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {3272#(<= main_~i~0 10)} assume true; {3272#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:25,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {3272#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:25,145 INFO L273 TraceCheckUtils]: 28: Hoare triple {3273#(<= main_~i~0 11)} assume true; {3273#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:25,146 INFO L273 TraceCheckUtils]: 29: Hoare triple {3273#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:25,146 INFO L273 TraceCheckUtils]: 30: Hoare triple {3274#(<= main_~i~0 12)} assume true; {3274#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:25,147 INFO L273 TraceCheckUtils]: 31: Hoare triple {3274#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3261#false} is VALID [2018-11-14 18:43:25,147 INFO L273 TraceCheckUtils]: 32: Hoare triple {3261#false} havoc ~x~0;~x~0 := 0; {3261#false} is VALID [2018-11-14 18:43:25,147 INFO L273 TraceCheckUtils]: 33: Hoare triple {3261#false} assume true; {3261#false} is VALID [2018-11-14 18:43:25,148 INFO L273 TraceCheckUtils]: 34: Hoare triple {3261#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3261#false} is VALID [2018-11-14 18:43:25,148 INFO L256 TraceCheckUtils]: 35: Hoare triple {3261#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3261#false} is VALID [2018-11-14 18:43:25,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {3261#false} ~cond := #in~cond; {3261#false} is VALID [2018-11-14 18:43:25,148 INFO L273 TraceCheckUtils]: 37: Hoare triple {3261#false} assume ~cond == 0; {3261#false} is VALID [2018-11-14 18:43:25,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {3261#false} assume !false; {3261#false} is VALID [2018-11-14 18:43:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:25,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:25,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-14 18:43:25,176 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 18:43:25,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:25,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-14 18:43:25,210 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-14 18:43:25,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-14 18:43:25,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-14 18:43:25,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:43:25,211 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 16 states. [2018-11-14 18:43:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:25,470 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-14 18:43:25,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-14 18:43:25,471 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2018-11-14 18:43:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:43:25,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 18:43:25,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-14 18:43:25,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 60 transitions. [2018-11-14 18:43:25,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 60 transitions. [2018-11-14 18:43:25,552 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:25,553 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:43:25,553 INFO L226 Difference]: Without dead ends: 46 [2018-11-14 18:43:25,554 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-14 18:43:25,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-14 18:43:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-14 18:43:25,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:25,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-14 18:43:25,579 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 18:43:25,579 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 18:43:25,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:25,580 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-14 18:43:25,581 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 18:43:25,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:25,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:25,581 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-14 18:43:25,582 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-14 18:43:25,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:25,583 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-14 18:43:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 18:43:25,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:25,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:25,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:25,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:25,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 18:43:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-14 18:43:25,585 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 39 [2018-11-14 18:43:25,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:25,585 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-14 18:43:25,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-14 18:43:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-14 18:43:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-14 18:43:25,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:25,586 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:25,586 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:25,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:25,587 INFO L82 PathProgramCache]: Analyzing trace with hash 249337094, now seen corresponding path program 13 times [2018-11-14 18:43:25,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:25,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:25,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:25,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2018-11-14 18:43:25,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3633#true} is VALID [2018-11-14 18:43:25,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {3633#true} assume true; {3633#true} is VALID [2018-11-14 18:43:25,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3633#true} {3633#true} #50#return; {3633#true} is VALID [2018-11-14 18:43:25,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {3633#true} call #t~ret2 := main(); {3633#true} is VALID [2018-11-14 18:43:25,888 INFO L273 TraceCheckUtils]: 5: Hoare triple {3633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3635#(= main_~i~0 0)} is VALID [2018-11-14 18:43:25,889 INFO L273 TraceCheckUtils]: 6: Hoare triple {3635#(= main_~i~0 0)} assume true; {3635#(= main_~i~0 0)} is VALID [2018-11-14 18:43:25,889 INFO L273 TraceCheckUtils]: 7: Hoare triple {3635#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:25,890 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 1)} assume true; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:25,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:25,891 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(<= main_~i~0 2)} assume true; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:25,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:25,892 INFO L273 TraceCheckUtils]: 12: Hoare triple {3638#(<= main_~i~0 3)} assume true; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:25,893 INFO L273 TraceCheckUtils]: 13: Hoare triple {3638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:25,894 INFO L273 TraceCheckUtils]: 14: Hoare triple {3639#(<= main_~i~0 4)} assume true; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:25,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {3639#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:25,895 INFO L273 TraceCheckUtils]: 16: Hoare triple {3640#(<= main_~i~0 5)} assume true; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:25,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {3640#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:25,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#(<= main_~i~0 6)} assume true; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:25,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {3641#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:25,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {3642#(<= main_~i~0 7)} assume true; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:25,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {3642#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:25,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {3643#(<= main_~i~0 8)} assume true; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:25,901 INFO L273 TraceCheckUtils]: 23: Hoare triple {3643#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:25,901 INFO L273 TraceCheckUtils]: 24: Hoare triple {3644#(<= main_~i~0 9)} assume true; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:25,902 INFO L273 TraceCheckUtils]: 25: Hoare triple {3644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:25,903 INFO L273 TraceCheckUtils]: 26: Hoare triple {3645#(<= main_~i~0 10)} assume true; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:25,904 INFO L273 TraceCheckUtils]: 27: Hoare triple {3645#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:25,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {3646#(<= main_~i~0 11)} assume true; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:25,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {3646#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:25,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {3647#(<= main_~i~0 12)} assume true; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:25,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {3647#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:25,908 INFO L273 TraceCheckUtils]: 32: Hoare triple {3648#(<= main_~i~0 13)} assume true; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:25,909 INFO L273 TraceCheckUtils]: 33: Hoare triple {3648#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3634#false} is VALID [2018-11-14 18:43:25,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {3634#false} havoc ~x~0;~x~0 := 0; {3634#false} is VALID [2018-11-14 18:43:25,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {3634#false} assume true; {3634#false} is VALID [2018-11-14 18:43:25,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {3634#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3634#false} is VALID [2018-11-14 18:43:25,910 INFO L256 TraceCheckUtils]: 37: Hoare triple {3634#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3634#false} is VALID [2018-11-14 18:43:25,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {3634#false} ~cond := #in~cond; {3634#false} is VALID [2018-11-14 18:43:25,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {3634#false} assume ~cond == 0; {3634#false} is VALID [2018-11-14 18:43:25,911 INFO L273 TraceCheckUtils]: 40: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2018-11-14 18:43:25,914 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:25,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:25,914 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-14 18:43:25,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:25,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:26,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {3633#true} call ULTIMATE.init(); {3633#true} is VALID [2018-11-14 18:43:26,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {3633#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3633#true} is VALID [2018-11-14 18:43:26,089 INFO L273 TraceCheckUtils]: 2: Hoare triple {3633#true} assume true; {3633#true} is VALID [2018-11-14 18:43:26,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3633#true} {3633#true} #50#return; {3633#true} is VALID [2018-11-14 18:43:26,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {3633#true} call #t~ret2 := main(); {3633#true} is VALID [2018-11-14 18:43:26,090 INFO L273 TraceCheckUtils]: 5: Hoare triple {3633#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3667#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:26,091 INFO L273 TraceCheckUtils]: 6: Hoare triple {3667#(<= main_~i~0 0)} assume true; {3667#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:26,092 INFO L273 TraceCheckUtils]: 7: Hoare triple {3667#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:26,092 INFO L273 TraceCheckUtils]: 8: Hoare triple {3636#(<= main_~i~0 1)} assume true; {3636#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:26,093 INFO L273 TraceCheckUtils]: 9: Hoare triple {3636#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:26,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {3637#(<= main_~i~0 2)} assume true; {3637#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:26,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {3637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:26,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {3638#(<= main_~i~0 3)} assume true; {3638#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:26,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {3638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:26,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {3639#(<= main_~i~0 4)} assume true; {3639#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:26,098 INFO L273 TraceCheckUtils]: 15: Hoare triple {3639#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:26,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {3640#(<= main_~i~0 5)} assume true; {3640#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:26,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {3640#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:26,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {3641#(<= main_~i~0 6)} assume true; {3641#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:26,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {3641#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:26,102 INFO L273 TraceCheckUtils]: 20: Hoare triple {3642#(<= main_~i~0 7)} assume true; {3642#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:26,103 INFO L273 TraceCheckUtils]: 21: Hoare triple {3642#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:26,104 INFO L273 TraceCheckUtils]: 22: Hoare triple {3643#(<= main_~i~0 8)} assume true; {3643#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:26,105 INFO L273 TraceCheckUtils]: 23: Hoare triple {3643#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:26,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {3644#(<= main_~i~0 9)} assume true; {3644#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:26,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {3644#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:26,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {3645#(<= main_~i~0 10)} assume true; {3645#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:26,108 INFO L273 TraceCheckUtils]: 27: Hoare triple {3645#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:26,109 INFO L273 TraceCheckUtils]: 28: Hoare triple {3646#(<= main_~i~0 11)} assume true; {3646#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:26,110 INFO L273 TraceCheckUtils]: 29: Hoare triple {3646#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:26,111 INFO L273 TraceCheckUtils]: 30: Hoare triple {3647#(<= main_~i~0 12)} assume true; {3647#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:26,112 INFO L273 TraceCheckUtils]: 31: Hoare triple {3647#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:26,112 INFO L273 TraceCheckUtils]: 32: Hoare triple {3648#(<= main_~i~0 13)} assume true; {3648#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:26,113 INFO L273 TraceCheckUtils]: 33: Hoare triple {3648#(<= main_~i~0 13)} assume !(~i~0 < 100000); {3634#false} is VALID [2018-11-14 18:43:26,114 INFO L273 TraceCheckUtils]: 34: Hoare triple {3634#false} havoc ~x~0;~x~0 := 0; {3634#false} is VALID [2018-11-14 18:43:26,114 INFO L273 TraceCheckUtils]: 35: Hoare triple {3634#false} assume true; {3634#false} is VALID [2018-11-14 18:43:26,114 INFO L273 TraceCheckUtils]: 36: Hoare triple {3634#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {3634#false} is VALID [2018-11-14 18:43:26,114 INFO L256 TraceCheckUtils]: 37: Hoare triple {3634#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {3634#false} is VALID [2018-11-14 18:43:26,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {3634#false} ~cond := #in~cond; {3634#false} is VALID [2018-11-14 18:43:26,115 INFO L273 TraceCheckUtils]: 39: Hoare triple {3634#false} assume ~cond == 0; {3634#false} is VALID [2018-11-14 18:43:26,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {3634#false} assume !false; {3634#false} is VALID [2018-11-14 18:43:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:26,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:26,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-14 18:43:26,151 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 18:43:26,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:26,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-14 18:43:26,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:26,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-14 18:43:26,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-14 18:43:26,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:43:26,274 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-11-14 18:43:26,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:26,393 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-14 18:43:26,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:43:26,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2018-11-14 18:43:26,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:43:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 18:43:26,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-14 18:43:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 62 transitions. [2018-11-14 18:43:26,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 62 transitions. [2018-11-14 18:43:26,845 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-14 18:43:26,846 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:43:26,846 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 18:43:26,847 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-14 18:43:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 18:43:26,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 18:43:26,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:26,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 18:43:26,869 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 18:43:26,869 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 18:43:26,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:26,870 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-14 18:43:26,870 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 18:43:26,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:26,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:26,871 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 18:43:26,871 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 18:43:26,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:26,872 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-14 18:43:26,872 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 18:43:26,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:26,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:26,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:26,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:26,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:43:26,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-14 18:43:26,874 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 41 [2018-11-14 18:43:26,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:26,874 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-14 18:43:26,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-14 18:43:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-14 18:43:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-14 18:43:26,875 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:26,875 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:26,875 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:26,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash -917161248, now seen corresponding path program 14 times [2018-11-14 18:43:26,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:26,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:26,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:26,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:27,814 INFO L256 TraceCheckUtils]: 0: Hoare triple {4023#true} call ULTIMATE.init(); {4023#true} is VALID [2018-11-14 18:43:27,814 INFO L273 TraceCheckUtils]: 1: Hoare triple {4023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4023#true} is VALID [2018-11-14 18:43:27,814 INFO L273 TraceCheckUtils]: 2: Hoare triple {4023#true} assume true; {4023#true} is VALID [2018-11-14 18:43:27,815 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4023#true} {4023#true} #50#return; {4023#true} is VALID [2018-11-14 18:43:27,815 INFO L256 TraceCheckUtils]: 4: Hoare triple {4023#true} call #t~ret2 := main(); {4023#true} is VALID [2018-11-14 18:43:27,815 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4025#(= main_~i~0 0)} is VALID [2018-11-14 18:43:27,815 INFO L273 TraceCheckUtils]: 6: Hoare triple {4025#(= main_~i~0 0)} assume true; {4025#(= main_~i~0 0)} is VALID [2018-11-14 18:43:27,816 INFO L273 TraceCheckUtils]: 7: Hoare triple {4025#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:27,817 INFO L273 TraceCheckUtils]: 8: Hoare triple {4026#(<= main_~i~0 1)} assume true; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:27,818 INFO L273 TraceCheckUtils]: 9: Hoare triple {4026#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:27,818 INFO L273 TraceCheckUtils]: 10: Hoare triple {4027#(<= main_~i~0 2)} assume true; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:27,819 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:27,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {4028#(<= main_~i~0 3)} assume true; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:27,821 INFO L273 TraceCheckUtils]: 13: Hoare triple {4028#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:27,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {4029#(<= main_~i~0 4)} assume true; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:27,822 INFO L273 TraceCheckUtils]: 15: Hoare triple {4029#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:27,823 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(<= main_~i~0 5)} assume true; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:27,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:27,824 INFO L273 TraceCheckUtils]: 18: Hoare triple {4031#(<= main_~i~0 6)} assume true; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:27,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {4031#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:27,826 INFO L273 TraceCheckUtils]: 20: Hoare triple {4032#(<= main_~i~0 7)} assume true; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:27,827 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:27,827 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 8)} assume true; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:27,828 INFO L273 TraceCheckUtils]: 23: Hoare triple {4033#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:27,829 INFO L273 TraceCheckUtils]: 24: Hoare triple {4034#(<= main_~i~0 9)} assume true; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:27,830 INFO L273 TraceCheckUtils]: 25: Hoare triple {4034#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:27,830 INFO L273 TraceCheckUtils]: 26: Hoare triple {4035#(<= main_~i~0 10)} assume true; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:27,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {4035#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:27,832 INFO L273 TraceCheckUtils]: 28: Hoare triple {4036#(<= main_~i~0 11)} assume true; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:27,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {4036#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:27,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {4037#(<= main_~i~0 12)} assume true; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:27,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {4037#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:27,834 INFO L273 TraceCheckUtils]: 32: Hoare triple {4038#(<= main_~i~0 13)} assume true; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:27,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {4038#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:27,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {4039#(<= main_~i~0 14)} assume true; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:27,836 INFO L273 TraceCheckUtils]: 35: Hoare triple {4039#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4024#false} is VALID [2018-11-14 18:43:27,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {4024#false} havoc ~x~0;~x~0 := 0; {4024#false} is VALID [2018-11-14 18:43:27,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {4024#false} assume true; {4024#false} is VALID [2018-11-14 18:43:27,837 INFO L273 TraceCheckUtils]: 38: Hoare triple {4024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4024#false} is VALID [2018-11-14 18:43:27,837 INFO L256 TraceCheckUtils]: 39: Hoare triple {4024#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4024#false} is VALID [2018-11-14 18:43:27,837 INFO L273 TraceCheckUtils]: 40: Hoare triple {4024#false} ~cond := #in~cond; {4024#false} is VALID [2018-11-14 18:43:27,838 INFO L273 TraceCheckUtils]: 41: Hoare triple {4024#false} assume ~cond == 0; {4024#false} is VALID [2018-11-14 18:43:27,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {4024#false} assume !false; {4024#false} is VALID [2018-11-14 18:43:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:27,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:27,840 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-14 18:43:27,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:43:27,866 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:43:27,867 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:27,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:27,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:28,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {4023#true} call ULTIMATE.init(); {4023#true} is VALID [2018-11-14 18:43:28,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {4023#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4023#true} is VALID [2018-11-14 18:43:28,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {4023#true} assume true; {4023#true} is VALID [2018-11-14 18:43:28,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4023#true} {4023#true} #50#return; {4023#true} is VALID [2018-11-14 18:43:28,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {4023#true} call #t~ret2 := main(); {4023#true} is VALID [2018-11-14 18:43:28,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {4023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4058#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:28,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {4058#(<= main_~i~0 0)} assume true; {4058#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:28,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {4058#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:28,032 INFO L273 TraceCheckUtils]: 8: Hoare triple {4026#(<= main_~i~0 1)} assume true; {4026#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:28,033 INFO L273 TraceCheckUtils]: 9: Hoare triple {4026#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:28,033 INFO L273 TraceCheckUtils]: 10: Hoare triple {4027#(<= main_~i~0 2)} assume true; {4027#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:28,034 INFO L273 TraceCheckUtils]: 11: Hoare triple {4027#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:28,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {4028#(<= main_~i~0 3)} assume true; {4028#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:28,036 INFO L273 TraceCheckUtils]: 13: Hoare triple {4028#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:28,036 INFO L273 TraceCheckUtils]: 14: Hoare triple {4029#(<= main_~i~0 4)} assume true; {4029#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:28,037 INFO L273 TraceCheckUtils]: 15: Hoare triple {4029#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:28,038 INFO L273 TraceCheckUtils]: 16: Hoare triple {4030#(<= main_~i~0 5)} assume true; {4030#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:28,039 INFO L273 TraceCheckUtils]: 17: Hoare triple {4030#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:28,039 INFO L273 TraceCheckUtils]: 18: Hoare triple {4031#(<= main_~i~0 6)} assume true; {4031#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:28,040 INFO L273 TraceCheckUtils]: 19: Hoare triple {4031#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:28,041 INFO L273 TraceCheckUtils]: 20: Hoare triple {4032#(<= main_~i~0 7)} assume true; {4032#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:28,042 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:28,042 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 8)} assume true; {4033#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:28,043 INFO L273 TraceCheckUtils]: 23: Hoare triple {4033#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:28,044 INFO L273 TraceCheckUtils]: 24: Hoare triple {4034#(<= main_~i~0 9)} assume true; {4034#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:28,045 INFO L273 TraceCheckUtils]: 25: Hoare triple {4034#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:28,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {4035#(<= main_~i~0 10)} assume true; {4035#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:28,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {4035#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:28,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {4036#(<= main_~i~0 11)} assume true; {4036#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:28,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {4036#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:28,048 INFO L273 TraceCheckUtils]: 30: Hoare triple {4037#(<= main_~i~0 12)} assume true; {4037#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:28,049 INFO L273 TraceCheckUtils]: 31: Hoare triple {4037#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:28,050 INFO L273 TraceCheckUtils]: 32: Hoare triple {4038#(<= main_~i~0 13)} assume true; {4038#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:28,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {4038#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:28,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {4039#(<= main_~i~0 14)} assume true; {4039#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:28,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {4039#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4024#false} is VALID [2018-11-14 18:43:28,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {4024#false} havoc ~x~0;~x~0 := 0; {4024#false} is VALID [2018-11-14 18:43:28,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {4024#false} assume true; {4024#false} is VALID [2018-11-14 18:43:28,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {4024#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4024#false} is VALID [2018-11-14 18:43:28,053 INFO L256 TraceCheckUtils]: 39: Hoare triple {4024#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4024#false} is VALID [2018-11-14 18:43:28,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {4024#false} ~cond := #in~cond; {4024#false} is VALID [2018-11-14 18:43:28,053 INFO L273 TraceCheckUtils]: 41: Hoare triple {4024#false} assume ~cond == 0; {4024#false} is VALID [2018-11-14 18:43:28,053 INFO L273 TraceCheckUtils]: 42: Hoare triple {4024#false} assume !false; {4024#false} is VALID [2018-11-14 18:43:28,055 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:28,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:28,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-14 18:43:28,076 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 18:43:28,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:28,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 18:43:28,116 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:28,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 18:43:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 18:43:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:43:28,117 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 18 states. [2018-11-14 18:43:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:28,285 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-14 18:43:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 18:43:28,285 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-14 18:43:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:43:28,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-14 18:43:28,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 18:43:28,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-14 18:43:28,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2018-11-14 18:43:28,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:28,695 INFO L225 Difference]: With dead ends: 62 [2018-11-14 18:43:28,695 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:43:28,696 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-14 18:43:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:43:28,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 18:43:28,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:28,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 18:43:28,718 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:43:28,718 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:43:28,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:28,720 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-14 18:43:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 18:43:28,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:28,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:28,721 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:43:28,721 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:43:28,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:28,722 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-14 18:43:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 18:43:28,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:28,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:28,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:28,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:28,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:43:28,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-14 18:43:28,725 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 43 [2018-11-14 18:43:28,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:28,725 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-14 18:43:28,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 18:43:28,725 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-14 18:43:28,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 18:43:28,726 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:28,726 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:28,726 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:28,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:28,726 INFO L82 PathProgramCache]: Analyzing trace with hash -935603654, now seen corresponding path program 15 times [2018-11-14 18:43:28,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:28,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:28,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:28,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:28,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:28,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:29,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {4430#true} call ULTIMATE.init(); {4430#true} is VALID [2018-11-14 18:43:29,400 INFO L273 TraceCheckUtils]: 1: Hoare triple {4430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4430#true} is VALID [2018-11-14 18:43:29,400 INFO L273 TraceCheckUtils]: 2: Hoare triple {4430#true} assume true; {4430#true} is VALID [2018-11-14 18:43:29,400 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4430#true} {4430#true} #50#return; {4430#true} is VALID [2018-11-14 18:43:29,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {4430#true} call #t~ret2 := main(); {4430#true} is VALID [2018-11-14 18:43:29,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {4430#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4432#(= main_~i~0 0)} is VALID [2018-11-14 18:43:29,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {4432#(= main_~i~0 0)} assume true; {4432#(= main_~i~0 0)} is VALID [2018-11-14 18:43:29,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {4432#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:29,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {4433#(<= main_~i~0 1)} assume true; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:29,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {4433#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:29,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {4434#(<= main_~i~0 2)} assume true; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:29,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {4434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:29,404 INFO L273 TraceCheckUtils]: 12: Hoare triple {4435#(<= main_~i~0 3)} assume true; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:29,405 INFO L273 TraceCheckUtils]: 13: Hoare triple {4435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:29,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#(<= main_~i~0 4)} assume true; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:29,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:29,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#(<= main_~i~0 5)} assume true; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:29,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:29,409 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#(<= main_~i~0 6)} assume true; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:29,410 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:29,410 INFO L273 TraceCheckUtils]: 20: Hoare triple {4439#(<= main_~i~0 7)} assume true; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:29,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {4439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:29,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {4440#(<= main_~i~0 8)} assume true; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:29,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {4440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:29,413 INFO L273 TraceCheckUtils]: 24: Hoare triple {4441#(<= main_~i~0 9)} assume true; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:29,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {4441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:29,414 INFO L273 TraceCheckUtils]: 26: Hoare triple {4442#(<= main_~i~0 10)} assume true; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:29,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {4442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:29,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {4443#(<= main_~i~0 11)} assume true; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:29,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:29,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {4444#(<= main_~i~0 12)} assume true; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:29,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {4444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:29,419 INFO L273 TraceCheckUtils]: 32: Hoare triple {4445#(<= main_~i~0 13)} assume true; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:29,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {4445#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:29,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {4446#(<= main_~i~0 14)} assume true; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:29,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {4446#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:29,422 INFO L273 TraceCheckUtils]: 36: Hoare triple {4447#(<= main_~i~0 15)} assume true; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:29,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {4447#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4431#false} is VALID [2018-11-14 18:43:29,423 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#false} havoc ~x~0;~x~0 := 0; {4431#false} is VALID [2018-11-14 18:43:29,423 INFO L273 TraceCheckUtils]: 39: Hoare triple {4431#false} assume true; {4431#false} is VALID [2018-11-14 18:43:29,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {4431#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4431#false} is VALID [2018-11-14 18:43:29,423 INFO L256 TraceCheckUtils]: 41: Hoare triple {4431#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4431#false} is VALID [2018-11-14 18:43:29,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {4431#false} ~cond := #in~cond; {4431#false} is VALID [2018-11-14 18:43:29,424 INFO L273 TraceCheckUtils]: 43: Hoare triple {4431#false} assume ~cond == 0; {4431#false} is VALID [2018-11-14 18:43:29,424 INFO L273 TraceCheckUtils]: 44: Hoare triple {4431#false} assume !false; {4431#false} is VALID [2018-11-14 18:43:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:29,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:29,427 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-14 18:43:29,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:43:29,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-14 18:43:29,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:29,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:29,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:29,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {4430#true} call ULTIMATE.init(); {4430#true} is VALID [2018-11-14 18:43:29,886 INFO L273 TraceCheckUtils]: 1: Hoare triple {4430#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4430#true} is VALID [2018-11-14 18:43:29,886 INFO L273 TraceCheckUtils]: 2: Hoare triple {4430#true} assume true; {4430#true} is VALID [2018-11-14 18:43:29,886 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4430#true} {4430#true} #50#return; {4430#true} is VALID [2018-11-14 18:43:29,887 INFO L256 TraceCheckUtils]: 4: Hoare triple {4430#true} call #t~ret2 := main(); {4430#true} is VALID [2018-11-14 18:43:29,887 INFO L273 TraceCheckUtils]: 5: Hoare triple {4430#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4466#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:29,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {4466#(<= main_~i~0 0)} assume true; {4466#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:29,888 INFO L273 TraceCheckUtils]: 7: Hoare triple {4466#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:29,888 INFO L273 TraceCheckUtils]: 8: Hoare triple {4433#(<= main_~i~0 1)} assume true; {4433#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:29,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {4433#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:29,890 INFO L273 TraceCheckUtils]: 10: Hoare triple {4434#(<= main_~i~0 2)} assume true; {4434#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:29,891 INFO L273 TraceCheckUtils]: 11: Hoare triple {4434#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:29,891 INFO L273 TraceCheckUtils]: 12: Hoare triple {4435#(<= main_~i~0 3)} assume true; {4435#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:29,892 INFO L273 TraceCheckUtils]: 13: Hoare triple {4435#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:29,893 INFO L273 TraceCheckUtils]: 14: Hoare triple {4436#(<= main_~i~0 4)} assume true; {4436#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:29,894 INFO L273 TraceCheckUtils]: 15: Hoare triple {4436#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:29,894 INFO L273 TraceCheckUtils]: 16: Hoare triple {4437#(<= main_~i~0 5)} assume true; {4437#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:29,895 INFO L273 TraceCheckUtils]: 17: Hoare triple {4437#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:29,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {4438#(<= main_~i~0 6)} assume true; {4438#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:29,897 INFO L273 TraceCheckUtils]: 19: Hoare triple {4438#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:29,897 INFO L273 TraceCheckUtils]: 20: Hoare triple {4439#(<= main_~i~0 7)} assume true; {4439#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:29,898 INFO L273 TraceCheckUtils]: 21: Hoare triple {4439#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:29,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {4440#(<= main_~i~0 8)} assume true; {4440#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:29,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {4440#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:29,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {4441#(<= main_~i~0 9)} assume true; {4441#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:29,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {4441#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:29,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {4442#(<= main_~i~0 10)} assume true; {4442#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:29,903 INFO L273 TraceCheckUtils]: 27: Hoare triple {4442#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:29,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {4443#(<= main_~i~0 11)} assume true; {4443#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:29,904 INFO L273 TraceCheckUtils]: 29: Hoare triple {4443#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:29,905 INFO L273 TraceCheckUtils]: 30: Hoare triple {4444#(<= main_~i~0 12)} assume true; {4444#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:29,906 INFO L273 TraceCheckUtils]: 31: Hoare triple {4444#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:29,906 INFO L273 TraceCheckUtils]: 32: Hoare triple {4445#(<= main_~i~0 13)} assume true; {4445#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:29,907 INFO L273 TraceCheckUtils]: 33: Hoare triple {4445#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:29,908 INFO L273 TraceCheckUtils]: 34: Hoare triple {4446#(<= main_~i~0 14)} assume true; {4446#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:29,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {4446#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:29,909 INFO L273 TraceCheckUtils]: 36: Hoare triple {4447#(<= main_~i~0 15)} assume true; {4447#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:29,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {4447#(<= main_~i~0 15)} assume !(~i~0 < 100000); {4431#false} is VALID [2018-11-14 18:43:29,910 INFO L273 TraceCheckUtils]: 38: Hoare triple {4431#false} havoc ~x~0;~x~0 := 0; {4431#false} is VALID [2018-11-14 18:43:29,910 INFO L273 TraceCheckUtils]: 39: Hoare triple {4431#false} assume true; {4431#false} is VALID [2018-11-14 18:43:29,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {4431#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4431#false} is VALID [2018-11-14 18:43:29,911 INFO L256 TraceCheckUtils]: 41: Hoare triple {4431#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4431#false} is VALID [2018-11-14 18:43:29,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {4431#false} ~cond := #in~cond; {4431#false} is VALID [2018-11-14 18:43:29,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {4431#false} assume ~cond == 0; {4431#false} is VALID [2018-11-14 18:43:29,911 INFO L273 TraceCheckUtils]: 44: Hoare triple {4431#false} assume !false; {4431#false} is VALID [2018-11-14 18:43:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:29,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-14 18:43:29,934 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 18:43:29,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:29,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 18:43:29,977 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-14 18:43:29,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 18:43:29,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 18:43:29,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:43:29,978 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 19 states. [2018-11-14 18:43:30,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:30,342 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-14 18:43:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:43:30,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 18:43:30,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:43:30,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-14 18:43:30,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 18:43:30,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 66 transitions. [2018-11-14 18:43:30,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 66 transitions. [2018-11-14 18:43:30,903 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-14 18:43:30,905 INFO L225 Difference]: With dead ends: 64 [2018-11-14 18:43:30,905 INFO L226 Difference]: Without dead ends: 52 [2018-11-14 18:43:30,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-14 18:43:30,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-14 18:43:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-14 18:43:30,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:30,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-14 18:43:30,923 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 18:43:30,923 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 18:43:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:30,925 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-14 18:43:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 18:43:30,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:30,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:30,926 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-14 18:43:30,926 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-14 18:43:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:30,927 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-14 18:43:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 18:43:30,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:30,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:30,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:30,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:30,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-14 18:43:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-14 18:43:30,929 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2018-11-14 18:43:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:30,929 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-14 18:43:30,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 18:43:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-14 18:43:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 18:43:30,930 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:30,930 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:30,930 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:30,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1478886636, now seen corresponding path program 16 times [2018-11-14 18:43:30,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:30,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:30,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:30,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:31,328 INFO L256 TraceCheckUtils]: 0: Hoare triple {4854#true} call ULTIMATE.init(); {4854#true} is VALID [2018-11-14 18:43:31,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {4854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4854#true} is VALID [2018-11-14 18:43:31,329 INFO L273 TraceCheckUtils]: 2: Hoare triple {4854#true} assume true; {4854#true} is VALID [2018-11-14 18:43:31,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4854#true} {4854#true} #50#return; {4854#true} is VALID [2018-11-14 18:43:31,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {4854#true} call #t~ret2 := main(); {4854#true} is VALID [2018-11-14 18:43:31,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {4854#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4856#(= main_~i~0 0)} is VALID [2018-11-14 18:43:31,330 INFO L273 TraceCheckUtils]: 6: Hoare triple {4856#(= main_~i~0 0)} assume true; {4856#(= main_~i~0 0)} is VALID [2018-11-14 18:43:31,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {4856#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:31,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {4857#(<= main_~i~0 1)} assume true; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:31,332 INFO L273 TraceCheckUtils]: 9: Hoare triple {4857#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:31,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {4858#(<= main_~i~0 2)} assume true; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:31,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {4858#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:31,333 INFO L273 TraceCheckUtils]: 12: Hoare triple {4859#(<= main_~i~0 3)} assume true; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:31,334 INFO L273 TraceCheckUtils]: 13: Hoare triple {4859#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:31,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {4860#(<= main_~i~0 4)} assume true; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:31,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {4860#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:31,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {4861#(<= main_~i~0 5)} assume true; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:31,337 INFO L273 TraceCheckUtils]: 17: Hoare triple {4861#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:31,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {4862#(<= main_~i~0 6)} assume true; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:31,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {4862#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:31,339 INFO L273 TraceCheckUtils]: 20: Hoare triple {4863#(<= main_~i~0 7)} assume true; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:31,339 INFO L273 TraceCheckUtils]: 21: Hoare triple {4863#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:31,340 INFO L273 TraceCheckUtils]: 22: Hoare triple {4864#(<= main_~i~0 8)} assume true; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:31,341 INFO L273 TraceCheckUtils]: 23: Hoare triple {4864#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:31,342 INFO L273 TraceCheckUtils]: 24: Hoare triple {4865#(<= main_~i~0 9)} assume true; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:31,342 INFO L273 TraceCheckUtils]: 25: Hoare triple {4865#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:31,343 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 10)} assume true; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:31,344 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:31,344 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 11)} assume true; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:31,345 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:31,346 INFO L273 TraceCheckUtils]: 30: Hoare triple {4868#(<= main_~i~0 12)} assume true; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:31,347 INFO L273 TraceCheckUtils]: 31: Hoare triple {4868#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:31,347 INFO L273 TraceCheckUtils]: 32: Hoare triple {4869#(<= main_~i~0 13)} assume true; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:31,348 INFO L273 TraceCheckUtils]: 33: Hoare triple {4869#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:31,349 INFO L273 TraceCheckUtils]: 34: Hoare triple {4870#(<= main_~i~0 14)} assume true; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:31,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {4870#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:31,350 INFO L273 TraceCheckUtils]: 36: Hoare triple {4871#(<= main_~i~0 15)} assume true; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:31,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {4871#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:31,352 INFO L273 TraceCheckUtils]: 38: Hoare triple {4872#(<= main_~i~0 16)} assume true; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:31,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {4872#(<= main_~i~0 16)} assume !(~i~0 < 100000); {4855#false} is VALID [2018-11-14 18:43:31,353 INFO L273 TraceCheckUtils]: 40: Hoare triple {4855#false} havoc ~x~0;~x~0 := 0; {4855#false} is VALID [2018-11-14 18:43:31,353 INFO L273 TraceCheckUtils]: 41: Hoare triple {4855#false} assume true; {4855#false} is VALID [2018-11-14 18:43:31,353 INFO L273 TraceCheckUtils]: 42: Hoare triple {4855#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4855#false} is VALID [2018-11-14 18:43:31,354 INFO L256 TraceCheckUtils]: 43: Hoare triple {4855#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4855#false} is VALID [2018-11-14 18:43:31,354 INFO L273 TraceCheckUtils]: 44: Hoare triple {4855#false} ~cond := #in~cond; {4855#false} is VALID [2018-11-14 18:43:31,354 INFO L273 TraceCheckUtils]: 45: Hoare triple {4855#false} assume ~cond == 0; {4855#false} is VALID [2018-11-14 18:43:31,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2018-11-14 18:43:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:31,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:31,357 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-14 18:43:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:43:31,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:43:31,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:31,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:31,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {4854#true} call ULTIMATE.init(); {4854#true} is VALID [2018-11-14 18:43:31,528 INFO L273 TraceCheckUtils]: 1: Hoare triple {4854#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4854#true} is VALID [2018-11-14 18:43:31,528 INFO L273 TraceCheckUtils]: 2: Hoare triple {4854#true} assume true; {4854#true} is VALID [2018-11-14 18:43:31,528 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4854#true} {4854#true} #50#return; {4854#true} is VALID [2018-11-14 18:43:31,528 INFO L256 TraceCheckUtils]: 4: Hoare triple {4854#true} call #t~ret2 := main(); {4854#true} is VALID [2018-11-14 18:43:31,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {4854#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4891#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:31,529 INFO L273 TraceCheckUtils]: 6: Hoare triple {4891#(<= main_~i~0 0)} assume true; {4891#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:31,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {4891#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:31,530 INFO L273 TraceCheckUtils]: 8: Hoare triple {4857#(<= main_~i~0 1)} assume true; {4857#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:31,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {4857#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:31,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {4858#(<= main_~i~0 2)} assume true; {4858#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:31,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {4858#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:31,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {4859#(<= main_~i~0 3)} assume true; {4859#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:31,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {4859#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:31,533 INFO L273 TraceCheckUtils]: 14: Hoare triple {4860#(<= main_~i~0 4)} assume true; {4860#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:31,533 INFO L273 TraceCheckUtils]: 15: Hoare triple {4860#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:31,534 INFO L273 TraceCheckUtils]: 16: Hoare triple {4861#(<= main_~i~0 5)} assume true; {4861#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:31,535 INFO L273 TraceCheckUtils]: 17: Hoare triple {4861#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:31,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {4862#(<= main_~i~0 6)} assume true; {4862#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:31,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {4862#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:31,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {4863#(<= main_~i~0 7)} assume true; {4863#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:31,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {4863#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:31,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {4864#(<= main_~i~0 8)} assume true; {4864#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:31,539 INFO L273 TraceCheckUtils]: 23: Hoare triple {4864#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:31,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {4865#(<= main_~i~0 9)} assume true; {4865#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:31,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {4865#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:31,542 INFO L273 TraceCheckUtils]: 26: Hoare triple {4866#(<= main_~i~0 10)} assume true; {4866#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:31,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {4866#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:31,543 INFO L273 TraceCheckUtils]: 28: Hoare triple {4867#(<= main_~i~0 11)} assume true; {4867#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:31,544 INFO L273 TraceCheckUtils]: 29: Hoare triple {4867#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:31,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {4868#(<= main_~i~0 12)} assume true; {4868#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:31,545 INFO L273 TraceCheckUtils]: 31: Hoare triple {4868#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:31,546 INFO L273 TraceCheckUtils]: 32: Hoare triple {4869#(<= main_~i~0 13)} assume true; {4869#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:31,547 INFO L273 TraceCheckUtils]: 33: Hoare triple {4869#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:31,547 INFO L273 TraceCheckUtils]: 34: Hoare triple {4870#(<= main_~i~0 14)} assume true; {4870#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:31,548 INFO L273 TraceCheckUtils]: 35: Hoare triple {4870#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:31,549 INFO L273 TraceCheckUtils]: 36: Hoare triple {4871#(<= main_~i~0 15)} assume true; {4871#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:31,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {4871#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:31,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {4872#(<= main_~i~0 16)} assume true; {4872#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:31,551 INFO L273 TraceCheckUtils]: 39: Hoare triple {4872#(<= main_~i~0 16)} assume !(~i~0 < 100000); {4855#false} is VALID [2018-11-14 18:43:31,551 INFO L273 TraceCheckUtils]: 40: Hoare triple {4855#false} havoc ~x~0;~x~0 := 0; {4855#false} is VALID [2018-11-14 18:43:31,552 INFO L273 TraceCheckUtils]: 41: Hoare triple {4855#false} assume true; {4855#false} is VALID [2018-11-14 18:43:31,552 INFO L273 TraceCheckUtils]: 42: Hoare triple {4855#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {4855#false} is VALID [2018-11-14 18:43:31,552 INFO L256 TraceCheckUtils]: 43: Hoare triple {4855#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {4855#false} is VALID [2018-11-14 18:43:31,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {4855#false} ~cond := #in~cond; {4855#false} is VALID [2018-11-14 18:43:31,552 INFO L273 TraceCheckUtils]: 45: Hoare triple {4855#false} assume ~cond == 0; {4855#false} is VALID [2018-11-14 18:43:31,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {4855#false} assume !false; {4855#false} is VALID [2018-11-14 18:43:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:31,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:31,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-14 18:43:31,576 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 18:43:31,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:31,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 18:43:31,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:31,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 18:43:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 18:43:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:43:31,629 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 20 states. [2018-11-14 18:43:31,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:31,816 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-14 18:43:31,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 18:43:31,816 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 47 [2018-11-14 18:43:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:43:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-14 18:43:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 18:43:31,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2018-11-14 18:43:31,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2018-11-14 18:43:31,882 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:31,884 INFO L225 Difference]: With dead ends: 66 [2018-11-14 18:43:31,884 INFO L226 Difference]: Without dead ends: 54 [2018-11-14 18:43:31,885 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-14 18:43:31,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-14 18:43:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-14 18:43:31,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:31,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-14 18:43:31,919 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 18:43:31,919 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 18:43:31,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:31,920 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-14 18:43:31,921 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 18:43:31,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:31,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-14 18:43:31,921 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-14 18:43:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:31,923 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-14 18:43:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 18:43:31,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:31,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:31,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:31,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 18:43:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-14 18:43:31,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 47 [2018-11-14 18:43:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:31,925 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-14 18:43:31,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 18:43:31,925 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-14 18:43:31,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-14 18:43:31,926 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:31,926 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:31,926 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:31,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:31,927 INFO L82 PathProgramCache]: Analyzing trace with hash 412177774, now seen corresponding path program 17 times [2018-11-14 18:43:31,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:31,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:31,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:31,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:31,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:32,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2018-11-14 18:43:32,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {5295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5295#true} is VALID [2018-11-14 18:43:32,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2018-11-14 18:43:32,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #50#return; {5295#true} is VALID [2018-11-14 18:43:32,272 INFO L256 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret2 := main(); {5295#true} is VALID [2018-11-14 18:43:32,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {5295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5297#(= main_~i~0 0)} is VALID [2018-11-14 18:43:32,273 INFO L273 TraceCheckUtils]: 6: Hoare triple {5297#(= main_~i~0 0)} assume true; {5297#(= main_~i~0 0)} is VALID [2018-11-14 18:43:32,274 INFO L273 TraceCheckUtils]: 7: Hoare triple {5297#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:32,274 INFO L273 TraceCheckUtils]: 8: Hoare triple {5298#(<= main_~i~0 1)} assume true; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:32,275 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:32,275 INFO L273 TraceCheckUtils]: 10: Hoare triple {5299#(<= main_~i~0 2)} assume true; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:32,276 INFO L273 TraceCheckUtils]: 11: Hoare triple {5299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:32,276 INFO L273 TraceCheckUtils]: 12: Hoare triple {5300#(<= main_~i~0 3)} assume true; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:32,277 INFO L273 TraceCheckUtils]: 13: Hoare triple {5300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:32,278 INFO L273 TraceCheckUtils]: 14: Hoare triple {5301#(<= main_~i~0 4)} assume true; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:32,279 INFO L273 TraceCheckUtils]: 15: Hoare triple {5301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:32,279 INFO L273 TraceCheckUtils]: 16: Hoare triple {5302#(<= main_~i~0 5)} assume true; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:32,280 INFO L273 TraceCheckUtils]: 17: Hoare triple {5302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:32,281 INFO L273 TraceCheckUtils]: 18: Hoare triple {5303#(<= main_~i~0 6)} assume true; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:32,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {5303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:32,282 INFO L273 TraceCheckUtils]: 20: Hoare triple {5304#(<= main_~i~0 7)} assume true; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:32,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {5304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:32,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {5305#(<= main_~i~0 8)} assume true; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:32,284 INFO L273 TraceCheckUtils]: 23: Hoare triple {5305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:32,285 INFO L273 TraceCheckUtils]: 24: Hoare triple {5306#(<= main_~i~0 9)} assume true; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:32,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {5306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:32,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {5307#(<= main_~i~0 10)} assume true; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:32,287 INFO L273 TraceCheckUtils]: 27: Hoare triple {5307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:32,288 INFO L273 TraceCheckUtils]: 28: Hoare triple {5308#(<= main_~i~0 11)} assume true; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:32,289 INFO L273 TraceCheckUtils]: 29: Hoare triple {5308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:32,289 INFO L273 TraceCheckUtils]: 30: Hoare triple {5309#(<= main_~i~0 12)} assume true; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:32,290 INFO L273 TraceCheckUtils]: 31: Hoare triple {5309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:32,291 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#(<= main_~i~0 13)} assume true; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:32,292 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:32,292 INFO L273 TraceCheckUtils]: 34: Hoare triple {5311#(<= main_~i~0 14)} assume true; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:32,293 INFO L273 TraceCheckUtils]: 35: Hoare triple {5311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:32,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {5312#(<= main_~i~0 15)} assume true; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:32,295 INFO L273 TraceCheckUtils]: 37: Hoare triple {5312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:32,295 INFO L273 TraceCheckUtils]: 38: Hoare triple {5313#(<= main_~i~0 16)} assume true; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:32,296 INFO L273 TraceCheckUtils]: 39: Hoare triple {5313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:32,297 INFO L273 TraceCheckUtils]: 40: Hoare triple {5314#(<= main_~i~0 17)} assume true; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:32,298 INFO L273 TraceCheckUtils]: 41: Hoare triple {5314#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5296#false} is VALID [2018-11-14 18:43:32,298 INFO L273 TraceCheckUtils]: 42: Hoare triple {5296#false} havoc ~x~0;~x~0 := 0; {5296#false} is VALID [2018-11-14 18:43:32,298 INFO L273 TraceCheckUtils]: 43: Hoare triple {5296#false} assume true; {5296#false} is VALID [2018-11-14 18:43:32,298 INFO L273 TraceCheckUtils]: 44: Hoare triple {5296#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5296#false} is VALID [2018-11-14 18:43:32,298 INFO L256 TraceCheckUtils]: 45: Hoare triple {5296#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5296#false} is VALID [2018-11-14 18:43:32,299 INFO L273 TraceCheckUtils]: 46: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2018-11-14 18:43:32,299 INFO L273 TraceCheckUtils]: 47: Hoare triple {5296#false} assume ~cond == 0; {5296#false} is VALID [2018-11-14 18:43:32,299 INFO L273 TraceCheckUtils]: 48: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2018-11-14 18:43:32,302 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:32,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:32,302 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-14 18:43:32,312 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:43:32,434 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-14 18:43:32,434 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:32,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:32,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5295#true} is VALID [2018-11-14 18:43:32,748 INFO L273 TraceCheckUtils]: 1: Hoare triple {5295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5295#true} is VALID [2018-11-14 18:43:32,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2018-11-14 18:43:32,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #50#return; {5295#true} is VALID [2018-11-14 18:43:32,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret2 := main(); {5295#true} is VALID [2018-11-14 18:43:32,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {5295#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5333#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:32,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {5333#(<= main_~i~0 0)} assume true; {5333#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:32,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {5333#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:32,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {5298#(<= main_~i~0 1)} assume true; {5298#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:32,750 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:32,751 INFO L273 TraceCheckUtils]: 10: Hoare triple {5299#(<= main_~i~0 2)} assume true; {5299#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:32,751 INFO L273 TraceCheckUtils]: 11: Hoare triple {5299#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:32,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {5300#(<= main_~i~0 3)} assume true; {5300#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:32,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {5300#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:32,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {5301#(<= main_~i~0 4)} assume true; {5301#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:32,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {5301#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:32,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {5302#(<= main_~i~0 5)} assume true; {5302#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:32,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {5302#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:32,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {5303#(<= main_~i~0 6)} assume true; {5303#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:32,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {5303#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:32,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {5304#(<= main_~i~0 7)} assume true; {5304#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:32,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {5304#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:32,759 INFO L273 TraceCheckUtils]: 22: Hoare triple {5305#(<= main_~i~0 8)} assume true; {5305#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:32,760 INFO L273 TraceCheckUtils]: 23: Hoare triple {5305#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:32,760 INFO L273 TraceCheckUtils]: 24: Hoare triple {5306#(<= main_~i~0 9)} assume true; {5306#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:32,761 INFO L273 TraceCheckUtils]: 25: Hoare triple {5306#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:32,762 INFO L273 TraceCheckUtils]: 26: Hoare triple {5307#(<= main_~i~0 10)} assume true; {5307#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:32,763 INFO L273 TraceCheckUtils]: 27: Hoare triple {5307#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:32,763 INFO L273 TraceCheckUtils]: 28: Hoare triple {5308#(<= main_~i~0 11)} assume true; {5308#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:32,764 INFO L273 TraceCheckUtils]: 29: Hoare triple {5308#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:32,765 INFO L273 TraceCheckUtils]: 30: Hoare triple {5309#(<= main_~i~0 12)} assume true; {5309#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:32,766 INFO L273 TraceCheckUtils]: 31: Hoare triple {5309#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:32,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {5310#(<= main_~i~0 13)} assume true; {5310#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:32,767 INFO L273 TraceCheckUtils]: 33: Hoare triple {5310#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:32,768 INFO L273 TraceCheckUtils]: 34: Hoare triple {5311#(<= main_~i~0 14)} assume true; {5311#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:32,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {5311#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:32,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {5312#(<= main_~i~0 15)} assume true; {5312#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:32,770 INFO L273 TraceCheckUtils]: 37: Hoare triple {5312#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:32,771 INFO L273 TraceCheckUtils]: 38: Hoare triple {5313#(<= main_~i~0 16)} assume true; {5313#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:32,772 INFO L273 TraceCheckUtils]: 39: Hoare triple {5313#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:32,772 INFO L273 TraceCheckUtils]: 40: Hoare triple {5314#(<= main_~i~0 17)} assume true; {5314#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:32,773 INFO L273 TraceCheckUtils]: 41: Hoare triple {5314#(<= main_~i~0 17)} assume !(~i~0 < 100000); {5296#false} is VALID [2018-11-14 18:43:32,773 INFO L273 TraceCheckUtils]: 42: Hoare triple {5296#false} havoc ~x~0;~x~0 := 0; {5296#false} is VALID [2018-11-14 18:43:32,773 INFO L273 TraceCheckUtils]: 43: Hoare triple {5296#false} assume true; {5296#false} is VALID [2018-11-14 18:43:32,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {5296#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5296#false} is VALID [2018-11-14 18:43:32,774 INFO L256 TraceCheckUtils]: 45: Hoare triple {5296#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5296#false} is VALID [2018-11-14 18:43:32,774 INFO L273 TraceCheckUtils]: 46: Hoare triple {5296#false} ~cond := #in~cond; {5296#false} is VALID [2018-11-14 18:43:32,774 INFO L273 TraceCheckUtils]: 47: Hoare triple {5296#false} assume ~cond == 0; {5296#false} is VALID [2018-11-14 18:43:32,774 INFO L273 TraceCheckUtils]: 48: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2018-11-14 18:43:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:32,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:32,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-14 18:43:32,799 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-14 18:43:32,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:32,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-14 18:43:32,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:32,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-14 18:43:32,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-14 18:43:32,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:43:32,848 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 21 states. [2018-11-14 18:43:33,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:33,180 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-14 18:43:33,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:43:33,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 49 [2018-11-14 18:43:33,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:43:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-14 18:43:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-14 18:43:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 70 transitions. [2018-11-14 18:43:33,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 70 transitions. [2018-11-14 18:43:33,249 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:33,251 INFO L225 Difference]: With dead ends: 68 [2018-11-14 18:43:33,251 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 18:43:33,252 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-14 18:43:33,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 18:43:33,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-14 18:43:33,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:33,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-14 18:43:33,299 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 18:43:33,299 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 18:43:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:33,300 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-14 18:43:33,300 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 18:43:33,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:33,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:33,301 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-14 18:43:33,301 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-14 18:43:33,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:33,302 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-14 18:43:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 18:43:33,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:33,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:33,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:33,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:33,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 18:43:33,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-14 18:43:33,305 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 49 [2018-11-14 18:43:33,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:33,305 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-14 18:43:33,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-14 18:43:33,305 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-14 18:43:33,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 18:43:33,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:33,306 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:33,306 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:33,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:33,307 INFO L82 PathProgramCache]: Analyzing trace with hash 953909576, now seen corresponding path program 18 times [2018-11-14 18:43:33,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:33,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:33,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:33,308 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:33,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:34,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {5753#true} call ULTIMATE.init(); {5753#true} is VALID [2018-11-14 18:43:34,057 INFO L273 TraceCheckUtils]: 1: Hoare triple {5753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5753#true} is VALID [2018-11-14 18:43:34,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {5753#true} assume true; {5753#true} is VALID [2018-11-14 18:43:34,058 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5753#true} {5753#true} #50#return; {5753#true} is VALID [2018-11-14 18:43:34,058 INFO L256 TraceCheckUtils]: 4: Hoare triple {5753#true} call #t~ret2 := main(); {5753#true} is VALID [2018-11-14 18:43:34,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {5753#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5755#(= main_~i~0 0)} is VALID [2018-11-14 18:43:34,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {5755#(= main_~i~0 0)} assume true; {5755#(= main_~i~0 0)} is VALID [2018-11-14 18:43:34,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {5755#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:34,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {5756#(<= main_~i~0 1)} assume true; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:34,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {5756#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:34,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {5757#(<= main_~i~0 2)} assume true; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:34,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {5757#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:34,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {5758#(<= main_~i~0 3)} assume true; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:34,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {5758#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:34,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {5759#(<= main_~i~0 4)} assume true; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:34,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {5759#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:34,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {5760#(<= main_~i~0 5)} assume true; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:34,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {5760#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:34,109 INFO L273 TraceCheckUtils]: 18: Hoare triple {5761#(<= main_~i~0 6)} assume true; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:34,110 INFO L273 TraceCheckUtils]: 19: Hoare triple {5761#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:34,111 INFO L273 TraceCheckUtils]: 20: Hoare triple {5762#(<= main_~i~0 7)} assume true; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:34,112 INFO L273 TraceCheckUtils]: 21: Hoare triple {5762#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:34,112 INFO L273 TraceCheckUtils]: 22: Hoare triple {5763#(<= main_~i~0 8)} assume true; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:34,113 INFO L273 TraceCheckUtils]: 23: Hoare triple {5763#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:34,114 INFO L273 TraceCheckUtils]: 24: Hoare triple {5764#(<= main_~i~0 9)} assume true; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:34,115 INFO L273 TraceCheckUtils]: 25: Hoare triple {5764#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:34,115 INFO L273 TraceCheckUtils]: 26: Hoare triple {5765#(<= main_~i~0 10)} assume true; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:34,116 INFO L273 TraceCheckUtils]: 27: Hoare triple {5765#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:34,117 INFO L273 TraceCheckUtils]: 28: Hoare triple {5766#(<= main_~i~0 11)} assume true; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:34,118 INFO L273 TraceCheckUtils]: 29: Hoare triple {5766#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:34,118 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(<= main_~i~0 12)} assume true; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:34,119 INFO L273 TraceCheckUtils]: 31: Hoare triple {5767#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:34,120 INFO L273 TraceCheckUtils]: 32: Hoare triple {5768#(<= main_~i~0 13)} assume true; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:34,121 INFO L273 TraceCheckUtils]: 33: Hoare triple {5768#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:34,121 INFO L273 TraceCheckUtils]: 34: Hoare triple {5769#(<= main_~i~0 14)} assume true; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:34,122 INFO L273 TraceCheckUtils]: 35: Hoare triple {5769#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:34,123 INFO L273 TraceCheckUtils]: 36: Hoare triple {5770#(<= main_~i~0 15)} assume true; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:34,124 INFO L273 TraceCheckUtils]: 37: Hoare triple {5770#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:34,124 INFO L273 TraceCheckUtils]: 38: Hoare triple {5771#(<= main_~i~0 16)} assume true; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:34,125 INFO L273 TraceCheckUtils]: 39: Hoare triple {5771#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:34,126 INFO L273 TraceCheckUtils]: 40: Hoare triple {5772#(<= main_~i~0 17)} assume true; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:34,126 INFO L273 TraceCheckUtils]: 41: Hoare triple {5772#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:34,127 INFO L273 TraceCheckUtils]: 42: Hoare triple {5773#(<= main_~i~0 18)} assume true; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:34,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {5773#(<= main_~i~0 18)} assume !(~i~0 < 100000); {5754#false} is VALID [2018-11-14 18:43:34,128 INFO L273 TraceCheckUtils]: 44: Hoare triple {5754#false} havoc ~x~0;~x~0 := 0; {5754#false} is VALID [2018-11-14 18:43:34,128 INFO L273 TraceCheckUtils]: 45: Hoare triple {5754#false} assume true; {5754#false} is VALID [2018-11-14 18:43:34,128 INFO L273 TraceCheckUtils]: 46: Hoare triple {5754#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5754#false} is VALID [2018-11-14 18:43:34,129 INFO L256 TraceCheckUtils]: 47: Hoare triple {5754#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5754#false} is VALID [2018-11-14 18:43:34,129 INFO L273 TraceCheckUtils]: 48: Hoare triple {5754#false} ~cond := #in~cond; {5754#false} is VALID [2018-11-14 18:43:34,129 INFO L273 TraceCheckUtils]: 49: Hoare triple {5754#false} assume ~cond == 0; {5754#false} is VALID [2018-11-14 18:43:34,129 INFO L273 TraceCheckUtils]: 50: Hoare triple {5754#false} assume !false; {5754#false} is VALID [2018-11-14 18:43:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:34,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:34,132 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-14 18:43:34,141 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:43:34,641 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-14 18:43:34,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:34,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:35,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {5753#true} call ULTIMATE.init(); {5753#true} is VALID [2018-11-14 18:43:35,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {5753#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5753#true} is VALID [2018-11-14 18:43:35,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {5753#true} assume true; {5753#true} is VALID [2018-11-14 18:43:35,000 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5753#true} {5753#true} #50#return; {5753#true} is VALID [2018-11-14 18:43:35,000 INFO L256 TraceCheckUtils]: 4: Hoare triple {5753#true} call #t~ret2 := main(); {5753#true} is VALID [2018-11-14 18:43:35,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {5753#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5792#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:35,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {5792#(<= main_~i~0 0)} assume true; {5792#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:35,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {5792#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:35,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {5756#(<= main_~i~0 1)} assume true; {5756#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:35,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {5756#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:35,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {5757#(<= main_~i~0 2)} assume true; {5757#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:35,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {5757#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:35,004 INFO L273 TraceCheckUtils]: 12: Hoare triple {5758#(<= main_~i~0 3)} assume true; {5758#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:35,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {5758#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:35,005 INFO L273 TraceCheckUtils]: 14: Hoare triple {5759#(<= main_~i~0 4)} assume true; {5759#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:35,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {5759#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:35,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {5760#(<= main_~i~0 5)} assume true; {5760#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:35,010 INFO L273 TraceCheckUtils]: 17: Hoare triple {5760#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:35,010 INFO L273 TraceCheckUtils]: 18: Hoare triple {5761#(<= main_~i~0 6)} assume true; {5761#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:35,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {5761#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:35,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {5762#(<= main_~i~0 7)} assume true; {5762#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:35,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {5762#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:35,015 INFO L273 TraceCheckUtils]: 22: Hoare triple {5763#(<= main_~i~0 8)} assume true; {5763#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:35,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {5763#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:35,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {5764#(<= main_~i~0 9)} assume true; {5764#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:35,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {5764#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:35,021 INFO L273 TraceCheckUtils]: 26: Hoare triple {5765#(<= main_~i~0 10)} assume true; {5765#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:35,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {5765#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:35,023 INFO L273 TraceCheckUtils]: 28: Hoare triple {5766#(<= main_~i~0 11)} assume true; {5766#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:35,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {5766#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:35,025 INFO L273 TraceCheckUtils]: 30: Hoare triple {5767#(<= main_~i~0 12)} assume true; {5767#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:35,028 INFO L273 TraceCheckUtils]: 31: Hoare triple {5767#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:35,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {5768#(<= main_~i~0 13)} assume true; {5768#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:35,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {5768#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:35,031 INFO L273 TraceCheckUtils]: 34: Hoare triple {5769#(<= main_~i~0 14)} assume true; {5769#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:35,034 INFO L273 TraceCheckUtils]: 35: Hoare triple {5769#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:35,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {5770#(<= main_~i~0 15)} assume true; {5770#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:35,036 INFO L273 TraceCheckUtils]: 37: Hoare triple {5770#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:35,036 INFO L273 TraceCheckUtils]: 38: Hoare triple {5771#(<= main_~i~0 16)} assume true; {5771#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:35,038 INFO L273 TraceCheckUtils]: 39: Hoare triple {5771#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:35,038 INFO L273 TraceCheckUtils]: 40: Hoare triple {5772#(<= main_~i~0 17)} assume true; {5772#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:35,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {5772#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:35,040 INFO L273 TraceCheckUtils]: 42: Hoare triple {5773#(<= main_~i~0 18)} assume true; {5773#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {5773#(<= main_~i~0 18)} assume !(~i~0 < 100000); {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 44: Hoare triple {5754#false} havoc ~x~0;~x~0 := 0; {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 45: Hoare triple {5754#false} assume true; {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 46: Hoare triple {5754#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L256 TraceCheckUtils]: 47: Hoare triple {5754#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 48: Hoare triple {5754#false} ~cond := #in~cond; {5754#false} is VALID [2018-11-14 18:43:35,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {5754#false} assume ~cond == 0; {5754#false} is VALID [2018-11-14 18:43:35,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {5754#false} assume !false; {5754#false} is VALID [2018-11-14 18:43:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:35,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:35,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-14 18:43:35,068 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-14 18:43:35,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:35,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-14 18:43:35,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:35,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-14 18:43:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-14 18:43:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:43:35,127 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 22 states. [2018-11-14 18:43:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:35,399 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-14 18:43:35,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-14 18:43:35,399 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 51 [2018-11-14 18:43:35,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:35,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:43:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 18:43:35,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 18:43:35,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 72 transitions. [2018-11-14 18:43:35,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 72 transitions. [2018-11-14 18:43:35,474 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-14 18:43:35,476 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:43:35,476 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 18:43:35,477 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-14 18:43:35,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 18:43:35,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-14 18:43:35,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:35,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-14 18:43:35,499 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 18:43:35,499 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 18:43:35,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:35,500 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-14 18:43:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 18:43:35,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:35,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:35,501 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-14 18:43:35,501 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-14 18:43:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:35,502 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-14 18:43:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 18:43:35,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:35,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:35,503 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:35,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-14 18:43:35,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-14 18:43:35,505 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 51 [2018-11-14 18:43:35,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:35,505 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-14 18:43:35,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-14 18:43:35,505 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-14 18:43:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-14 18:43:35,506 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:35,506 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:35,506 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:35,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1867128482, now seen corresponding path program 19 times [2018-11-14 18:43:35,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:35,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:35,508 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:35,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:35,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:36,039 INFO L256 TraceCheckUtils]: 0: Hoare triple {6228#true} call ULTIMATE.init(); {6228#true} is VALID [2018-11-14 18:43:36,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {6228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6228#true} is VALID [2018-11-14 18:43:36,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {6228#true} assume true; {6228#true} is VALID [2018-11-14 18:43:36,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6228#true} {6228#true} #50#return; {6228#true} is VALID [2018-11-14 18:43:36,040 INFO L256 TraceCheckUtils]: 4: Hoare triple {6228#true} call #t~ret2 := main(); {6228#true} is VALID [2018-11-14 18:43:36,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {6228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6230#(= main_~i~0 0)} is VALID [2018-11-14 18:43:36,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {6230#(= main_~i~0 0)} assume true; {6230#(= main_~i~0 0)} is VALID [2018-11-14 18:43:36,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {6230#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:36,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {6231#(<= main_~i~0 1)} assume true; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:36,042 INFO L273 TraceCheckUtils]: 9: Hoare triple {6231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:36,043 INFO L273 TraceCheckUtils]: 10: Hoare triple {6232#(<= main_~i~0 2)} assume true; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:36,043 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:36,044 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= main_~i~0 3)} assume true; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:36,045 INFO L273 TraceCheckUtils]: 13: Hoare triple {6233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:36,045 INFO L273 TraceCheckUtils]: 14: Hoare triple {6234#(<= main_~i~0 4)} assume true; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:36,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {6234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:36,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {6235#(<= main_~i~0 5)} assume true; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:36,048 INFO L273 TraceCheckUtils]: 17: Hoare triple {6235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:36,049 INFO L273 TraceCheckUtils]: 18: Hoare triple {6236#(<= main_~i~0 6)} assume true; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:36,050 INFO L273 TraceCheckUtils]: 19: Hoare triple {6236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:36,050 INFO L273 TraceCheckUtils]: 20: Hoare triple {6237#(<= main_~i~0 7)} assume true; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:36,051 INFO L273 TraceCheckUtils]: 21: Hoare triple {6237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:36,053 INFO L273 TraceCheckUtils]: 22: Hoare triple {6238#(<= main_~i~0 8)} assume true; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:36,054 INFO L273 TraceCheckUtils]: 23: Hoare triple {6238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:36,054 INFO L273 TraceCheckUtils]: 24: Hoare triple {6239#(<= main_~i~0 9)} assume true; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:36,055 INFO L273 TraceCheckUtils]: 25: Hoare triple {6239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:36,055 INFO L273 TraceCheckUtils]: 26: Hoare triple {6240#(<= main_~i~0 10)} assume true; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:36,056 INFO L273 TraceCheckUtils]: 27: Hoare triple {6240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:36,057 INFO L273 TraceCheckUtils]: 28: Hoare triple {6241#(<= main_~i~0 11)} assume true; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:36,058 INFO L273 TraceCheckUtils]: 29: Hoare triple {6241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:36,058 INFO L273 TraceCheckUtils]: 30: Hoare triple {6242#(<= main_~i~0 12)} assume true; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:36,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {6242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:36,060 INFO L273 TraceCheckUtils]: 32: Hoare triple {6243#(<= main_~i~0 13)} assume true; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:36,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {6243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:36,062 INFO L273 TraceCheckUtils]: 34: Hoare triple {6244#(<= main_~i~0 14)} assume true; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:36,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {6244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:36,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {6245#(<= main_~i~0 15)} assume true; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:36,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {6245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:36,065 INFO L273 TraceCheckUtils]: 38: Hoare triple {6246#(<= main_~i~0 16)} assume true; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:36,066 INFO L273 TraceCheckUtils]: 39: Hoare triple {6246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:36,067 INFO L273 TraceCheckUtils]: 40: Hoare triple {6247#(<= main_~i~0 17)} assume true; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:36,068 INFO L273 TraceCheckUtils]: 41: Hoare triple {6247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:36,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {6248#(<= main_~i~0 18)} assume true; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:36,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {6248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:36,071 INFO L273 TraceCheckUtils]: 44: Hoare triple {6249#(<= main_~i~0 19)} assume true; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:36,071 INFO L273 TraceCheckUtils]: 45: Hoare triple {6249#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6229#false} is VALID [2018-11-14 18:43:36,072 INFO L273 TraceCheckUtils]: 46: Hoare triple {6229#false} havoc ~x~0;~x~0 := 0; {6229#false} is VALID [2018-11-14 18:43:36,072 INFO L273 TraceCheckUtils]: 47: Hoare triple {6229#false} assume true; {6229#false} is VALID [2018-11-14 18:43:36,072 INFO L273 TraceCheckUtils]: 48: Hoare triple {6229#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6229#false} is VALID [2018-11-14 18:43:36,073 INFO L256 TraceCheckUtils]: 49: Hoare triple {6229#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6229#false} is VALID [2018-11-14 18:43:36,073 INFO L273 TraceCheckUtils]: 50: Hoare triple {6229#false} ~cond := #in~cond; {6229#false} is VALID [2018-11-14 18:43:36,073 INFO L273 TraceCheckUtils]: 51: Hoare triple {6229#false} assume ~cond == 0; {6229#false} is VALID [2018-11-14 18:43:36,073 INFO L273 TraceCheckUtils]: 52: Hoare triple {6229#false} assume !false; {6229#false} is VALID [2018-11-14 18:43:36,077 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:36,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:36,078 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-14 18:43:36,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:36,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:36,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {6228#true} call ULTIMATE.init(); {6228#true} is VALID [2018-11-14 18:43:36,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {6228#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6228#true} is VALID [2018-11-14 18:43:36,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {6228#true} assume true; {6228#true} is VALID [2018-11-14 18:43:36,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6228#true} {6228#true} #50#return; {6228#true} is VALID [2018-11-14 18:43:36,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {6228#true} call #t~ret2 := main(); {6228#true} is VALID [2018-11-14 18:43:36,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {6228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6268#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:36,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {6268#(<= main_~i~0 0)} assume true; {6268#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:36,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {6268#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:36,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {6231#(<= main_~i~0 1)} assume true; {6231#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:36,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {6231#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:36,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {6232#(<= main_~i~0 2)} assume true; {6232#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:36,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {6232#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:36,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {6233#(<= main_~i~0 3)} assume true; {6233#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:36,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {6233#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:36,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {6234#(<= main_~i~0 4)} assume true; {6234#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:36,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {6234#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:36,325 INFO L273 TraceCheckUtils]: 16: Hoare triple {6235#(<= main_~i~0 5)} assume true; {6235#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:36,326 INFO L273 TraceCheckUtils]: 17: Hoare triple {6235#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:36,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {6236#(<= main_~i~0 6)} assume true; {6236#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:36,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {6236#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:36,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {6237#(<= main_~i~0 7)} assume true; {6237#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:36,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {6237#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:36,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {6238#(<= main_~i~0 8)} assume true; {6238#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:36,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {6238#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:36,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {6239#(<= main_~i~0 9)} assume true; {6239#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:36,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {6239#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:36,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {6240#(<= main_~i~0 10)} assume true; {6240#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:36,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {6240#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:36,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {6241#(<= main_~i~0 11)} assume true; {6241#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:36,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {6241#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:36,336 INFO L273 TraceCheckUtils]: 30: Hoare triple {6242#(<= main_~i~0 12)} assume true; {6242#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:36,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {6242#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:36,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {6243#(<= main_~i~0 13)} assume true; {6243#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:36,338 INFO L273 TraceCheckUtils]: 33: Hoare triple {6243#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:36,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {6244#(<= main_~i~0 14)} assume true; {6244#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:36,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {6244#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:36,359 INFO L273 TraceCheckUtils]: 36: Hoare triple {6245#(<= main_~i~0 15)} assume true; {6245#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:36,360 INFO L273 TraceCheckUtils]: 37: Hoare triple {6245#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:36,360 INFO L273 TraceCheckUtils]: 38: Hoare triple {6246#(<= main_~i~0 16)} assume true; {6246#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:36,361 INFO L273 TraceCheckUtils]: 39: Hoare triple {6246#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:36,361 INFO L273 TraceCheckUtils]: 40: Hoare triple {6247#(<= main_~i~0 17)} assume true; {6247#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:36,362 INFO L273 TraceCheckUtils]: 41: Hoare triple {6247#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:36,362 INFO L273 TraceCheckUtils]: 42: Hoare triple {6248#(<= main_~i~0 18)} assume true; {6248#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:36,362 INFO L273 TraceCheckUtils]: 43: Hoare triple {6248#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:36,363 INFO L273 TraceCheckUtils]: 44: Hoare triple {6249#(<= main_~i~0 19)} assume true; {6249#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:36,364 INFO L273 TraceCheckUtils]: 45: Hoare triple {6249#(<= main_~i~0 19)} assume !(~i~0 < 100000); {6229#false} is VALID [2018-11-14 18:43:36,364 INFO L273 TraceCheckUtils]: 46: Hoare triple {6229#false} havoc ~x~0;~x~0 := 0; {6229#false} is VALID [2018-11-14 18:43:36,364 INFO L273 TraceCheckUtils]: 47: Hoare triple {6229#false} assume true; {6229#false} is VALID [2018-11-14 18:43:36,364 INFO L273 TraceCheckUtils]: 48: Hoare triple {6229#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6229#false} is VALID [2018-11-14 18:43:36,364 INFO L256 TraceCheckUtils]: 49: Hoare triple {6229#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6229#false} is VALID [2018-11-14 18:43:36,365 INFO L273 TraceCheckUtils]: 50: Hoare triple {6229#false} ~cond := #in~cond; {6229#false} is VALID [2018-11-14 18:43:36,365 INFO L273 TraceCheckUtils]: 51: Hoare triple {6229#false} assume ~cond == 0; {6229#false} is VALID [2018-11-14 18:43:36,365 INFO L273 TraceCheckUtils]: 52: Hoare triple {6229#false} assume !false; {6229#false} is VALID [2018-11-14 18:43:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:36,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:36,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-14 18:43:36,389 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-14 18:43:36,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:36,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 18:43:36,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:36,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 18:43:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 18:43:36,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:43:36,456 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 23 states. [2018-11-14 18:43:36,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:36,670 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-14 18:43:36,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-14 18:43:36,670 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2018-11-14 18:43:36,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:43:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 74 transitions. [2018-11-14 18:43:36,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 18:43:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 74 transitions. [2018-11-14 18:43:36,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 74 transitions. [2018-11-14 18:43:36,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:36,741 INFO L225 Difference]: With dead ends: 72 [2018-11-14 18:43:36,741 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:43:36,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:43:36,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:43:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 18:43:36,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:36,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 18:43:36,777 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:43:36,777 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:43:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:36,778 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-14 18:43:36,778 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 18:43:36,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:36,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:36,779 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 18:43:36,779 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 18:43:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:36,780 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-14 18:43:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 18:43:36,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:36,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:36,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:36,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 18:43:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-14 18:43:36,782 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2018-11-14 18:43:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:36,782 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-14 18:43:36,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-14 18:43:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-14 18:43:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:43:36,783 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:36,783 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:36,783 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash -997798532, now seen corresponding path program 20 times [2018-11-14 18:43:36,784 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:36,784 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:36,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:36,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:37,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {6720#true} call ULTIMATE.init(); {6720#true} is VALID [2018-11-14 18:43:37,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {6720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6720#true} is VALID [2018-11-14 18:43:37,407 INFO L273 TraceCheckUtils]: 2: Hoare triple {6720#true} assume true; {6720#true} is VALID [2018-11-14 18:43:37,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6720#true} {6720#true} #50#return; {6720#true} is VALID [2018-11-14 18:43:37,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {6720#true} call #t~ret2 := main(); {6720#true} is VALID [2018-11-14 18:43:37,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {6720#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6722#(= main_~i~0 0)} is VALID [2018-11-14 18:43:37,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {6722#(= main_~i~0 0)} assume true; {6722#(= main_~i~0 0)} is VALID [2018-11-14 18:43:37,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {6722#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:37,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {6723#(<= main_~i~0 1)} assume true; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:37,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {6723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:37,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#(<= main_~i~0 2)} assume true; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:37,412 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:37,412 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(<= main_~i~0 3)} assume true; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:37,413 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:37,414 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 4)} assume true; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:37,414 INFO L273 TraceCheckUtils]: 15: Hoare triple {6726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:37,415 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 5)} assume true; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:37,416 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:37,416 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 6)} assume true; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:37,417 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:37,418 INFO L273 TraceCheckUtils]: 20: Hoare triple {6729#(<= main_~i~0 7)} assume true; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:37,419 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:37,419 INFO L273 TraceCheckUtils]: 22: Hoare triple {6730#(<= main_~i~0 8)} assume true; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:37,420 INFO L273 TraceCheckUtils]: 23: Hoare triple {6730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:37,421 INFO L273 TraceCheckUtils]: 24: Hoare triple {6731#(<= main_~i~0 9)} assume true; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:37,422 INFO L273 TraceCheckUtils]: 25: Hoare triple {6731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:37,422 INFO L273 TraceCheckUtils]: 26: Hoare triple {6732#(<= main_~i~0 10)} assume true; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:37,423 INFO L273 TraceCheckUtils]: 27: Hoare triple {6732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:37,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {6733#(<= main_~i~0 11)} assume true; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:37,425 INFO L273 TraceCheckUtils]: 29: Hoare triple {6733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:37,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {6734#(<= main_~i~0 12)} assume true; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:37,426 INFO L273 TraceCheckUtils]: 31: Hoare triple {6734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:37,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {6735#(<= main_~i~0 13)} assume true; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:37,428 INFO L273 TraceCheckUtils]: 33: Hoare triple {6735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:37,428 INFO L273 TraceCheckUtils]: 34: Hoare triple {6736#(<= main_~i~0 14)} assume true; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:37,429 INFO L273 TraceCheckUtils]: 35: Hoare triple {6736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:37,430 INFO L273 TraceCheckUtils]: 36: Hoare triple {6737#(<= main_~i~0 15)} assume true; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:37,431 INFO L273 TraceCheckUtils]: 37: Hoare triple {6737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:37,431 INFO L273 TraceCheckUtils]: 38: Hoare triple {6738#(<= main_~i~0 16)} assume true; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:37,432 INFO L273 TraceCheckUtils]: 39: Hoare triple {6738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:37,433 INFO L273 TraceCheckUtils]: 40: Hoare triple {6739#(<= main_~i~0 17)} assume true; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:37,434 INFO L273 TraceCheckUtils]: 41: Hoare triple {6739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:37,434 INFO L273 TraceCheckUtils]: 42: Hoare triple {6740#(<= main_~i~0 18)} assume true; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:37,435 INFO L273 TraceCheckUtils]: 43: Hoare triple {6740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:37,436 INFO L273 TraceCheckUtils]: 44: Hoare triple {6741#(<= main_~i~0 19)} assume true; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:37,437 INFO L273 TraceCheckUtils]: 45: Hoare triple {6741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:37,437 INFO L273 TraceCheckUtils]: 46: Hoare triple {6742#(<= main_~i~0 20)} assume true; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:37,438 INFO L273 TraceCheckUtils]: 47: Hoare triple {6742#(<= main_~i~0 20)} assume !(~i~0 < 100000); {6721#false} is VALID [2018-11-14 18:43:37,438 INFO L273 TraceCheckUtils]: 48: Hoare triple {6721#false} havoc ~x~0;~x~0 := 0; {6721#false} is VALID [2018-11-14 18:43:37,438 INFO L273 TraceCheckUtils]: 49: Hoare triple {6721#false} assume true; {6721#false} is VALID [2018-11-14 18:43:37,438 INFO L273 TraceCheckUtils]: 50: Hoare triple {6721#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6721#false} is VALID [2018-11-14 18:43:37,439 INFO L256 TraceCheckUtils]: 51: Hoare triple {6721#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6721#false} is VALID [2018-11-14 18:43:37,439 INFO L273 TraceCheckUtils]: 52: Hoare triple {6721#false} ~cond := #in~cond; {6721#false} is VALID [2018-11-14 18:43:37,439 INFO L273 TraceCheckUtils]: 53: Hoare triple {6721#false} assume ~cond == 0; {6721#false} is VALID [2018-11-14 18:43:37,439 INFO L273 TraceCheckUtils]: 54: Hoare triple {6721#false} assume !false; {6721#false} is VALID [2018-11-14 18:43:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:37,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:37,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 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-14 18:43:37,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:43:37,478 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:43:37,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:37,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:37,636 INFO L256 TraceCheckUtils]: 0: Hoare triple {6720#true} call ULTIMATE.init(); {6720#true} is VALID [2018-11-14 18:43:37,636 INFO L273 TraceCheckUtils]: 1: Hoare triple {6720#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6720#true} is VALID [2018-11-14 18:43:37,636 INFO L273 TraceCheckUtils]: 2: Hoare triple {6720#true} assume true; {6720#true} is VALID [2018-11-14 18:43:37,636 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6720#true} {6720#true} #50#return; {6720#true} is VALID [2018-11-14 18:43:37,637 INFO L256 TraceCheckUtils]: 4: Hoare triple {6720#true} call #t~ret2 := main(); {6720#true} is VALID [2018-11-14 18:43:37,637 INFO L273 TraceCheckUtils]: 5: Hoare triple {6720#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6761#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:37,638 INFO L273 TraceCheckUtils]: 6: Hoare triple {6761#(<= main_~i~0 0)} assume true; {6761#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:37,639 INFO L273 TraceCheckUtils]: 7: Hoare triple {6761#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:37,639 INFO L273 TraceCheckUtils]: 8: Hoare triple {6723#(<= main_~i~0 1)} assume true; {6723#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:37,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {6723#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:37,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {6724#(<= main_~i~0 2)} assume true; {6724#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:37,641 INFO L273 TraceCheckUtils]: 11: Hoare triple {6724#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:37,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {6725#(<= main_~i~0 3)} assume true; {6725#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:37,642 INFO L273 TraceCheckUtils]: 13: Hoare triple {6725#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:37,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {6726#(<= main_~i~0 4)} assume true; {6726#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:37,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {6726#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:37,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {6727#(<= main_~i~0 5)} assume true; {6727#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:37,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {6727#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:37,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {6728#(<= main_~i~0 6)} assume true; {6728#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:37,646 INFO L273 TraceCheckUtils]: 19: Hoare triple {6728#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:37,647 INFO L273 TraceCheckUtils]: 20: Hoare triple {6729#(<= main_~i~0 7)} assume true; {6729#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:37,648 INFO L273 TraceCheckUtils]: 21: Hoare triple {6729#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:37,648 INFO L273 TraceCheckUtils]: 22: Hoare triple {6730#(<= main_~i~0 8)} assume true; {6730#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:37,649 INFO L273 TraceCheckUtils]: 23: Hoare triple {6730#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:37,650 INFO L273 TraceCheckUtils]: 24: Hoare triple {6731#(<= main_~i~0 9)} assume true; {6731#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:37,651 INFO L273 TraceCheckUtils]: 25: Hoare triple {6731#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:37,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {6732#(<= main_~i~0 10)} assume true; {6732#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:37,652 INFO L273 TraceCheckUtils]: 27: Hoare triple {6732#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:37,653 INFO L273 TraceCheckUtils]: 28: Hoare triple {6733#(<= main_~i~0 11)} assume true; {6733#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:37,654 INFO L273 TraceCheckUtils]: 29: Hoare triple {6733#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:37,654 INFO L273 TraceCheckUtils]: 30: Hoare triple {6734#(<= main_~i~0 12)} assume true; {6734#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:37,655 INFO L273 TraceCheckUtils]: 31: Hoare triple {6734#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:37,656 INFO L273 TraceCheckUtils]: 32: Hoare triple {6735#(<= main_~i~0 13)} assume true; {6735#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:37,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {6735#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:37,657 INFO L273 TraceCheckUtils]: 34: Hoare triple {6736#(<= main_~i~0 14)} assume true; {6736#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:37,658 INFO L273 TraceCheckUtils]: 35: Hoare triple {6736#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:37,659 INFO L273 TraceCheckUtils]: 36: Hoare triple {6737#(<= main_~i~0 15)} assume true; {6737#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:37,660 INFO L273 TraceCheckUtils]: 37: Hoare triple {6737#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:37,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {6738#(<= main_~i~0 16)} assume true; {6738#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:37,661 INFO L273 TraceCheckUtils]: 39: Hoare triple {6738#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:37,662 INFO L273 TraceCheckUtils]: 40: Hoare triple {6739#(<= main_~i~0 17)} assume true; {6739#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:37,663 INFO L273 TraceCheckUtils]: 41: Hoare triple {6739#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:37,663 INFO L273 TraceCheckUtils]: 42: Hoare triple {6740#(<= main_~i~0 18)} assume true; {6740#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:37,664 INFO L273 TraceCheckUtils]: 43: Hoare triple {6740#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:37,665 INFO L273 TraceCheckUtils]: 44: Hoare triple {6741#(<= main_~i~0 19)} assume true; {6741#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:37,666 INFO L273 TraceCheckUtils]: 45: Hoare triple {6741#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:37,666 INFO L273 TraceCheckUtils]: 46: Hoare triple {6742#(<= main_~i~0 20)} assume true; {6742#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:37,667 INFO L273 TraceCheckUtils]: 47: Hoare triple {6742#(<= main_~i~0 20)} assume !(~i~0 < 100000); {6721#false} is VALID [2018-11-14 18:43:37,667 INFO L273 TraceCheckUtils]: 48: Hoare triple {6721#false} havoc ~x~0;~x~0 := 0; {6721#false} is VALID [2018-11-14 18:43:37,667 INFO L273 TraceCheckUtils]: 49: Hoare triple {6721#false} assume true; {6721#false} is VALID [2018-11-14 18:43:37,668 INFO L273 TraceCheckUtils]: 50: Hoare triple {6721#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {6721#false} is VALID [2018-11-14 18:43:37,668 INFO L256 TraceCheckUtils]: 51: Hoare triple {6721#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {6721#false} is VALID [2018-11-14 18:43:37,668 INFO L273 TraceCheckUtils]: 52: Hoare triple {6721#false} ~cond := #in~cond; {6721#false} is VALID [2018-11-14 18:43:37,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {6721#false} assume ~cond == 0; {6721#false} is VALID [2018-11-14 18:43:37,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {6721#false} assume !false; {6721#false} is VALID [2018-11-14 18:43:37,671 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:37,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:37,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-14 18:43:37,693 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 18:43:37,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:37,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 18:43:37,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:37,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 18:43:37,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 18:43:37,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:43:37,747 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 24 states. [2018-11-14 18:43:38,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:38,117 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-14 18:43:38,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 18:43:38,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 18:43:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:43:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 76 transitions. [2018-11-14 18:43:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:43:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 76 transitions. [2018-11-14 18:43:38,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 76 transitions. [2018-11-14 18:43:38,220 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:38,222 INFO L225 Difference]: With dead ends: 74 [2018-11-14 18:43:38,222 INFO L226 Difference]: Without dead ends: 62 [2018-11-14 18:43:38,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-14 18:43:38,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-14 18:43:38,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-14 18:43:38,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:38,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-14 18:43:38,298 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 18:43:38,299 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 18:43:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:38,300 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-14 18:43:38,300 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 18:43:38,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:38,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:38,301 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-14 18:43:38,301 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-14 18:43:38,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:38,302 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-14 18:43:38,302 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 18:43:38,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:38,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:38,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:38,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 18:43:38,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-14 18:43:38,304 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 55 [2018-11-14 18:43:38,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:38,304 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-14 18:43:38,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 18:43:38,305 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-14 18:43:38,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-14 18:43:38,305 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:38,305 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:38,306 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:38,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:38,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1118622250, now seen corresponding path program 21 times [2018-11-14 18:43:38,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:38,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:38,307 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:38,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:38,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:38,710 INFO L256 TraceCheckUtils]: 0: Hoare triple {7229#true} call ULTIMATE.init(); {7229#true} is VALID [2018-11-14 18:43:38,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {7229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7229#true} is VALID [2018-11-14 18:43:38,711 INFO L273 TraceCheckUtils]: 2: Hoare triple {7229#true} assume true; {7229#true} is VALID [2018-11-14 18:43:38,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7229#true} {7229#true} #50#return; {7229#true} is VALID [2018-11-14 18:43:38,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {7229#true} call #t~ret2 := main(); {7229#true} is VALID [2018-11-14 18:43:38,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {7229#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7231#(= main_~i~0 0)} is VALID [2018-11-14 18:43:38,712 INFO L273 TraceCheckUtils]: 6: Hoare triple {7231#(= main_~i~0 0)} assume true; {7231#(= main_~i~0 0)} is VALID [2018-11-14 18:43:38,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {7231#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:38,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {7232#(<= main_~i~0 1)} assume true; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:38,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:38,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {7233#(<= main_~i~0 2)} assume true; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:38,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:38,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {7234#(<= main_~i~0 3)} assume true; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:38,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:38,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {7235#(<= main_~i~0 4)} assume true; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:38,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:38,720 INFO L273 TraceCheckUtils]: 16: Hoare triple {7236#(<= main_~i~0 5)} assume true; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:38,721 INFO L273 TraceCheckUtils]: 17: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:38,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {7237#(<= main_~i~0 6)} assume true; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:38,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:38,723 INFO L273 TraceCheckUtils]: 20: Hoare triple {7238#(<= main_~i~0 7)} assume true; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:38,724 INFO L273 TraceCheckUtils]: 21: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:38,724 INFO L273 TraceCheckUtils]: 22: Hoare triple {7239#(<= main_~i~0 8)} assume true; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:38,725 INFO L273 TraceCheckUtils]: 23: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:38,726 INFO L273 TraceCheckUtils]: 24: Hoare triple {7240#(<= main_~i~0 9)} assume true; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:38,727 INFO L273 TraceCheckUtils]: 25: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:38,727 INFO L273 TraceCheckUtils]: 26: Hoare triple {7241#(<= main_~i~0 10)} assume true; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:38,728 INFO L273 TraceCheckUtils]: 27: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:38,729 INFO L273 TraceCheckUtils]: 28: Hoare triple {7242#(<= main_~i~0 11)} assume true; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:38,730 INFO L273 TraceCheckUtils]: 29: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:38,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {7243#(<= main_~i~0 12)} assume true; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:38,731 INFO L273 TraceCheckUtils]: 31: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:38,732 INFO L273 TraceCheckUtils]: 32: Hoare triple {7244#(<= main_~i~0 13)} assume true; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:38,732 INFO L273 TraceCheckUtils]: 33: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:38,733 INFO L273 TraceCheckUtils]: 34: Hoare triple {7245#(<= main_~i~0 14)} assume true; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:38,734 INFO L273 TraceCheckUtils]: 35: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:38,734 INFO L273 TraceCheckUtils]: 36: Hoare triple {7246#(<= main_~i~0 15)} assume true; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:38,735 INFO L273 TraceCheckUtils]: 37: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:38,736 INFO L273 TraceCheckUtils]: 38: Hoare triple {7247#(<= main_~i~0 16)} assume true; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:38,737 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:38,737 INFO L273 TraceCheckUtils]: 40: Hoare triple {7248#(<= main_~i~0 17)} assume true; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:38,738 INFO L273 TraceCheckUtils]: 41: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:38,739 INFO L273 TraceCheckUtils]: 42: Hoare triple {7249#(<= main_~i~0 18)} assume true; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:38,740 INFO L273 TraceCheckUtils]: 43: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:38,740 INFO L273 TraceCheckUtils]: 44: Hoare triple {7250#(<= main_~i~0 19)} assume true; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:38,741 INFO L273 TraceCheckUtils]: 45: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:38,742 INFO L273 TraceCheckUtils]: 46: Hoare triple {7251#(<= main_~i~0 20)} assume true; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:38,743 INFO L273 TraceCheckUtils]: 47: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:38,743 INFO L273 TraceCheckUtils]: 48: Hoare triple {7252#(<= main_~i~0 21)} assume true; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:38,744 INFO L273 TraceCheckUtils]: 49: Hoare triple {7252#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7230#false} is VALID [2018-11-14 18:43:38,744 INFO L273 TraceCheckUtils]: 50: Hoare triple {7230#false} havoc ~x~0;~x~0 := 0; {7230#false} is VALID [2018-11-14 18:43:38,744 INFO L273 TraceCheckUtils]: 51: Hoare triple {7230#false} assume true; {7230#false} is VALID [2018-11-14 18:43:38,745 INFO L273 TraceCheckUtils]: 52: Hoare triple {7230#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7230#false} is VALID [2018-11-14 18:43:38,745 INFO L256 TraceCheckUtils]: 53: Hoare triple {7230#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7230#false} is VALID [2018-11-14 18:43:38,745 INFO L273 TraceCheckUtils]: 54: Hoare triple {7230#false} ~cond := #in~cond; {7230#false} is VALID [2018-11-14 18:43:38,745 INFO L273 TraceCheckUtils]: 55: Hoare triple {7230#false} assume ~cond == 0; {7230#false} is VALID [2018-11-14 18:43:38,745 INFO L273 TraceCheckUtils]: 56: Hoare triple {7230#false} assume !false; {7230#false} is VALID [2018-11-14 18:43:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:38,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:38,749 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-14 18:43:38,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:43:39,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-14 18:43:39,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:39,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:39,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:40,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {7229#true} call ULTIMATE.init(); {7229#true} is VALID [2018-11-14 18:43:40,008 INFO L273 TraceCheckUtils]: 1: Hoare triple {7229#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7229#true} is VALID [2018-11-14 18:43:40,008 INFO L273 TraceCheckUtils]: 2: Hoare triple {7229#true} assume true; {7229#true} is VALID [2018-11-14 18:43:40,008 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7229#true} {7229#true} #50#return; {7229#true} is VALID [2018-11-14 18:43:40,009 INFO L256 TraceCheckUtils]: 4: Hoare triple {7229#true} call #t~ret2 := main(); {7229#true} is VALID [2018-11-14 18:43:40,010 INFO L273 TraceCheckUtils]: 5: Hoare triple {7229#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7271#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:40,010 INFO L273 TraceCheckUtils]: 6: Hoare triple {7271#(<= main_~i~0 0)} assume true; {7271#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:40,011 INFO L273 TraceCheckUtils]: 7: Hoare triple {7271#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:40,012 INFO L273 TraceCheckUtils]: 8: Hoare triple {7232#(<= main_~i~0 1)} assume true; {7232#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:40,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {7232#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:40,013 INFO L273 TraceCheckUtils]: 10: Hoare triple {7233#(<= main_~i~0 2)} assume true; {7233#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:40,015 INFO L273 TraceCheckUtils]: 11: Hoare triple {7233#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:40,015 INFO L273 TraceCheckUtils]: 12: Hoare triple {7234#(<= main_~i~0 3)} assume true; {7234#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:40,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {7234#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:40,017 INFO L273 TraceCheckUtils]: 14: Hoare triple {7235#(<= main_~i~0 4)} assume true; {7235#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:40,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {7235#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:40,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {7236#(<= main_~i~0 5)} assume true; {7236#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:40,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {7236#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:40,021 INFO L273 TraceCheckUtils]: 18: Hoare triple {7237#(<= main_~i~0 6)} assume true; {7237#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:40,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {7237#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:40,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {7238#(<= main_~i~0 7)} assume true; {7238#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:40,026 INFO L273 TraceCheckUtils]: 21: Hoare triple {7238#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:40,026 INFO L273 TraceCheckUtils]: 22: Hoare triple {7239#(<= main_~i~0 8)} assume true; {7239#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:40,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {7239#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:40,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {7240#(<= main_~i~0 9)} assume true; {7240#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:40,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {7240#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:40,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {7241#(<= main_~i~0 10)} assume true; {7241#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:40,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {7241#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:40,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {7242#(<= main_~i~0 11)} assume true; {7242#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:40,036 INFO L273 TraceCheckUtils]: 29: Hoare triple {7242#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:40,036 INFO L273 TraceCheckUtils]: 30: Hoare triple {7243#(<= main_~i~0 12)} assume true; {7243#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:40,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {7243#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:40,039 INFO L273 TraceCheckUtils]: 32: Hoare triple {7244#(<= main_~i~0 13)} assume true; {7244#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:40,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {7244#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:40,041 INFO L273 TraceCheckUtils]: 34: Hoare triple {7245#(<= main_~i~0 14)} assume true; {7245#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:40,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {7245#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:40,043 INFO L273 TraceCheckUtils]: 36: Hoare triple {7246#(<= main_~i~0 15)} assume true; {7246#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:40,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {7246#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:40,045 INFO L273 TraceCheckUtils]: 38: Hoare triple {7247#(<= main_~i~0 16)} assume true; {7247#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:40,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {7247#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:40,047 INFO L273 TraceCheckUtils]: 40: Hoare triple {7248#(<= main_~i~0 17)} assume true; {7248#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:40,050 INFO L273 TraceCheckUtils]: 41: Hoare triple {7248#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:40,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {7249#(<= main_~i~0 18)} assume true; {7249#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:40,053 INFO L273 TraceCheckUtils]: 43: Hoare triple {7249#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:40,053 INFO L273 TraceCheckUtils]: 44: Hoare triple {7250#(<= main_~i~0 19)} assume true; {7250#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:40,056 INFO L273 TraceCheckUtils]: 45: Hoare triple {7250#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:40,056 INFO L273 TraceCheckUtils]: 46: Hoare triple {7251#(<= main_~i~0 20)} assume true; {7251#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:40,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {7251#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:40,059 INFO L273 TraceCheckUtils]: 48: Hoare triple {7252#(<= main_~i~0 21)} assume true; {7252#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 49: Hoare triple {7252#(<= main_~i~0 21)} assume !(~i~0 < 100000); {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 50: Hoare triple {7230#false} havoc ~x~0;~x~0 := 0; {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {7230#false} assume true; {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {7230#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L256 TraceCheckUtils]: 53: Hoare triple {7230#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 54: Hoare triple {7230#false} ~cond := #in~cond; {7230#false} is VALID [2018-11-14 18:43:40,061 INFO L273 TraceCheckUtils]: 55: Hoare triple {7230#false} assume ~cond == 0; {7230#false} is VALID [2018-11-14 18:43:40,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {7230#false} assume !false; {7230#false} is VALID [2018-11-14 18:43:40,064 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:40,086 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-14 18:43:40,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-14 18:43:40,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:40,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:43:40,167 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:40,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:43:40,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:43:40,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:43:40,168 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 25 states. [2018-11-14 18:43:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:40,558 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-14 18:43:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 18:43:40,558 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 57 [2018-11-14 18:43:40,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:40,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:43:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 78 transitions. [2018-11-14 18:43:40,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:43:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 78 transitions. [2018-11-14 18:43:40,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 78 transitions. [2018-11-14 18:43:40,742 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-14 18:43:40,744 INFO L225 Difference]: With dead ends: 76 [2018-11-14 18:43:40,744 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 18:43:40,745 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:43:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 18:43:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-11-14 18:43:40,764 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:40,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 64 states. [2018-11-14 18:43:40,765 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 18:43:40,765 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 18:43:40,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:40,766 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-14 18:43:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 18:43:40,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:40,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:40,766 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 64 states. [2018-11-14 18:43:40,766 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 64 states. [2018-11-14 18:43:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:40,767 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-11-14 18:43:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 18:43:40,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:40,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:40,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:40,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 18:43:40,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2018-11-14 18:43:40,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2018-11-14 18:43:40,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:40,770 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2018-11-14 18:43:40,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:43:40,770 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2018-11-14 18:43:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-14 18:43:40,771 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:40,771 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:40,771 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:40,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:40,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1266098256, now seen corresponding path program 22 times [2018-11-14 18:43:40,772 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:40,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:40,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:40,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:40,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:41,187 INFO L256 TraceCheckUtils]: 0: Hoare triple {7755#true} call ULTIMATE.init(); {7755#true} is VALID [2018-11-14 18:43:41,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {7755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7755#true} is VALID [2018-11-14 18:43:41,188 INFO L273 TraceCheckUtils]: 2: Hoare triple {7755#true} assume true; {7755#true} is VALID [2018-11-14 18:43:41,188 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7755#true} {7755#true} #50#return; {7755#true} is VALID [2018-11-14 18:43:41,188 INFO L256 TraceCheckUtils]: 4: Hoare triple {7755#true} call #t~ret2 := main(); {7755#true} is VALID [2018-11-14 18:43:41,189 INFO L273 TraceCheckUtils]: 5: Hoare triple {7755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7757#(= main_~i~0 0)} is VALID [2018-11-14 18:43:41,189 INFO L273 TraceCheckUtils]: 6: Hoare triple {7757#(= main_~i~0 0)} assume true; {7757#(= main_~i~0 0)} is VALID [2018-11-14 18:43:41,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {7757#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:41,190 INFO L273 TraceCheckUtils]: 8: Hoare triple {7758#(<= main_~i~0 1)} assume true; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:41,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {7758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:41,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {7759#(<= main_~i~0 2)} assume true; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:41,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {7759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:41,193 INFO L273 TraceCheckUtils]: 12: Hoare triple {7760#(<= main_~i~0 3)} assume true; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:41,193 INFO L273 TraceCheckUtils]: 13: Hoare triple {7760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:41,194 INFO L273 TraceCheckUtils]: 14: Hoare triple {7761#(<= main_~i~0 4)} assume true; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:41,195 INFO L273 TraceCheckUtils]: 15: Hoare triple {7761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:41,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {7762#(<= main_~i~0 5)} assume true; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:41,196 INFO L273 TraceCheckUtils]: 17: Hoare triple {7762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:41,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {7763#(<= main_~i~0 6)} assume true; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:41,198 INFO L273 TraceCheckUtils]: 19: Hoare triple {7763#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:41,198 INFO L273 TraceCheckUtils]: 20: Hoare triple {7764#(<= main_~i~0 7)} assume true; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:41,199 INFO L273 TraceCheckUtils]: 21: Hoare triple {7764#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:41,200 INFO L273 TraceCheckUtils]: 22: Hoare triple {7765#(<= main_~i~0 8)} assume true; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:41,201 INFO L273 TraceCheckUtils]: 23: Hoare triple {7765#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:41,201 INFO L273 TraceCheckUtils]: 24: Hoare triple {7766#(<= main_~i~0 9)} assume true; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:41,202 INFO L273 TraceCheckUtils]: 25: Hoare triple {7766#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:41,203 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#(<= main_~i~0 10)} assume true; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:41,204 INFO L273 TraceCheckUtils]: 27: Hoare triple {7767#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:41,204 INFO L273 TraceCheckUtils]: 28: Hoare triple {7768#(<= main_~i~0 11)} assume true; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:41,205 INFO L273 TraceCheckUtils]: 29: Hoare triple {7768#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:41,206 INFO L273 TraceCheckUtils]: 30: Hoare triple {7769#(<= main_~i~0 12)} assume true; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:41,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {7769#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:41,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {7770#(<= main_~i~0 13)} assume true; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:41,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {7770#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:41,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {7771#(<= main_~i~0 14)} assume true; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:41,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {7771#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:41,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {7772#(<= main_~i~0 15)} assume true; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:41,229 INFO L273 TraceCheckUtils]: 37: Hoare triple {7772#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:41,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {7773#(<= main_~i~0 16)} assume true; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:41,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {7773#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:41,266 INFO L273 TraceCheckUtils]: 40: Hoare triple {7774#(<= main_~i~0 17)} assume true; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:41,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {7774#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:41,293 INFO L273 TraceCheckUtils]: 42: Hoare triple {7775#(<= main_~i~0 18)} assume true; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:41,309 INFO L273 TraceCheckUtils]: 43: Hoare triple {7775#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:41,318 INFO L273 TraceCheckUtils]: 44: Hoare triple {7776#(<= main_~i~0 19)} assume true; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:41,331 INFO L273 TraceCheckUtils]: 45: Hoare triple {7776#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:41,340 INFO L273 TraceCheckUtils]: 46: Hoare triple {7777#(<= main_~i~0 20)} assume true; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:41,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {7777#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:41,365 INFO L273 TraceCheckUtils]: 48: Hoare triple {7778#(<= main_~i~0 21)} assume true; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:41,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {7778#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:41,388 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#(<= main_~i~0 22)} assume true; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:41,401 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#(<= main_~i~0 22)} assume !(~i~0 < 100000); {7756#false} is VALID [2018-11-14 18:43:41,401 INFO L273 TraceCheckUtils]: 52: Hoare triple {7756#false} havoc ~x~0;~x~0 := 0; {7756#false} is VALID [2018-11-14 18:43:41,401 INFO L273 TraceCheckUtils]: 53: Hoare triple {7756#false} assume true; {7756#false} is VALID [2018-11-14 18:43:41,402 INFO L273 TraceCheckUtils]: 54: Hoare triple {7756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7756#false} is VALID [2018-11-14 18:43:41,402 INFO L256 TraceCheckUtils]: 55: Hoare triple {7756#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7756#false} is VALID [2018-11-14 18:43:41,402 INFO L273 TraceCheckUtils]: 56: Hoare triple {7756#false} ~cond := #in~cond; {7756#false} is VALID [2018-11-14 18:43:41,402 INFO L273 TraceCheckUtils]: 57: Hoare triple {7756#false} assume ~cond == 0; {7756#false} is VALID [2018-11-14 18:43:41,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {7756#false} assume !false; {7756#false} is VALID [2018-11-14 18:43:41,406 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:41,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:41,407 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-14 18:43:41,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:43:41,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:43:41,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:41,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:41,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {7755#true} call ULTIMATE.init(); {7755#true} is VALID [2018-11-14 18:43:41,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {7755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7755#true} is VALID [2018-11-14 18:43:41,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {7755#true} assume true; {7755#true} is VALID [2018-11-14 18:43:41,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7755#true} {7755#true} #50#return; {7755#true} is VALID [2018-11-14 18:43:41,905 INFO L256 TraceCheckUtils]: 4: Hoare triple {7755#true} call #t~ret2 := main(); {7755#true} is VALID [2018-11-14 18:43:41,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {7755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7798#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:41,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {7798#(<= main_~i~0 0)} assume true; {7798#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:41,907 INFO L273 TraceCheckUtils]: 7: Hoare triple {7798#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:41,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {7758#(<= main_~i~0 1)} assume true; {7758#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:41,908 INFO L273 TraceCheckUtils]: 9: Hoare triple {7758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:41,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {7759#(<= main_~i~0 2)} assume true; {7759#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:41,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {7759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:41,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {7760#(<= main_~i~0 3)} assume true; {7760#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:41,909 INFO L273 TraceCheckUtils]: 13: Hoare triple {7760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:41,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {7761#(<= main_~i~0 4)} assume true; {7761#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:41,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {7761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:41,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {7762#(<= main_~i~0 5)} assume true; {7762#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:41,924 INFO L273 TraceCheckUtils]: 17: Hoare triple {7762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:41,925 INFO L273 TraceCheckUtils]: 18: Hoare triple {7763#(<= main_~i~0 6)} assume true; {7763#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:41,925 INFO L273 TraceCheckUtils]: 19: Hoare triple {7763#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:41,926 INFO L273 TraceCheckUtils]: 20: Hoare triple {7764#(<= main_~i~0 7)} assume true; {7764#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:41,927 INFO L273 TraceCheckUtils]: 21: Hoare triple {7764#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:41,927 INFO L273 TraceCheckUtils]: 22: Hoare triple {7765#(<= main_~i~0 8)} assume true; {7765#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:41,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {7765#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:41,929 INFO L273 TraceCheckUtils]: 24: Hoare triple {7766#(<= main_~i~0 9)} assume true; {7766#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:41,930 INFO L273 TraceCheckUtils]: 25: Hoare triple {7766#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:41,930 INFO L273 TraceCheckUtils]: 26: Hoare triple {7767#(<= main_~i~0 10)} assume true; {7767#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:41,931 INFO L273 TraceCheckUtils]: 27: Hoare triple {7767#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:41,932 INFO L273 TraceCheckUtils]: 28: Hoare triple {7768#(<= main_~i~0 11)} assume true; {7768#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:41,932 INFO L273 TraceCheckUtils]: 29: Hoare triple {7768#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:41,933 INFO L273 TraceCheckUtils]: 30: Hoare triple {7769#(<= main_~i~0 12)} assume true; {7769#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:41,934 INFO L273 TraceCheckUtils]: 31: Hoare triple {7769#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:41,934 INFO L273 TraceCheckUtils]: 32: Hoare triple {7770#(<= main_~i~0 13)} assume true; {7770#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:41,935 INFO L273 TraceCheckUtils]: 33: Hoare triple {7770#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:41,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {7771#(<= main_~i~0 14)} assume true; {7771#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:41,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {7771#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:41,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {7772#(<= main_~i~0 15)} assume true; {7772#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:41,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {7772#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:41,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {7773#(<= main_~i~0 16)} assume true; {7773#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:41,940 INFO L273 TraceCheckUtils]: 39: Hoare triple {7773#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:41,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {7774#(<= main_~i~0 17)} assume true; {7774#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:41,941 INFO L273 TraceCheckUtils]: 41: Hoare triple {7774#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:41,942 INFO L273 TraceCheckUtils]: 42: Hoare triple {7775#(<= main_~i~0 18)} assume true; {7775#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:41,943 INFO L273 TraceCheckUtils]: 43: Hoare triple {7775#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:41,943 INFO L273 TraceCheckUtils]: 44: Hoare triple {7776#(<= main_~i~0 19)} assume true; {7776#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:41,944 INFO L273 TraceCheckUtils]: 45: Hoare triple {7776#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:41,945 INFO L273 TraceCheckUtils]: 46: Hoare triple {7777#(<= main_~i~0 20)} assume true; {7777#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:41,946 INFO L273 TraceCheckUtils]: 47: Hoare triple {7777#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:41,946 INFO L273 TraceCheckUtils]: 48: Hoare triple {7778#(<= main_~i~0 21)} assume true; {7778#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:41,947 INFO L273 TraceCheckUtils]: 49: Hoare triple {7778#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:41,948 INFO L273 TraceCheckUtils]: 50: Hoare triple {7779#(<= main_~i~0 22)} assume true; {7779#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:41,948 INFO L273 TraceCheckUtils]: 51: Hoare triple {7779#(<= main_~i~0 22)} assume !(~i~0 < 100000); {7756#false} is VALID [2018-11-14 18:43:41,949 INFO L273 TraceCheckUtils]: 52: Hoare triple {7756#false} havoc ~x~0;~x~0 := 0; {7756#false} is VALID [2018-11-14 18:43:41,949 INFO L273 TraceCheckUtils]: 53: Hoare triple {7756#false} assume true; {7756#false} is VALID [2018-11-14 18:43:41,949 INFO L273 TraceCheckUtils]: 54: Hoare triple {7756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {7756#false} is VALID [2018-11-14 18:43:41,949 INFO L256 TraceCheckUtils]: 55: Hoare triple {7756#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {7756#false} is VALID [2018-11-14 18:43:41,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {7756#false} ~cond := #in~cond; {7756#false} is VALID [2018-11-14 18:43:41,950 INFO L273 TraceCheckUtils]: 57: Hoare triple {7756#false} assume ~cond == 0; {7756#false} is VALID [2018-11-14 18:43:41,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {7756#false} assume !false; {7756#false} is VALID [2018-11-14 18:43:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:41,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:41,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-14 18:43:41,975 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-14 18:43:41,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:41,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:43:42,032 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-14 18:43:42,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:43:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:43:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:43:42,033 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 26 states. [2018-11-14 18:43:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:42,215 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-14 18:43:42,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 18:43:42,216 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2018-11-14 18:43:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:43:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2018-11-14 18:43:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:43:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 80 transitions. [2018-11-14 18:43:42,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 80 transitions. [2018-11-14 18:43:42,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:42,292 INFO L225 Difference]: With dead ends: 78 [2018-11-14 18:43:42,292 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 18:43:42,293 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:43:42,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 18:43:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-14 18:43:42,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:42,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-14 18:43:42,316 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 18:43:42,316 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 18:43:42,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:42,317 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-14 18:43:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 18:43:42,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:42,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:42,318 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 18:43:42,318 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 18:43:42,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:42,319 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-11-14 18:43:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 18:43:42,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:42,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:42,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:42,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:42,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 18:43:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-11-14 18:43:42,321 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 59 [2018-11-14 18:43:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:42,321 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-11-14 18:43:42,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:43:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-11-14 18:43:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 18:43:42,322 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:42,322 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:42,322 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:42,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1256619254, now seen corresponding path program 23 times [2018-11-14 18:43:42,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:42,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:42,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:42,729 INFO L256 TraceCheckUtils]: 0: Hoare triple {8298#true} call ULTIMATE.init(); {8298#true} is VALID [2018-11-14 18:43:42,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {8298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8298#true} is VALID [2018-11-14 18:43:42,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {8298#true} assume true; {8298#true} is VALID [2018-11-14 18:43:42,730 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8298#true} {8298#true} #50#return; {8298#true} is VALID [2018-11-14 18:43:42,730 INFO L256 TraceCheckUtils]: 4: Hoare triple {8298#true} call #t~ret2 := main(); {8298#true} is VALID [2018-11-14 18:43:42,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {8298#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8300#(= main_~i~0 0)} is VALID [2018-11-14 18:43:42,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {8300#(= main_~i~0 0)} assume true; {8300#(= main_~i~0 0)} is VALID [2018-11-14 18:43:42,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {8300#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:42,732 INFO L273 TraceCheckUtils]: 8: Hoare triple {8301#(<= main_~i~0 1)} assume true; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:42,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {8301#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:42,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {8302#(<= main_~i~0 2)} assume true; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:42,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {8302#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:42,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {8303#(<= main_~i~0 3)} assume true; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:42,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {8303#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:42,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~i~0 4)} assume true; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:42,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {8304#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:42,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {8305#(<= main_~i~0 5)} assume true; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:42,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {8305#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:42,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {8306#(<= main_~i~0 6)} assume true; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:42,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {8306#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:42,739 INFO L273 TraceCheckUtils]: 20: Hoare triple {8307#(<= main_~i~0 7)} assume true; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:42,740 INFO L273 TraceCheckUtils]: 21: Hoare triple {8307#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:42,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {8308#(<= main_~i~0 8)} assume true; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:42,741 INFO L273 TraceCheckUtils]: 23: Hoare triple {8308#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:42,742 INFO L273 TraceCheckUtils]: 24: Hoare triple {8309#(<= main_~i~0 9)} assume true; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:42,743 INFO L273 TraceCheckUtils]: 25: Hoare triple {8309#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:42,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {8310#(<= main_~i~0 10)} assume true; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:42,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {8310#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:42,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {8311#(<= main_~i~0 11)} assume true; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:42,746 INFO L273 TraceCheckUtils]: 29: Hoare triple {8311#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:42,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {8312#(<= main_~i~0 12)} assume true; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:42,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {8312#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:42,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {8313#(<= main_~i~0 13)} assume true; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:42,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {8313#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:42,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {8314#(<= main_~i~0 14)} assume true; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:42,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {8314#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:42,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {8315#(<= main_~i~0 15)} assume true; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:42,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {8315#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:42,752 INFO L273 TraceCheckUtils]: 38: Hoare triple {8316#(<= main_~i~0 16)} assume true; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:42,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {8316#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:42,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {8317#(<= main_~i~0 17)} assume true; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:42,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {8317#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:42,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {8318#(<= main_~i~0 18)} assume true; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:42,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {8318#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:42,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {8319#(<= main_~i~0 19)} assume true; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:42,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {8319#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:42,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {8320#(<= main_~i~0 20)} assume true; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:42,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {8320#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:42,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {8321#(<= main_~i~0 21)} assume true; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:42,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {8321#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:42,761 INFO L273 TraceCheckUtils]: 50: Hoare triple {8322#(<= main_~i~0 22)} assume true; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:42,762 INFO L273 TraceCheckUtils]: 51: Hoare triple {8322#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:42,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {8323#(<= main_~i~0 23)} assume true; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:42,763 INFO L273 TraceCheckUtils]: 53: Hoare triple {8323#(<= main_~i~0 23)} assume !(~i~0 < 100000); {8299#false} is VALID [2018-11-14 18:43:42,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {8299#false} havoc ~x~0;~x~0 := 0; {8299#false} is VALID [2018-11-14 18:43:42,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {8299#false} assume true; {8299#false} is VALID [2018-11-14 18:43:42,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {8299#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8299#false} is VALID [2018-11-14 18:43:42,764 INFO L256 TraceCheckUtils]: 57: Hoare triple {8299#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8299#false} is VALID [2018-11-14 18:43:42,764 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#false} ~cond := #in~cond; {8299#false} is VALID [2018-11-14 18:43:42,764 INFO L273 TraceCheckUtils]: 59: Hoare triple {8299#false} assume ~cond == 0; {8299#false} is VALID [2018-11-14 18:43:42,764 INFO L273 TraceCheckUtils]: 60: Hoare triple {8299#false} assume !false; {8299#false} is VALID [2018-11-14 18:43:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:42,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:42,768 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-14 18:43:42,795 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:43:43,059 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-14 18:43:43,059 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:43,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:43,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:43,272 INFO L256 TraceCheckUtils]: 0: Hoare triple {8298#true} call ULTIMATE.init(); {8298#true} is VALID [2018-11-14 18:43:43,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {8298#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8298#true} is VALID [2018-11-14 18:43:43,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {8298#true} assume true; {8298#true} is VALID [2018-11-14 18:43:43,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8298#true} {8298#true} #50#return; {8298#true} is VALID [2018-11-14 18:43:43,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {8298#true} call #t~ret2 := main(); {8298#true} is VALID [2018-11-14 18:43:43,274 INFO L273 TraceCheckUtils]: 5: Hoare triple {8298#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8342#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:43,275 INFO L273 TraceCheckUtils]: 6: Hoare triple {8342#(<= main_~i~0 0)} assume true; {8342#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:43,275 INFO L273 TraceCheckUtils]: 7: Hoare triple {8342#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:43,276 INFO L273 TraceCheckUtils]: 8: Hoare triple {8301#(<= main_~i~0 1)} assume true; {8301#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:43,276 INFO L273 TraceCheckUtils]: 9: Hoare triple {8301#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:43,277 INFO L273 TraceCheckUtils]: 10: Hoare triple {8302#(<= main_~i~0 2)} assume true; {8302#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:43,277 INFO L273 TraceCheckUtils]: 11: Hoare triple {8302#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:43,277 INFO L273 TraceCheckUtils]: 12: Hoare triple {8303#(<= main_~i~0 3)} assume true; {8303#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:43,278 INFO L273 TraceCheckUtils]: 13: Hoare triple {8303#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:43,279 INFO L273 TraceCheckUtils]: 14: Hoare triple {8304#(<= main_~i~0 4)} assume true; {8304#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:43,280 INFO L273 TraceCheckUtils]: 15: Hoare triple {8304#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:43,280 INFO L273 TraceCheckUtils]: 16: Hoare triple {8305#(<= main_~i~0 5)} assume true; {8305#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:43,281 INFO L273 TraceCheckUtils]: 17: Hoare triple {8305#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:43,282 INFO L273 TraceCheckUtils]: 18: Hoare triple {8306#(<= main_~i~0 6)} assume true; {8306#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:43,282 INFO L273 TraceCheckUtils]: 19: Hoare triple {8306#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:43,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {8307#(<= main_~i~0 7)} assume true; {8307#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:43,284 INFO L273 TraceCheckUtils]: 21: Hoare triple {8307#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:43,284 INFO L273 TraceCheckUtils]: 22: Hoare triple {8308#(<= main_~i~0 8)} assume true; {8308#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:43,285 INFO L273 TraceCheckUtils]: 23: Hoare triple {8308#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:43,286 INFO L273 TraceCheckUtils]: 24: Hoare triple {8309#(<= main_~i~0 9)} assume true; {8309#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:43,287 INFO L273 TraceCheckUtils]: 25: Hoare triple {8309#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:43,287 INFO L273 TraceCheckUtils]: 26: Hoare triple {8310#(<= main_~i~0 10)} assume true; {8310#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:43,288 INFO L273 TraceCheckUtils]: 27: Hoare triple {8310#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:43,289 INFO L273 TraceCheckUtils]: 28: Hoare triple {8311#(<= main_~i~0 11)} assume true; {8311#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:43,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {8311#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:43,290 INFO L273 TraceCheckUtils]: 30: Hoare triple {8312#(<= main_~i~0 12)} assume true; {8312#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:43,291 INFO L273 TraceCheckUtils]: 31: Hoare triple {8312#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:43,292 INFO L273 TraceCheckUtils]: 32: Hoare triple {8313#(<= main_~i~0 13)} assume true; {8313#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:43,293 INFO L273 TraceCheckUtils]: 33: Hoare triple {8313#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:43,293 INFO L273 TraceCheckUtils]: 34: Hoare triple {8314#(<= main_~i~0 14)} assume true; {8314#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:43,294 INFO L273 TraceCheckUtils]: 35: Hoare triple {8314#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:43,295 INFO L273 TraceCheckUtils]: 36: Hoare triple {8315#(<= main_~i~0 15)} assume true; {8315#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:43,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {8315#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:43,296 INFO L273 TraceCheckUtils]: 38: Hoare triple {8316#(<= main_~i~0 16)} assume true; {8316#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:43,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {8316#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:43,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {8317#(<= main_~i~0 17)} assume true; {8317#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:43,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {8317#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:43,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {8318#(<= main_~i~0 18)} assume true; {8318#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:43,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {8318#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:43,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {8319#(<= main_~i~0 19)} assume true; {8319#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:43,302 INFO L273 TraceCheckUtils]: 45: Hoare triple {8319#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:43,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {8320#(<= main_~i~0 20)} assume true; {8320#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:43,303 INFO L273 TraceCheckUtils]: 47: Hoare triple {8320#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:43,304 INFO L273 TraceCheckUtils]: 48: Hoare triple {8321#(<= main_~i~0 21)} assume true; {8321#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:43,304 INFO L273 TraceCheckUtils]: 49: Hoare triple {8321#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:43,305 INFO L273 TraceCheckUtils]: 50: Hoare triple {8322#(<= main_~i~0 22)} assume true; {8322#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:43,306 INFO L273 TraceCheckUtils]: 51: Hoare triple {8322#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:43,306 INFO L273 TraceCheckUtils]: 52: Hoare triple {8323#(<= main_~i~0 23)} assume true; {8323#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:43,307 INFO L273 TraceCheckUtils]: 53: Hoare triple {8323#(<= main_~i~0 23)} assume !(~i~0 < 100000); {8299#false} is VALID [2018-11-14 18:43:43,307 INFO L273 TraceCheckUtils]: 54: Hoare triple {8299#false} havoc ~x~0;~x~0 := 0; {8299#false} is VALID [2018-11-14 18:43:43,308 INFO L273 TraceCheckUtils]: 55: Hoare triple {8299#false} assume true; {8299#false} is VALID [2018-11-14 18:43:43,308 INFO L273 TraceCheckUtils]: 56: Hoare triple {8299#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8299#false} is VALID [2018-11-14 18:43:43,308 INFO L256 TraceCheckUtils]: 57: Hoare triple {8299#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8299#false} is VALID [2018-11-14 18:43:43,308 INFO L273 TraceCheckUtils]: 58: Hoare triple {8299#false} ~cond := #in~cond; {8299#false} is VALID [2018-11-14 18:43:43,308 INFO L273 TraceCheckUtils]: 59: Hoare triple {8299#false} assume ~cond == 0; {8299#false} is VALID [2018-11-14 18:43:43,309 INFO L273 TraceCheckUtils]: 60: Hoare triple {8299#false} assume !false; {8299#false} is VALID [2018-11-14 18:43:43,312 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:43,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:43,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-14 18:43:43,333 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-14 18:43:43,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:43,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:43:43,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:43,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:43:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:43:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:43:43,395 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 27 states. [2018-11-14 18:43:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:43,587 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2018-11-14 18:43:43,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-14 18:43:43,587 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 61 [2018-11-14 18:43:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:43:43,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 82 transitions. [2018-11-14 18:43:43,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:43:43,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 82 transitions. [2018-11-14 18:43:43,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 82 transitions. [2018-11-14 18:43:43,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:43,663 INFO L225 Difference]: With dead ends: 80 [2018-11-14 18:43:43,663 INFO L226 Difference]: Without dead ends: 68 [2018-11-14 18:43:43,664 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:43:43,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-11-14 18:43:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-11-14 18:43:43,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:43,686 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 68 states. [2018-11-14 18:43:43,686 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 18:43:43,686 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 18:43:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:43,688 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-14 18:43:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 18:43:43,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:43,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:43,688 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 68 states. [2018-11-14 18:43:43,688 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 68 states. [2018-11-14 18:43:43,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:43,689 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2018-11-14 18:43:43,689 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 18:43:43,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:43,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:43,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:43,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:43,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:43:43,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2018-11-14 18:43:43,691 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2018-11-14 18:43:43,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:43,691 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2018-11-14 18:43:43,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:43:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2018-11-14 18:43:43,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-14 18:43:43,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:43,692 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:43,693 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:43,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash -737232924, now seen corresponding path program 24 times [2018-11-14 18:43:43,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:43,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:44,680 INFO L256 TraceCheckUtils]: 0: Hoare triple {8858#true} call ULTIMATE.init(); {8858#true} is VALID [2018-11-14 18:43:44,681 INFO L273 TraceCheckUtils]: 1: Hoare triple {8858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8858#true} is VALID [2018-11-14 18:43:44,681 INFO L273 TraceCheckUtils]: 2: Hoare triple {8858#true} assume true; {8858#true} is VALID [2018-11-14 18:43:44,681 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8858#true} {8858#true} #50#return; {8858#true} is VALID [2018-11-14 18:43:44,681 INFO L256 TraceCheckUtils]: 4: Hoare triple {8858#true} call #t~ret2 := main(); {8858#true} is VALID [2018-11-14 18:43:44,682 INFO L273 TraceCheckUtils]: 5: Hoare triple {8858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8860#(= main_~i~0 0)} is VALID [2018-11-14 18:43:44,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {8860#(= main_~i~0 0)} assume true; {8860#(= main_~i~0 0)} is VALID [2018-11-14 18:43:44,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {8860#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:44,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {8861#(<= main_~i~0 1)} assume true; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:44,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {8861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:44,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {8862#(<= main_~i~0 2)} assume true; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:44,687 INFO L273 TraceCheckUtils]: 11: Hoare triple {8862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:44,687 INFO L273 TraceCheckUtils]: 12: Hoare triple {8863#(<= main_~i~0 3)} assume true; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:44,688 INFO L273 TraceCheckUtils]: 13: Hoare triple {8863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:44,689 INFO L273 TraceCheckUtils]: 14: Hoare triple {8864#(<= main_~i~0 4)} assume true; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:44,690 INFO L273 TraceCheckUtils]: 15: Hoare triple {8864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:44,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {8865#(<= main_~i~0 5)} assume true; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:44,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {8865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:44,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {8866#(<= main_~i~0 6)} assume true; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:44,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {8866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:44,693 INFO L273 TraceCheckUtils]: 20: Hoare triple {8867#(<= main_~i~0 7)} assume true; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:44,694 INFO L273 TraceCheckUtils]: 21: Hoare triple {8867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:44,694 INFO L273 TraceCheckUtils]: 22: Hoare triple {8868#(<= main_~i~0 8)} assume true; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:44,695 INFO L273 TraceCheckUtils]: 23: Hoare triple {8868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:44,696 INFO L273 TraceCheckUtils]: 24: Hoare triple {8869#(<= main_~i~0 9)} assume true; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:44,697 INFO L273 TraceCheckUtils]: 25: Hoare triple {8869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:44,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {8870#(<= main_~i~0 10)} assume true; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:44,698 INFO L273 TraceCheckUtils]: 27: Hoare triple {8870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:44,699 INFO L273 TraceCheckUtils]: 28: Hoare triple {8871#(<= main_~i~0 11)} assume true; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:44,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {8871#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:44,700 INFO L273 TraceCheckUtils]: 30: Hoare triple {8872#(<= main_~i~0 12)} assume true; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:44,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {8872#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:44,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {8873#(<= main_~i~0 13)} assume true; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:44,703 INFO L273 TraceCheckUtils]: 33: Hoare triple {8873#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:44,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {8874#(<= main_~i~0 14)} assume true; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:44,704 INFO L273 TraceCheckUtils]: 35: Hoare triple {8874#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:44,705 INFO L273 TraceCheckUtils]: 36: Hoare triple {8875#(<= main_~i~0 15)} assume true; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:44,706 INFO L273 TraceCheckUtils]: 37: Hoare triple {8875#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:44,706 INFO L273 TraceCheckUtils]: 38: Hoare triple {8876#(<= main_~i~0 16)} assume true; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:44,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {8876#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:44,708 INFO L273 TraceCheckUtils]: 40: Hoare triple {8877#(<= main_~i~0 17)} assume true; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:44,708 INFO L273 TraceCheckUtils]: 41: Hoare triple {8877#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:44,709 INFO L273 TraceCheckUtils]: 42: Hoare triple {8878#(<= main_~i~0 18)} assume true; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:44,710 INFO L273 TraceCheckUtils]: 43: Hoare triple {8878#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:44,710 INFO L273 TraceCheckUtils]: 44: Hoare triple {8879#(<= main_~i~0 19)} assume true; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:44,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {8879#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:44,712 INFO L273 TraceCheckUtils]: 46: Hoare triple {8880#(<= main_~i~0 20)} assume true; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:44,713 INFO L273 TraceCheckUtils]: 47: Hoare triple {8880#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:44,713 INFO L273 TraceCheckUtils]: 48: Hoare triple {8881#(<= main_~i~0 21)} assume true; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:44,714 INFO L273 TraceCheckUtils]: 49: Hoare triple {8881#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:44,715 INFO L273 TraceCheckUtils]: 50: Hoare triple {8882#(<= main_~i~0 22)} assume true; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:44,716 INFO L273 TraceCheckUtils]: 51: Hoare triple {8882#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:44,716 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#(<= main_~i~0 23)} assume true; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:44,717 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:44,718 INFO L273 TraceCheckUtils]: 54: Hoare triple {8884#(<= main_~i~0 24)} assume true; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:44,718 INFO L273 TraceCheckUtils]: 55: Hoare triple {8884#(<= main_~i~0 24)} assume !(~i~0 < 100000); {8859#false} is VALID [2018-11-14 18:43:44,719 INFO L273 TraceCheckUtils]: 56: Hoare triple {8859#false} havoc ~x~0;~x~0 := 0; {8859#false} is VALID [2018-11-14 18:43:44,719 INFO L273 TraceCheckUtils]: 57: Hoare triple {8859#false} assume true; {8859#false} is VALID [2018-11-14 18:43:44,719 INFO L273 TraceCheckUtils]: 58: Hoare triple {8859#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8859#false} is VALID [2018-11-14 18:43:44,719 INFO L256 TraceCheckUtils]: 59: Hoare triple {8859#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8859#false} is VALID [2018-11-14 18:43:44,719 INFO L273 TraceCheckUtils]: 60: Hoare triple {8859#false} ~cond := #in~cond; {8859#false} is VALID [2018-11-14 18:43:44,720 INFO L273 TraceCheckUtils]: 61: Hoare triple {8859#false} assume ~cond == 0; {8859#false} is VALID [2018-11-14 18:43:44,720 INFO L273 TraceCheckUtils]: 62: Hoare triple {8859#false} assume !false; {8859#false} is VALID [2018-11-14 18:43:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:44,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:44,723 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-14 18:43:44,736 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:43:49,464 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-14 18:43:49,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:49,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:49,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {8858#true} call ULTIMATE.init(); {8858#true} is VALID [2018-11-14 18:43:49,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {8858#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8858#true} is VALID [2018-11-14 18:43:49,724 INFO L273 TraceCheckUtils]: 2: Hoare triple {8858#true} assume true; {8858#true} is VALID [2018-11-14 18:43:49,724 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8858#true} {8858#true} #50#return; {8858#true} is VALID [2018-11-14 18:43:49,725 INFO L256 TraceCheckUtils]: 4: Hoare triple {8858#true} call #t~ret2 := main(); {8858#true} is VALID [2018-11-14 18:43:49,725 INFO L273 TraceCheckUtils]: 5: Hoare triple {8858#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8903#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:49,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {8903#(<= main_~i~0 0)} assume true; {8903#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:49,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {8903#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:49,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {8861#(<= main_~i~0 1)} assume true; {8861#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:49,727 INFO L273 TraceCheckUtils]: 9: Hoare triple {8861#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:49,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {8862#(<= main_~i~0 2)} assume true; {8862#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:49,728 INFO L273 TraceCheckUtils]: 11: Hoare triple {8862#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:49,729 INFO L273 TraceCheckUtils]: 12: Hoare triple {8863#(<= main_~i~0 3)} assume true; {8863#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:49,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {8863#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:49,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {8864#(<= main_~i~0 4)} assume true; {8864#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:49,731 INFO L273 TraceCheckUtils]: 15: Hoare triple {8864#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:49,731 INFO L273 TraceCheckUtils]: 16: Hoare triple {8865#(<= main_~i~0 5)} assume true; {8865#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:49,732 INFO L273 TraceCheckUtils]: 17: Hoare triple {8865#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:49,733 INFO L273 TraceCheckUtils]: 18: Hoare triple {8866#(<= main_~i~0 6)} assume true; {8866#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:49,734 INFO L273 TraceCheckUtils]: 19: Hoare triple {8866#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:49,734 INFO L273 TraceCheckUtils]: 20: Hoare triple {8867#(<= main_~i~0 7)} assume true; {8867#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:49,735 INFO L273 TraceCheckUtils]: 21: Hoare triple {8867#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:49,736 INFO L273 TraceCheckUtils]: 22: Hoare triple {8868#(<= main_~i~0 8)} assume true; {8868#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:49,737 INFO L273 TraceCheckUtils]: 23: Hoare triple {8868#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:49,737 INFO L273 TraceCheckUtils]: 24: Hoare triple {8869#(<= main_~i~0 9)} assume true; {8869#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:49,738 INFO L273 TraceCheckUtils]: 25: Hoare triple {8869#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:49,739 INFO L273 TraceCheckUtils]: 26: Hoare triple {8870#(<= main_~i~0 10)} assume true; {8870#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:49,739 INFO L273 TraceCheckUtils]: 27: Hoare triple {8870#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:49,740 INFO L273 TraceCheckUtils]: 28: Hoare triple {8871#(<= main_~i~0 11)} assume true; {8871#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:49,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {8871#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:49,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {8872#(<= main_~i~0 12)} assume true; {8872#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:49,742 INFO L273 TraceCheckUtils]: 31: Hoare triple {8872#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:49,743 INFO L273 TraceCheckUtils]: 32: Hoare triple {8873#(<= main_~i~0 13)} assume true; {8873#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:49,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {8873#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:49,744 INFO L273 TraceCheckUtils]: 34: Hoare triple {8874#(<= main_~i~0 14)} assume true; {8874#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:49,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {8874#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:49,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {8875#(<= main_~i~0 15)} assume true; {8875#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:49,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {8875#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:49,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {8876#(<= main_~i~0 16)} assume true; {8876#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:49,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {8876#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:49,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {8877#(<= main_~i~0 17)} assume true; {8877#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:49,750 INFO L273 TraceCheckUtils]: 41: Hoare triple {8877#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:49,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {8878#(<= main_~i~0 18)} assume true; {8878#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:49,751 INFO L273 TraceCheckUtils]: 43: Hoare triple {8878#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:49,752 INFO L273 TraceCheckUtils]: 44: Hoare triple {8879#(<= main_~i~0 19)} assume true; {8879#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:49,752 INFO L273 TraceCheckUtils]: 45: Hoare triple {8879#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:49,753 INFO L273 TraceCheckUtils]: 46: Hoare triple {8880#(<= main_~i~0 20)} assume true; {8880#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:49,754 INFO L273 TraceCheckUtils]: 47: Hoare triple {8880#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:49,754 INFO L273 TraceCheckUtils]: 48: Hoare triple {8881#(<= main_~i~0 21)} assume true; {8881#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:49,755 INFO L273 TraceCheckUtils]: 49: Hoare triple {8881#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:49,756 INFO L273 TraceCheckUtils]: 50: Hoare triple {8882#(<= main_~i~0 22)} assume true; {8882#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:49,757 INFO L273 TraceCheckUtils]: 51: Hoare triple {8882#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:49,757 INFO L273 TraceCheckUtils]: 52: Hoare triple {8883#(<= main_~i~0 23)} assume true; {8883#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:49,758 INFO L273 TraceCheckUtils]: 53: Hoare triple {8883#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:49,759 INFO L273 TraceCheckUtils]: 54: Hoare triple {8884#(<= main_~i~0 24)} assume true; {8884#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:49,760 INFO L273 TraceCheckUtils]: 55: Hoare triple {8884#(<= main_~i~0 24)} assume !(~i~0 < 100000); {8859#false} is VALID [2018-11-14 18:43:49,760 INFO L273 TraceCheckUtils]: 56: Hoare triple {8859#false} havoc ~x~0;~x~0 := 0; {8859#false} is VALID [2018-11-14 18:43:49,760 INFO L273 TraceCheckUtils]: 57: Hoare triple {8859#false} assume true; {8859#false} is VALID [2018-11-14 18:43:49,760 INFO L273 TraceCheckUtils]: 58: Hoare triple {8859#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {8859#false} is VALID [2018-11-14 18:43:49,760 INFO L256 TraceCheckUtils]: 59: Hoare triple {8859#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {8859#false} is VALID [2018-11-14 18:43:49,761 INFO L273 TraceCheckUtils]: 60: Hoare triple {8859#false} ~cond := #in~cond; {8859#false} is VALID [2018-11-14 18:43:49,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {8859#false} assume ~cond == 0; {8859#false} is VALID [2018-11-14 18:43:49,761 INFO L273 TraceCheckUtils]: 62: Hoare triple {8859#false} assume !false; {8859#false} is VALID [2018-11-14 18:43:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:49,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:49,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-14 18:43:49,792 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-14 18:43:49,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:49,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-14 18:43:49,856 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-14 18:43:49,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-14 18:43:49,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-14 18:43:49,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:43:49,857 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 28 states. [2018-11-14 18:43:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:50,445 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2018-11-14 18:43:50,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-14 18:43:50,445 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-14 18:43:50,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:50,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:43:50,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2018-11-14 18:43:50,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 18:43:50,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 84 transitions. [2018-11-14 18:43:50,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 84 transitions. [2018-11-14 18:43:50,572 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-14 18:43:50,573 INFO L225 Difference]: With dead ends: 82 [2018-11-14 18:43:50,574 INFO L226 Difference]: Without dead ends: 70 [2018-11-14 18:43:50,574 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-14 18:43:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-14 18:43:50,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-11-14 18:43:50,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:50,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2018-11-14 18:43:50,597 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 18:43:50,598 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 18:43:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:50,600 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-14 18:43:50,600 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 18:43:50,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:50,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:50,600 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2018-11-14 18:43:50,601 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2018-11-14 18:43:50,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:50,602 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-11-14 18:43:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 18:43:50,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:50,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:50,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:50,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:50,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-14 18:43:50,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-11-14 18:43:50,604 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 63 [2018-11-14 18:43:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:50,605 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-11-14 18:43:50,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-14 18:43:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-11-14 18:43:50,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 18:43:50,605 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:50,606 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:50,606 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:50,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:50,606 INFO L82 PathProgramCache]: Analyzing trace with hash 176823870, now seen corresponding path program 25 times [2018-11-14 18:43:50,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:50,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:50,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:51,482 INFO L256 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2018-11-14 18:43:51,483 INFO L273 TraceCheckUtils]: 1: Hoare triple {9435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9435#true} is VALID [2018-11-14 18:43:51,483 INFO L273 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2018-11-14 18:43:51,483 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #50#return; {9435#true} is VALID [2018-11-14 18:43:51,483 INFO L256 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret2 := main(); {9435#true} is VALID [2018-11-14 18:43:51,484 INFO L273 TraceCheckUtils]: 5: Hoare triple {9435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9437#(= main_~i~0 0)} is VALID [2018-11-14 18:43:51,484 INFO L273 TraceCheckUtils]: 6: Hoare triple {9437#(= main_~i~0 0)} assume true; {9437#(= main_~i~0 0)} is VALID [2018-11-14 18:43:51,485 INFO L273 TraceCheckUtils]: 7: Hoare triple {9437#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:51,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {9438#(<= main_~i~0 1)} assume true; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:51,487 INFO L273 TraceCheckUtils]: 9: Hoare triple {9438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:51,487 INFO L273 TraceCheckUtils]: 10: Hoare triple {9439#(<= main_~i~0 2)} assume true; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:51,488 INFO L273 TraceCheckUtils]: 11: Hoare triple {9439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:51,489 INFO L273 TraceCheckUtils]: 12: Hoare triple {9440#(<= main_~i~0 3)} assume true; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:51,490 INFO L273 TraceCheckUtils]: 13: Hoare triple {9440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:51,490 INFO L273 TraceCheckUtils]: 14: Hoare triple {9441#(<= main_~i~0 4)} assume true; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:51,491 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:51,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= main_~i~0 5)} assume true; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:51,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {9442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:51,493 INFO L273 TraceCheckUtils]: 18: Hoare triple {9443#(<= main_~i~0 6)} assume true; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:51,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {9443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:51,495 INFO L273 TraceCheckUtils]: 20: Hoare triple {9444#(<= main_~i~0 7)} assume true; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:51,496 INFO L273 TraceCheckUtils]: 21: Hoare triple {9444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:51,496 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 8)} assume true; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:51,497 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:51,498 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 9)} assume true; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:51,498 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:51,499 INFO L273 TraceCheckUtils]: 26: Hoare triple {9447#(<= main_~i~0 10)} assume true; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:51,500 INFO L273 TraceCheckUtils]: 27: Hoare triple {9447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:51,500 INFO L273 TraceCheckUtils]: 28: Hoare triple {9448#(<= main_~i~0 11)} assume true; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:51,501 INFO L273 TraceCheckUtils]: 29: Hoare triple {9448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:51,502 INFO L273 TraceCheckUtils]: 30: Hoare triple {9449#(<= main_~i~0 12)} assume true; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:51,503 INFO L273 TraceCheckUtils]: 31: Hoare triple {9449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:51,503 INFO L273 TraceCheckUtils]: 32: Hoare triple {9450#(<= main_~i~0 13)} assume true; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:51,504 INFO L273 TraceCheckUtils]: 33: Hoare triple {9450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:51,505 INFO L273 TraceCheckUtils]: 34: Hoare triple {9451#(<= main_~i~0 14)} assume true; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:51,506 INFO L273 TraceCheckUtils]: 35: Hoare triple {9451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:51,506 INFO L273 TraceCheckUtils]: 36: Hoare triple {9452#(<= main_~i~0 15)} assume true; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:51,507 INFO L273 TraceCheckUtils]: 37: Hoare triple {9452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:51,508 INFO L273 TraceCheckUtils]: 38: Hoare triple {9453#(<= main_~i~0 16)} assume true; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:51,509 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:51,509 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#(<= main_~i~0 17)} assume true; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:51,510 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:51,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {9455#(<= main_~i~0 18)} assume true; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:51,511 INFO L273 TraceCheckUtils]: 43: Hoare triple {9455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:51,512 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= main_~i~0 19)} assume true; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:51,513 INFO L273 TraceCheckUtils]: 45: Hoare triple {9456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:51,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {9457#(<= main_~i~0 20)} assume true; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:51,514 INFO L273 TraceCheckUtils]: 47: Hoare triple {9457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:51,515 INFO L273 TraceCheckUtils]: 48: Hoare triple {9458#(<= main_~i~0 21)} assume true; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:51,516 INFO L273 TraceCheckUtils]: 49: Hoare triple {9458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:51,516 INFO L273 TraceCheckUtils]: 50: Hoare triple {9459#(<= main_~i~0 22)} assume true; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:51,517 INFO L273 TraceCheckUtils]: 51: Hoare triple {9459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:51,518 INFO L273 TraceCheckUtils]: 52: Hoare triple {9460#(<= main_~i~0 23)} assume true; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:51,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {9460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:51,519 INFO L273 TraceCheckUtils]: 54: Hoare triple {9461#(<= main_~i~0 24)} assume true; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:51,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {9461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:51,521 INFO L273 TraceCheckUtils]: 56: Hoare triple {9462#(<= main_~i~0 25)} assume true; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:51,521 INFO L273 TraceCheckUtils]: 57: Hoare triple {9462#(<= main_~i~0 25)} assume !(~i~0 < 100000); {9436#false} is VALID [2018-11-14 18:43:51,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {9436#false} havoc ~x~0;~x~0 := 0; {9436#false} is VALID [2018-11-14 18:43:51,522 INFO L273 TraceCheckUtils]: 59: Hoare triple {9436#false} assume true; {9436#false} is VALID [2018-11-14 18:43:51,522 INFO L273 TraceCheckUtils]: 60: Hoare triple {9436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9436#false} is VALID [2018-11-14 18:43:51,522 INFO L256 TraceCheckUtils]: 61: Hoare triple {9436#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9436#false} is VALID [2018-11-14 18:43:51,522 INFO L273 TraceCheckUtils]: 62: Hoare triple {9436#false} ~cond := #in~cond; {9436#false} is VALID [2018-11-14 18:43:51,523 INFO L273 TraceCheckUtils]: 63: Hoare triple {9436#false} assume ~cond == 0; {9436#false} is VALID [2018-11-14 18:43:51,523 INFO L273 TraceCheckUtils]: 64: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2018-11-14 18:43:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:51,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:51,527 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-14 18:43:51,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:51,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:51,601 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:51,817 INFO L256 TraceCheckUtils]: 0: Hoare triple {9435#true} call ULTIMATE.init(); {9435#true} is VALID [2018-11-14 18:43:51,817 INFO L273 TraceCheckUtils]: 1: Hoare triple {9435#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9435#true} is VALID [2018-11-14 18:43:51,817 INFO L273 TraceCheckUtils]: 2: Hoare triple {9435#true} assume true; {9435#true} is VALID [2018-11-14 18:43:51,818 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9435#true} {9435#true} #50#return; {9435#true} is VALID [2018-11-14 18:43:51,818 INFO L256 TraceCheckUtils]: 4: Hoare triple {9435#true} call #t~ret2 := main(); {9435#true} is VALID [2018-11-14 18:43:51,819 INFO L273 TraceCheckUtils]: 5: Hoare triple {9435#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9481#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:51,819 INFO L273 TraceCheckUtils]: 6: Hoare triple {9481#(<= main_~i~0 0)} assume true; {9481#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:51,820 INFO L273 TraceCheckUtils]: 7: Hoare triple {9481#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:51,820 INFO L273 TraceCheckUtils]: 8: Hoare triple {9438#(<= main_~i~0 1)} assume true; {9438#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:51,821 INFO L273 TraceCheckUtils]: 9: Hoare triple {9438#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:51,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {9439#(<= main_~i~0 2)} assume true; {9439#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:51,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {9439#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:51,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {9440#(<= main_~i~0 3)} assume true; {9440#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:51,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {9440#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:51,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {9441#(<= main_~i~0 4)} assume true; {9441#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:51,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {9441#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:51,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {9442#(<= main_~i~0 5)} assume true; {9442#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:51,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {9442#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:51,827 INFO L273 TraceCheckUtils]: 18: Hoare triple {9443#(<= main_~i~0 6)} assume true; {9443#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:51,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {9443#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:51,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {9444#(<= main_~i~0 7)} assume true; {9444#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:51,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {9444#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:51,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {9445#(<= main_~i~0 8)} assume true; {9445#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:51,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {9445#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:51,831 INFO L273 TraceCheckUtils]: 24: Hoare triple {9446#(<= main_~i~0 9)} assume true; {9446#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:51,832 INFO L273 TraceCheckUtils]: 25: Hoare triple {9446#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:51,833 INFO L273 TraceCheckUtils]: 26: Hoare triple {9447#(<= main_~i~0 10)} assume true; {9447#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:51,833 INFO L273 TraceCheckUtils]: 27: Hoare triple {9447#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:51,834 INFO L273 TraceCheckUtils]: 28: Hoare triple {9448#(<= main_~i~0 11)} assume true; {9448#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:51,835 INFO L273 TraceCheckUtils]: 29: Hoare triple {9448#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:51,835 INFO L273 TraceCheckUtils]: 30: Hoare triple {9449#(<= main_~i~0 12)} assume true; {9449#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:51,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {9449#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:51,837 INFO L273 TraceCheckUtils]: 32: Hoare triple {9450#(<= main_~i~0 13)} assume true; {9450#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:51,838 INFO L273 TraceCheckUtils]: 33: Hoare triple {9450#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:51,838 INFO L273 TraceCheckUtils]: 34: Hoare triple {9451#(<= main_~i~0 14)} assume true; {9451#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:51,839 INFO L273 TraceCheckUtils]: 35: Hoare triple {9451#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:51,840 INFO L273 TraceCheckUtils]: 36: Hoare triple {9452#(<= main_~i~0 15)} assume true; {9452#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:51,841 INFO L273 TraceCheckUtils]: 37: Hoare triple {9452#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:51,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {9453#(<= main_~i~0 16)} assume true; {9453#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:51,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {9453#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:51,843 INFO L273 TraceCheckUtils]: 40: Hoare triple {9454#(<= main_~i~0 17)} assume true; {9454#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:51,844 INFO L273 TraceCheckUtils]: 41: Hoare triple {9454#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:51,844 INFO L273 TraceCheckUtils]: 42: Hoare triple {9455#(<= main_~i~0 18)} assume true; {9455#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:51,845 INFO L273 TraceCheckUtils]: 43: Hoare triple {9455#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:51,846 INFO L273 TraceCheckUtils]: 44: Hoare triple {9456#(<= main_~i~0 19)} assume true; {9456#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:51,846 INFO L273 TraceCheckUtils]: 45: Hoare triple {9456#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:51,847 INFO L273 TraceCheckUtils]: 46: Hoare triple {9457#(<= main_~i~0 20)} assume true; {9457#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:51,848 INFO L273 TraceCheckUtils]: 47: Hoare triple {9457#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:51,848 INFO L273 TraceCheckUtils]: 48: Hoare triple {9458#(<= main_~i~0 21)} assume true; {9458#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:51,849 INFO L273 TraceCheckUtils]: 49: Hoare triple {9458#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:51,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {9459#(<= main_~i~0 22)} assume true; {9459#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:51,851 INFO L273 TraceCheckUtils]: 51: Hoare triple {9459#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:51,851 INFO L273 TraceCheckUtils]: 52: Hoare triple {9460#(<= main_~i~0 23)} assume true; {9460#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:51,852 INFO L273 TraceCheckUtils]: 53: Hoare triple {9460#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:51,853 INFO L273 TraceCheckUtils]: 54: Hoare triple {9461#(<= main_~i~0 24)} assume true; {9461#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:51,854 INFO L273 TraceCheckUtils]: 55: Hoare triple {9461#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:51,854 INFO L273 TraceCheckUtils]: 56: Hoare triple {9462#(<= main_~i~0 25)} assume true; {9462#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:51,855 INFO L273 TraceCheckUtils]: 57: Hoare triple {9462#(<= main_~i~0 25)} assume !(~i~0 < 100000); {9436#false} is VALID [2018-11-14 18:43:51,855 INFO L273 TraceCheckUtils]: 58: Hoare triple {9436#false} havoc ~x~0;~x~0 := 0; {9436#false} is VALID [2018-11-14 18:43:51,855 INFO L273 TraceCheckUtils]: 59: Hoare triple {9436#false} assume true; {9436#false} is VALID [2018-11-14 18:43:51,855 INFO L273 TraceCheckUtils]: 60: Hoare triple {9436#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {9436#false} is VALID [2018-11-14 18:43:51,856 INFO L256 TraceCheckUtils]: 61: Hoare triple {9436#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {9436#false} is VALID [2018-11-14 18:43:51,856 INFO L273 TraceCheckUtils]: 62: Hoare triple {9436#false} ~cond := #in~cond; {9436#false} is VALID [2018-11-14 18:43:51,856 INFO L273 TraceCheckUtils]: 63: Hoare triple {9436#false} assume ~cond == 0; {9436#false} is VALID [2018-11-14 18:43:51,856 INFO L273 TraceCheckUtils]: 64: Hoare triple {9436#false} assume !false; {9436#false} is VALID [2018-11-14 18:43:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-14 18:43:51,881 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 18:43:51,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:51,882 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:43:51,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:51,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:43:51,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:43:51,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:43:51,947 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 29 states. [2018-11-14 18:43:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:52,490 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-11-14 18:43:52,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 18:43:52,490 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 18:43:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:43:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 86 transitions. [2018-11-14 18:43:52,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:43:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 86 transitions. [2018-11-14 18:43:52,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 86 transitions. [2018-11-14 18:43:52,570 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:52,571 INFO L225 Difference]: With dead ends: 84 [2018-11-14 18:43:52,572 INFO L226 Difference]: Without dead ends: 72 [2018-11-14 18:43:52,573 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:43:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-14 18:43:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-14 18:43:52,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:52,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-14 18:43:52,598 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 18:43:52,598 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 18:43:52,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:52,599 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-14 18:43:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 18:43:52,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:52,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:52,600 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-14 18:43:52,600 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-14 18:43:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:52,601 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-11-14 18:43:52,601 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 18:43:52,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:52,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:52,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:52,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 18:43:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-11-14 18:43:52,602 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 65 [2018-11-14 18:43:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:52,602 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-11-14 18:43:52,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:43:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-11-14 18:43:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 18:43:52,603 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:52,603 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:52,603 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:52,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:52,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1882892776, now seen corresponding path program 26 times [2018-11-14 18:43:52,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:52,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:52,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:52,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:43:52,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:52,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:53,614 INFO L256 TraceCheckUtils]: 0: Hoare triple {10029#true} call ULTIMATE.init(); {10029#true} is VALID [2018-11-14 18:43:53,615 INFO L273 TraceCheckUtils]: 1: Hoare triple {10029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10029#true} is VALID [2018-11-14 18:43:53,615 INFO L273 TraceCheckUtils]: 2: Hoare triple {10029#true} assume true; {10029#true} is VALID [2018-11-14 18:43:53,615 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10029#true} {10029#true} #50#return; {10029#true} is VALID [2018-11-14 18:43:53,615 INFO L256 TraceCheckUtils]: 4: Hoare triple {10029#true} call #t~ret2 := main(); {10029#true} is VALID [2018-11-14 18:43:53,616 INFO L273 TraceCheckUtils]: 5: Hoare triple {10029#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10031#(= main_~i~0 0)} is VALID [2018-11-14 18:43:53,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {10031#(= main_~i~0 0)} assume true; {10031#(= main_~i~0 0)} is VALID [2018-11-14 18:43:53,617 INFO L273 TraceCheckUtils]: 7: Hoare triple {10031#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:53,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {10032#(<= main_~i~0 1)} assume true; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:53,618 INFO L273 TraceCheckUtils]: 9: Hoare triple {10032#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:53,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {10033#(<= main_~i~0 2)} assume true; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:53,619 INFO L273 TraceCheckUtils]: 11: Hoare triple {10033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:53,620 INFO L273 TraceCheckUtils]: 12: Hoare triple {10034#(<= main_~i~0 3)} assume true; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:53,621 INFO L273 TraceCheckUtils]: 13: Hoare triple {10034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:53,621 INFO L273 TraceCheckUtils]: 14: Hoare triple {10035#(<= main_~i~0 4)} assume true; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:53,622 INFO L273 TraceCheckUtils]: 15: Hoare triple {10035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:53,623 INFO L273 TraceCheckUtils]: 16: Hoare triple {10036#(<= main_~i~0 5)} assume true; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:53,624 INFO L273 TraceCheckUtils]: 17: Hoare triple {10036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:53,624 INFO L273 TraceCheckUtils]: 18: Hoare triple {10037#(<= main_~i~0 6)} assume true; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:53,625 INFO L273 TraceCheckUtils]: 19: Hoare triple {10037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:53,626 INFO L273 TraceCheckUtils]: 20: Hoare triple {10038#(<= main_~i~0 7)} assume true; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:53,627 INFO L273 TraceCheckUtils]: 21: Hoare triple {10038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:53,627 INFO L273 TraceCheckUtils]: 22: Hoare triple {10039#(<= main_~i~0 8)} assume true; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:53,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {10039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:53,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {10040#(<= main_~i~0 9)} assume true; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:53,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {10040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:53,630 INFO L273 TraceCheckUtils]: 26: Hoare triple {10041#(<= main_~i~0 10)} assume true; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:53,631 INFO L273 TraceCheckUtils]: 27: Hoare triple {10041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:53,631 INFO L273 TraceCheckUtils]: 28: Hoare triple {10042#(<= main_~i~0 11)} assume true; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:53,632 INFO L273 TraceCheckUtils]: 29: Hoare triple {10042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:53,633 INFO L273 TraceCheckUtils]: 30: Hoare triple {10043#(<= main_~i~0 12)} assume true; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:53,634 INFO L273 TraceCheckUtils]: 31: Hoare triple {10043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:53,634 INFO L273 TraceCheckUtils]: 32: Hoare triple {10044#(<= main_~i~0 13)} assume true; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:53,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {10044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:53,636 INFO L273 TraceCheckUtils]: 34: Hoare triple {10045#(<= main_~i~0 14)} assume true; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:53,637 INFO L273 TraceCheckUtils]: 35: Hoare triple {10045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:53,637 INFO L273 TraceCheckUtils]: 36: Hoare triple {10046#(<= main_~i~0 15)} assume true; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:53,638 INFO L273 TraceCheckUtils]: 37: Hoare triple {10046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:53,639 INFO L273 TraceCheckUtils]: 38: Hoare triple {10047#(<= main_~i~0 16)} assume true; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:53,639 INFO L273 TraceCheckUtils]: 39: Hoare triple {10047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:53,640 INFO L273 TraceCheckUtils]: 40: Hoare triple {10048#(<= main_~i~0 17)} assume true; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:53,641 INFO L273 TraceCheckUtils]: 41: Hoare triple {10048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:53,641 INFO L273 TraceCheckUtils]: 42: Hoare triple {10049#(<= main_~i~0 18)} assume true; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:53,642 INFO L273 TraceCheckUtils]: 43: Hoare triple {10049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:53,643 INFO L273 TraceCheckUtils]: 44: Hoare triple {10050#(<= main_~i~0 19)} assume true; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:53,644 INFO L273 TraceCheckUtils]: 45: Hoare triple {10050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:53,644 INFO L273 TraceCheckUtils]: 46: Hoare triple {10051#(<= main_~i~0 20)} assume true; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:53,645 INFO L273 TraceCheckUtils]: 47: Hoare triple {10051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:53,646 INFO L273 TraceCheckUtils]: 48: Hoare triple {10052#(<= main_~i~0 21)} assume true; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:53,647 INFO L273 TraceCheckUtils]: 49: Hoare triple {10052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:53,647 INFO L273 TraceCheckUtils]: 50: Hoare triple {10053#(<= main_~i~0 22)} assume true; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:53,648 INFO L273 TraceCheckUtils]: 51: Hoare triple {10053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:53,649 INFO L273 TraceCheckUtils]: 52: Hoare triple {10054#(<= main_~i~0 23)} assume true; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:53,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {10054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:53,650 INFO L273 TraceCheckUtils]: 54: Hoare triple {10055#(<= main_~i~0 24)} assume true; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:53,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {10055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:53,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {10056#(<= main_~i~0 25)} assume true; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:53,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {10056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:53,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {10057#(<= main_~i~0 26)} assume true; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:53,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {10057#(<= main_~i~0 26)} assume !(~i~0 < 100000); {10030#false} is VALID [2018-11-14 18:43:53,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {10030#false} havoc ~x~0;~x~0 := 0; {10030#false} is VALID [2018-11-14 18:43:53,654 INFO L273 TraceCheckUtils]: 61: Hoare triple {10030#false} assume true; {10030#false} is VALID [2018-11-14 18:43:53,654 INFO L273 TraceCheckUtils]: 62: Hoare triple {10030#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10030#false} is VALID [2018-11-14 18:43:53,655 INFO L256 TraceCheckUtils]: 63: Hoare triple {10030#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10030#false} is VALID [2018-11-14 18:43:53,655 INFO L273 TraceCheckUtils]: 64: Hoare triple {10030#false} ~cond := #in~cond; {10030#false} is VALID [2018-11-14 18:43:53,655 INFO L273 TraceCheckUtils]: 65: Hoare triple {10030#false} assume ~cond == 0; {10030#false} is VALID [2018-11-14 18:43:53,655 INFO L273 TraceCheckUtils]: 66: Hoare triple {10030#false} assume !false; {10030#false} is VALID [2018-11-14 18:43:53,658 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:53,659 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:53,659 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-14 18:43:53,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:43:53,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:43:53,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:53,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:53,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:53,916 INFO L256 TraceCheckUtils]: 0: Hoare triple {10029#true} call ULTIMATE.init(); {10029#true} is VALID [2018-11-14 18:43:53,916 INFO L273 TraceCheckUtils]: 1: Hoare triple {10029#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10029#true} is VALID [2018-11-14 18:43:53,916 INFO L273 TraceCheckUtils]: 2: Hoare triple {10029#true} assume true; {10029#true} is VALID [2018-11-14 18:43:53,917 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10029#true} {10029#true} #50#return; {10029#true} is VALID [2018-11-14 18:43:53,917 INFO L256 TraceCheckUtils]: 4: Hoare triple {10029#true} call #t~ret2 := main(); {10029#true} is VALID [2018-11-14 18:43:53,918 INFO L273 TraceCheckUtils]: 5: Hoare triple {10029#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10076#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:53,918 INFO L273 TraceCheckUtils]: 6: Hoare triple {10076#(<= main_~i~0 0)} assume true; {10076#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:53,919 INFO L273 TraceCheckUtils]: 7: Hoare triple {10076#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:53,919 INFO L273 TraceCheckUtils]: 8: Hoare triple {10032#(<= main_~i~0 1)} assume true; {10032#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:53,920 INFO L273 TraceCheckUtils]: 9: Hoare triple {10032#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:53,920 INFO L273 TraceCheckUtils]: 10: Hoare triple {10033#(<= main_~i~0 2)} assume true; {10033#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:53,921 INFO L273 TraceCheckUtils]: 11: Hoare triple {10033#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:53,921 INFO L273 TraceCheckUtils]: 12: Hoare triple {10034#(<= main_~i~0 3)} assume true; {10034#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:53,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {10034#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:53,923 INFO L273 TraceCheckUtils]: 14: Hoare triple {10035#(<= main_~i~0 4)} assume true; {10035#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:53,924 INFO L273 TraceCheckUtils]: 15: Hoare triple {10035#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:53,924 INFO L273 TraceCheckUtils]: 16: Hoare triple {10036#(<= main_~i~0 5)} assume true; {10036#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:53,925 INFO L273 TraceCheckUtils]: 17: Hoare triple {10036#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:53,926 INFO L273 TraceCheckUtils]: 18: Hoare triple {10037#(<= main_~i~0 6)} assume true; {10037#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:53,927 INFO L273 TraceCheckUtils]: 19: Hoare triple {10037#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:53,927 INFO L273 TraceCheckUtils]: 20: Hoare triple {10038#(<= main_~i~0 7)} assume true; {10038#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:53,928 INFO L273 TraceCheckUtils]: 21: Hoare triple {10038#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:53,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {10039#(<= main_~i~0 8)} assume true; {10039#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:53,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {10039#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:53,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {10040#(<= main_~i~0 9)} assume true; {10040#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:53,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {10040#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:53,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {10041#(<= main_~i~0 10)} assume true; {10041#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:53,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {10041#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:53,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {10042#(<= main_~i~0 11)} assume true; {10042#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:53,934 INFO L273 TraceCheckUtils]: 29: Hoare triple {10042#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:53,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {10043#(<= main_~i~0 12)} assume true; {10043#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:53,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {10043#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:53,936 INFO L273 TraceCheckUtils]: 32: Hoare triple {10044#(<= main_~i~0 13)} assume true; {10044#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:53,937 INFO L273 TraceCheckUtils]: 33: Hoare triple {10044#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:53,937 INFO L273 TraceCheckUtils]: 34: Hoare triple {10045#(<= main_~i~0 14)} assume true; {10045#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:53,938 INFO L273 TraceCheckUtils]: 35: Hoare triple {10045#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:53,939 INFO L273 TraceCheckUtils]: 36: Hoare triple {10046#(<= main_~i~0 15)} assume true; {10046#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:53,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {10046#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:53,940 INFO L273 TraceCheckUtils]: 38: Hoare triple {10047#(<= main_~i~0 16)} assume true; {10047#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:53,941 INFO L273 TraceCheckUtils]: 39: Hoare triple {10047#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:53,942 INFO L273 TraceCheckUtils]: 40: Hoare triple {10048#(<= main_~i~0 17)} assume true; {10048#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:53,943 INFO L273 TraceCheckUtils]: 41: Hoare triple {10048#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:53,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {10049#(<= main_~i~0 18)} assume true; {10049#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:53,944 INFO L273 TraceCheckUtils]: 43: Hoare triple {10049#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:53,945 INFO L273 TraceCheckUtils]: 44: Hoare triple {10050#(<= main_~i~0 19)} assume true; {10050#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:53,946 INFO L273 TraceCheckUtils]: 45: Hoare triple {10050#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:53,946 INFO L273 TraceCheckUtils]: 46: Hoare triple {10051#(<= main_~i~0 20)} assume true; {10051#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:53,947 INFO L273 TraceCheckUtils]: 47: Hoare triple {10051#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:53,948 INFO L273 TraceCheckUtils]: 48: Hoare triple {10052#(<= main_~i~0 21)} assume true; {10052#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:53,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {10052#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:53,949 INFO L273 TraceCheckUtils]: 50: Hoare triple {10053#(<= main_~i~0 22)} assume true; {10053#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:53,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {10053#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:53,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {10054#(<= main_~i~0 23)} assume true; {10054#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:53,951 INFO L273 TraceCheckUtils]: 53: Hoare triple {10054#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:53,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {10055#(<= main_~i~0 24)} assume true; {10055#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:53,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {10055#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:53,954 INFO L273 TraceCheckUtils]: 56: Hoare triple {10056#(<= main_~i~0 25)} assume true; {10056#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:53,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {10056#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:53,955 INFO L273 TraceCheckUtils]: 58: Hoare triple {10057#(<= main_~i~0 26)} assume true; {10057#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:53,956 INFO L273 TraceCheckUtils]: 59: Hoare triple {10057#(<= main_~i~0 26)} assume !(~i~0 < 100000); {10030#false} is VALID [2018-11-14 18:43:53,956 INFO L273 TraceCheckUtils]: 60: Hoare triple {10030#false} havoc ~x~0;~x~0 := 0; {10030#false} is VALID [2018-11-14 18:43:53,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {10030#false} assume true; {10030#false} is VALID [2018-11-14 18:43:53,956 INFO L273 TraceCheckUtils]: 62: Hoare triple {10030#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10030#false} is VALID [2018-11-14 18:43:53,957 INFO L256 TraceCheckUtils]: 63: Hoare triple {10030#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10030#false} is VALID [2018-11-14 18:43:53,957 INFO L273 TraceCheckUtils]: 64: Hoare triple {10030#false} ~cond := #in~cond; {10030#false} is VALID [2018-11-14 18:43:53,957 INFO L273 TraceCheckUtils]: 65: Hoare triple {10030#false} assume ~cond == 0; {10030#false} is VALID [2018-11-14 18:43:53,957 INFO L273 TraceCheckUtils]: 66: Hoare triple {10030#false} assume !false; {10030#false} is VALID [2018-11-14 18:43:53,962 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:53,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:53,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-14 18:43:53,983 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-14 18:43:53,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:53,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-14 18:43:54,049 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:54,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-14 18:43:54,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-14 18:43:54,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:43:54,051 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 30 states. [2018-11-14 18:43:54,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:54,321 INFO L93 Difference]: Finished difference Result 86 states and 88 transitions. [2018-11-14 18:43:54,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-14 18:43:54,322 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2018-11-14 18:43:54,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:43:54,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:43:54,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 88 transitions. [2018-11-14 18:43:54,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 18:43:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 88 transitions. [2018-11-14 18:43:54,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 88 transitions. [2018-11-14 18:43:54,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:43:54,412 INFO L225 Difference]: With dead ends: 86 [2018-11-14 18:43:54,412 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 18:43:54,413 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-14 18:43:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 18:43:54,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-14 18:43:54,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:43:54,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-14 18:43:54,440 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 18:43:54,440 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 18:43:54,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:54,442 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-14 18:43:54,442 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 18:43:54,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:54,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:54,443 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 18:43:54,443 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 18:43:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:43:54,444 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-11-14 18:43:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 18:43:54,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:43:54,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:43:54,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:43:54,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:43:54,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:43:54,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-11-14 18:43:54,446 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 67 [2018-11-14 18:43:54,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:43:54,446 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-11-14 18:43:54,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-14 18:43:54,447 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-11-14 18:43:54,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 18:43:54,447 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:43:54,447 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:43:54,448 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:43:54,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:43:54,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1290666126, now seen corresponding path program 27 times [2018-11-14 18:43:54,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:43:54,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:43:54,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:54,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:43:54,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:43:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:55,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {10640#true} call ULTIMATE.init(); {10640#true} is VALID [2018-11-14 18:43:55,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {10640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10640#true} is VALID [2018-11-14 18:43:55,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {10640#true} assume true; {10640#true} is VALID [2018-11-14 18:43:55,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10640#true} {10640#true} #50#return; {10640#true} is VALID [2018-11-14 18:43:55,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {10640#true} call #t~ret2 := main(); {10640#true} is VALID [2018-11-14 18:43:55,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {10640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10642#(= main_~i~0 0)} is VALID [2018-11-14 18:43:55,017 INFO L273 TraceCheckUtils]: 6: Hoare triple {10642#(= main_~i~0 0)} assume true; {10642#(= main_~i~0 0)} is VALID [2018-11-14 18:43:55,018 INFO L273 TraceCheckUtils]: 7: Hoare triple {10642#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:55,018 INFO L273 TraceCheckUtils]: 8: Hoare triple {10643#(<= main_~i~0 1)} assume true; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:55,019 INFO L273 TraceCheckUtils]: 9: Hoare triple {10643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:55,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {10644#(<= main_~i~0 2)} assume true; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:55,021 INFO L273 TraceCheckUtils]: 11: Hoare triple {10644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:55,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {10645#(<= main_~i~0 3)} assume true; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:55,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {10645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:55,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {10646#(<= main_~i~0 4)} assume true; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:55,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {10646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:55,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {10647#(<= main_~i~0 5)} assume true; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:55,025 INFO L273 TraceCheckUtils]: 17: Hoare triple {10647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:55,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {10648#(<= main_~i~0 6)} assume true; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:55,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {10648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:55,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {10649#(<= main_~i~0 7)} assume true; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:55,028 INFO L273 TraceCheckUtils]: 21: Hoare triple {10649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:55,029 INFO L273 TraceCheckUtils]: 22: Hoare triple {10650#(<= main_~i~0 8)} assume true; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:55,029 INFO L273 TraceCheckUtils]: 23: Hoare triple {10650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:55,030 INFO L273 TraceCheckUtils]: 24: Hoare triple {10651#(<= main_~i~0 9)} assume true; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:55,031 INFO L273 TraceCheckUtils]: 25: Hoare triple {10651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:55,031 INFO L273 TraceCheckUtils]: 26: Hoare triple {10652#(<= main_~i~0 10)} assume true; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:55,032 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:55,033 INFO L273 TraceCheckUtils]: 28: Hoare triple {10653#(<= main_~i~0 11)} assume true; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:55,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {10653#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:55,034 INFO L273 TraceCheckUtils]: 30: Hoare triple {10654#(<= main_~i~0 12)} assume true; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:55,035 INFO L273 TraceCheckUtils]: 31: Hoare triple {10654#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:55,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {10655#(<= main_~i~0 13)} assume true; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:55,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {10655#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:55,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {10656#(<= main_~i~0 14)} assume true; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:55,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {10656#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:55,039 INFO L273 TraceCheckUtils]: 36: Hoare triple {10657#(<= main_~i~0 15)} assume true; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:55,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {10657#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:55,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {10658#(<= main_~i~0 16)} assume true; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:55,041 INFO L273 TraceCheckUtils]: 39: Hoare triple {10658#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:55,042 INFO L273 TraceCheckUtils]: 40: Hoare triple {10659#(<= main_~i~0 17)} assume true; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:55,042 INFO L273 TraceCheckUtils]: 41: Hoare triple {10659#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:55,043 INFO L273 TraceCheckUtils]: 42: Hoare triple {10660#(<= main_~i~0 18)} assume true; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:55,044 INFO L273 TraceCheckUtils]: 43: Hoare triple {10660#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:55,044 INFO L273 TraceCheckUtils]: 44: Hoare triple {10661#(<= main_~i~0 19)} assume true; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:55,045 INFO L273 TraceCheckUtils]: 45: Hoare triple {10661#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:55,046 INFO L273 TraceCheckUtils]: 46: Hoare triple {10662#(<= main_~i~0 20)} assume true; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:55,047 INFO L273 TraceCheckUtils]: 47: Hoare triple {10662#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:55,047 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#(<= main_~i~0 21)} assume true; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:55,048 INFO L273 TraceCheckUtils]: 49: Hoare triple {10663#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:55,049 INFO L273 TraceCheckUtils]: 50: Hoare triple {10664#(<= main_~i~0 22)} assume true; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:55,050 INFO L273 TraceCheckUtils]: 51: Hoare triple {10664#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:55,050 INFO L273 TraceCheckUtils]: 52: Hoare triple {10665#(<= main_~i~0 23)} assume true; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:55,051 INFO L273 TraceCheckUtils]: 53: Hoare triple {10665#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:55,052 INFO L273 TraceCheckUtils]: 54: Hoare triple {10666#(<= main_~i~0 24)} assume true; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:55,053 INFO L273 TraceCheckUtils]: 55: Hoare triple {10666#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:55,053 INFO L273 TraceCheckUtils]: 56: Hoare triple {10667#(<= main_~i~0 25)} assume true; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:55,054 INFO L273 TraceCheckUtils]: 57: Hoare triple {10667#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:55,055 INFO L273 TraceCheckUtils]: 58: Hoare triple {10668#(<= main_~i~0 26)} assume true; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:55,055 INFO L273 TraceCheckUtils]: 59: Hoare triple {10668#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 18:43:55,056 INFO L273 TraceCheckUtils]: 60: Hoare triple {10669#(<= main_~i~0 27)} assume true; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 18:43:55,057 INFO L273 TraceCheckUtils]: 61: Hoare triple {10669#(<= main_~i~0 27)} assume !(~i~0 < 100000); {10641#false} is VALID [2018-11-14 18:43:55,057 INFO L273 TraceCheckUtils]: 62: Hoare triple {10641#false} havoc ~x~0;~x~0 := 0; {10641#false} is VALID [2018-11-14 18:43:55,057 INFO L273 TraceCheckUtils]: 63: Hoare triple {10641#false} assume true; {10641#false} is VALID [2018-11-14 18:43:55,057 INFO L273 TraceCheckUtils]: 64: Hoare triple {10641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10641#false} is VALID [2018-11-14 18:43:55,057 INFO L256 TraceCheckUtils]: 65: Hoare triple {10641#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10641#false} is VALID [2018-11-14 18:43:55,058 INFO L273 TraceCheckUtils]: 66: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2018-11-14 18:43:55,058 INFO L273 TraceCheckUtils]: 67: Hoare triple {10641#false} assume ~cond == 0; {10641#false} is VALID [2018-11-14 18:43:55,058 INFO L273 TraceCheckUtils]: 68: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2018-11-14 18:43:55,062 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:55,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:43:55,062 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-14 18:43:55,073 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:43:59,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-14 18:43:59,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:43:59,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:43:59,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:43:59,834 INFO L256 TraceCheckUtils]: 0: Hoare triple {10640#true} call ULTIMATE.init(); {10640#true} is VALID [2018-11-14 18:43:59,834 INFO L273 TraceCheckUtils]: 1: Hoare triple {10640#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10640#true} is VALID [2018-11-14 18:43:59,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {10640#true} assume true; {10640#true} is VALID [2018-11-14 18:43:59,834 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10640#true} {10640#true} #50#return; {10640#true} is VALID [2018-11-14 18:43:59,835 INFO L256 TraceCheckUtils]: 4: Hoare triple {10640#true} call #t~ret2 := main(); {10640#true} is VALID [2018-11-14 18:43:59,835 INFO L273 TraceCheckUtils]: 5: Hoare triple {10640#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10688#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:59,836 INFO L273 TraceCheckUtils]: 6: Hoare triple {10688#(<= main_~i~0 0)} assume true; {10688#(<= main_~i~0 0)} is VALID [2018-11-14 18:43:59,837 INFO L273 TraceCheckUtils]: 7: Hoare triple {10688#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:59,837 INFO L273 TraceCheckUtils]: 8: Hoare triple {10643#(<= main_~i~0 1)} assume true; {10643#(<= main_~i~0 1)} is VALID [2018-11-14 18:43:59,837 INFO L273 TraceCheckUtils]: 9: Hoare triple {10643#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:59,838 INFO L273 TraceCheckUtils]: 10: Hoare triple {10644#(<= main_~i~0 2)} assume true; {10644#(<= main_~i~0 2)} is VALID [2018-11-14 18:43:59,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {10644#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:59,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {10645#(<= main_~i~0 3)} assume true; {10645#(<= main_~i~0 3)} is VALID [2018-11-14 18:43:59,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {10645#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:59,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {10646#(<= main_~i~0 4)} assume true; {10646#(<= main_~i~0 4)} is VALID [2018-11-14 18:43:59,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {10646#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:59,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {10647#(<= main_~i~0 5)} assume true; {10647#(<= main_~i~0 5)} is VALID [2018-11-14 18:43:59,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {10647#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:59,843 INFO L273 TraceCheckUtils]: 18: Hoare triple {10648#(<= main_~i~0 6)} assume true; {10648#(<= main_~i~0 6)} is VALID [2018-11-14 18:43:59,844 INFO L273 TraceCheckUtils]: 19: Hoare triple {10648#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:59,844 INFO L273 TraceCheckUtils]: 20: Hoare triple {10649#(<= main_~i~0 7)} assume true; {10649#(<= main_~i~0 7)} is VALID [2018-11-14 18:43:59,845 INFO L273 TraceCheckUtils]: 21: Hoare triple {10649#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:59,846 INFO L273 TraceCheckUtils]: 22: Hoare triple {10650#(<= main_~i~0 8)} assume true; {10650#(<= main_~i~0 8)} is VALID [2018-11-14 18:43:59,847 INFO L273 TraceCheckUtils]: 23: Hoare triple {10650#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:59,847 INFO L273 TraceCheckUtils]: 24: Hoare triple {10651#(<= main_~i~0 9)} assume true; {10651#(<= main_~i~0 9)} is VALID [2018-11-14 18:43:59,848 INFO L273 TraceCheckUtils]: 25: Hoare triple {10651#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:59,849 INFO L273 TraceCheckUtils]: 26: Hoare triple {10652#(<= main_~i~0 10)} assume true; {10652#(<= main_~i~0 10)} is VALID [2018-11-14 18:43:59,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {10652#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:59,850 INFO L273 TraceCheckUtils]: 28: Hoare triple {10653#(<= main_~i~0 11)} assume true; {10653#(<= main_~i~0 11)} is VALID [2018-11-14 18:43:59,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {10653#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:59,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {10654#(<= main_~i~0 12)} assume true; {10654#(<= main_~i~0 12)} is VALID [2018-11-14 18:43:59,852 INFO L273 TraceCheckUtils]: 31: Hoare triple {10654#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:59,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {10655#(<= main_~i~0 13)} assume true; {10655#(<= main_~i~0 13)} is VALID [2018-11-14 18:43:59,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {10655#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:59,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {10656#(<= main_~i~0 14)} assume true; {10656#(<= main_~i~0 14)} is VALID [2018-11-14 18:43:59,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {10656#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:59,856 INFO L273 TraceCheckUtils]: 36: Hoare triple {10657#(<= main_~i~0 15)} assume true; {10657#(<= main_~i~0 15)} is VALID [2018-11-14 18:43:59,857 INFO L273 TraceCheckUtils]: 37: Hoare triple {10657#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:59,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {10658#(<= main_~i~0 16)} assume true; {10658#(<= main_~i~0 16)} is VALID [2018-11-14 18:43:59,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {10658#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:59,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {10659#(<= main_~i~0 17)} assume true; {10659#(<= main_~i~0 17)} is VALID [2018-11-14 18:43:59,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {10659#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:59,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {10660#(<= main_~i~0 18)} assume true; {10660#(<= main_~i~0 18)} is VALID [2018-11-14 18:43:59,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {10660#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:59,862 INFO L273 TraceCheckUtils]: 44: Hoare triple {10661#(<= main_~i~0 19)} assume true; {10661#(<= main_~i~0 19)} is VALID [2018-11-14 18:43:59,863 INFO L273 TraceCheckUtils]: 45: Hoare triple {10661#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:59,863 INFO L273 TraceCheckUtils]: 46: Hoare triple {10662#(<= main_~i~0 20)} assume true; {10662#(<= main_~i~0 20)} is VALID [2018-11-14 18:43:59,864 INFO L273 TraceCheckUtils]: 47: Hoare triple {10662#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:59,865 INFO L273 TraceCheckUtils]: 48: Hoare triple {10663#(<= main_~i~0 21)} assume true; {10663#(<= main_~i~0 21)} is VALID [2018-11-14 18:43:59,866 INFO L273 TraceCheckUtils]: 49: Hoare triple {10663#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:59,866 INFO L273 TraceCheckUtils]: 50: Hoare triple {10664#(<= main_~i~0 22)} assume true; {10664#(<= main_~i~0 22)} is VALID [2018-11-14 18:43:59,867 INFO L273 TraceCheckUtils]: 51: Hoare triple {10664#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:59,868 INFO L273 TraceCheckUtils]: 52: Hoare triple {10665#(<= main_~i~0 23)} assume true; {10665#(<= main_~i~0 23)} is VALID [2018-11-14 18:43:59,869 INFO L273 TraceCheckUtils]: 53: Hoare triple {10665#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:59,869 INFO L273 TraceCheckUtils]: 54: Hoare triple {10666#(<= main_~i~0 24)} assume true; {10666#(<= main_~i~0 24)} is VALID [2018-11-14 18:43:59,870 INFO L273 TraceCheckUtils]: 55: Hoare triple {10666#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:59,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {10667#(<= main_~i~0 25)} assume true; {10667#(<= main_~i~0 25)} is VALID [2018-11-14 18:43:59,871 INFO L273 TraceCheckUtils]: 57: Hoare triple {10667#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:59,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {10668#(<= main_~i~0 26)} assume true; {10668#(<= main_~i~0 26)} is VALID [2018-11-14 18:43:59,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {10668#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 18:43:59,874 INFO L273 TraceCheckUtils]: 60: Hoare triple {10669#(<= main_~i~0 27)} assume true; {10669#(<= main_~i~0 27)} is VALID [2018-11-14 18:43:59,874 INFO L273 TraceCheckUtils]: 61: Hoare triple {10669#(<= main_~i~0 27)} assume !(~i~0 < 100000); {10641#false} is VALID [2018-11-14 18:43:59,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {10641#false} havoc ~x~0;~x~0 := 0; {10641#false} is VALID [2018-11-14 18:43:59,875 INFO L273 TraceCheckUtils]: 63: Hoare triple {10641#false} assume true; {10641#false} is VALID [2018-11-14 18:43:59,875 INFO L273 TraceCheckUtils]: 64: Hoare triple {10641#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {10641#false} is VALID [2018-11-14 18:43:59,875 INFO L256 TraceCheckUtils]: 65: Hoare triple {10641#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {10641#false} is VALID [2018-11-14 18:43:59,875 INFO L273 TraceCheckUtils]: 66: Hoare triple {10641#false} ~cond := #in~cond; {10641#false} is VALID [2018-11-14 18:43:59,875 INFO L273 TraceCheckUtils]: 67: Hoare triple {10641#false} assume ~cond == 0; {10641#false} is VALID [2018-11-14 18:43:59,876 INFO L273 TraceCheckUtils]: 68: Hoare triple {10641#false} assume !false; {10641#false} is VALID [2018-11-14 18:43:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:43:59,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:43:59,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-14 18:43:59,903 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-11-14 18:43:59,903 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:43:59,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-14 18:43:59,987 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-14 18:43:59,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-14 18:43:59,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-14 18:43:59,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:43:59,989 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 31 states. [2018-11-14 18:44:00,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:00,724 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2018-11-14 18:44:00,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-14 18:44:00,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 69 [2018-11-14 18:44:00,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:44:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2018-11-14 18:44:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 18:44:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 90 transitions. [2018-11-14 18:44:00,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 90 transitions. [2018-11-14 18:44:00,808 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-14 18:44:00,810 INFO L225 Difference]: With dead ends: 88 [2018-11-14 18:44:00,810 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 18:44:00,811 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-14 18:44:00,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 18:44:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-14 18:44:00,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:00,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-14 18:44:00,849 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 18:44:00,849 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 18:44:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:00,851 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-14 18:44:00,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 18:44:00,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:00,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:00,851 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-14 18:44:00,852 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-14 18:44:00,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:00,853 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-11-14 18:44:00,853 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 18:44:00,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:00,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:00,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:00,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-14 18:44:00,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-11-14 18:44:00,854 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 69 [2018-11-14 18:44:00,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:00,855 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-11-14 18:44:00,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-14 18:44:00,855 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-11-14 18:44:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-14 18:44:00,855 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:00,856 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:00,856 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:00,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:00,856 INFO L82 PathProgramCache]: Analyzing trace with hash 903461452, now seen corresponding path program 28 times [2018-11-14 18:44:00,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:00,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:00,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:00,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:01,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {11268#true} call ULTIMATE.init(); {11268#true} is VALID [2018-11-14 18:44:01,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {11268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11268#true} is VALID [2018-11-14 18:44:01,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {11268#true} assume true; {11268#true} is VALID [2018-11-14 18:44:01,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11268#true} {11268#true} #50#return; {11268#true} is VALID [2018-11-14 18:44:01,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {11268#true} call #t~ret2 := main(); {11268#true} is VALID [2018-11-14 18:44:01,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {11268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11270#(= main_~i~0 0)} is VALID [2018-11-14 18:44:01,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {11270#(= main_~i~0 0)} assume true; {11270#(= main_~i~0 0)} is VALID [2018-11-14 18:44:01,377 INFO L273 TraceCheckUtils]: 7: Hoare triple {11270#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:01,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {11271#(<= main_~i~0 1)} assume true; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:01,378 INFO L273 TraceCheckUtils]: 9: Hoare triple {11271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:01,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {11272#(<= main_~i~0 2)} assume true; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:01,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {11272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:01,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {11273#(<= main_~i~0 3)} assume true; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:01,381 INFO L273 TraceCheckUtils]: 13: Hoare triple {11273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:01,381 INFO L273 TraceCheckUtils]: 14: Hoare triple {11274#(<= main_~i~0 4)} assume true; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:01,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {11274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:01,383 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 5)} assume true; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:01,384 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:01,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 6)} assume true; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:01,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:01,386 INFO L273 TraceCheckUtils]: 20: Hoare triple {11277#(<= main_~i~0 7)} assume true; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:01,387 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:01,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {11278#(<= main_~i~0 8)} assume true; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:01,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {11278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:01,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {11279#(<= main_~i~0 9)} assume true; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:01,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {11279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:01,390 INFO L273 TraceCheckUtils]: 26: Hoare triple {11280#(<= main_~i~0 10)} assume true; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:01,391 INFO L273 TraceCheckUtils]: 27: Hoare triple {11280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:01,392 INFO L273 TraceCheckUtils]: 28: Hoare triple {11281#(<= main_~i~0 11)} assume true; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:01,392 INFO L273 TraceCheckUtils]: 29: Hoare triple {11281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:01,393 INFO L273 TraceCheckUtils]: 30: Hoare triple {11282#(<= main_~i~0 12)} assume true; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:01,394 INFO L273 TraceCheckUtils]: 31: Hoare triple {11282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:01,394 INFO L273 TraceCheckUtils]: 32: Hoare triple {11283#(<= main_~i~0 13)} assume true; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:01,395 INFO L273 TraceCheckUtils]: 33: Hoare triple {11283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:01,396 INFO L273 TraceCheckUtils]: 34: Hoare triple {11284#(<= main_~i~0 14)} assume true; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:01,397 INFO L273 TraceCheckUtils]: 35: Hoare triple {11284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:01,397 INFO L273 TraceCheckUtils]: 36: Hoare triple {11285#(<= main_~i~0 15)} assume true; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:01,398 INFO L273 TraceCheckUtils]: 37: Hoare triple {11285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:01,399 INFO L273 TraceCheckUtils]: 38: Hoare triple {11286#(<= main_~i~0 16)} assume true; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:01,400 INFO L273 TraceCheckUtils]: 39: Hoare triple {11286#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:01,400 INFO L273 TraceCheckUtils]: 40: Hoare triple {11287#(<= main_~i~0 17)} assume true; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:01,401 INFO L273 TraceCheckUtils]: 41: Hoare triple {11287#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:01,402 INFO L273 TraceCheckUtils]: 42: Hoare triple {11288#(<= main_~i~0 18)} assume true; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:01,403 INFO L273 TraceCheckUtils]: 43: Hoare triple {11288#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:01,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {11289#(<= main_~i~0 19)} assume true; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:01,404 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:01,405 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 20)} assume true; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:01,406 INFO L273 TraceCheckUtils]: 47: Hoare triple {11290#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:01,406 INFO L273 TraceCheckUtils]: 48: Hoare triple {11291#(<= main_~i~0 21)} assume true; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:01,407 INFO L273 TraceCheckUtils]: 49: Hoare triple {11291#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:01,407 INFO L273 TraceCheckUtils]: 50: Hoare triple {11292#(<= main_~i~0 22)} assume true; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:01,408 INFO L273 TraceCheckUtils]: 51: Hoare triple {11292#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:01,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {11293#(<= main_~i~0 23)} assume true; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:01,410 INFO L273 TraceCheckUtils]: 53: Hoare triple {11293#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:01,410 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 24)} assume true; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:01,411 INFO L273 TraceCheckUtils]: 55: Hoare triple {11294#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:01,412 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 25)} assume true; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:01,413 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:01,413 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 26)} assume true; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:01,414 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:01,415 INFO L273 TraceCheckUtils]: 60: Hoare triple {11297#(<= main_~i~0 27)} assume true; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:01,416 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:01,416 INFO L273 TraceCheckUtils]: 62: Hoare triple {11298#(<= main_~i~0 28)} assume true; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:01,417 INFO L273 TraceCheckUtils]: 63: Hoare triple {11298#(<= main_~i~0 28)} assume !(~i~0 < 100000); {11269#false} is VALID [2018-11-14 18:44:01,417 INFO L273 TraceCheckUtils]: 64: Hoare triple {11269#false} havoc ~x~0;~x~0 := 0; {11269#false} is VALID [2018-11-14 18:44:01,417 INFO L273 TraceCheckUtils]: 65: Hoare triple {11269#false} assume true; {11269#false} is VALID [2018-11-14 18:44:01,418 INFO L273 TraceCheckUtils]: 66: Hoare triple {11269#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11269#false} is VALID [2018-11-14 18:44:01,418 INFO L256 TraceCheckUtils]: 67: Hoare triple {11269#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11269#false} is VALID [2018-11-14 18:44:01,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {11269#false} ~cond := #in~cond; {11269#false} is VALID [2018-11-14 18:44:01,418 INFO L273 TraceCheckUtils]: 69: Hoare triple {11269#false} assume ~cond == 0; {11269#false} is VALID [2018-11-14 18:44:01,418 INFO L273 TraceCheckUtils]: 70: Hoare triple {11269#false} assume !false; {11269#false} is VALID [2018-11-14 18:44:01,423 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:01,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:01,423 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-14 18:44:01,434 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:44:01,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:44:01,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:01,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:01,696 INFO L256 TraceCheckUtils]: 0: Hoare triple {11268#true} call ULTIMATE.init(); {11268#true} is VALID [2018-11-14 18:44:01,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {11268#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11268#true} is VALID [2018-11-14 18:44:01,697 INFO L273 TraceCheckUtils]: 2: Hoare triple {11268#true} assume true; {11268#true} is VALID [2018-11-14 18:44:01,697 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11268#true} {11268#true} #50#return; {11268#true} is VALID [2018-11-14 18:44:01,697 INFO L256 TraceCheckUtils]: 4: Hoare triple {11268#true} call #t~ret2 := main(); {11268#true} is VALID [2018-11-14 18:44:01,698 INFO L273 TraceCheckUtils]: 5: Hoare triple {11268#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11317#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:01,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {11317#(<= main_~i~0 0)} assume true; {11317#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:01,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {11317#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:01,699 INFO L273 TraceCheckUtils]: 8: Hoare triple {11271#(<= main_~i~0 1)} assume true; {11271#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:01,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {11271#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:01,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {11272#(<= main_~i~0 2)} assume true; {11272#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:01,701 INFO L273 TraceCheckUtils]: 11: Hoare triple {11272#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:01,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {11273#(<= main_~i~0 3)} assume true; {11273#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:01,702 INFO L273 TraceCheckUtils]: 13: Hoare triple {11273#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:01,703 INFO L273 TraceCheckUtils]: 14: Hoare triple {11274#(<= main_~i~0 4)} assume true; {11274#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:01,703 INFO L273 TraceCheckUtils]: 15: Hoare triple {11274#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:01,704 INFO L273 TraceCheckUtils]: 16: Hoare triple {11275#(<= main_~i~0 5)} assume true; {11275#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:01,705 INFO L273 TraceCheckUtils]: 17: Hoare triple {11275#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:01,705 INFO L273 TraceCheckUtils]: 18: Hoare triple {11276#(<= main_~i~0 6)} assume true; {11276#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:01,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {11276#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:01,707 INFO L273 TraceCheckUtils]: 20: Hoare triple {11277#(<= main_~i~0 7)} assume true; {11277#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:01,711 INFO L273 TraceCheckUtils]: 21: Hoare triple {11277#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:01,711 INFO L273 TraceCheckUtils]: 22: Hoare triple {11278#(<= main_~i~0 8)} assume true; {11278#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:01,712 INFO L273 TraceCheckUtils]: 23: Hoare triple {11278#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:01,712 INFO L273 TraceCheckUtils]: 24: Hoare triple {11279#(<= main_~i~0 9)} assume true; {11279#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:01,713 INFO L273 TraceCheckUtils]: 25: Hoare triple {11279#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:01,713 INFO L273 TraceCheckUtils]: 26: Hoare triple {11280#(<= main_~i~0 10)} assume true; {11280#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:01,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {11280#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:01,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {11281#(<= main_~i~0 11)} assume true; {11281#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:01,716 INFO L273 TraceCheckUtils]: 29: Hoare triple {11281#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:01,716 INFO L273 TraceCheckUtils]: 30: Hoare triple {11282#(<= main_~i~0 12)} assume true; {11282#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:01,717 INFO L273 TraceCheckUtils]: 31: Hoare triple {11282#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:01,718 INFO L273 TraceCheckUtils]: 32: Hoare triple {11283#(<= main_~i~0 13)} assume true; {11283#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:01,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {11283#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:01,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {11284#(<= main_~i~0 14)} assume true; {11284#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:01,720 INFO L273 TraceCheckUtils]: 35: Hoare triple {11284#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:01,721 INFO L273 TraceCheckUtils]: 36: Hoare triple {11285#(<= main_~i~0 15)} assume true; {11285#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:01,721 INFO L273 TraceCheckUtils]: 37: Hoare triple {11285#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:01,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {11286#(<= main_~i~0 16)} assume true; {11286#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:01,723 INFO L273 TraceCheckUtils]: 39: Hoare triple {11286#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:01,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {11287#(<= main_~i~0 17)} assume true; {11287#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:01,724 INFO L273 TraceCheckUtils]: 41: Hoare triple {11287#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:01,725 INFO L273 TraceCheckUtils]: 42: Hoare triple {11288#(<= main_~i~0 18)} assume true; {11288#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:01,726 INFO L273 TraceCheckUtils]: 43: Hoare triple {11288#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:01,726 INFO L273 TraceCheckUtils]: 44: Hoare triple {11289#(<= main_~i~0 19)} assume true; {11289#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:01,727 INFO L273 TraceCheckUtils]: 45: Hoare triple {11289#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:01,728 INFO L273 TraceCheckUtils]: 46: Hoare triple {11290#(<= main_~i~0 20)} assume true; {11290#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:01,729 INFO L273 TraceCheckUtils]: 47: Hoare triple {11290#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:01,729 INFO L273 TraceCheckUtils]: 48: Hoare triple {11291#(<= main_~i~0 21)} assume true; {11291#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:01,730 INFO L273 TraceCheckUtils]: 49: Hoare triple {11291#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:01,731 INFO L273 TraceCheckUtils]: 50: Hoare triple {11292#(<= main_~i~0 22)} assume true; {11292#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:01,732 INFO L273 TraceCheckUtils]: 51: Hoare triple {11292#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:01,732 INFO L273 TraceCheckUtils]: 52: Hoare triple {11293#(<= main_~i~0 23)} assume true; {11293#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:01,733 INFO L273 TraceCheckUtils]: 53: Hoare triple {11293#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:01,734 INFO L273 TraceCheckUtils]: 54: Hoare triple {11294#(<= main_~i~0 24)} assume true; {11294#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:01,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {11294#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:01,735 INFO L273 TraceCheckUtils]: 56: Hoare triple {11295#(<= main_~i~0 25)} assume true; {11295#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:01,736 INFO L273 TraceCheckUtils]: 57: Hoare triple {11295#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:01,736 INFO L273 TraceCheckUtils]: 58: Hoare triple {11296#(<= main_~i~0 26)} assume true; {11296#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:01,737 INFO L273 TraceCheckUtils]: 59: Hoare triple {11296#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:01,738 INFO L273 TraceCheckUtils]: 60: Hoare triple {11297#(<= main_~i~0 27)} assume true; {11297#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:01,739 INFO L273 TraceCheckUtils]: 61: Hoare triple {11297#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:01,739 INFO L273 TraceCheckUtils]: 62: Hoare triple {11298#(<= main_~i~0 28)} assume true; {11298#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:01,740 INFO L273 TraceCheckUtils]: 63: Hoare triple {11298#(<= main_~i~0 28)} assume !(~i~0 < 100000); {11269#false} is VALID [2018-11-14 18:44:01,740 INFO L273 TraceCheckUtils]: 64: Hoare triple {11269#false} havoc ~x~0;~x~0 := 0; {11269#false} is VALID [2018-11-14 18:44:01,740 INFO L273 TraceCheckUtils]: 65: Hoare triple {11269#false} assume true; {11269#false} is VALID [2018-11-14 18:44:01,741 INFO L273 TraceCheckUtils]: 66: Hoare triple {11269#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11269#false} is VALID [2018-11-14 18:44:01,741 INFO L256 TraceCheckUtils]: 67: Hoare triple {11269#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11269#false} is VALID [2018-11-14 18:44:01,741 INFO L273 TraceCheckUtils]: 68: Hoare triple {11269#false} ~cond := #in~cond; {11269#false} is VALID [2018-11-14 18:44:01,741 INFO L273 TraceCheckUtils]: 69: Hoare triple {11269#false} assume ~cond == 0; {11269#false} is VALID [2018-11-14 18:44:01,741 INFO L273 TraceCheckUtils]: 70: Hoare triple {11269#false} assume !false; {11269#false} is VALID [2018-11-14 18:44:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:01,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:01,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-14 18:44:01,767 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-14 18:44:01,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:01,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-14 18:44:01,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:01,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-14 18:44:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-14 18:44:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:44:01,837 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 32 states. [2018-11-14 18:44:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:02,282 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2018-11-14 18:44:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-14 18:44:02,282 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 71 [2018-11-14 18:44:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:02,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:44:02,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 92 transitions. [2018-11-14 18:44:02,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-14 18:44:02,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 92 transitions. [2018-11-14 18:44:02,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 92 transitions. [2018-11-14 18:44:02,367 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:02,368 INFO L225 Difference]: With dead ends: 90 [2018-11-14 18:44:02,369 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 18:44:02,370 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-14 18:44:02,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 18:44:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-14 18:44:02,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:02,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 78 states. [2018-11-14 18:44:02,540 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 18:44:02,541 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 18:44:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:02,542 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-14 18:44:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 18:44:02,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:02,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:02,543 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 78 states. [2018-11-14 18:44:02,543 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 78 states. [2018-11-14 18:44:02,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:02,544 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-11-14 18:44:02,544 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 18:44:02,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:02,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:02,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:02,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 18:44:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-11-14 18:44:02,546 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2018-11-14 18:44:02,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:02,546 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-11-14 18:44:02,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-14 18:44:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-11-14 18:44:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-11-14 18:44:02,547 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:02,547 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:02,547 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:02,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash 631121574, now seen corresponding path program 29 times [2018-11-14 18:44:02,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:02,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:02,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:03,076 INFO L256 TraceCheckUtils]: 0: Hoare triple {11913#true} call ULTIMATE.init(); {11913#true} is VALID [2018-11-14 18:44:03,076 INFO L273 TraceCheckUtils]: 1: Hoare triple {11913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11913#true} is VALID [2018-11-14 18:44:03,076 INFO L273 TraceCheckUtils]: 2: Hoare triple {11913#true} assume true; {11913#true} is VALID [2018-11-14 18:44:03,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11913#true} {11913#true} #50#return; {11913#true} is VALID [2018-11-14 18:44:03,077 INFO L256 TraceCheckUtils]: 4: Hoare triple {11913#true} call #t~ret2 := main(); {11913#true} is VALID [2018-11-14 18:44:03,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {11913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11915#(= main_~i~0 0)} is VALID [2018-11-14 18:44:03,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {11915#(= main_~i~0 0)} assume true; {11915#(= main_~i~0 0)} is VALID [2018-11-14 18:44:03,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {11915#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:03,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {11916#(<= main_~i~0 1)} assume true; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:03,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {11916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:03,080 INFO L273 TraceCheckUtils]: 10: Hoare triple {11917#(<= main_~i~0 2)} assume true; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:03,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {11917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:03,081 INFO L273 TraceCheckUtils]: 12: Hoare triple {11918#(<= main_~i~0 3)} assume true; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:03,082 INFO L273 TraceCheckUtils]: 13: Hoare triple {11918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:03,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {11919#(<= main_~i~0 4)} assume true; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:03,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {11919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:03,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {11920#(<= main_~i~0 5)} assume true; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:03,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {11920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:03,085 INFO L273 TraceCheckUtils]: 18: Hoare triple {11921#(<= main_~i~0 6)} assume true; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:03,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {11921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:03,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {11922#(<= main_~i~0 7)} assume true; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:03,087 INFO L273 TraceCheckUtils]: 21: Hoare triple {11922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:03,088 INFO L273 TraceCheckUtils]: 22: Hoare triple {11923#(<= main_~i~0 8)} assume true; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:03,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {11923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:03,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {11924#(<= main_~i~0 9)} assume true; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:03,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {11924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:03,091 INFO L273 TraceCheckUtils]: 26: Hoare triple {11925#(<= main_~i~0 10)} assume true; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:03,092 INFO L273 TraceCheckUtils]: 27: Hoare triple {11925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:03,092 INFO L273 TraceCheckUtils]: 28: Hoare triple {11926#(<= main_~i~0 11)} assume true; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:03,093 INFO L273 TraceCheckUtils]: 29: Hoare triple {11926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:03,094 INFO L273 TraceCheckUtils]: 30: Hoare triple {11927#(<= main_~i~0 12)} assume true; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:03,095 INFO L273 TraceCheckUtils]: 31: Hoare triple {11927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:03,095 INFO L273 TraceCheckUtils]: 32: Hoare triple {11928#(<= main_~i~0 13)} assume true; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:03,096 INFO L273 TraceCheckUtils]: 33: Hoare triple {11928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:03,097 INFO L273 TraceCheckUtils]: 34: Hoare triple {11929#(<= main_~i~0 14)} assume true; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:03,098 INFO L273 TraceCheckUtils]: 35: Hoare triple {11929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:03,098 INFO L273 TraceCheckUtils]: 36: Hoare triple {11930#(<= main_~i~0 15)} assume true; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:03,099 INFO L273 TraceCheckUtils]: 37: Hoare triple {11930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:03,100 INFO L273 TraceCheckUtils]: 38: Hoare triple {11931#(<= main_~i~0 16)} assume true; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:03,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {11931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:03,101 INFO L273 TraceCheckUtils]: 40: Hoare triple {11932#(<= main_~i~0 17)} assume true; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:03,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {11932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:03,102 INFO L273 TraceCheckUtils]: 42: Hoare triple {11933#(<= main_~i~0 18)} assume true; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:03,103 INFO L273 TraceCheckUtils]: 43: Hoare triple {11933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:03,104 INFO L273 TraceCheckUtils]: 44: Hoare triple {11934#(<= main_~i~0 19)} assume true; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:03,105 INFO L273 TraceCheckUtils]: 45: Hoare triple {11934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:03,105 INFO L273 TraceCheckUtils]: 46: Hoare triple {11935#(<= main_~i~0 20)} assume true; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:03,106 INFO L273 TraceCheckUtils]: 47: Hoare triple {11935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:03,107 INFO L273 TraceCheckUtils]: 48: Hoare triple {11936#(<= main_~i~0 21)} assume true; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:03,108 INFO L273 TraceCheckUtils]: 49: Hoare triple {11936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:03,108 INFO L273 TraceCheckUtils]: 50: Hoare triple {11937#(<= main_~i~0 22)} assume true; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:03,109 INFO L273 TraceCheckUtils]: 51: Hoare triple {11937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:03,110 INFO L273 TraceCheckUtils]: 52: Hoare triple {11938#(<= main_~i~0 23)} assume true; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:03,111 INFO L273 TraceCheckUtils]: 53: Hoare triple {11938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:03,111 INFO L273 TraceCheckUtils]: 54: Hoare triple {11939#(<= main_~i~0 24)} assume true; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:03,112 INFO L273 TraceCheckUtils]: 55: Hoare triple {11939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:03,113 INFO L273 TraceCheckUtils]: 56: Hoare triple {11940#(<= main_~i~0 25)} assume true; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:03,114 INFO L273 TraceCheckUtils]: 57: Hoare triple {11940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:03,114 INFO L273 TraceCheckUtils]: 58: Hoare triple {11941#(<= main_~i~0 26)} assume true; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:03,115 INFO L273 TraceCheckUtils]: 59: Hoare triple {11941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:03,116 INFO L273 TraceCheckUtils]: 60: Hoare triple {11942#(<= main_~i~0 27)} assume true; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:03,116 INFO L273 TraceCheckUtils]: 61: Hoare triple {11942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:03,117 INFO L273 TraceCheckUtils]: 62: Hoare triple {11943#(<= main_~i~0 28)} assume true; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:03,118 INFO L273 TraceCheckUtils]: 63: Hoare triple {11943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:03,118 INFO L273 TraceCheckUtils]: 64: Hoare triple {11944#(<= main_~i~0 29)} assume true; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:03,119 INFO L273 TraceCheckUtils]: 65: Hoare triple {11944#(<= main_~i~0 29)} assume !(~i~0 < 100000); {11914#false} is VALID [2018-11-14 18:44:03,119 INFO L273 TraceCheckUtils]: 66: Hoare triple {11914#false} havoc ~x~0;~x~0 := 0; {11914#false} is VALID [2018-11-14 18:44:03,120 INFO L273 TraceCheckUtils]: 67: Hoare triple {11914#false} assume true; {11914#false} is VALID [2018-11-14 18:44:03,120 INFO L273 TraceCheckUtils]: 68: Hoare triple {11914#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11914#false} is VALID [2018-11-14 18:44:03,120 INFO L256 TraceCheckUtils]: 69: Hoare triple {11914#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11914#false} is VALID [2018-11-14 18:44:03,120 INFO L273 TraceCheckUtils]: 70: Hoare triple {11914#false} ~cond := #in~cond; {11914#false} is VALID [2018-11-14 18:44:03,120 INFO L273 TraceCheckUtils]: 71: Hoare triple {11914#false} assume ~cond == 0; {11914#false} is VALID [2018-11-14 18:44:03,121 INFO L273 TraceCheckUtils]: 72: Hoare triple {11914#false} assume !false; {11914#false} is VALID [2018-11-14 18:44:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:03,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:03,125 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-14 18:44:03,133 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:44:03,667 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-14 18:44:03,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:03,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:03,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {11913#true} call ULTIMATE.init(); {11913#true} is VALID [2018-11-14 18:44:03,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {11913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11913#true} is VALID [2018-11-14 18:44:03,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {11913#true} assume true; {11913#true} is VALID [2018-11-14 18:44:03,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11913#true} {11913#true} #50#return; {11913#true} is VALID [2018-11-14 18:44:03,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {11913#true} call #t~ret2 := main(); {11913#true} is VALID [2018-11-14 18:44:03,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {11913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11963#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:03,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {11963#(<= main_~i~0 0)} assume true; {11963#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:03,935 INFO L273 TraceCheckUtils]: 7: Hoare triple {11963#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:03,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {11916#(<= main_~i~0 1)} assume true; {11916#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:03,936 INFO L273 TraceCheckUtils]: 9: Hoare triple {11916#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:03,937 INFO L273 TraceCheckUtils]: 10: Hoare triple {11917#(<= main_~i~0 2)} assume true; {11917#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:03,938 INFO L273 TraceCheckUtils]: 11: Hoare triple {11917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:03,938 INFO L273 TraceCheckUtils]: 12: Hoare triple {11918#(<= main_~i~0 3)} assume true; {11918#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:03,939 INFO L273 TraceCheckUtils]: 13: Hoare triple {11918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:03,940 INFO L273 TraceCheckUtils]: 14: Hoare triple {11919#(<= main_~i~0 4)} assume true; {11919#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:03,940 INFO L273 TraceCheckUtils]: 15: Hoare triple {11919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:03,941 INFO L273 TraceCheckUtils]: 16: Hoare triple {11920#(<= main_~i~0 5)} assume true; {11920#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:03,942 INFO L273 TraceCheckUtils]: 17: Hoare triple {11920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:03,942 INFO L273 TraceCheckUtils]: 18: Hoare triple {11921#(<= main_~i~0 6)} assume true; {11921#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:03,943 INFO L273 TraceCheckUtils]: 19: Hoare triple {11921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:03,944 INFO L273 TraceCheckUtils]: 20: Hoare triple {11922#(<= main_~i~0 7)} assume true; {11922#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:03,945 INFO L273 TraceCheckUtils]: 21: Hoare triple {11922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:03,945 INFO L273 TraceCheckUtils]: 22: Hoare triple {11923#(<= main_~i~0 8)} assume true; {11923#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:03,946 INFO L273 TraceCheckUtils]: 23: Hoare triple {11923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:03,947 INFO L273 TraceCheckUtils]: 24: Hoare triple {11924#(<= main_~i~0 9)} assume true; {11924#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:03,948 INFO L273 TraceCheckUtils]: 25: Hoare triple {11924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:03,948 INFO L273 TraceCheckUtils]: 26: Hoare triple {11925#(<= main_~i~0 10)} assume true; {11925#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:03,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {11925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:03,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {11926#(<= main_~i~0 11)} assume true; {11926#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:03,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {11926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:03,951 INFO L273 TraceCheckUtils]: 30: Hoare triple {11927#(<= main_~i~0 12)} assume true; {11927#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:03,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {11927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:03,952 INFO L273 TraceCheckUtils]: 32: Hoare triple {11928#(<= main_~i~0 13)} assume true; {11928#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:03,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {11928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:03,954 INFO L273 TraceCheckUtils]: 34: Hoare triple {11929#(<= main_~i~0 14)} assume true; {11929#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:03,955 INFO L273 TraceCheckUtils]: 35: Hoare triple {11929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:03,955 INFO L273 TraceCheckUtils]: 36: Hoare triple {11930#(<= main_~i~0 15)} assume true; {11930#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:03,956 INFO L273 TraceCheckUtils]: 37: Hoare triple {11930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:03,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {11931#(<= main_~i~0 16)} assume true; {11931#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:03,958 INFO L273 TraceCheckUtils]: 39: Hoare triple {11931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:03,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {11932#(<= main_~i~0 17)} assume true; {11932#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:03,959 INFO L273 TraceCheckUtils]: 41: Hoare triple {11932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:03,960 INFO L273 TraceCheckUtils]: 42: Hoare triple {11933#(<= main_~i~0 18)} assume true; {11933#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:03,961 INFO L273 TraceCheckUtils]: 43: Hoare triple {11933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:03,961 INFO L273 TraceCheckUtils]: 44: Hoare triple {11934#(<= main_~i~0 19)} assume true; {11934#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:03,962 INFO L273 TraceCheckUtils]: 45: Hoare triple {11934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:03,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {11935#(<= main_~i~0 20)} assume true; {11935#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:03,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {11935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:03,964 INFO L273 TraceCheckUtils]: 48: Hoare triple {11936#(<= main_~i~0 21)} assume true; {11936#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:03,965 INFO L273 TraceCheckUtils]: 49: Hoare triple {11936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:03,965 INFO L273 TraceCheckUtils]: 50: Hoare triple {11937#(<= main_~i~0 22)} assume true; {11937#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:03,966 INFO L273 TraceCheckUtils]: 51: Hoare triple {11937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:03,967 INFO L273 TraceCheckUtils]: 52: Hoare triple {11938#(<= main_~i~0 23)} assume true; {11938#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:03,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {11938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:03,973 INFO L273 TraceCheckUtils]: 54: Hoare triple {11939#(<= main_~i~0 24)} assume true; {11939#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:03,974 INFO L273 TraceCheckUtils]: 55: Hoare triple {11939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:03,974 INFO L273 TraceCheckUtils]: 56: Hoare triple {11940#(<= main_~i~0 25)} assume true; {11940#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:03,975 INFO L273 TraceCheckUtils]: 57: Hoare triple {11940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:03,975 INFO L273 TraceCheckUtils]: 58: Hoare triple {11941#(<= main_~i~0 26)} assume true; {11941#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:03,976 INFO L273 TraceCheckUtils]: 59: Hoare triple {11941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:03,976 INFO L273 TraceCheckUtils]: 60: Hoare triple {11942#(<= main_~i~0 27)} assume true; {11942#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:03,976 INFO L273 TraceCheckUtils]: 61: Hoare triple {11942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:03,977 INFO L273 TraceCheckUtils]: 62: Hoare triple {11943#(<= main_~i~0 28)} assume true; {11943#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:03,977 INFO L273 TraceCheckUtils]: 63: Hoare triple {11943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:03,978 INFO L273 TraceCheckUtils]: 64: Hoare triple {11944#(<= main_~i~0 29)} assume true; {11944#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:03,978 INFO L273 TraceCheckUtils]: 65: Hoare triple {11944#(<= main_~i~0 29)} assume !(~i~0 < 100000); {11914#false} is VALID [2018-11-14 18:44:03,978 INFO L273 TraceCheckUtils]: 66: Hoare triple {11914#false} havoc ~x~0;~x~0 := 0; {11914#false} is VALID [2018-11-14 18:44:03,979 INFO L273 TraceCheckUtils]: 67: Hoare triple {11914#false} assume true; {11914#false} is VALID [2018-11-14 18:44:03,979 INFO L273 TraceCheckUtils]: 68: Hoare triple {11914#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {11914#false} is VALID [2018-11-14 18:44:03,979 INFO L256 TraceCheckUtils]: 69: Hoare triple {11914#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {11914#false} is VALID [2018-11-14 18:44:03,979 INFO L273 TraceCheckUtils]: 70: Hoare triple {11914#false} ~cond := #in~cond; {11914#false} is VALID [2018-11-14 18:44:03,979 INFO L273 TraceCheckUtils]: 71: Hoare triple {11914#false} assume ~cond == 0; {11914#false} is VALID [2018-11-14 18:44:03,980 INFO L273 TraceCheckUtils]: 72: Hoare triple {11914#false} assume !false; {11914#false} is VALID [2018-11-14 18:44:03,984 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:04,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:04,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-14 18:44:04,006 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-11-14 18:44:04,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:04,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-14 18:44:04,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:04,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-14 18:44:04,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-14 18:44:04,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:44:04,079 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 33 states. [2018-11-14 18:44:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:04,578 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-11-14 18:44:04,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-14 18:44:04,579 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 73 [2018-11-14 18:44:04,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:44:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 94 transitions. [2018-11-14 18:44:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:44:04,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 94 transitions. [2018-11-14 18:44:04,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 94 transitions. [2018-11-14 18:44:04,666 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:04,668 INFO L225 Difference]: With dead ends: 92 [2018-11-14 18:44:04,668 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:44:04,669 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-14 18:44:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:44:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-11-14 18:44:04,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:04,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 80 states. [2018-11-14 18:44:04,701 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 18:44:04,701 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 18:44:04,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:04,702 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-14 18:44:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 18:44:04,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:04,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:04,703 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 80 states. [2018-11-14 18:44:04,703 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 80 states. [2018-11-14 18:44:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:04,704 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2018-11-14 18:44:04,704 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 18:44:04,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:04,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:04,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:04,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:04,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:44:04,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2018-11-14 18:44:04,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 73 [2018-11-14 18:44:04,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:04,706 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2018-11-14 18:44:04,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-14 18:44:04,706 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2018-11-14 18:44:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 18:44:04,707 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:04,707 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:04,707 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:04,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:04,707 INFO L82 PathProgramCache]: Analyzing trace with hash 905503872, now seen corresponding path program 30 times [2018-11-14 18:44:04,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:04,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:04,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:04,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:05,533 INFO L256 TraceCheckUtils]: 0: Hoare triple {12575#true} call ULTIMATE.init(); {12575#true} is VALID [2018-11-14 18:44:05,533 INFO L273 TraceCheckUtils]: 1: Hoare triple {12575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12575#true} is VALID [2018-11-14 18:44:05,534 INFO L273 TraceCheckUtils]: 2: Hoare triple {12575#true} assume true; {12575#true} is VALID [2018-11-14 18:44:05,534 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12575#true} {12575#true} #50#return; {12575#true} is VALID [2018-11-14 18:44:05,534 INFO L256 TraceCheckUtils]: 4: Hoare triple {12575#true} call #t~ret2 := main(); {12575#true} is VALID [2018-11-14 18:44:05,535 INFO L273 TraceCheckUtils]: 5: Hoare triple {12575#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12577#(= main_~i~0 0)} is VALID [2018-11-14 18:44:05,535 INFO L273 TraceCheckUtils]: 6: Hoare triple {12577#(= main_~i~0 0)} assume true; {12577#(= main_~i~0 0)} is VALID [2018-11-14 18:44:05,536 INFO L273 TraceCheckUtils]: 7: Hoare triple {12577#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:05,537 INFO L273 TraceCheckUtils]: 8: Hoare triple {12578#(<= main_~i~0 1)} assume true; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:05,537 INFO L273 TraceCheckUtils]: 9: Hoare triple {12578#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:05,537 INFO L273 TraceCheckUtils]: 10: Hoare triple {12579#(<= main_~i~0 2)} assume true; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:05,538 INFO L273 TraceCheckUtils]: 11: Hoare triple {12579#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:05,539 INFO L273 TraceCheckUtils]: 12: Hoare triple {12580#(<= main_~i~0 3)} assume true; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:05,540 INFO L273 TraceCheckUtils]: 13: Hoare triple {12580#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:05,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {12581#(<= main_~i~0 4)} assume true; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:05,541 INFO L273 TraceCheckUtils]: 15: Hoare triple {12581#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:05,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {12582#(<= main_~i~0 5)} assume true; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:05,542 INFO L273 TraceCheckUtils]: 17: Hoare triple {12582#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:05,543 INFO L273 TraceCheckUtils]: 18: Hoare triple {12583#(<= main_~i~0 6)} assume true; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:05,562 INFO L273 TraceCheckUtils]: 19: Hoare triple {12583#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:05,571 INFO L273 TraceCheckUtils]: 20: Hoare triple {12584#(<= main_~i~0 7)} assume true; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:05,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {12584#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:05,572 INFO L273 TraceCheckUtils]: 22: Hoare triple {12585#(<= main_~i~0 8)} assume true; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:05,573 INFO L273 TraceCheckUtils]: 23: Hoare triple {12585#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:05,573 INFO L273 TraceCheckUtils]: 24: Hoare triple {12586#(<= main_~i~0 9)} assume true; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:05,574 INFO L273 TraceCheckUtils]: 25: Hoare triple {12586#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:05,574 INFO L273 TraceCheckUtils]: 26: Hoare triple {12587#(<= main_~i~0 10)} assume true; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:05,575 INFO L273 TraceCheckUtils]: 27: Hoare triple {12587#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:05,575 INFO L273 TraceCheckUtils]: 28: Hoare triple {12588#(<= main_~i~0 11)} assume true; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:05,576 INFO L273 TraceCheckUtils]: 29: Hoare triple {12588#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:05,576 INFO L273 TraceCheckUtils]: 30: Hoare triple {12589#(<= main_~i~0 12)} assume true; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:05,577 INFO L273 TraceCheckUtils]: 31: Hoare triple {12589#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:05,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {12590#(<= main_~i~0 13)} assume true; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:05,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {12590#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:05,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {12591#(<= main_~i~0 14)} assume true; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:05,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {12591#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:05,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {12592#(<= main_~i~0 15)} assume true; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:05,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {12592#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:05,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {12593#(<= main_~i~0 16)} assume true; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:05,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {12593#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:05,583 INFO L273 TraceCheckUtils]: 40: Hoare triple {12594#(<= main_~i~0 17)} assume true; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:05,584 INFO L273 TraceCheckUtils]: 41: Hoare triple {12594#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:05,585 INFO L273 TraceCheckUtils]: 42: Hoare triple {12595#(<= main_~i~0 18)} assume true; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:05,586 INFO L273 TraceCheckUtils]: 43: Hoare triple {12595#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:05,586 INFO L273 TraceCheckUtils]: 44: Hoare triple {12596#(<= main_~i~0 19)} assume true; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:05,587 INFO L273 TraceCheckUtils]: 45: Hoare triple {12596#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:05,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {12597#(<= main_~i~0 20)} assume true; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:05,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {12597#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:05,589 INFO L273 TraceCheckUtils]: 48: Hoare triple {12598#(<= main_~i~0 21)} assume true; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:05,590 INFO L273 TraceCheckUtils]: 49: Hoare triple {12598#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:05,590 INFO L273 TraceCheckUtils]: 50: Hoare triple {12599#(<= main_~i~0 22)} assume true; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:05,591 INFO L273 TraceCheckUtils]: 51: Hoare triple {12599#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:05,592 INFO L273 TraceCheckUtils]: 52: Hoare triple {12600#(<= main_~i~0 23)} assume true; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:05,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {12600#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:05,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {12601#(<= main_~i~0 24)} assume true; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:05,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {12601#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:05,595 INFO L273 TraceCheckUtils]: 56: Hoare triple {12602#(<= main_~i~0 25)} assume true; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:05,596 INFO L273 TraceCheckUtils]: 57: Hoare triple {12602#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:05,596 INFO L273 TraceCheckUtils]: 58: Hoare triple {12603#(<= main_~i~0 26)} assume true; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:05,597 INFO L273 TraceCheckUtils]: 59: Hoare triple {12603#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:05,598 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#(<= main_~i~0 27)} assume true; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:05,599 INFO L273 TraceCheckUtils]: 61: Hoare triple {12604#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:05,599 INFO L273 TraceCheckUtils]: 62: Hoare triple {12605#(<= main_~i~0 28)} assume true; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:05,600 INFO L273 TraceCheckUtils]: 63: Hoare triple {12605#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:05,601 INFO L273 TraceCheckUtils]: 64: Hoare triple {12606#(<= main_~i~0 29)} assume true; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:05,601 INFO L273 TraceCheckUtils]: 65: Hoare triple {12606#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:05,602 INFO L273 TraceCheckUtils]: 66: Hoare triple {12607#(<= main_~i~0 30)} assume true; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:05,603 INFO L273 TraceCheckUtils]: 67: Hoare triple {12607#(<= main_~i~0 30)} assume !(~i~0 < 100000); {12576#false} is VALID [2018-11-14 18:44:05,603 INFO L273 TraceCheckUtils]: 68: Hoare triple {12576#false} havoc ~x~0;~x~0 := 0; {12576#false} is VALID [2018-11-14 18:44:05,603 INFO L273 TraceCheckUtils]: 69: Hoare triple {12576#false} assume true; {12576#false} is VALID [2018-11-14 18:44:05,603 INFO L273 TraceCheckUtils]: 70: Hoare triple {12576#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12576#false} is VALID [2018-11-14 18:44:05,603 INFO L256 TraceCheckUtils]: 71: Hoare triple {12576#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12576#false} is VALID [2018-11-14 18:44:05,604 INFO L273 TraceCheckUtils]: 72: Hoare triple {12576#false} ~cond := #in~cond; {12576#false} is VALID [2018-11-14 18:44:05,604 INFO L273 TraceCheckUtils]: 73: Hoare triple {12576#false} assume ~cond == 0; {12576#false} is VALID [2018-11-14 18:44:05,604 INFO L273 TraceCheckUtils]: 74: Hoare triple {12576#false} assume !false; {12576#false} is VALID [2018-11-14 18:44:05,609 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:05,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:05,609 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-14 18:44:05,618 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 18:44:19,463 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-14 18:44:19,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:19,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:19,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:19,692 INFO L256 TraceCheckUtils]: 0: Hoare triple {12575#true} call ULTIMATE.init(); {12575#true} is VALID [2018-11-14 18:44:19,692 INFO L273 TraceCheckUtils]: 1: Hoare triple {12575#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12575#true} is VALID [2018-11-14 18:44:19,693 INFO L273 TraceCheckUtils]: 2: Hoare triple {12575#true} assume true; {12575#true} is VALID [2018-11-14 18:44:19,693 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12575#true} {12575#true} #50#return; {12575#true} is VALID [2018-11-14 18:44:19,693 INFO L256 TraceCheckUtils]: 4: Hoare triple {12575#true} call #t~ret2 := main(); {12575#true} is VALID [2018-11-14 18:44:19,694 INFO L273 TraceCheckUtils]: 5: Hoare triple {12575#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12626#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:19,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {12626#(<= main_~i~0 0)} assume true; {12626#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:19,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {12626#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:19,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {12578#(<= main_~i~0 1)} assume true; {12578#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:19,695 INFO L273 TraceCheckUtils]: 9: Hoare triple {12578#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:19,696 INFO L273 TraceCheckUtils]: 10: Hoare triple {12579#(<= main_~i~0 2)} assume true; {12579#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:19,696 INFO L273 TraceCheckUtils]: 11: Hoare triple {12579#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:19,697 INFO L273 TraceCheckUtils]: 12: Hoare triple {12580#(<= main_~i~0 3)} assume true; {12580#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:19,697 INFO L273 TraceCheckUtils]: 13: Hoare triple {12580#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:19,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {12581#(<= main_~i~0 4)} assume true; {12581#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:19,699 INFO L273 TraceCheckUtils]: 15: Hoare triple {12581#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:19,699 INFO L273 TraceCheckUtils]: 16: Hoare triple {12582#(<= main_~i~0 5)} assume true; {12582#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:19,700 INFO L273 TraceCheckUtils]: 17: Hoare triple {12582#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:19,701 INFO L273 TraceCheckUtils]: 18: Hoare triple {12583#(<= main_~i~0 6)} assume true; {12583#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:19,701 INFO L273 TraceCheckUtils]: 19: Hoare triple {12583#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:19,702 INFO L273 TraceCheckUtils]: 20: Hoare triple {12584#(<= main_~i~0 7)} assume true; {12584#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:19,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {12584#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:19,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {12585#(<= main_~i~0 8)} assume true; {12585#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:19,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {12585#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:19,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {12586#(<= main_~i~0 9)} assume true; {12586#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:19,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {12586#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:19,706 INFO L273 TraceCheckUtils]: 26: Hoare triple {12587#(<= main_~i~0 10)} assume true; {12587#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:19,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {12587#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:19,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {12588#(<= main_~i~0 11)} assume true; {12588#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:19,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {12588#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:19,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {12589#(<= main_~i~0 12)} assume true; {12589#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:19,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {12589#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:19,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {12590#(<= main_~i~0 13)} assume true; {12590#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:19,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {12590#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:19,711 INFO L273 TraceCheckUtils]: 34: Hoare triple {12591#(<= main_~i~0 14)} assume true; {12591#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:19,712 INFO L273 TraceCheckUtils]: 35: Hoare triple {12591#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:19,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {12592#(<= main_~i~0 15)} assume true; {12592#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:19,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {12592#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:19,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {12593#(<= main_~i~0 16)} assume true; {12593#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:19,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {12593#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:19,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {12594#(<= main_~i~0 17)} assume true; {12594#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:19,719 INFO L273 TraceCheckUtils]: 41: Hoare triple {12594#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:19,719 INFO L273 TraceCheckUtils]: 42: Hoare triple {12595#(<= main_~i~0 18)} assume true; {12595#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:19,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {12595#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:19,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {12596#(<= main_~i~0 19)} assume true; {12596#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:19,721 INFO L273 TraceCheckUtils]: 45: Hoare triple {12596#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:19,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {12597#(<= main_~i~0 20)} assume true; {12597#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:19,722 INFO L273 TraceCheckUtils]: 47: Hoare triple {12597#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:19,723 INFO L273 TraceCheckUtils]: 48: Hoare triple {12598#(<= main_~i~0 21)} assume true; {12598#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:19,727 INFO L273 TraceCheckUtils]: 49: Hoare triple {12598#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:19,727 INFO L273 TraceCheckUtils]: 50: Hoare triple {12599#(<= main_~i~0 22)} assume true; {12599#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:19,728 INFO L273 TraceCheckUtils]: 51: Hoare triple {12599#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:19,728 INFO L273 TraceCheckUtils]: 52: Hoare triple {12600#(<= main_~i~0 23)} assume true; {12600#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:19,728 INFO L273 TraceCheckUtils]: 53: Hoare triple {12600#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:19,729 INFO L273 TraceCheckUtils]: 54: Hoare triple {12601#(<= main_~i~0 24)} assume true; {12601#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:19,729 INFO L273 TraceCheckUtils]: 55: Hoare triple {12601#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:19,730 INFO L273 TraceCheckUtils]: 56: Hoare triple {12602#(<= main_~i~0 25)} assume true; {12602#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:19,730 INFO L273 TraceCheckUtils]: 57: Hoare triple {12602#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:19,731 INFO L273 TraceCheckUtils]: 58: Hoare triple {12603#(<= main_~i~0 26)} assume true; {12603#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:19,732 INFO L273 TraceCheckUtils]: 59: Hoare triple {12603#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:19,732 INFO L273 TraceCheckUtils]: 60: Hoare triple {12604#(<= main_~i~0 27)} assume true; {12604#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:19,733 INFO L273 TraceCheckUtils]: 61: Hoare triple {12604#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:19,734 INFO L273 TraceCheckUtils]: 62: Hoare triple {12605#(<= main_~i~0 28)} assume true; {12605#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:19,734 INFO L273 TraceCheckUtils]: 63: Hoare triple {12605#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:19,735 INFO L273 TraceCheckUtils]: 64: Hoare triple {12606#(<= main_~i~0 29)} assume true; {12606#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:19,736 INFO L273 TraceCheckUtils]: 65: Hoare triple {12606#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:19,736 INFO L273 TraceCheckUtils]: 66: Hoare triple {12607#(<= main_~i~0 30)} assume true; {12607#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:19,737 INFO L273 TraceCheckUtils]: 67: Hoare triple {12607#(<= main_~i~0 30)} assume !(~i~0 < 100000); {12576#false} is VALID [2018-11-14 18:44:19,737 INFO L273 TraceCheckUtils]: 68: Hoare triple {12576#false} havoc ~x~0;~x~0 := 0; {12576#false} is VALID [2018-11-14 18:44:19,737 INFO L273 TraceCheckUtils]: 69: Hoare triple {12576#false} assume true; {12576#false} is VALID [2018-11-14 18:44:19,737 INFO L273 TraceCheckUtils]: 70: Hoare triple {12576#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {12576#false} is VALID [2018-11-14 18:44:19,738 INFO L256 TraceCheckUtils]: 71: Hoare triple {12576#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {12576#false} is VALID [2018-11-14 18:44:19,738 INFO L273 TraceCheckUtils]: 72: Hoare triple {12576#false} ~cond := #in~cond; {12576#false} is VALID [2018-11-14 18:44:19,738 INFO L273 TraceCheckUtils]: 73: Hoare triple {12576#false} assume ~cond == 0; {12576#false} is VALID [2018-11-14 18:44:19,738 INFO L273 TraceCheckUtils]: 74: Hoare triple {12576#false} assume !false; {12576#false} is VALID [2018-11-14 18:44:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:19,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:19,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-14 18:44:19,767 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-14 18:44:19,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:19,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-14 18:44:19,836 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-14 18:44:19,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-14 18:44:19,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-14 18:44:19,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:44:19,838 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 34 states. [2018-11-14 18:44:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:20,370 INFO L93 Difference]: Finished difference Result 94 states and 96 transitions. [2018-11-14 18:44:20,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-14 18:44:20,370 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2018-11-14 18:44:20,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:44:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-14 18:44:20,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-14 18:44:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 96 transitions. [2018-11-14 18:44:20,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 96 transitions. [2018-11-14 18:44:20,460 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-14 18:44:20,462 INFO L225 Difference]: With dead ends: 94 [2018-11-14 18:44:20,462 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 18:44:20,463 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 18:44:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 18:44:20,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-14 18:44:20,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:20,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 82 states. [2018-11-14 18:44:20,493 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 18:44:20,493 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 18:44:20,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:20,494 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-14 18:44:20,495 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 18:44:20,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:20,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:20,495 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 82 states. [2018-11-14 18:44:20,495 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 82 states. [2018-11-14 18:44:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:20,496 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-11-14 18:44:20,496 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 18:44:20,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:20,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:20,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:20,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:20,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-14 18:44:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-11-14 18:44:20,498 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 75 [2018-11-14 18:44:20,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:20,499 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-11-14 18:44:20,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-14 18:44:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-11-14 18:44:20,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-14 18:44:20,500 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:20,500 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:20,500 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:20,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:20,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1701080102, now seen corresponding path program 31 times [2018-11-14 18:44:20,500 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:20,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:20,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:20,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:21,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2018-11-14 18:44:21,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {13254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13254#true} is VALID [2018-11-14 18:44:21,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2018-11-14 18:44:21,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #50#return; {13254#true} is VALID [2018-11-14 18:44:21,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret2 := main(); {13254#true} is VALID [2018-11-14 18:44:21,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {13254#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13256#(= main_~i~0 0)} is VALID [2018-11-14 18:44:21,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {13256#(= main_~i~0 0)} assume true; {13256#(= main_~i~0 0)} is VALID [2018-11-14 18:44:21,317 INFO L273 TraceCheckUtils]: 7: Hoare triple {13256#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:21,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {13257#(<= main_~i~0 1)} assume true; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:21,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {13257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:21,318 INFO L273 TraceCheckUtils]: 10: Hoare triple {13258#(<= main_~i~0 2)} assume true; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:21,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {13258#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:21,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {13259#(<= main_~i~0 3)} assume true; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:21,320 INFO L273 TraceCheckUtils]: 13: Hoare triple {13259#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:21,321 INFO L273 TraceCheckUtils]: 14: Hoare triple {13260#(<= main_~i~0 4)} assume true; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:21,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {13260#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:21,322 INFO L273 TraceCheckUtils]: 16: Hoare triple {13261#(<= main_~i~0 5)} assume true; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:21,323 INFO L273 TraceCheckUtils]: 17: Hoare triple {13261#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:21,323 INFO L273 TraceCheckUtils]: 18: Hoare triple {13262#(<= main_~i~0 6)} assume true; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:21,324 INFO L273 TraceCheckUtils]: 19: Hoare triple {13262#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:21,325 INFO L273 TraceCheckUtils]: 20: Hoare triple {13263#(<= main_~i~0 7)} assume true; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:21,326 INFO L273 TraceCheckUtils]: 21: Hoare triple {13263#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:21,326 INFO L273 TraceCheckUtils]: 22: Hoare triple {13264#(<= main_~i~0 8)} assume true; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:21,327 INFO L273 TraceCheckUtils]: 23: Hoare triple {13264#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:21,328 INFO L273 TraceCheckUtils]: 24: Hoare triple {13265#(<= main_~i~0 9)} assume true; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:21,329 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:21,329 INFO L273 TraceCheckUtils]: 26: Hoare triple {13266#(<= main_~i~0 10)} assume true; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:21,330 INFO L273 TraceCheckUtils]: 27: Hoare triple {13266#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:21,331 INFO L273 TraceCheckUtils]: 28: Hoare triple {13267#(<= main_~i~0 11)} assume true; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:21,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {13267#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:21,332 INFO L273 TraceCheckUtils]: 30: Hoare triple {13268#(<= main_~i~0 12)} assume true; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:21,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {13268#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:21,333 INFO L273 TraceCheckUtils]: 32: Hoare triple {13269#(<= main_~i~0 13)} assume true; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:21,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {13269#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:21,335 INFO L273 TraceCheckUtils]: 34: Hoare triple {13270#(<= main_~i~0 14)} assume true; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:21,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {13270#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:21,336 INFO L273 TraceCheckUtils]: 36: Hoare triple {13271#(<= main_~i~0 15)} assume true; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:21,337 INFO L273 TraceCheckUtils]: 37: Hoare triple {13271#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:21,337 INFO L273 TraceCheckUtils]: 38: Hoare triple {13272#(<= main_~i~0 16)} assume true; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:21,338 INFO L273 TraceCheckUtils]: 39: Hoare triple {13272#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:21,339 INFO L273 TraceCheckUtils]: 40: Hoare triple {13273#(<= main_~i~0 17)} assume true; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:21,340 INFO L273 TraceCheckUtils]: 41: Hoare triple {13273#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:21,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {13274#(<= main_~i~0 18)} assume true; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:21,341 INFO L273 TraceCheckUtils]: 43: Hoare triple {13274#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:21,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {13275#(<= main_~i~0 19)} assume true; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:21,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {13275#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:21,343 INFO L273 TraceCheckUtils]: 46: Hoare triple {13276#(<= main_~i~0 20)} assume true; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:21,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {13276#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:21,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {13277#(<= main_~i~0 21)} assume true; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:21,345 INFO L273 TraceCheckUtils]: 49: Hoare triple {13277#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:21,346 INFO L273 TraceCheckUtils]: 50: Hoare triple {13278#(<= main_~i~0 22)} assume true; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:21,347 INFO L273 TraceCheckUtils]: 51: Hoare triple {13278#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:21,347 INFO L273 TraceCheckUtils]: 52: Hoare triple {13279#(<= main_~i~0 23)} assume true; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:21,348 INFO L273 TraceCheckUtils]: 53: Hoare triple {13279#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:21,349 INFO L273 TraceCheckUtils]: 54: Hoare triple {13280#(<= main_~i~0 24)} assume true; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:21,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {13280#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:21,350 INFO L273 TraceCheckUtils]: 56: Hoare triple {13281#(<= main_~i~0 25)} assume true; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:21,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {13281#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:21,352 INFO L273 TraceCheckUtils]: 58: Hoare triple {13282#(<= main_~i~0 26)} assume true; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:21,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {13282#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:21,353 INFO L273 TraceCheckUtils]: 60: Hoare triple {13283#(<= main_~i~0 27)} assume true; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:21,354 INFO L273 TraceCheckUtils]: 61: Hoare triple {13283#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:21,354 INFO L273 TraceCheckUtils]: 62: Hoare triple {13284#(<= main_~i~0 28)} assume true; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:21,355 INFO L273 TraceCheckUtils]: 63: Hoare triple {13284#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:21,356 INFO L273 TraceCheckUtils]: 64: Hoare triple {13285#(<= main_~i~0 29)} assume true; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:21,357 INFO L273 TraceCheckUtils]: 65: Hoare triple {13285#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:21,357 INFO L273 TraceCheckUtils]: 66: Hoare triple {13286#(<= main_~i~0 30)} assume true; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:21,358 INFO L273 TraceCheckUtils]: 67: Hoare triple {13286#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:21,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {13287#(<= main_~i~0 31)} assume true; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:21,359 INFO L273 TraceCheckUtils]: 69: Hoare triple {13287#(<= main_~i~0 31)} assume !(~i~0 < 100000); {13255#false} is VALID [2018-11-14 18:44:21,360 INFO L273 TraceCheckUtils]: 70: Hoare triple {13255#false} havoc ~x~0;~x~0 := 0; {13255#false} is VALID [2018-11-14 18:44:21,360 INFO L273 TraceCheckUtils]: 71: Hoare triple {13255#false} assume true; {13255#false} is VALID [2018-11-14 18:44:21,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13255#false} is VALID [2018-11-14 18:44:21,360 INFO L256 TraceCheckUtils]: 73: Hoare triple {13255#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13255#false} is VALID [2018-11-14 18:44:21,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2018-11-14 18:44:21,361 INFO L273 TraceCheckUtils]: 75: Hoare triple {13255#false} assume ~cond == 0; {13255#false} is VALID [2018-11-14 18:44:21,361 INFO L273 TraceCheckUtils]: 76: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2018-11-14 18:44:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:21,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:21,366 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:21,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:21,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:21,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {13254#true} call ULTIMATE.init(); {13254#true} is VALID [2018-11-14 18:44:21,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {13254#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13254#true} is VALID [2018-11-14 18:44:21,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {13254#true} assume true; {13254#true} is VALID [2018-11-14 18:44:21,638 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13254#true} {13254#true} #50#return; {13254#true} is VALID [2018-11-14 18:44:21,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {13254#true} call #t~ret2 := main(); {13254#true} is VALID [2018-11-14 18:44:21,639 INFO L273 TraceCheckUtils]: 5: Hoare triple {13254#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13306#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:21,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {13306#(<= main_~i~0 0)} assume true; {13306#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:21,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {13306#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:21,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {13257#(<= main_~i~0 1)} assume true; {13257#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:21,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {13257#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:21,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {13258#(<= main_~i~0 2)} assume true; {13258#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:21,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {13258#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:21,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {13259#(<= main_~i~0 3)} assume true; {13259#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:21,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {13259#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:21,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {13260#(<= main_~i~0 4)} assume true; {13260#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:21,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {13260#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:21,645 INFO L273 TraceCheckUtils]: 16: Hoare triple {13261#(<= main_~i~0 5)} assume true; {13261#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:21,646 INFO L273 TraceCheckUtils]: 17: Hoare triple {13261#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:21,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {13262#(<= main_~i~0 6)} assume true; {13262#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:21,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {13262#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:21,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {13263#(<= main_~i~0 7)} assume true; {13263#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:21,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {13263#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:21,649 INFO L273 TraceCheckUtils]: 22: Hoare triple {13264#(<= main_~i~0 8)} assume true; {13264#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:21,650 INFO L273 TraceCheckUtils]: 23: Hoare triple {13264#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:21,651 INFO L273 TraceCheckUtils]: 24: Hoare triple {13265#(<= main_~i~0 9)} assume true; {13265#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:21,652 INFO L273 TraceCheckUtils]: 25: Hoare triple {13265#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:21,652 INFO L273 TraceCheckUtils]: 26: Hoare triple {13266#(<= main_~i~0 10)} assume true; {13266#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:21,653 INFO L273 TraceCheckUtils]: 27: Hoare triple {13266#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:21,654 INFO L273 TraceCheckUtils]: 28: Hoare triple {13267#(<= main_~i~0 11)} assume true; {13267#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:21,655 INFO L273 TraceCheckUtils]: 29: Hoare triple {13267#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:21,655 INFO L273 TraceCheckUtils]: 30: Hoare triple {13268#(<= main_~i~0 12)} assume true; {13268#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:21,656 INFO L273 TraceCheckUtils]: 31: Hoare triple {13268#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:21,657 INFO L273 TraceCheckUtils]: 32: Hoare triple {13269#(<= main_~i~0 13)} assume true; {13269#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:21,658 INFO L273 TraceCheckUtils]: 33: Hoare triple {13269#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:21,658 INFO L273 TraceCheckUtils]: 34: Hoare triple {13270#(<= main_~i~0 14)} assume true; {13270#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:21,659 INFO L273 TraceCheckUtils]: 35: Hoare triple {13270#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:21,660 INFO L273 TraceCheckUtils]: 36: Hoare triple {13271#(<= main_~i~0 15)} assume true; {13271#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:21,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {13271#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:21,661 INFO L273 TraceCheckUtils]: 38: Hoare triple {13272#(<= main_~i~0 16)} assume true; {13272#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:21,662 INFO L273 TraceCheckUtils]: 39: Hoare triple {13272#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:21,663 INFO L273 TraceCheckUtils]: 40: Hoare triple {13273#(<= main_~i~0 17)} assume true; {13273#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:21,664 INFO L273 TraceCheckUtils]: 41: Hoare triple {13273#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:21,664 INFO L273 TraceCheckUtils]: 42: Hoare triple {13274#(<= main_~i~0 18)} assume true; {13274#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:21,665 INFO L273 TraceCheckUtils]: 43: Hoare triple {13274#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:21,666 INFO L273 TraceCheckUtils]: 44: Hoare triple {13275#(<= main_~i~0 19)} assume true; {13275#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:21,667 INFO L273 TraceCheckUtils]: 45: Hoare triple {13275#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:21,667 INFO L273 TraceCheckUtils]: 46: Hoare triple {13276#(<= main_~i~0 20)} assume true; {13276#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:21,668 INFO L273 TraceCheckUtils]: 47: Hoare triple {13276#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:21,669 INFO L273 TraceCheckUtils]: 48: Hoare triple {13277#(<= main_~i~0 21)} assume true; {13277#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:21,670 INFO L273 TraceCheckUtils]: 49: Hoare triple {13277#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:21,670 INFO L273 TraceCheckUtils]: 50: Hoare triple {13278#(<= main_~i~0 22)} assume true; {13278#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:21,671 INFO L273 TraceCheckUtils]: 51: Hoare triple {13278#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:21,672 INFO L273 TraceCheckUtils]: 52: Hoare triple {13279#(<= main_~i~0 23)} assume true; {13279#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:21,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {13279#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:21,673 INFO L273 TraceCheckUtils]: 54: Hoare triple {13280#(<= main_~i~0 24)} assume true; {13280#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:21,674 INFO L273 TraceCheckUtils]: 55: Hoare triple {13280#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:21,675 INFO L273 TraceCheckUtils]: 56: Hoare triple {13281#(<= main_~i~0 25)} assume true; {13281#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:21,675 INFO L273 TraceCheckUtils]: 57: Hoare triple {13281#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:21,676 INFO L273 TraceCheckUtils]: 58: Hoare triple {13282#(<= main_~i~0 26)} assume true; {13282#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:21,677 INFO L273 TraceCheckUtils]: 59: Hoare triple {13282#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:21,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {13283#(<= main_~i~0 27)} assume true; {13283#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:21,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {13283#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:21,679 INFO L273 TraceCheckUtils]: 62: Hoare triple {13284#(<= main_~i~0 28)} assume true; {13284#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:21,700 INFO L273 TraceCheckUtils]: 63: Hoare triple {13284#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:21,713 INFO L273 TraceCheckUtils]: 64: Hoare triple {13285#(<= main_~i~0 29)} assume true; {13285#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:21,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {13285#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:21,730 INFO L273 TraceCheckUtils]: 66: Hoare triple {13286#(<= main_~i~0 30)} assume true; {13286#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:21,731 INFO L273 TraceCheckUtils]: 67: Hoare triple {13286#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:21,731 INFO L273 TraceCheckUtils]: 68: Hoare triple {13287#(<= main_~i~0 31)} assume true; {13287#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:21,731 INFO L273 TraceCheckUtils]: 69: Hoare triple {13287#(<= main_~i~0 31)} assume !(~i~0 < 100000); {13255#false} is VALID [2018-11-14 18:44:21,731 INFO L273 TraceCheckUtils]: 70: Hoare triple {13255#false} havoc ~x~0;~x~0 := 0; {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L273 TraceCheckUtils]: 71: Hoare triple {13255#false} assume true; {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L273 TraceCheckUtils]: 72: Hoare triple {13255#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L256 TraceCheckUtils]: 73: Hoare triple {13255#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L273 TraceCheckUtils]: 74: Hoare triple {13255#false} ~cond := #in~cond; {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L273 TraceCheckUtils]: 75: Hoare triple {13255#false} assume ~cond == 0; {13255#false} is VALID [2018-11-14 18:44:21,732 INFO L273 TraceCheckUtils]: 76: Hoare triple {13255#false} assume !false; {13255#false} is VALID [2018-11-14 18:44:21,737 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:21,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:21,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-14 18:44:21,758 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-11-14 18:44:21,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:21,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-14 18:44:21,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:21,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-14 18:44:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-14 18:44:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:44:21,834 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 35 states. [2018-11-14 18:44:22,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:22,350 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2018-11-14 18:44:22,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-14 18:44:22,351 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 77 [2018-11-14 18:44:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:22,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:44:22,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2018-11-14 18:44:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:44:22,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2018-11-14 18:44:22,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 98 transitions. [2018-11-14 18:44:22,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:22,447 INFO L225 Difference]: With dead ends: 96 [2018-11-14 18:44:22,447 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:44:22,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-14 18:44:22,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:44:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-14 18:44:22,474 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:22,474 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-14 18:44:22,474 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 18:44:22,475 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 18:44:22,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:22,476 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-11-14 18:44:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 18:44:22,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:22,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:22,476 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-14 18:44:22,476 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-14 18:44:22,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:22,477 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-11-14 18:44:22,478 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 18:44:22,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:22,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:22,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:22,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-14 18:44:22,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-11-14 18:44:22,480 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 77 [2018-11-14 18:44:22,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:22,480 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-11-14 18:44:22,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-14 18:44:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-11-14 18:44:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-14 18:44:22,481 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:22,481 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:22,481 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:22,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:22,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1632621748, now seen corresponding path program 32 times [2018-11-14 18:44:22,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:22,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:22,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:44:22,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:23,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {13950#true} call ULTIMATE.init(); {13950#true} is VALID [2018-11-14 18:44:23,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {13950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13950#true} is VALID [2018-11-14 18:44:23,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {13950#true} assume true; {13950#true} is VALID [2018-11-14 18:44:23,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13950#true} {13950#true} #50#return; {13950#true} is VALID [2018-11-14 18:44:23,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {13950#true} call #t~ret2 := main(); {13950#true} is VALID [2018-11-14 18:44:23,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {13950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13952#(= main_~i~0 0)} is VALID [2018-11-14 18:44:23,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {13952#(= main_~i~0 0)} assume true; {13952#(= main_~i~0 0)} is VALID [2018-11-14 18:44:23,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {13952#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:23,568 INFO L273 TraceCheckUtils]: 8: Hoare triple {13953#(<= main_~i~0 1)} assume true; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:23,568 INFO L273 TraceCheckUtils]: 9: Hoare triple {13953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:23,569 INFO L273 TraceCheckUtils]: 10: Hoare triple {13954#(<= main_~i~0 2)} assume true; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:23,569 INFO L273 TraceCheckUtils]: 11: Hoare triple {13954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:23,570 INFO L273 TraceCheckUtils]: 12: Hoare triple {13955#(<= main_~i~0 3)} assume true; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:23,570 INFO L273 TraceCheckUtils]: 13: Hoare triple {13955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:23,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {13956#(<= main_~i~0 4)} assume true; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:23,571 INFO L273 TraceCheckUtils]: 15: Hoare triple {13956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:23,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {13957#(<= main_~i~0 5)} assume true; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:23,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {13957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:23,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {13958#(<= main_~i~0 6)} assume true; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:23,574 INFO L273 TraceCheckUtils]: 19: Hoare triple {13958#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:23,575 INFO L273 TraceCheckUtils]: 20: Hoare triple {13959#(<= main_~i~0 7)} assume true; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:23,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {13959#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:23,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {13960#(<= main_~i~0 8)} assume true; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:23,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {13960#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:23,578 INFO L273 TraceCheckUtils]: 24: Hoare triple {13961#(<= main_~i~0 9)} assume true; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:23,579 INFO L273 TraceCheckUtils]: 25: Hoare triple {13961#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:23,579 INFO L273 TraceCheckUtils]: 26: Hoare triple {13962#(<= main_~i~0 10)} assume true; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:23,584 INFO L273 TraceCheckUtils]: 27: Hoare triple {13962#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:23,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {13963#(<= main_~i~0 11)} assume true; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:23,585 INFO L273 TraceCheckUtils]: 29: Hoare triple {13963#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:23,585 INFO L273 TraceCheckUtils]: 30: Hoare triple {13964#(<= main_~i~0 12)} assume true; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:23,586 INFO L273 TraceCheckUtils]: 31: Hoare triple {13964#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:23,586 INFO L273 TraceCheckUtils]: 32: Hoare triple {13965#(<= main_~i~0 13)} assume true; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:23,587 INFO L273 TraceCheckUtils]: 33: Hoare triple {13965#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:23,587 INFO L273 TraceCheckUtils]: 34: Hoare triple {13966#(<= main_~i~0 14)} assume true; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:23,587 INFO L273 TraceCheckUtils]: 35: Hoare triple {13966#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:23,588 INFO L273 TraceCheckUtils]: 36: Hoare triple {13967#(<= main_~i~0 15)} assume true; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:23,589 INFO L273 TraceCheckUtils]: 37: Hoare triple {13967#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:23,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {13968#(<= main_~i~0 16)} assume true; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:23,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {13968#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:23,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {13969#(<= main_~i~0 17)} assume true; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:23,592 INFO L273 TraceCheckUtils]: 41: Hoare triple {13969#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:23,592 INFO L273 TraceCheckUtils]: 42: Hoare triple {13970#(<= main_~i~0 18)} assume true; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:23,593 INFO L273 TraceCheckUtils]: 43: Hoare triple {13970#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:23,594 INFO L273 TraceCheckUtils]: 44: Hoare triple {13971#(<= main_~i~0 19)} assume true; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:23,595 INFO L273 TraceCheckUtils]: 45: Hoare triple {13971#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:23,595 INFO L273 TraceCheckUtils]: 46: Hoare triple {13972#(<= main_~i~0 20)} assume true; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:23,597 INFO L273 TraceCheckUtils]: 47: Hoare triple {13972#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:23,598 INFO L273 TraceCheckUtils]: 48: Hoare triple {13973#(<= main_~i~0 21)} assume true; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:23,599 INFO L273 TraceCheckUtils]: 49: Hoare triple {13973#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:23,599 INFO L273 TraceCheckUtils]: 50: Hoare triple {13974#(<= main_~i~0 22)} assume true; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:23,599 INFO L273 TraceCheckUtils]: 51: Hoare triple {13974#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:23,600 INFO L273 TraceCheckUtils]: 52: Hoare triple {13975#(<= main_~i~0 23)} assume true; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:23,600 INFO L273 TraceCheckUtils]: 53: Hoare triple {13975#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:23,601 INFO L273 TraceCheckUtils]: 54: Hoare triple {13976#(<= main_~i~0 24)} assume true; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:23,601 INFO L273 TraceCheckUtils]: 55: Hoare triple {13976#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:23,601 INFO L273 TraceCheckUtils]: 56: Hoare triple {13977#(<= main_~i~0 25)} assume true; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:23,602 INFO L273 TraceCheckUtils]: 57: Hoare triple {13977#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:23,602 INFO L273 TraceCheckUtils]: 58: Hoare triple {13978#(<= main_~i~0 26)} assume true; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:23,603 INFO L273 TraceCheckUtils]: 59: Hoare triple {13978#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:23,603 INFO L273 TraceCheckUtils]: 60: Hoare triple {13979#(<= main_~i~0 27)} assume true; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:23,604 INFO L273 TraceCheckUtils]: 61: Hoare triple {13979#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:23,605 INFO L273 TraceCheckUtils]: 62: Hoare triple {13980#(<= main_~i~0 28)} assume true; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:23,606 INFO L273 TraceCheckUtils]: 63: Hoare triple {13980#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:23,606 INFO L273 TraceCheckUtils]: 64: Hoare triple {13981#(<= main_~i~0 29)} assume true; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:23,607 INFO L273 TraceCheckUtils]: 65: Hoare triple {13981#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:23,608 INFO L273 TraceCheckUtils]: 66: Hoare triple {13982#(<= main_~i~0 30)} assume true; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:23,609 INFO L273 TraceCheckUtils]: 67: Hoare triple {13982#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:23,609 INFO L273 TraceCheckUtils]: 68: Hoare triple {13983#(<= main_~i~0 31)} assume true; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:23,610 INFO L273 TraceCheckUtils]: 69: Hoare triple {13983#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:23,611 INFO L273 TraceCheckUtils]: 70: Hoare triple {13984#(<= main_~i~0 32)} assume true; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:23,611 INFO L273 TraceCheckUtils]: 71: Hoare triple {13984#(<= main_~i~0 32)} assume !(~i~0 < 100000); {13951#false} is VALID [2018-11-14 18:44:23,611 INFO L273 TraceCheckUtils]: 72: Hoare triple {13951#false} havoc ~x~0;~x~0 := 0; {13951#false} is VALID [2018-11-14 18:44:23,612 INFO L273 TraceCheckUtils]: 73: Hoare triple {13951#false} assume true; {13951#false} is VALID [2018-11-14 18:44:23,612 INFO L273 TraceCheckUtils]: 74: Hoare triple {13951#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13951#false} is VALID [2018-11-14 18:44:23,612 INFO L256 TraceCheckUtils]: 75: Hoare triple {13951#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13951#false} is VALID [2018-11-14 18:44:23,612 INFO L273 TraceCheckUtils]: 76: Hoare triple {13951#false} ~cond := #in~cond; {13951#false} is VALID [2018-11-14 18:44:23,612 INFO L273 TraceCheckUtils]: 77: Hoare triple {13951#false} assume ~cond == 0; {13951#false} is VALID [2018-11-14 18:44:23,613 INFO L273 TraceCheckUtils]: 78: Hoare triple {13951#false} assume !false; {13951#false} is VALID [2018-11-14 18:44:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:23,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:23,620 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:23,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:44:23,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:44:23,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:23,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:23,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {13950#true} call ULTIMATE.init(); {13950#true} is VALID [2018-11-14 18:44:23,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {13950#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13950#true} is VALID [2018-11-14 18:44:23,965 INFO L273 TraceCheckUtils]: 2: Hoare triple {13950#true} assume true; {13950#true} is VALID [2018-11-14 18:44:23,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13950#true} {13950#true} #50#return; {13950#true} is VALID [2018-11-14 18:44:23,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {13950#true} call #t~ret2 := main(); {13950#true} is VALID [2018-11-14 18:44:23,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {13950#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14003#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:23,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {14003#(<= main_~i~0 0)} assume true; {14003#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:23,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {14003#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:23,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {13953#(<= main_~i~0 1)} assume true; {13953#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:23,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {13953#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:23,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {13954#(<= main_~i~0 2)} assume true; {13954#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:23,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {13954#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:23,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {13955#(<= main_~i~0 3)} assume true; {13955#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:23,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {13955#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:23,971 INFO L273 TraceCheckUtils]: 14: Hoare triple {13956#(<= main_~i~0 4)} assume true; {13956#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:23,972 INFO L273 TraceCheckUtils]: 15: Hoare triple {13956#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:23,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {13957#(<= main_~i~0 5)} assume true; {13957#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:23,973 INFO L273 TraceCheckUtils]: 17: Hoare triple {13957#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:23,974 INFO L273 TraceCheckUtils]: 18: Hoare triple {13958#(<= main_~i~0 6)} assume true; {13958#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:23,975 INFO L273 TraceCheckUtils]: 19: Hoare triple {13958#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:23,975 INFO L273 TraceCheckUtils]: 20: Hoare triple {13959#(<= main_~i~0 7)} assume true; {13959#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:23,976 INFO L273 TraceCheckUtils]: 21: Hoare triple {13959#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:23,977 INFO L273 TraceCheckUtils]: 22: Hoare triple {13960#(<= main_~i~0 8)} assume true; {13960#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:23,978 INFO L273 TraceCheckUtils]: 23: Hoare triple {13960#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:23,978 INFO L273 TraceCheckUtils]: 24: Hoare triple {13961#(<= main_~i~0 9)} assume true; {13961#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:23,979 INFO L273 TraceCheckUtils]: 25: Hoare triple {13961#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:23,980 INFO L273 TraceCheckUtils]: 26: Hoare triple {13962#(<= main_~i~0 10)} assume true; {13962#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:23,981 INFO L273 TraceCheckUtils]: 27: Hoare triple {13962#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:23,981 INFO L273 TraceCheckUtils]: 28: Hoare triple {13963#(<= main_~i~0 11)} assume true; {13963#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:23,982 INFO L273 TraceCheckUtils]: 29: Hoare triple {13963#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:23,983 INFO L273 TraceCheckUtils]: 30: Hoare triple {13964#(<= main_~i~0 12)} assume true; {13964#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:23,984 INFO L273 TraceCheckUtils]: 31: Hoare triple {13964#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:23,984 INFO L273 TraceCheckUtils]: 32: Hoare triple {13965#(<= main_~i~0 13)} assume true; {13965#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:23,985 INFO L273 TraceCheckUtils]: 33: Hoare triple {13965#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:23,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {13966#(<= main_~i~0 14)} assume true; {13966#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:23,987 INFO L273 TraceCheckUtils]: 35: Hoare triple {13966#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:23,987 INFO L273 TraceCheckUtils]: 36: Hoare triple {13967#(<= main_~i~0 15)} assume true; {13967#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:23,988 INFO L273 TraceCheckUtils]: 37: Hoare triple {13967#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:23,989 INFO L273 TraceCheckUtils]: 38: Hoare triple {13968#(<= main_~i~0 16)} assume true; {13968#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:23,990 INFO L273 TraceCheckUtils]: 39: Hoare triple {13968#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:23,990 INFO L273 TraceCheckUtils]: 40: Hoare triple {13969#(<= main_~i~0 17)} assume true; {13969#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:23,991 INFO L273 TraceCheckUtils]: 41: Hoare triple {13969#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:23,992 INFO L273 TraceCheckUtils]: 42: Hoare triple {13970#(<= main_~i~0 18)} assume true; {13970#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:23,993 INFO L273 TraceCheckUtils]: 43: Hoare triple {13970#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:23,993 INFO L273 TraceCheckUtils]: 44: Hoare triple {13971#(<= main_~i~0 19)} assume true; {13971#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:23,994 INFO L273 TraceCheckUtils]: 45: Hoare triple {13971#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:23,995 INFO L273 TraceCheckUtils]: 46: Hoare triple {13972#(<= main_~i~0 20)} assume true; {13972#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:23,995 INFO L273 TraceCheckUtils]: 47: Hoare triple {13972#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:23,996 INFO L273 TraceCheckUtils]: 48: Hoare triple {13973#(<= main_~i~0 21)} assume true; {13973#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:23,997 INFO L273 TraceCheckUtils]: 49: Hoare triple {13973#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:23,997 INFO L273 TraceCheckUtils]: 50: Hoare triple {13974#(<= main_~i~0 22)} assume true; {13974#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:23,998 INFO L273 TraceCheckUtils]: 51: Hoare triple {13974#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:23,999 INFO L273 TraceCheckUtils]: 52: Hoare triple {13975#(<= main_~i~0 23)} assume true; {13975#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:24,000 INFO L273 TraceCheckUtils]: 53: Hoare triple {13975#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:24,000 INFO L273 TraceCheckUtils]: 54: Hoare triple {13976#(<= main_~i~0 24)} assume true; {13976#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:24,001 INFO L273 TraceCheckUtils]: 55: Hoare triple {13976#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:24,002 INFO L273 TraceCheckUtils]: 56: Hoare triple {13977#(<= main_~i~0 25)} assume true; {13977#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:24,003 INFO L273 TraceCheckUtils]: 57: Hoare triple {13977#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:24,003 INFO L273 TraceCheckUtils]: 58: Hoare triple {13978#(<= main_~i~0 26)} assume true; {13978#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:24,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {13978#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:24,005 INFO L273 TraceCheckUtils]: 60: Hoare triple {13979#(<= main_~i~0 27)} assume true; {13979#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:24,006 INFO L273 TraceCheckUtils]: 61: Hoare triple {13979#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:24,006 INFO L273 TraceCheckUtils]: 62: Hoare triple {13980#(<= main_~i~0 28)} assume true; {13980#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:24,007 INFO L273 TraceCheckUtils]: 63: Hoare triple {13980#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:24,008 INFO L273 TraceCheckUtils]: 64: Hoare triple {13981#(<= main_~i~0 29)} assume true; {13981#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:24,009 INFO L273 TraceCheckUtils]: 65: Hoare triple {13981#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:24,009 INFO L273 TraceCheckUtils]: 66: Hoare triple {13982#(<= main_~i~0 30)} assume true; {13982#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:24,010 INFO L273 TraceCheckUtils]: 67: Hoare triple {13982#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:24,010 INFO L273 TraceCheckUtils]: 68: Hoare triple {13983#(<= main_~i~0 31)} assume true; {13983#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:24,011 INFO L273 TraceCheckUtils]: 69: Hoare triple {13983#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:24,012 INFO L273 TraceCheckUtils]: 70: Hoare triple {13984#(<= main_~i~0 32)} assume true; {13984#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:24,013 INFO L273 TraceCheckUtils]: 71: Hoare triple {13984#(<= main_~i~0 32)} assume !(~i~0 < 100000); {13951#false} is VALID [2018-11-14 18:44:24,013 INFO L273 TraceCheckUtils]: 72: Hoare triple {13951#false} havoc ~x~0;~x~0 := 0; {13951#false} is VALID [2018-11-14 18:44:24,013 INFO L273 TraceCheckUtils]: 73: Hoare triple {13951#false} assume true; {13951#false} is VALID [2018-11-14 18:44:24,013 INFO L273 TraceCheckUtils]: 74: Hoare triple {13951#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {13951#false} is VALID [2018-11-14 18:44:24,013 INFO L256 TraceCheckUtils]: 75: Hoare triple {13951#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {13951#false} is VALID [2018-11-14 18:44:24,014 INFO L273 TraceCheckUtils]: 76: Hoare triple {13951#false} ~cond := #in~cond; {13951#false} is VALID [2018-11-14 18:44:24,014 INFO L273 TraceCheckUtils]: 77: Hoare triple {13951#false} assume ~cond == 0; {13951#false} is VALID [2018-11-14 18:44:24,014 INFO L273 TraceCheckUtils]: 78: Hoare triple {13951#false} assume !false; {13951#false} is VALID [2018-11-14 18:44:24,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:24,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:24,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-14 18:44:24,042 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-14 18:44:24,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:24,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-14 18:44:24,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:24,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-14 18:44:24,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-14 18:44:24,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:44:24,124 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 36 states. [2018-11-14 18:44:24,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:24,859 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2018-11-14 18:44:24,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:44:24,860 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 79 [2018-11-14 18:44:24,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:44:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2018-11-14 18:44:24,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-14 18:44:24,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2018-11-14 18:44:24,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 100 transitions. [2018-11-14 18:44:24,968 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-14 18:44:24,970 INFO L225 Difference]: With dead ends: 98 [2018-11-14 18:44:24,970 INFO L226 Difference]: Without dead ends: 86 [2018-11-14 18:44:24,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-14 18:44:24,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-14 18:44:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-11-14 18:44:25,022 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:25,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand 86 states. [2018-11-14 18:44:25,022 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 18:44:25,022 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 18:44:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:25,023 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-11-14 18:44:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 18:44:25,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:25,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:25,024 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 86 states. [2018-11-14 18:44:25,024 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 86 states. [2018-11-14 18:44:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:25,025 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-11-14 18:44:25,025 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 18:44:25,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:25,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:25,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:25,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 18:44:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-11-14 18:44:25,027 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 79 [2018-11-14 18:44:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:25,027 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-11-14 18:44:25,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-14 18:44:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-11-14 18:44:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-14 18:44:25,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:25,028 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:25,028 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1274496782, now seen corresponding path program 33 times [2018-11-14 18:44:25,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:25,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:25,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:25,816 INFO L256 TraceCheckUtils]: 0: Hoare triple {14663#true} call ULTIMATE.init(); {14663#true} is VALID [2018-11-14 18:44:25,816 INFO L273 TraceCheckUtils]: 1: Hoare triple {14663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14663#true} is VALID [2018-11-14 18:44:25,816 INFO L273 TraceCheckUtils]: 2: Hoare triple {14663#true} assume true; {14663#true} is VALID [2018-11-14 18:44:25,817 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14663#true} {14663#true} #50#return; {14663#true} is VALID [2018-11-14 18:44:25,817 INFO L256 TraceCheckUtils]: 4: Hoare triple {14663#true} call #t~ret2 := main(); {14663#true} is VALID [2018-11-14 18:44:25,817 INFO L273 TraceCheckUtils]: 5: Hoare triple {14663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14665#(= main_~i~0 0)} is VALID [2018-11-14 18:44:25,818 INFO L273 TraceCheckUtils]: 6: Hoare triple {14665#(= main_~i~0 0)} assume true; {14665#(= main_~i~0 0)} is VALID [2018-11-14 18:44:25,819 INFO L273 TraceCheckUtils]: 7: Hoare triple {14665#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:25,819 INFO L273 TraceCheckUtils]: 8: Hoare triple {14666#(<= main_~i~0 1)} assume true; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:25,820 INFO L273 TraceCheckUtils]: 9: Hoare triple {14666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:25,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {14667#(<= main_~i~0 2)} assume true; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:25,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {14667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:25,822 INFO L273 TraceCheckUtils]: 12: Hoare triple {14668#(<= main_~i~0 3)} assume true; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:25,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {14668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:25,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {14669#(<= main_~i~0 4)} assume true; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:25,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {14669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:25,826 INFO L273 TraceCheckUtils]: 16: Hoare triple {14670#(<= main_~i~0 5)} assume true; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:25,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {14670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:25,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {14671#(<= main_~i~0 6)} assume true; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:25,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {14671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:25,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {14672#(<= main_~i~0 7)} assume true; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:25,836 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:25,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 8)} assume true; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:25,841 INFO L273 TraceCheckUtils]: 23: Hoare triple {14673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:25,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {14674#(<= main_~i~0 9)} assume true; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:25,842 INFO L273 TraceCheckUtils]: 25: Hoare triple {14674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:25,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {14675#(<= main_~i~0 10)} assume true; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:25,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {14675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:25,846 INFO L273 TraceCheckUtils]: 28: Hoare triple {14676#(<= main_~i~0 11)} assume true; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:25,847 INFO L273 TraceCheckUtils]: 29: Hoare triple {14676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:25,848 INFO L273 TraceCheckUtils]: 30: Hoare triple {14677#(<= main_~i~0 12)} assume true; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:25,849 INFO L273 TraceCheckUtils]: 31: Hoare triple {14677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:25,850 INFO L273 TraceCheckUtils]: 32: Hoare triple {14678#(<= main_~i~0 13)} assume true; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:25,852 INFO L273 TraceCheckUtils]: 33: Hoare triple {14678#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:25,852 INFO L273 TraceCheckUtils]: 34: Hoare triple {14679#(<= main_~i~0 14)} assume true; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:25,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {14679#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:25,854 INFO L273 TraceCheckUtils]: 36: Hoare triple {14680#(<= main_~i~0 15)} assume true; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:25,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {14680#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:25,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {14681#(<= main_~i~0 16)} assume true; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:25,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {14681#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:25,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {14682#(<= main_~i~0 17)} assume true; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:25,860 INFO L273 TraceCheckUtils]: 41: Hoare triple {14682#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:25,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {14683#(<= main_~i~0 18)} assume true; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:25,861 INFO L273 TraceCheckUtils]: 43: Hoare triple {14683#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:25,861 INFO L273 TraceCheckUtils]: 44: Hoare triple {14684#(<= main_~i~0 19)} assume true; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:25,862 INFO L273 TraceCheckUtils]: 45: Hoare triple {14684#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:25,862 INFO L273 TraceCheckUtils]: 46: Hoare triple {14685#(<= main_~i~0 20)} assume true; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:25,864 INFO L273 TraceCheckUtils]: 47: Hoare triple {14685#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:25,866 INFO L273 TraceCheckUtils]: 48: Hoare triple {14686#(<= main_~i~0 21)} assume true; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:25,868 INFO L273 TraceCheckUtils]: 49: Hoare triple {14686#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:25,868 INFO L273 TraceCheckUtils]: 50: Hoare triple {14687#(<= main_~i~0 22)} assume true; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:25,871 INFO L273 TraceCheckUtils]: 51: Hoare triple {14687#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:25,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {14688#(<= main_~i~0 23)} assume true; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:25,874 INFO L273 TraceCheckUtils]: 53: Hoare triple {14688#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:25,874 INFO L273 TraceCheckUtils]: 54: Hoare triple {14689#(<= main_~i~0 24)} assume true; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:25,876 INFO L273 TraceCheckUtils]: 55: Hoare triple {14689#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:25,876 INFO L273 TraceCheckUtils]: 56: Hoare triple {14690#(<= main_~i~0 25)} assume true; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:25,878 INFO L273 TraceCheckUtils]: 57: Hoare triple {14690#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:25,878 INFO L273 TraceCheckUtils]: 58: Hoare triple {14691#(<= main_~i~0 26)} assume true; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:25,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {14691#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:25,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {14692#(<= main_~i~0 27)} assume true; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:25,883 INFO L273 TraceCheckUtils]: 61: Hoare triple {14692#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:25,883 INFO L273 TraceCheckUtils]: 62: Hoare triple {14693#(<= main_~i~0 28)} assume true; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:25,885 INFO L273 TraceCheckUtils]: 63: Hoare triple {14693#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:25,885 INFO L273 TraceCheckUtils]: 64: Hoare triple {14694#(<= main_~i~0 29)} assume true; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:25,887 INFO L273 TraceCheckUtils]: 65: Hoare triple {14694#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:25,887 INFO L273 TraceCheckUtils]: 66: Hoare triple {14695#(<= main_~i~0 30)} assume true; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:25,890 INFO L273 TraceCheckUtils]: 67: Hoare triple {14695#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:25,890 INFO L273 TraceCheckUtils]: 68: Hoare triple {14696#(<= main_~i~0 31)} assume true; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:25,893 INFO L273 TraceCheckUtils]: 69: Hoare triple {14696#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:25,893 INFO L273 TraceCheckUtils]: 70: Hoare triple {14697#(<= main_~i~0 32)} assume true; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:25,896 INFO L273 TraceCheckUtils]: 71: Hoare triple {14697#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:25,896 INFO L273 TraceCheckUtils]: 72: Hoare triple {14698#(<= main_~i~0 33)} assume true; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 73: Hoare triple {14698#(<= main_~i~0 33)} assume !(~i~0 < 100000); {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 74: Hoare triple {14664#false} havoc ~x~0;~x~0 := 0; {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 75: Hoare triple {14664#false} assume true; {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L256 TraceCheckUtils]: 77: Hoare triple {14664#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#false} ~cond := #in~cond; {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#false} assume ~cond == 0; {14664#false} is VALID [2018-11-14 18:44:25,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#false} assume !false; {14664#false} is VALID [2018-11-14 18:44:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:25,903 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:25,903 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:25,912 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:44:33,850 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-14 18:44:33,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:33,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:34,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {14663#true} call ULTIMATE.init(); {14663#true} is VALID [2018-11-14 18:44:34,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {14663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14663#true} is VALID [2018-11-14 18:44:34,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {14663#true} assume true; {14663#true} is VALID [2018-11-14 18:44:34,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14663#true} {14663#true} #50#return; {14663#true} is VALID [2018-11-14 18:44:34,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {14663#true} call #t~ret2 := main(); {14663#true} is VALID [2018-11-14 18:44:34,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {14663#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14717#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:34,116 INFO L273 TraceCheckUtils]: 6: Hoare triple {14717#(<= main_~i~0 0)} assume true; {14717#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:34,117 INFO L273 TraceCheckUtils]: 7: Hoare triple {14717#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:34,117 INFO L273 TraceCheckUtils]: 8: Hoare triple {14666#(<= main_~i~0 1)} assume true; {14666#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:34,118 INFO L273 TraceCheckUtils]: 9: Hoare triple {14666#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:34,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {14667#(<= main_~i~0 2)} assume true; {14667#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:34,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {14667#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:34,119 INFO L273 TraceCheckUtils]: 12: Hoare triple {14668#(<= main_~i~0 3)} assume true; {14668#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:34,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {14668#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:34,120 INFO L273 TraceCheckUtils]: 14: Hoare triple {14669#(<= main_~i~0 4)} assume true; {14669#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:34,121 INFO L273 TraceCheckUtils]: 15: Hoare triple {14669#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:34,121 INFO L273 TraceCheckUtils]: 16: Hoare triple {14670#(<= main_~i~0 5)} assume true; {14670#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:34,122 INFO L273 TraceCheckUtils]: 17: Hoare triple {14670#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:34,123 INFO L273 TraceCheckUtils]: 18: Hoare triple {14671#(<= main_~i~0 6)} assume true; {14671#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:34,123 INFO L273 TraceCheckUtils]: 19: Hoare triple {14671#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:34,124 INFO L273 TraceCheckUtils]: 20: Hoare triple {14672#(<= main_~i~0 7)} assume true; {14672#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:34,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {14672#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:34,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {14673#(<= main_~i~0 8)} assume true; {14673#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:34,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {14673#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:34,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {14674#(<= main_~i~0 9)} assume true; {14674#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:34,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {14674#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:34,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {14675#(<= main_~i~0 10)} assume true; {14675#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:34,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {14675#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:34,129 INFO L273 TraceCheckUtils]: 28: Hoare triple {14676#(<= main_~i~0 11)} assume true; {14676#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:34,130 INFO L273 TraceCheckUtils]: 29: Hoare triple {14676#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:34,131 INFO L273 TraceCheckUtils]: 30: Hoare triple {14677#(<= main_~i~0 12)} assume true; {14677#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:34,131 INFO L273 TraceCheckUtils]: 31: Hoare triple {14677#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:34,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {14678#(<= main_~i~0 13)} assume true; {14678#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:34,133 INFO L273 TraceCheckUtils]: 33: Hoare triple {14678#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:34,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {14679#(<= main_~i~0 14)} assume true; {14679#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:34,134 INFO L273 TraceCheckUtils]: 35: Hoare triple {14679#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:34,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {14680#(<= main_~i~0 15)} assume true; {14680#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:34,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {14680#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:34,136 INFO L273 TraceCheckUtils]: 38: Hoare triple {14681#(<= main_~i~0 16)} assume true; {14681#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:34,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {14681#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:34,137 INFO L273 TraceCheckUtils]: 40: Hoare triple {14682#(<= main_~i~0 17)} assume true; {14682#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:34,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {14682#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:34,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {14683#(<= main_~i~0 18)} assume true; {14683#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:34,139 INFO L273 TraceCheckUtils]: 43: Hoare triple {14683#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:34,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {14684#(<= main_~i~0 19)} assume true; {14684#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:34,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {14684#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:34,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {14685#(<= main_~i~0 20)} assume true; {14685#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:34,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {14685#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:34,143 INFO L273 TraceCheckUtils]: 48: Hoare triple {14686#(<= main_~i~0 21)} assume true; {14686#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:34,144 INFO L273 TraceCheckUtils]: 49: Hoare triple {14686#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:34,144 INFO L273 TraceCheckUtils]: 50: Hoare triple {14687#(<= main_~i~0 22)} assume true; {14687#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:34,145 INFO L273 TraceCheckUtils]: 51: Hoare triple {14687#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:34,146 INFO L273 TraceCheckUtils]: 52: Hoare triple {14688#(<= main_~i~0 23)} assume true; {14688#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:34,146 INFO L273 TraceCheckUtils]: 53: Hoare triple {14688#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:34,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {14689#(<= main_~i~0 24)} assume true; {14689#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:34,148 INFO L273 TraceCheckUtils]: 55: Hoare triple {14689#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:34,148 INFO L273 TraceCheckUtils]: 56: Hoare triple {14690#(<= main_~i~0 25)} assume true; {14690#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:34,149 INFO L273 TraceCheckUtils]: 57: Hoare triple {14690#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:34,150 INFO L273 TraceCheckUtils]: 58: Hoare triple {14691#(<= main_~i~0 26)} assume true; {14691#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:34,150 INFO L273 TraceCheckUtils]: 59: Hoare triple {14691#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:34,151 INFO L273 TraceCheckUtils]: 60: Hoare triple {14692#(<= main_~i~0 27)} assume true; {14692#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:34,152 INFO L273 TraceCheckUtils]: 61: Hoare triple {14692#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:34,152 INFO L273 TraceCheckUtils]: 62: Hoare triple {14693#(<= main_~i~0 28)} assume true; {14693#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:34,153 INFO L273 TraceCheckUtils]: 63: Hoare triple {14693#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:34,154 INFO L273 TraceCheckUtils]: 64: Hoare triple {14694#(<= main_~i~0 29)} assume true; {14694#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:34,154 INFO L273 TraceCheckUtils]: 65: Hoare triple {14694#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:34,155 INFO L273 TraceCheckUtils]: 66: Hoare triple {14695#(<= main_~i~0 30)} assume true; {14695#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:34,156 INFO L273 TraceCheckUtils]: 67: Hoare triple {14695#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:34,156 INFO L273 TraceCheckUtils]: 68: Hoare triple {14696#(<= main_~i~0 31)} assume true; {14696#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:34,157 INFO L273 TraceCheckUtils]: 69: Hoare triple {14696#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:34,158 INFO L273 TraceCheckUtils]: 70: Hoare triple {14697#(<= main_~i~0 32)} assume true; {14697#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:34,158 INFO L273 TraceCheckUtils]: 71: Hoare triple {14697#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:34,159 INFO L273 TraceCheckUtils]: 72: Hoare triple {14698#(<= main_~i~0 33)} assume true; {14698#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:34,160 INFO L273 TraceCheckUtils]: 73: Hoare triple {14698#(<= main_~i~0 33)} assume !(~i~0 < 100000); {14664#false} is VALID [2018-11-14 18:44:34,160 INFO L273 TraceCheckUtils]: 74: Hoare triple {14664#false} havoc ~x~0;~x~0 := 0; {14664#false} is VALID [2018-11-14 18:44:34,160 INFO L273 TraceCheckUtils]: 75: Hoare triple {14664#false} assume true; {14664#false} is VALID [2018-11-14 18:44:34,160 INFO L273 TraceCheckUtils]: 76: Hoare triple {14664#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {14664#false} is VALID [2018-11-14 18:44:34,160 INFO L256 TraceCheckUtils]: 77: Hoare triple {14664#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {14664#false} is VALID [2018-11-14 18:44:34,161 INFO L273 TraceCheckUtils]: 78: Hoare triple {14664#false} ~cond := #in~cond; {14664#false} is VALID [2018-11-14 18:44:34,161 INFO L273 TraceCheckUtils]: 79: Hoare triple {14664#false} assume ~cond == 0; {14664#false} is VALID [2018-11-14 18:44:34,161 INFO L273 TraceCheckUtils]: 80: Hoare triple {14664#false} assume !false; {14664#false} is VALID [2018-11-14 18:44:34,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:34,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:34,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-14 18:44:34,192 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-11-14 18:44:34,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:34,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-14 18:44:34,296 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-14 18:44:34,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-14 18:44:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-14 18:44:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:44:34,298 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 37 states. [2018-11-14 18:44:34,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:34,864 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-11-14 18:44:34,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-14 18:44:34,865 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 81 [2018-11-14 18:44:34,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:34,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:44:34,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2018-11-14 18:44:34,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 18:44:34,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2018-11-14 18:44:34,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 102 transitions. [2018-11-14 18:44:34,954 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-14 18:44:34,956 INFO L225 Difference]: With dead ends: 100 [2018-11-14 18:44:34,956 INFO L226 Difference]: Without dead ends: 88 [2018-11-14 18:44:34,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-14 18:44:34,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-11-14 18:44:34,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-11-14 18:44:34,995 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:34,996 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand 88 states. [2018-11-14 18:44:34,996 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-14 18:44:34,996 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-14 18:44:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:34,998 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-14 18:44:34,998 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 18:44:34,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:34,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:34,999 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand 88 states. [2018-11-14 18:44:34,999 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 88 states. [2018-11-14 18:44:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:35,000 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-11-14 18:44:35,000 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 18:44:35,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:35,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:35,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:35,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-14 18:44:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-11-14 18:44:35,002 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 81 [2018-11-14 18:44:35,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:35,003 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-11-14 18:44:35,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-14 18:44:35,003 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-11-14 18:44:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-14 18:44:35,004 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:35,004 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:35,004 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:35,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:35,004 INFO L82 PathProgramCache]: Analyzing trace with hash 713788136, now seen corresponding path program 34 times [2018-11-14 18:44:35,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:35,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:35,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:35,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:36,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {15393#true} call ULTIMATE.init(); {15393#true} is VALID [2018-11-14 18:44:36,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {15393#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15393#true} is VALID [2018-11-14 18:44:36,375 INFO L273 TraceCheckUtils]: 2: Hoare triple {15393#true} assume true; {15393#true} is VALID [2018-11-14 18:44:36,376 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15393#true} {15393#true} #50#return; {15393#true} is VALID [2018-11-14 18:44:36,376 INFO L256 TraceCheckUtils]: 4: Hoare triple {15393#true} call #t~ret2 := main(); {15393#true} is VALID [2018-11-14 18:44:36,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {15393#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15395#(= main_~i~0 0)} is VALID [2018-11-14 18:44:36,380 INFO L273 TraceCheckUtils]: 6: Hoare triple {15395#(= main_~i~0 0)} assume true; {15395#(= main_~i~0 0)} is VALID [2018-11-14 18:44:36,380 INFO L273 TraceCheckUtils]: 7: Hoare triple {15395#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:36,381 INFO L273 TraceCheckUtils]: 8: Hoare triple {15396#(<= main_~i~0 1)} assume true; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:36,381 INFO L273 TraceCheckUtils]: 9: Hoare triple {15396#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:36,382 INFO L273 TraceCheckUtils]: 10: Hoare triple {15397#(<= main_~i~0 2)} assume true; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:36,382 INFO L273 TraceCheckUtils]: 11: Hoare triple {15397#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:36,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {15398#(<= main_~i~0 3)} assume true; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:36,410 INFO L273 TraceCheckUtils]: 13: Hoare triple {15398#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:36,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {15399#(<= main_~i~0 4)} assume true; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:36,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {15399#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:36,448 INFO L273 TraceCheckUtils]: 16: Hoare triple {15400#(<= main_~i~0 5)} assume true; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:36,461 INFO L273 TraceCheckUtils]: 17: Hoare triple {15400#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:36,473 INFO L273 TraceCheckUtils]: 18: Hoare triple {15401#(<= main_~i~0 6)} assume true; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:36,486 INFO L273 TraceCheckUtils]: 19: Hoare triple {15401#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:36,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {15402#(<= main_~i~0 7)} assume true; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:36,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {15402#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:36,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {15403#(<= main_~i~0 8)} assume true; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:36,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {15403#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:36,550 INFO L273 TraceCheckUtils]: 24: Hoare triple {15404#(<= main_~i~0 9)} assume true; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:36,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {15404#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:36,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {15405#(<= main_~i~0 10)} assume true; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:36,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {15405#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:36,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {15406#(<= main_~i~0 11)} assume true; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:36,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {15406#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:36,625 INFO L273 TraceCheckUtils]: 30: Hoare triple {15407#(<= main_~i~0 12)} assume true; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:36,637 INFO L273 TraceCheckUtils]: 31: Hoare triple {15407#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:36,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {15408#(<= main_~i~0 13)} assume true; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:36,663 INFO L273 TraceCheckUtils]: 33: Hoare triple {15408#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:36,675 INFO L273 TraceCheckUtils]: 34: Hoare triple {15409#(<= main_~i~0 14)} assume true; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:36,684 INFO L273 TraceCheckUtils]: 35: Hoare triple {15409#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:36,684 INFO L273 TraceCheckUtils]: 36: Hoare triple {15410#(<= main_~i~0 15)} assume true; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:36,685 INFO L273 TraceCheckUtils]: 37: Hoare triple {15410#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:36,685 INFO L273 TraceCheckUtils]: 38: Hoare triple {15411#(<= main_~i~0 16)} assume true; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:36,691 INFO L273 TraceCheckUtils]: 39: Hoare triple {15411#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:36,691 INFO L273 TraceCheckUtils]: 40: Hoare triple {15412#(<= main_~i~0 17)} assume true; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:36,692 INFO L273 TraceCheckUtils]: 41: Hoare triple {15412#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:36,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {15413#(<= main_~i~0 18)} assume true; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:36,692 INFO L273 TraceCheckUtils]: 43: Hoare triple {15413#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:36,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {15414#(<= main_~i~0 19)} assume true; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:36,693 INFO L273 TraceCheckUtils]: 45: Hoare triple {15414#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:36,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {15415#(<= main_~i~0 20)} assume true; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:36,694 INFO L273 TraceCheckUtils]: 47: Hoare triple {15415#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:36,695 INFO L273 TraceCheckUtils]: 48: Hoare triple {15416#(<= main_~i~0 21)} assume true; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:36,696 INFO L273 TraceCheckUtils]: 49: Hoare triple {15416#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:36,696 INFO L273 TraceCheckUtils]: 50: Hoare triple {15417#(<= main_~i~0 22)} assume true; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:36,697 INFO L273 TraceCheckUtils]: 51: Hoare triple {15417#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:36,698 INFO L273 TraceCheckUtils]: 52: Hoare triple {15418#(<= main_~i~0 23)} assume true; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:36,699 INFO L273 TraceCheckUtils]: 53: Hoare triple {15418#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:36,699 INFO L273 TraceCheckUtils]: 54: Hoare triple {15419#(<= main_~i~0 24)} assume true; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:36,700 INFO L273 TraceCheckUtils]: 55: Hoare triple {15419#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:36,701 INFO L273 TraceCheckUtils]: 56: Hoare triple {15420#(<= main_~i~0 25)} assume true; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:36,701 INFO L273 TraceCheckUtils]: 57: Hoare triple {15420#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:36,702 INFO L273 TraceCheckUtils]: 58: Hoare triple {15421#(<= main_~i~0 26)} assume true; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:36,703 INFO L273 TraceCheckUtils]: 59: Hoare triple {15421#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:36,703 INFO L273 TraceCheckUtils]: 60: Hoare triple {15422#(<= main_~i~0 27)} assume true; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:36,704 INFO L273 TraceCheckUtils]: 61: Hoare triple {15422#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:36,705 INFO L273 TraceCheckUtils]: 62: Hoare triple {15423#(<= main_~i~0 28)} assume true; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:36,706 INFO L273 TraceCheckUtils]: 63: Hoare triple {15423#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:36,706 INFO L273 TraceCheckUtils]: 64: Hoare triple {15424#(<= main_~i~0 29)} assume true; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:36,707 INFO L273 TraceCheckUtils]: 65: Hoare triple {15424#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:36,708 INFO L273 TraceCheckUtils]: 66: Hoare triple {15425#(<= main_~i~0 30)} assume true; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:36,708 INFO L273 TraceCheckUtils]: 67: Hoare triple {15425#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:36,709 INFO L273 TraceCheckUtils]: 68: Hoare triple {15426#(<= main_~i~0 31)} assume true; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:36,710 INFO L273 TraceCheckUtils]: 69: Hoare triple {15426#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:36,710 INFO L273 TraceCheckUtils]: 70: Hoare triple {15427#(<= main_~i~0 32)} assume true; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:36,711 INFO L273 TraceCheckUtils]: 71: Hoare triple {15427#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:36,712 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#(<= main_~i~0 33)} assume true; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:36,713 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:36,713 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#(<= main_~i~0 34)} assume true; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:36,714 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#(<= main_~i~0 34)} assume !(~i~0 < 100000); {15394#false} is VALID [2018-11-14 18:44:36,714 INFO L273 TraceCheckUtils]: 76: Hoare triple {15394#false} havoc ~x~0;~x~0 := 0; {15394#false} is VALID [2018-11-14 18:44:36,714 INFO L273 TraceCheckUtils]: 77: Hoare triple {15394#false} assume true; {15394#false} is VALID [2018-11-14 18:44:36,714 INFO L273 TraceCheckUtils]: 78: Hoare triple {15394#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15394#false} is VALID [2018-11-14 18:44:36,715 INFO L256 TraceCheckUtils]: 79: Hoare triple {15394#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {15394#false} is VALID [2018-11-14 18:44:36,715 INFO L273 TraceCheckUtils]: 80: Hoare triple {15394#false} ~cond := #in~cond; {15394#false} is VALID [2018-11-14 18:44:36,715 INFO L273 TraceCheckUtils]: 81: Hoare triple {15394#false} assume ~cond == 0; {15394#false} is VALID [2018-11-14 18:44:36,715 INFO L273 TraceCheckUtils]: 82: Hoare triple {15394#false} assume !false; {15394#false} is VALID [2018-11-14 18:44:36,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:36,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:36,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:36,728 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:44:36,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:44:36,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:36,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:37,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {15393#true} call ULTIMATE.init(); {15393#true} is VALID [2018-11-14 18:44:37,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {15393#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15393#true} is VALID [2018-11-14 18:44:37,001 INFO L273 TraceCheckUtils]: 2: Hoare triple {15393#true} assume true; {15393#true} is VALID [2018-11-14 18:44:37,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15393#true} {15393#true} #50#return; {15393#true} is VALID [2018-11-14 18:44:37,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {15393#true} call #t~ret2 := main(); {15393#true} is VALID [2018-11-14 18:44:37,002 INFO L273 TraceCheckUtils]: 5: Hoare triple {15393#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15448#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:37,002 INFO L273 TraceCheckUtils]: 6: Hoare triple {15448#(<= main_~i~0 0)} assume true; {15448#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:37,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {15448#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:37,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {15396#(<= main_~i~0 1)} assume true; {15396#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:37,003 INFO L273 TraceCheckUtils]: 9: Hoare triple {15396#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:37,004 INFO L273 TraceCheckUtils]: 10: Hoare triple {15397#(<= main_~i~0 2)} assume true; {15397#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:37,004 INFO L273 TraceCheckUtils]: 11: Hoare triple {15397#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:37,005 INFO L273 TraceCheckUtils]: 12: Hoare triple {15398#(<= main_~i~0 3)} assume true; {15398#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:37,005 INFO L273 TraceCheckUtils]: 13: Hoare triple {15398#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:37,006 INFO L273 TraceCheckUtils]: 14: Hoare triple {15399#(<= main_~i~0 4)} assume true; {15399#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:37,007 INFO L273 TraceCheckUtils]: 15: Hoare triple {15399#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:37,007 INFO L273 TraceCheckUtils]: 16: Hoare triple {15400#(<= main_~i~0 5)} assume true; {15400#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:37,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {15400#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:37,009 INFO L273 TraceCheckUtils]: 18: Hoare triple {15401#(<= main_~i~0 6)} assume true; {15401#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:37,010 INFO L273 TraceCheckUtils]: 19: Hoare triple {15401#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:37,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {15402#(<= main_~i~0 7)} assume true; {15402#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:37,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {15402#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:37,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {15403#(<= main_~i~0 8)} assume true; {15403#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:37,012 INFO L273 TraceCheckUtils]: 23: Hoare triple {15403#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:37,013 INFO L273 TraceCheckUtils]: 24: Hoare triple {15404#(<= main_~i~0 9)} assume true; {15404#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:37,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {15404#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:37,014 INFO L273 TraceCheckUtils]: 26: Hoare triple {15405#(<= main_~i~0 10)} assume true; {15405#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:37,015 INFO L273 TraceCheckUtils]: 27: Hoare triple {15405#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:37,016 INFO L273 TraceCheckUtils]: 28: Hoare triple {15406#(<= main_~i~0 11)} assume true; {15406#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:37,017 INFO L273 TraceCheckUtils]: 29: Hoare triple {15406#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:37,017 INFO L273 TraceCheckUtils]: 30: Hoare triple {15407#(<= main_~i~0 12)} assume true; {15407#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:37,018 INFO L273 TraceCheckUtils]: 31: Hoare triple {15407#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:37,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {15408#(<= main_~i~0 13)} assume true; {15408#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:37,019 INFO L273 TraceCheckUtils]: 33: Hoare triple {15408#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:37,020 INFO L273 TraceCheckUtils]: 34: Hoare triple {15409#(<= main_~i~0 14)} assume true; {15409#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:37,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {15409#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:37,021 INFO L273 TraceCheckUtils]: 36: Hoare triple {15410#(<= main_~i~0 15)} assume true; {15410#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:37,022 INFO L273 TraceCheckUtils]: 37: Hoare triple {15410#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:37,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {15411#(<= main_~i~0 16)} assume true; {15411#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:37,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {15411#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:37,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {15412#(<= main_~i~0 17)} assume true; {15412#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:37,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {15412#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:37,026 INFO L273 TraceCheckUtils]: 42: Hoare triple {15413#(<= main_~i~0 18)} assume true; {15413#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:37,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {15413#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:37,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {15414#(<= main_~i~0 19)} assume true; {15414#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:37,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {15414#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:37,028 INFO L273 TraceCheckUtils]: 46: Hoare triple {15415#(<= main_~i~0 20)} assume true; {15415#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:37,029 INFO L273 TraceCheckUtils]: 47: Hoare triple {15415#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:37,030 INFO L273 TraceCheckUtils]: 48: Hoare triple {15416#(<= main_~i~0 21)} assume true; {15416#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:37,031 INFO L273 TraceCheckUtils]: 49: Hoare triple {15416#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:37,031 INFO L273 TraceCheckUtils]: 50: Hoare triple {15417#(<= main_~i~0 22)} assume true; {15417#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:37,032 INFO L273 TraceCheckUtils]: 51: Hoare triple {15417#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:37,033 INFO L273 TraceCheckUtils]: 52: Hoare triple {15418#(<= main_~i~0 23)} assume true; {15418#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:37,033 INFO L273 TraceCheckUtils]: 53: Hoare triple {15418#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:37,034 INFO L273 TraceCheckUtils]: 54: Hoare triple {15419#(<= main_~i~0 24)} assume true; {15419#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:37,035 INFO L273 TraceCheckUtils]: 55: Hoare triple {15419#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:37,035 INFO L273 TraceCheckUtils]: 56: Hoare triple {15420#(<= main_~i~0 25)} assume true; {15420#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:37,036 INFO L273 TraceCheckUtils]: 57: Hoare triple {15420#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:37,037 INFO L273 TraceCheckUtils]: 58: Hoare triple {15421#(<= main_~i~0 26)} assume true; {15421#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:37,038 INFO L273 TraceCheckUtils]: 59: Hoare triple {15421#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:37,038 INFO L273 TraceCheckUtils]: 60: Hoare triple {15422#(<= main_~i~0 27)} assume true; {15422#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:37,039 INFO L273 TraceCheckUtils]: 61: Hoare triple {15422#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:37,040 INFO L273 TraceCheckUtils]: 62: Hoare triple {15423#(<= main_~i~0 28)} assume true; {15423#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:37,040 INFO L273 TraceCheckUtils]: 63: Hoare triple {15423#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:37,041 INFO L273 TraceCheckUtils]: 64: Hoare triple {15424#(<= main_~i~0 29)} assume true; {15424#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:37,042 INFO L273 TraceCheckUtils]: 65: Hoare triple {15424#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:37,042 INFO L273 TraceCheckUtils]: 66: Hoare triple {15425#(<= main_~i~0 30)} assume true; {15425#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:37,043 INFO L273 TraceCheckUtils]: 67: Hoare triple {15425#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:37,044 INFO L273 TraceCheckUtils]: 68: Hoare triple {15426#(<= main_~i~0 31)} assume true; {15426#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:37,045 INFO L273 TraceCheckUtils]: 69: Hoare triple {15426#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:37,045 INFO L273 TraceCheckUtils]: 70: Hoare triple {15427#(<= main_~i~0 32)} assume true; {15427#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:37,046 INFO L273 TraceCheckUtils]: 71: Hoare triple {15427#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:37,047 INFO L273 TraceCheckUtils]: 72: Hoare triple {15428#(<= main_~i~0 33)} assume true; {15428#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:37,047 INFO L273 TraceCheckUtils]: 73: Hoare triple {15428#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:37,048 INFO L273 TraceCheckUtils]: 74: Hoare triple {15429#(<= main_~i~0 34)} assume true; {15429#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:37,049 INFO L273 TraceCheckUtils]: 75: Hoare triple {15429#(<= main_~i~0 34)} assume !(~i~0 < 100000); {15394#false} is VALID [2018-11-14 18:44:37,049 INFO L273 TraceCheckUtils]: 76: Hoare triple {15394#false} havoc ~x~0;~x~0 := 0; {15394#false} is VALID [2018-11-14 18:44:37,049 INFO L273 TraceCheckUtils]: 77: Hoare triple {15394#false} assume true; {15394#false} is VALID [2018-11-14 18:44:37,049 INFO L273 TraceCheckUtils]: 78: Hoare triple {15394#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {15394#false} is VALID [2018-11-14 18:44:37,049 INFO L256 TraceCheckUtils]: 79: Hoare triple {15394#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {15394#false} is VALID [2018-11-14 18:44:37,050 INFO L273 TraceCheckUtils]: 80: Hoare triple {15394#false} ~cond := #in~cond; {15394#false} is VALID [2018-11-14 18:44:37,050 INFO L273 TraceCheckUtils]: 81: Hoare triple {15394#false} assume ~cond == 0; {15394#false} is VALID [2018-11-14 18:44:37,050 INFO L273 TraceCheckUtils]: 82: Hoare triple {15394#false} assume !false; {15394#false} is VALID [2018-11-14 18:44:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:37,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:37,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-14 18:44:37,077 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-11-14 18:44:37,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:37,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-14 18:44:37,236 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:37,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-14 18:44:37,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-14 18:44:37,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:44:37,237 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 38 states. [2018-11-14 18:44:37,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:37,857 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2018-11-14 18:44:37,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-14 18:44:37,857 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-11-14 18:44:37,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:44:37,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:44:37,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2018-11-14 18:44:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-14 18:44:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2018-11-14 18:44:37,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 104 transitions. [2018-11-14 18:44:37,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:44:37,978 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:44:37,978 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 18:44:37,979 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 18:44:37,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 18:44:38,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-14 18:44:38,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:44:38,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2018-11-14 18:44:38,017 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-14 18:44:38,017 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-14 18:44:38,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:38,019 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-11-14 18:44:38,020 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-14 18:44:38,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:38,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:38,021 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-14 18:44:38,021 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-14 18:44:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:44:38,022 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-11-14 18:44:38,022 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-14 18:44:38,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:44:38,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:44:38,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:44:38,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:44:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 18:44:38,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-11-14 18:44:38,024 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 83 [2018-11-14 18:44:38,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:44:38,025 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-11-14 18:44:38,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-14 18:44:38,025 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-11-14 18:44:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:44:38,025 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:44:38,026 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:44:38,026 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:44:38,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:44:38,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1256308670, now seen corresponding path program 35 times [2018-11-14 18:44:38,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:44:38,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:44:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:38,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:44:38,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:44:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:38,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {16140#true} call ULTIMATE.init(); {16140#true} is VALID [2018-11-14 18:44:38,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {16140#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16140#true} is VALID [2018-11-14 18:44:38,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {16140#true} assume true; {16140#true} is VALID [2018-11-14 18:44:38,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16140#true} {16140#true} #50#return; {16140#true} is VALID [2018-11-14 18:44:38,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {16140#true} call #t~ret2 := main(); {16140#true} is VALID [2018-11-14 18:44:38,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {16140#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16142#(= main_~i~0 0)} is VALID [2018-11-14 18:44:38,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {16142#(= main_~i~0 0)} assume true; {16142#(= main_~i~0 0)} is VALID [2018-11-14 18:44:38,822 INFO L273 TraceCheckUtils]: 7: Hoare triple {16142#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16143#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:38,823 INFO L273 TraceCheckUtils]: 8: Hoare triple {16143#(<= main_~i~0 1)} assume true; {16143#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:38,823 INFO L273 TraceCheckUtils]: 9: Hoare triple {16143#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16144#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:38,824 INFO L273 TraceCheckUtils]: 10: Hoare triple {16144#(<= main_~i~0 2)} assume true; {16144#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:38,825 INFO L273 TraceCheckUtils]: 11: Hoare triple {16144#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16145#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:38,825 INFO L273 TraceCheckUtils]: 12: Hoare triple {16145#(<= main_~i~0 3)} assume true; {16145#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:38,826 INFO L273 TraceCheckUtils]: 13: Hoare triple {16145#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16146#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:38,827 INFO L273 TraceCheckUtils]: 14: Hoare triple {16146#(<= main_~i~0 4)} assume true; {16146#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:38,828 INFO L273 TraceCheckUtils]: 15: Hoare triple {16146#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16147#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:38,828 INFO L273 TraceCheckUtils]: 16: Hoare triple {16147#(<= main_~i~0 5)} assume true; {16147#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:38,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {16147#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16148#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:38,830 INFO L273 TraceCheckUtils]: 18: Hoare triple {16148#(<= main_~i~0 6)} assume true; {16148#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:38,830 INFO L273 TraceCheckUtils]: 19: Hoare triple {16148#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16149#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:38,831 INFO L273 TraceCheckUtils]: 20: Hoare triple {16149#(<= main_~i~0 7)} assume true; {16149#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:38,832 INFO L273 TraceCheckUtils]: 21: Hoare triple {16149#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16150#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:38,832 INFO L273 TraceCheckUtils]: 22: Hoare triple {16150#(<= main_~i~0 8)} assume true; {16150#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:38,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {16150#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16151#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:38,834 INFO L273 TraceCheckUtils]: 24: Hoare triple {16151#(<= main_~i~0 9)} assume true; {16151#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:38,835 INFO L273 TraceCheckUtils]: 25: Hoare triple {16151#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16152#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:38,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {16152#(<= main_~i~0 10)} assume true; {16152#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:38,836 INFO L273 TraceCheckUtils]: 27: Hoare triple {16152#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16153#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:38,837 INFO L273 TraceCheckUtils]: 28: Hoare triple {16153#(<= main_~i~0 11)} assume true; {16153#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:38,838 INFO L273 TraceCheckUtils]: 29: Hoare triple {16153#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16154#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:38,838 INFO L273 TraceCheckUtils]: 30: Hoare triple {16154#(<= main_~i~0 12)} assume true; {16154#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:38,839 INFO L273 TraceCheckUtils]: 31: Hoare triple {16154#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16155#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:38,839 INFO L273 TraceCheckUtils]: 32: Hoare triple {16155#(<= main_~i~0 13)} assume true; {16155#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:38,840 INFO L273 TraceCheckUtils]: 33: Hoare triple {16155#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16156#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:38,841 INFO L273 TraceCheckUtils]: 34: Hoare triple {16156#(<= main_~i~0 14)} assume true; {16156#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:38,842 INFO L273 TraceCheckUtils]: 35: Hoare triple {16156#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16157#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:38,842 INFO L273 TraceCheckUtils]: 36: Hoare triple {16157#(<= main_~i~0 15)} assume true; {16157#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:38,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {16157#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16158#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:38,844 INFO L273 TraceCheckUtils]: 38: Hoare triple {16158#(<= main_~i~0 16)} assume true; {16158#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:38,845 INFO L273 TraceCheckUtils]: 39: Hoare triple {16158#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16159#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:38,845 INFO L273 TraceCheckUtils]: 40: Hoare triple {16159#(<= main_~i~0 17)} assume true; {16159#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:38,846 INFO L273 TraceCheckUtils]: 41: Hoare triple {16159#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16160#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:38,847 INFO L273 TraceCheckUtils]: 42: Hoare triple {16160#(<= main_~i~0 18)} assume true; {16160#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:38,847 INFO L273 TraceCheckUtils]: 43: Hoare triple {16160#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16161#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:38,848 INFO L273 TraceCheckUtils]: 44: Hoare triple {16161#(<= main_~i~0 19)} assume true; {16161#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:38,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {16161#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16162#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:38,849 INFO L273 TraceCheckUtils]: 46: Hoare triple {16162#(<= main_~i~0 20)} assume true; {16162#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:38,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {16162#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16163#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:38,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {16163#(<= main_~i~0 21)} assume true; {16163#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:38,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {16163#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16164#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:38,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {16164#(<= main_~i~0 22)} assume true; {16164#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:38,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {16164#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16165#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:38,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {16165#(<= main_~i~0 23)} assume true; {16165#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:38,855 INFO L273 TraceCheckUtils]: 53: Hoare triple {16165#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16166#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:38,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#(<= main_~i~0 24)} assume true; {16166#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:38,856 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16167#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:38,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {16167#(<= main_~i~0 25)} assume true; {16167#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:38,857 INFO L273 TraceCheckUtils]: 57: Hoare triple {16167#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16168#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:38,858 INFO L273 TraceCheckUtils]: 58: Hoare triple {16168#(<= main_~i~0 26)} assume true; {16168#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:38,859 INFO L273 TraceCheckUtils]: 59: Hoare triple {16168#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16169#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:38,859 INFO L273 TraceCheckUtils]: 60: Hoare triple {16169#(<= main_~i~0 27)} assume true; {16169#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:38,860 INFO L273 TraceCheckUtils]: 61: Hoare triple {16169#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16170#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:38,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {16170#(<= main_~i~0 28)} assume true; {16170#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:38,862 INFO L273 TraceCheckUtils]: 63: Hoare triple {16170#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16171#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:38,862 INFO L273 TraceCheckUtils]: 64: Hoare triple {16171#(<= main_~i~0 29)} assume true; {16171#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:38,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {16171#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16172#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:38,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {16172#(<= main_~i~0 30)} assume true; {16172#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:38,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {16172#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16173#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:38,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {16173#(<= main_~i~0 31)} assume true; {16173#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:38,866 INFO L273 TraceCheckUtils]: 69: Hoare triple {16173#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16174#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:38,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {16174#(<= main_~i~0 32)} assume true; {16174#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:38,867 INFO L273 TraceCheckUtils]: 71: Hoare triple {16174#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16175#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:38,868 INFO L273 TraceCheckUtils]: 72: Hoare triple {16175#(<= main_~i~0 33)} assume true; {16175#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:38,869 INFO L273 TraceCheckUtils]: 73: Hoare triple {16175#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16176#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:38,869 INFO L273 TraceCheckUtils]: 74: Hoare triple {16176#(<= main_~i~0 34)} assume true; {16176#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:38,870 INFO L273 TraceCheckUtils]: 75: Hoare triple {16176#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16177#(<= main_~i~0 35)} is VALID [2018-11-14 18:44:38,871 INFO L273 TraceCheckUtils]: 76: Hoare triple {16177#(<= main_~i~0 35)} assume true; {16177#(<= main_~i~0 35)} is VALID [2018-11-14 18:44:38,871 INFO L273 TraceCheckUtils]: 77: Hoare triple {16177#(<= main_~i~0 35)} assume !(~i~0 < 100000); {16141#false} is VALID [2018-11-14 18:44:38,872 INFO L273 TraceCheckUtils]: 78: Hoare triple {16141#false} havoc ~x~0;~x~0 := 0; {16141#false} is VALID [2018-11-14 18:44:38,872 INFO L273 TraceCheckUtils]: 79: Hoare triple {16141#false} assume true; {16141#false} is VALID [2018-11-14 18:44:38,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {16141#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {16141#false} is VALID [2018-11-14 18:44:38,872 INFO L256 TraceCheckUtils]: 81: Hoare triple {16141#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {16141#false} is VALID [2018-11-14 18:44:38,872 INFO L273 TraceCheckUtils]: 82: Hoare triple {16141#false} ~cond := #in~cond; {16141#false} is VALID [2018-11-14 18:44:38,873 INFO L273 TraceCheckUtils]: 83: Hoare triple {16141#false} assume ~cond == 0; {16141#false} is VALID [2018-11-14 18:44:38,873 INFO L273 TraceCheckUtils]: 84: Hoare triple {16141#false} assume !false; {16141#false} is VALID [2018-11-14 18:44:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:38,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:44:38,879 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 18:44:38,887 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 18:44:40,104 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-14 18:44:40,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:44:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:44:40,124 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:44:40,373 INFO L256 TraceCheckUtils]: 0: Hoare triple {16140#true} call ULTIMATE.init(); {16140#true} is VALID [2018-11-14 18:44:40,373 INFO L273 TraceCheckUtils]: 1: Hoare triple {16140#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16140#true} is VALID [2018-11-14 18:44:40,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {16140#true} assume true; {16140#true} is VALID [2018-11-14 18:44:40,374 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16140#true} {16140#true} #50#return; {16140#true} is VALID [2018-11-14 18:44:40,374 INFO L256 TraceCheckUtils]: 4: Hoare triple {16140#true} call #t~ret2 := main(); {16140#true} is VALID [2018-11-14 18:44:40,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {16140#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16196#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:40,375 INFO L273 TraceCheckUtils]: 6: Hoare triple {16196#(<= main_~i~0 0)} assume true; {16196#(<= main_~i~0 0)} is VALID [2018-11-14 18:44:40,376 INFO L273 TraceCheckUtils]: 7: Hoare triple {16196#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16143#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:40,376 INFO L273 TraceCheckUtils]: 8: Hoare triple {16143#(<= main_~i~0 1)} assume true; {16143#(<= main_~i~0 1)} is VALID [2018-11-14 18:44:40,377 INFO L273 TraceCheckUtils]: 9: Hoare triple {16143#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16144#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:40,377 INFO L273 TraceCheckUtils]: 10: Hoare triple {16144#(<= main_~i~0 2)} assume true; {16144#(<= main_~i~0 2)} is VALID [2018-11-14 18:44:40,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {16144#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16145#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:40,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {16145#(<= main_~i~0 3)} assume true; {16145#(<= main_~i~0 3)} is VALID [2018-11-14 18:44:40,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {16145#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16146#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:40,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {16146#(<= main_~i~0 4)} assume true; {16146#(<= main_~i~0 4)} is VALID [2018-11-14 18:44:40,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {16146#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16147#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:40,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {16147#(<= main_~i~0 5)} assume true; {16147#(<= main_~i~0 5)} is VALID [2018-11-14 18:44:40,382 INFO L273 TraceCheckUtils]: 17: Hoare triple {16147#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16148#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:40,383 INFO L273 TraceCheckUtils]: 18: Hoare triple {16148#(<= main_~i~0 6)} assume true; {16148#(<= main_~i~0 6)} is VALID [2018-11-14 18:44:40,383 INFO L273 TraceCheckUtils]: 19: Hoare triple {16148#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16149#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:40,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {16149#(<= main_~i~0 7)} assume true; {16149#(<= main_~i~0 7)} is VALID [2018-11-14 18:44:40,385 INFO L273 TraceCheckUtils]: 21: Hoare triple {16149#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16150#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:40,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {16150#(<= main_~i~0 8)} assume true; {16150#(<= main_~i~0 8)} is VALID [2018-11-14 18:44:40,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {16150#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16151#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:40,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {16151#(<= main_~i~0 9)} assume true; {16151#(<= main_~i~0 9)} is VALID [2018-11-14 18:44:40,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {16151#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16152#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:40,388 INFO L273 TraceCheckUtils]: 26: Hoare triple {16152#(<= main_~i~0 10)} assume true; {16152#(<= main_~i~0 10)} is VALID [2018-11-14 18:44:40,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {16152#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16153#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:40,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {16153#(<= main_~i~0 11)} assume true; {16153#(<= main_~i~0 11)} is VALID [2018-11-14 18:44:40,390 INFO L273 TraceCheckUtils]: 29: Hoare triple {16153#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16154#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:40,391 INFO L273 TraceCheckUtils]: 30: Hoare triple {16154#(<= main_~i~0 12)} assume true; {16154#(<= main_~i~0 12)} is VALID [2018-11-14 18:44:40,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {16154#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16155#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:40,392 INFO L273 TraceCheckUtils]: 32: Hoare triple {16155#(<= main_~i~0 13)} assume true; {16155#(<= main_~i~0 13)} is VALID [2018-11-14 18:44:40,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {16155#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16156#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:40,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {16156#(<= main_~i~0 14)} assume true; {16156#(<= main_~i~0 14)} is VALID [2018-11-14 18:44:40,395 INFO L273 TraceCheckUtils]: 35: Hoare triple {16156#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16157#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:40,395 INFO L273 TraceCheckUtils]: 36: Hoare triple {16157#(<= main_~i~0 15)} assume true; {16157#(<= main_~i~0 15)} is VALID [2018-11-14 18:44:40,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {16157#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16158#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:40,397 INFO L273 TraceCheckUtils]: 38: Hoare triple {16158#(<= main_~i~0 16)} assume true; {16158#(<= main_~i~0 16)} is VALID [2018-11-14 18:44:40,398 INFO L273 TraceCheckUtils]: 39: Hoare triple {16158#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16159#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:40,398 INFO L273 TraceCheckUtils]: 40: Hoare triple {16159#(<= main_~i~0 17)} assume true; {16159#(<= main_~i~0 17)} is VALID [2018-11-14 18:44:40,399 INFO L273 TraceCheckUtils]: 41: Hoare triple {16159#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16160#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:40,399 INFO L273 TraceCheckUtils]: 42: Hoare triple {16160#(<= main_~i~0 18)} assume true; {16160#(<= main_~i~0 18)} is VALID [2018-11-14 18:44:40,400 INFO L273 TraceCheckUtils]: 43: Hoare triple {16160#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16161#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:40,401 INFO L273 TraceCheckUtils]: 44: Hoare triple {16161#(<= main_~i~0 19)} assume true; {16161#(<= main_~i~0 19)} is VALID [2018-11-14 18:44:40,402 INFO L273 TraceCheckUtils]: 45: Hoare triple {16161#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16162#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:40,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {16162#(<= main_~i~0 20)} assume true; {16162#(<= main_~i~0 20)} is VALID [2018-11-14 18:44:40,403 INFO L273 TraceCheckUtils]: 47: Hoare triple {16162#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16163#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:40,404 INFO L273 TraceCheckUtils]: 48: Hoare triple {16163#(<= main_~i~0 21)} assume true; {16163#(<= main_~i~0 21)} is VALID [2018-11-14 18:44:40,405 INFO L273 TraceCheckUtils]: 49: Hoare triple {16163#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16164#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:40,405 INFO L273 TraceCheckUtils]: 50: Hoare triple {16164#(<= main_~i~0 22)} assume true; {16164#(<= main_~i~0 22)} is VALID [2018-11-14 18:44:40,406 INFO L273 TraceCheckUtils]: 51: Hoare triple {16164#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16165#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:40,407 INFO L273 TraceCheckUtils]: 52: Hoare triple {16165#(<= main_~i~0 23)} assume true; {16165#(<= main_~i~0 23)} is VALID [2018-11-14 18:44:40,407 INFO L273 TraceCheckUtils]: 53: Hoare triple {16165#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16166#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:40,408 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#(<= main_~i~0 24)} assume true; {16166#(<= main_~i~0 24)} is VALID [2018-11-14 18:44:40,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16167#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:40,409 INFO L273 TraceCheckUtils]: 56: Hoare triple {16167#(<= main_~i~0 25)} assume true; {16167#(<= main_~i~0 25)} is VALID [2018-11-14 18:44:40,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {16167#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16168#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:40,411 INFO L273 TraceCheckUtils]: 58: Hoare triple {16168#(<= main_~i~0 26)} assume true; {16168#(<= main_~i~0 26)} is VALID [2018-11-14 18:44:40,412 INFO L273 TraceCheckUtils]: 59: Hoare triple {16168#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16169#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:40,412 INFO L273 TraceCheckUtils]: 60: Hoare triple {16169#(<= main_~i~0 27)} assume true; {16169#(<= main_~i~0 27)} is VALID [2018-11-14 18:44:40,413 INFO L273 TraceCheckUtils]: 61: Hoare triple {16169#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16170#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:40,414 INFO L273 TraceCheckUtils]: 62: Hoare triple {16170#(<= main_~i~0 28)} assume true; {16170#(<= main_~i~0 28)} is VALID [2018-11-14 18:44:40,414 INFO L273 TraceCheckUtils]: 63: Hoare triple {16170#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16171#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:40,415 INFO L273 TraceCheckUtils]: 64: Hoare triple {16171#(<= main_~i~0 29)} assume true; {16171#(<= main_~i~0 29)} is VALID [2018-11-14 18:44:40,416 INFO L273 TraceCheckUtils]: 65: Hoare triple {16171#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16172#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:40,416 INFO L273 TraceCheckUtils]: 66: Hoare triple {16172#(<= main_~i~0 30)} assume true; {16172#(<= main_~i~0 30)} is VALID [2018-11-14 18:44:40,417 INFO L273 TraceCheckUtils]: 67: Hoare triple {16172#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16173#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:40,418 INFO L273 TraceCheckUtils]: 68: Hoare triple {16173#(<= main_~i~0 31)} assume true; {16173#(<= main_~i~0 31)} is VALID [2018-11-14 18:44:40,419 INFO L273 TraceCheckUtils]: 69: Hoare triple {16173#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16174#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:40,419 INFO L273 TraceCheckUtils]: 70: Hoare triple {16174#(<= main_~i~0 32)} assume true; {16174#(<= main_~i~0 32)} is VALID [2018-11-14 18:44:40,420 INFO L273 TraceCheckUtils]: 71: Hoare triple {16174#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16175#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:40,421 INFO L273 TraceCheckUtils]: 72: Hoare triple {16175#(<= main_~i~0 33)} assume true; {16175#(<= main_~i~0 33)} is VALID [2018-11-14 18:44:40,422 INFO L273 TraceCheckUtils]: 73: Hoare triple {16175#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16176#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:40,422 INFO L273 TraceCheckUtils]: 74: Hoare triple {16176#(<= main_~i~0 34)} assume true; {16176#(<= main_~i~0 34)} is VALID [2018-11-14 18:44:40,423 INFO L273 TraceCheckUtils]: 75: Hoare triple {16176#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + ~i~0 * 4, 4);~i~0 := ~i~0 + 1; {16177#(<= main_~i~0 35)} is VALID [2018-11-14 18:44:40,423 INFO L273 TraceCheckUtils]: 76: Hoare triple {16177#(<= main_~i~0 35)} assume true; {16177#(<= main_~i~0 35)} is VALID [2018-11-14 18:44:40,424 INFO L273 TraceCheckUtils]: 77: Hoare triple {16177#(<= main_~i~0 35)} assume !(~i~0 < 100000); {16141#false} is VALID [2018-11-14 18:44:40,424 INFO L273 TraceCheckUtils]: 78: Hoare triple {16141#false} havoc ~x~0;~x~0 := 0; {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L273 TraceCheckUtils]: 79: Hoare triple {16141#false} assume true; {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L273 TraceCheckUtils]: 80: Hoare triple {16141#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + ~x~0 * 4, 4); {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L256 TraceCheckUtils]: 81: Hoare triple {16141#false} call __VERIFIER_assert((if #t~mem1 == 42 then 1 else 0)); {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L273 TraceCheckUtils]: 82: Hoare triple {16141#false} ~cond := #in~cond; {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L273 TraceCheckUtils]: 83: Hoare triple {16141#false} assume ~cond == 0; {16141#false} is VALID [2018-11-14 18:44:40,425 INFO L273 TraceCheckUtils]: 84: Hoare triple {16141#false} assume !false; {16141#false} is VALID [2018-11-14 18:44:40,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:44:40,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:44:40,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-14 18:44:40,454 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 85 [2018-11-14 18:44:40,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:44:40,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states.