java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:02:20,768 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:02:20,770 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:02:20,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:02:20,789 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:02:20,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:02:20,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:02:20,796 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:02:20,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:02:20,799 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:02:20,800 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:02:20,801 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:02:20,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:02:20,805 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:02:20,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:02:20,814 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:02:20,818 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:02:20,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:02:20,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:02:20,826 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:02:20,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:02:20,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:02:20,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:02:20,835 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:02:20,835 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:02:20,836 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:02:20,837 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:02:20,838 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:02:20,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:02:20,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:02:20,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:02:20,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:02:20,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:02:20,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:02:20,845 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:02:20,845 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:02:20,846 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:02:20,874 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:02:20,875 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:02:20,875 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:02:20,876 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:02:20,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:02:20,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:02:20,877 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:02:20,877 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:02:20,877 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:02:20,879 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:02:20,879 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:02:20,879 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:02:20,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:02:20,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:02:20,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:02:20,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:02:20,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:02:20,880 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:02:20,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:02:20,881 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:02:20,881 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:02:20,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:02:20,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:02:20,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:20,882 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:02:20,882 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:02:20,882 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:02:20,882 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:02:20,882 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:02:20,883 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:02:20,884 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:02:20,956 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:02:20,969 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:02:20,973 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:02:20,975 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:02:20,975 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:02:20,976 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-23 12:02:21,041 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca58710c/21f24c03c2ee4bc997f29cbc6612e6cc/FLAGe48937023 [2018-11-23 12:02:21,478 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:02:21,479 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init1_true-unreach-call_ground.i [2018-11-23 12:02:21,488 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca58710c/21f24c03c2ee4bc997f29cbc6612e6cc/FLAGe48937023 [2018-11-23 12:02:21,848 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ca58710c/21f24c03c2ee4bc997f29cbc6612e6cc [2018-11-23 12:02:21,857 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:02:21,858 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:02:21,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:21,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:02:21,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:02:21,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:21" (1/1) ... [2018-11-23 12:02:21,868 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29240fb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:21, skipping insertion in model container [2018-11-23 12:02:21,868 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:02:21" (1/1) ... [2018-11-23 12:02:21,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:02:21,900 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:02:22,097 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:22,101 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:02:22,126 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:02:22,150 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:02:22,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22 WrapperNode [2018-11-23 12:02:22,151 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:02:22,152 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:22,152 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:02:22,152 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:02:22,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:02:22,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:02:22,181 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:02:22,181 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:02:22,193 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,194 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,195 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,205 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,211 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... [2018-11-23 12:02:22,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:02:22,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:02:22,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:02:22,216 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:02:22,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:02:22,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:02:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:02:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:02:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:02:22,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:02:22,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:02:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:02:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:02:22,365 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:02:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:02:22,365 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:02:22,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:02:22,999 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:02:22,999 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:02:23,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:22 BoogieIcfgContainer [2018-11-23 12:02:23,000 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:02:23,000 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:02:23,001 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:02:23,004 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:02:23,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:02:21" (1/3) ... [2018-11-23 12:02:23,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc134e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:23, skipping insertion in model container [2018-11-23 12:02:23,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:02:22" (2/3) ... [2018-11-23 12:02:23,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc134e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:02:23, skipping insertion in model container [2018-11-23 12:02:23,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:02:22" (3/3) ... [2018-11-23 12:02:23,008 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init1_true-unreach-call_ground.i [2018-11-23 12:02:23,019 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:02:23,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:02:23,041 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:02:23,073 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:02:23,074 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:02:23,074 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:02:23,074 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:02:23,075 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:02:23,075 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:02:23,075 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:02:23,076 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:02:23,076 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:02:23,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-23 12:02:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:02:23,099 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:23,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:23,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:23,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:23,108 INFO L82 PathProgramCache]: Analyzing trace with hash -441053002, now seen corresponding path program 1 times [2018-11-23 12:02:23,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:23,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:23,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:23,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:23,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-23 12:02:23,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26#true} is VALID [2018-11-23 12:02:23,256 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-23 12:02:23,256 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #48#return; {26#true} is VALID [2018-11-23 12:02:23,256 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret2 := main(); {26#true} is VALID [2018-11-23 12:02:23,256 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {26#true} is VALID [2018-11-23 12:02:23,258 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-23 12:02:23,258 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} havoc ~x~0;~x~0 := 0; {27#false} is VALID [2018-11-23 12:02:23,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {27#false} is VALID [2018-11-23 12:02:23,259 INFO L256 TraceCheckUtils]: 9: Hoare triple {27#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {27#false} is VALID [2018-11-23 12:02:23,259 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2018-11-23 12:02:23,259 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2018-11-23 12:02:23,260 INFO L273 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-23 12:02:23,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:23,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:23,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:02:23,271 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:02:23,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:23,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:02:23,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:23,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:02:23,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:02:23,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:23,356 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-23 12:02:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:23,467 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 12:02:23,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:02:23,468 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:02:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:02:23,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:02:23,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-23 12:02:23,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-23 12:02:23,789 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-23 12:02:23,799 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:02:23,799 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:02:23,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:02:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:02:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:02:23,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:23,902 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:02:23,902 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:02:23,902 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:02:23,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:23,909 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:02:23,911 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:02:23,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:23,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:23,912 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:02:23,912 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:02:23,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:23,917 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:02:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:02:23,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:23,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:23,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:23,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:23,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:02:23,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:02:23,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:23,926 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:02:23,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:02:23,926 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:02:23,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:02:23,927 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:23,927 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:23,927 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:23,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:23,928 INFO L82 PathProgramCache]: Analyzing trace with hash 303899570, now seen corresponding path program 1 times [2018-11-23 12:02:23,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:23,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:23,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:23,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:23,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:24,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {142#true} is VALID [2018-11-23 12:02:24,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {142#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {142#true} is VALID [2018-11-23 12:02:24,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2018-11-23 12:02:24,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #48#return; {142#true} is VALID [2018-11-23 12:02:24,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret2 := main(); {142#true} is VALID [2018-11-23 12:02:24,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {142#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {144#(= main_~i~0 0)} is VALID [2018-11-23 12:02:24,056 INFO L273 TraceCheckUtils]: 6: Hoare triple {144#(= main_~i~0 0)} assume !(~i~0 < 100000); {143#false} is VALID [2018-11-23 12:02:24,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {143#false} havoc ~x~0;~x~0 := 0; {143#false} is VALID [2018-11-23 12:02:24,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {143#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {143#false} is VALID [2018-11-23 12:02:24,057 INFO L256 TraceCheckUtils]: 9: Hoare triple {143#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {143#false} is VALID [2018-11-23 12:02:24,058 INFO L273 TraceCheckUtils]: 10: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2018-11-23 12:02:24,059 INFO L273 TraceCheckUtils]: 11: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2018-11-23 12:02:24,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {143#false} assume !false; {143#false} is VALID [2018-11-23 12:02:24,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:24,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:02:24,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:02:24,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:02:24,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:24,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:02:24,117 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:24,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:02:24,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:02:24,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:24,119 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 12:02:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,298 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2018-11-23 12:02:24,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:02:24,299 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 12:02:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:24,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 12:02:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:02:24,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2018-11-23 12:02:24,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2018-11-23 12:02:24,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:24,402 INFO L225 Difference]: With dead ends: 30 [2018-11-23 12:02:24,402 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 12:02:24,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:02:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 12:02:24,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 12:02:24,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:24,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 12:02:24,448 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:02:24,448 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:02:24,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,450 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:02:24,450 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:02:24,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,451 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 12:02:24,451 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 12:02:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:24,453 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 12:02:24,454 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:02:24,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:24,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:24,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:24,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:24,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 12:02:24,457 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 13 [2018-11-23 12:02:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:24,458 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 12:02:24,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:02:24,458 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 12:02:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:02:24,459 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:24,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:24,459 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:24,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:24,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1260126610, now seen corresponding path program 1 times [2018-11-23 12:02:24,460 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:24,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:24,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:24,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 12:02:24,566 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 12:02:24,566 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 12:02:24,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 12:02:24,567 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret2 := main(); {255#true} is VALID [2018-11-23 12:02:24,569 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {257#(= main_~i~0 0)} is VALID [2018-11-23 12:02:24,571 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {258#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:24,591 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 1)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 12:02:24,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 0; {256#false} is VALID [2018-11-23 12:02:24,592 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {256#false} is VALID [2018-11-23 12:02:24,592 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {256#false} is VALID [2018-11-23 12:02:24,593 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 12:02:24,593 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 12:02:24,593 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 12:02:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:24,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:24,595 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:24,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:24,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:24,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:25,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {255#true} is VALID [2018-11-23 12:02:25,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {255#true} is VALID [2018-11-23 12:02:25,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2018-11-23 12:02:25,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {255#true} {255#true} #48#return; {255#true} is VALID [2018-11-23 12:02:25,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {255#true} call #t~ret2 := main(); {255#true} is VALID [2018-11-23 12:02:25,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {277#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:25,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {258#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {258#(<= main_~i~0 1)} assume !(~i~0 < 100000); {256#false} is VALID [2018-11-23 12:02:25,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {256#false} havoc ~x~0;~x~0 := 0; {256#false} is VALID [2018-11-23 12:02:25,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {256#false} is VALID [2018-11-23 12:02:25,149 INFO L256 TraceCheckUtils]: 10: Hoare triple {256#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {256#false} is VALID [2018-11-23 12:02:25,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2018-11-23 12:02:25,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2018-11-23 12:02:25,150 INFO L273 TraceCheckUtils]: 13: Hoare triple {256#false} assume !false; {256#false} is VALID [2018-11-23 12:02:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:25,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:25,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2018-11-23 12:02:25,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:02:25,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:25,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:02:25,206 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:25,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:02:25,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:02:25,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:02:25,208 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 5 states. [2018-11-23 12:02:25,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:25,382 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:02:25,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:02:25,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:02:25,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:25,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 12:02:25,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:02:25,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2018-11-23 12:02:25,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2018-11-23 12:02:25,467 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:25,469 INFO L225 Difference]: With dead ends: 31 [2018-11-23 12:02:25,469 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 12:02:25,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-23 12:02:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 12:02:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 12:02:25,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:25,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:25,483 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:25,484 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:25,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:25,487 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:02:25,487 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:02:25,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:25,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:25,488 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:25,489 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 12:02:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:25,491 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 12:02:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:02:25,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:25,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:25,492 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:25,492 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:02:25,494 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-23 12:02:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:25,494 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:02:25,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:02:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:02:25,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 12:02:25,495 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:25,495 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:25,496 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:25,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:25,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1794669362, now seen corresponding path program 2 times [2018-11-23 12:02:25,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:25,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:25,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:25,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,731 INFO L256 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2018-11-23 12:02:25,732 INFO L273 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {415#true} is VALID [2018-11-23 12:02:25,732 INFO L273 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2018-11-23 12:02:25,733 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #48#return; {415#true} is VALID [2018-11-23 12:02:25,733 INFO L256 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret2 := main(); {415#true} is VALID [2018-11-23 12:02:25,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {417#(= main_~i~0 0)} is VALID [2018-11-23 12:02:25,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {417#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {418#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,755 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {419#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:25,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !(~i~0 < 100000); {416#false} is VALID [2018-11-23 12:02:25,758 INFO L273 TraceCheckUtils]: 9: Hoare triple {416#false} havoc ~x~0;~x~0 := 0; {416#false} is VALID [2018-11-23 12:02:25,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {416#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {416#false} is VALID [2018-11-23 12:02:25,759 INFO L256 TraceCheckUtils]: 11: Hoare triple {416#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {416#false} is VALID [2018-11-23 12:02:25,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2018-11-23 12:02:25,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2018-11-23 12:02:25,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {416#false} assume !false; {416#false} is VALID [2018-11-23 12:02:25,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:25,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:25,760 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:25,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:25,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:25,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:25,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:25,925 INFO L256 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2018-11-23 12:02:25,925 INFO L273 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {415#true} is VALID [2018-11-23 12:02:25,926 INFO L273 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2018-11-23 12:02:25,926 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #48#return; {415#true} is VALID [2018-11-23 12:02:25,926 INFO L256 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret2 := main(); {415#true} is VALID [2018-11-23 12:02:25,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {438#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:25,943 INFO L273 TraceCheckUtils]: 6: Hoare triple {438#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {418#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:25,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {418#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {419#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:25,949 INFO L273 TraceCheckUtils]: 8: Hoare triple {419#(<= main_~i~0 2)} assume !(~i~0 < 100000); {416#false} is VALID [2018-11-23 12:02:25,949 INFO L273 TraceCheckUtils]: 9: Hoare triple {416#false} havoc ~x~0;~x~0 := 0; {416#false} is VALID [2018-11-23 12:02:25,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {416#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {416#false} is VALID [2018-11-23 12:02:25,950 INFO L256 TraceCheckUtils]: 11: Hoare triple {416#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {416#false} is VALID [2018-11-23 12:02:25,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2018-11-23 12:02:25,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2018-11-23 12:02:25,951 INFO L273 TraceCheckUtils]: 14: Hoare triple {416#false} assume !false; {416#false} is VALID [2018-11-23 12:02:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:25,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:25,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2018-11-23 12:02:25,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 12:02:25,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:25,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:02:25,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:25,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:02:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:02:25,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:25,995 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 12:02:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,163 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 12:02:26,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:02:26,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-23 12:02:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:26,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:26,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:02:26,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:02:26,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2018-11-23 12:02:26,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 34 transitions. [2018-11-23 12:02:26,264 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-23 12:02:26,265 INFO L225 Difference]: With dead ends: 32 [2018-11-23 12:02:26,265 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 12:02:26,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:02:26,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 12:02:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-23 12:02:26,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:26,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:26,286 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:26,287 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:26,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,289 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:02:26,289 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:02:26,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,290 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:26,290 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2018-11-23 12:02:26,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,292 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 12:02:26,292 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:02:26,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:26,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:26,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:02:26,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-11-23 12:02:26,295 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 15 [2018-11-23 12:02:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:26,295 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-11-23 12:02:26,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:02:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 12:02:26,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:02:26,296 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:26,296 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:26,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:26,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:26,297 INFO L82 PathProgramCache]: Analyzing trace with hash 2004063982, now seen corresponding path program 3 times [2018-11-23 12:02:26,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:26,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:26,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:26,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:26,423 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 12:02:26,424 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {585#true} is VALID [2018-11-23 12:02:26,424 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 12:02:26,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #48#return; {585#true} is VALID [2018-11-23 12:02:26,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret2 := main(); {585#true} is VALID [2018-11-23 12:02:26,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {587#(= main_~i~0 0)} is VALID [2018-11-23 12:02:26,428 INFO L273 TraceCheckUtils]: 6: Hoare triple {587#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {588#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:26,428 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {589#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:26,429 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {590#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:26,430 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(<= main_~i~0 3)} assume !(~i~0 < 100000); {586#false} is VALID [2018-11-23 12:02:26,431 INFO L273 TraceCheckUtils]: 10: Hoare triple {586#false} havoc ~x~0;~x~0 := 0; {586#false} is VALID [2018-11-23 12:02:26,431 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {586#false} is VALID [2018-11-23 12:02:26,432 INFO L256 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {586#false} is VALID [2018-11-23 12:02:26,432 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-23 12:02:26,433 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2018-11-23 12:02:26,433 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 12:02:26,434 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-23 12:02:26,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:26,435 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:26,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:26,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:02:26,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:26,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:26,573 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-23 12:02:26,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {585#true} is VALID [2018-11-23 12:02:26,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-23 12:02:26,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #48#return; {585#true} is VALID [2018-11-23 12:02:26,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret2 := main(); {585#true} is VALID [2018-11-23 12:02:26,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {609#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:26,584 INFO L273 TraceCheckUtils]: 6: Hoare triple {609#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {588#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:26,585 INFO L273 TraceCheckUtils]: 7: Hoare triple {588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {589#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:26,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {590#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:26,591 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(<= main_~i~0 3)} assume !(~i~0 < 100000); {586#false} is VALID [2018-11-23 12:02:26,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {586#false} havoc ~x~0;~x~0 := 0; {586#false} is VALID [2018-11-23 12:02:26,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {586#false} is VALID [2018-11-23 12:02:26,592 INFO L256 TraceCheckUtils]: 12: Hoare triple {586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {586#false} is VALID [2018-11-23 12:02:26,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-23 12:02:26,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2018-11-23 12:02:26,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-23 12:02:26,593 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-23 12:02:26,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:26,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2018-11-23 12:02:26,616 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 12:02:26,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:26,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:02:26,648 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:26,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:02:26,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:02:26,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:26,649 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 7 states. [2018-11-23 12:02:26,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,800 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:02:26,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:02:26,801 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2018-11-23 12:02:26,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:26,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:02:26,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:02:26,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:02:26,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-23 12:02:26,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:26,868 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:02:26,868 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:02:26,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:02:26,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:02:26,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:02:26,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:26,886 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:26,887 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:26,887 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:26,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,890 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:02:26,890 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:02:26,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,891 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:26,891 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:02:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:26,893 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2018-11-23 12:02:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:02:26,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:26,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:26,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:26,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:02:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-11-23 12:02:26,896 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2018-11-23 12:02:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:26,896 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-11-23 12:02:26,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:02:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-11-23 12:02:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:02:26,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:26,897 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:26,898 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:26,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -94637390, now seen corresponding path program 4 times [2018-11-23 12:02:26,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,899 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 12:02:27,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 12:02:27,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 12:02:27,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #48#return; {765#true} is VALID [2018-11-23 12:02:27,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 12:02:27,056 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {767#(= main_~i~0 0)} is VALID [2018-11-23 12:02:27,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {767#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {768#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:27,058 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {769#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:27,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {770#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:27,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {771#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:27,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {771#(<= main_~i~0 4)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:27,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 12:02:27,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 12:02:27,064 INFO L256 TraceCheckUtils]: 13: Hoare triple {766#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 12:02:27,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 12:02:27,064 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 12:02:27,064 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 12:02:27,065 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:27,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:27,066 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:27,102 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:27,103 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:27,273 INFO L256 TraceCheckUtils]: 0: Hoare triple {765#true} call ULTIMATE.init(); {765#true} is VALID [2018-11-23 12:02:27,274 INFO L273 TraceCheckUtils]: 1: Hoare triple {765#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {765#true} is VALID [2018-11-23 12:02:27,274 INFO L273 TraceCheckUtils]: 2: Hoare triple {765#true} assume true; {765#true} is VALID [2018-11-23 12:02:27,274 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {765#true} {765#true} #48#return; {765#true} is VALID [2018-11-23 12:02:27,275 INFO L256 TraceCheckUtils]: 4: Hoare triple {765#true} call #t~ret2 := main(); {765#true} is VALID [2018-11-23 12:02:27,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {765#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {790#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:27,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {790#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {768#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:27,278 INFO L273 TraceCheckUtils]: 7: Hoare triple {768#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {769#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:27,278 INFO L273 TraceCheckUtils]: 8: Hoare triple {769#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {770#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:27,280 INFO L273 TraceCheckUtils]: 9: Hoare triple {770#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {771#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:27,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {771#(<= main_~i~0 4)} assume !(~i~0 < 100000); {766#false} is VALID [2018-11-23 12:02:27,281 INFO L273 TraceCheckUtils]: 11: Hoare triple {766#false} havoc ~x~0;~x~0 := 0; {766#false} is VALID [2018-11-23 12:02:27,281 INFO L273 TraceCheckUtils]: 12: Hoare triple {766#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {766#false} is VALID [2018-11-23 12:02:27,282 INFO L256 TraceCheckUtils]: 13: Hoare triple {766#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {766#false} is VALID [2018-11-23 12:02:27,282 INFO L273 TraceCheckUtils]: 14: Hoare triple {766#false} ~cond := #in~cond; {766#false} is VALID [2018-11-23 12:02:27,282 INFO L273 TraceCheckUtils]: 15: Hoare triple {766#false} assume 0 == ~cond; {766#false} is VALID [2018-11-23 12:02:27,283 INFO L273 TraceCheckUtils]: 16: Hoare triple {766#false} assume !false; {766#false} is VALID [2018-11-23 12:02:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:27,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:27,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2018-11-23 12:02:27,305 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 12:02:27,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:27,305 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:02:27,327 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:27,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:02:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:02:27,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:27,329 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 8 states. [2018-11-23 12:02:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,464 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-11-23 12:02:27,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:02:27,465 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-11-23 12:02:27,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:27,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 12:02:27,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:02:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 36 transitions. [2018-11-23 12:02:27,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 36 transitions. [2018-11-23 12:02:27,611 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:27,612 INFO L225 Difference]: With dead ends: 34 [2018-11-23 12:02:27,612 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 12:02:27,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:02:27,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 12:02:27,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 12:02:27,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:27,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 12:02:27,656 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:02:27,657 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:02:27,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,658 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:02:27,659 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:02:27,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:27,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:27,659 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 12:02:27,660 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 12:02:27,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:27,661 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 12:02:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:02:27,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:27,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:27,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:27,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:02:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 12:02:27,664 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2018-11-23 12:02:27,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:27,664 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 12:02:27,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:02:27,665 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 12:02:27,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:02:27,665 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:27,666 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:27,666 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:27,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash -729870482, now seen corresponding path program 5 times [2018-11-23 12:02:27,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:27,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:27,668 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:27,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:27,941 INFO L256 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2018-11-23 12:02:27,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {955#true} is VALID [2018-11-23 12:02:27,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2018-11-23 12:02:27,942 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #48#return; {955#true} is VALID [2018-11-23 12:02:27,942 INFO L256 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2018-11-23 12:02:27,943 INFO L273 TraceCheckUtils]: 5: Hoare triple {955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {957#(= main_~i~0 0)} is VALID [2018-11-23 12:02:27,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {957#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {958#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:27,944 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {959#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:27,946 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {960#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:27,947 INFO L273 TraceCheckUtils]: 9: Hoare triple {960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {961#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:27,948 INFO L273 TraceCheckUtils]: 10: Hoare triple {961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {962#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:27,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {962#(<= main_~i~0 5)} assume !(~i~0 < 100000); {956#false} is VALID [2018-11-23 12:02:27,950 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#false} havoc ~x~0;~x~0 := 0; {956#false} is VALID [2018-11-23 12:02:27,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {956#false} is VALID [2018-11-23 12:02:27,950 INFO L256 TraceCheckUtils]: 14: Hoare triple {956#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {956#false} is VALID [2018-11-23 12:02:27,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#false} ~cond := #in~cond; {956#false} is VALID [2018-11-23 12:02:27,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#false} assume 0 == ~cond; {956#false} is VALID [2018-11-23 12:02:27,951 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#false} assume !false; {956#false} is VALID [2018-11-23 12:02:27,952 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:27,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:27,953 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:27,961 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:28,019 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-11-23 12:02:28,020 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:28,132 INFO L256 TraceCheckUtils]: 0: Hoare triple {955#true} call ULTIMATE.init(); {955#true} is VALID [2018-11-23 12:02:28,133 INFO L273 TraceCheckUtils]: 1: Hoare triple {955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {955#true} is VALID [2018-11-23 12:02:28,133 INFO L273 TraceCheckUtils]: 2: Hoare triple {955#true} assume true; {955#true} is VALID [2018-11-23 12:02:28,134 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {955#true} {955#true} #48#return; {955#true} is VALID [2018-11-23 12:02:28,134 INFO L256 TraceCheckUtils]: 4: Hoare triple {955#true} call #t~ret2 := main(); {955#true} is VALID [2018-11-23 12:02:28,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {981#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:28,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {981#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {958#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:28,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {959#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:28,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {960#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:28,153 INFO L273 TraceCheckUtils]: 9: Hoare triple {960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {961#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:28,154 INFO L273 TraceCheckUtils]: 10: Hoare triple {961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {962#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:28,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {962#(<= main_~i~0 5)} assume !(~i~0 < 100000); {956#false} is VALID [2018-11-23 12:02:28,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#false} havoc ~x~0;~x~0 := 0; {956#false} is VALID [2018-11-23 12:02:28,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {956#false} is VALID [2018-11-23 12:02:28,155 INFO L256 TraceCheckUtils]: 14: Hoare triple {956#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {956#false} is VALID [2018-11-23 12:02:28,155 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#false} ~cond := #in~cond; {956#false} is VALID [2018-11-23 12:02:28,155 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#false} assume 0 == ~cond; {956#false} is VALID [2018-11-23 12:02:28,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {956#false} assume !false; {956#false} is VALID [2018-11-23 12:02:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:28,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:28,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-23 12:02:28,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 12:02:28,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:28,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:02:28,200 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-23 12:02:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:02:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:02:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:28,201 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2018-11-23 12:02:28,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,324 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:02:28,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:02:28,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-23 12:02:28,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:28,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 12:02:28,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:02:28,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2018-11-23 12:02:28,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2018-11-23 12:02:28,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:28,411 INFO L225 Difference]: With dead ends: 35 [2018-11-23 12:02:28,411 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 12:02:28,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:02:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 12:02:28,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 12:02:28,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:28,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:28,426 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:28,427 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:28,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,429 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:02:28,429 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:02:28,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,430 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:28,430 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 12:02:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:28,431 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2018-11-23 12:02:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:02:28,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:28,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:28,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:28,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:02:28,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 12:02:28,434 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-11-23 12:02:28,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:28,435 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 12:02:28,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:02:28,435 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 12:02:28,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:02:28,436 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:28,436 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:28,436 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:28,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:28,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1052740146, now seen corresponding path program 6 times [2018-11-23 12:02:28,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:28,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:28,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2018-11-23 12:02:28,640 INFO L273 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1155#true} is VALID [2018-11-23 12:02:28,640 INFO L273 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2018-11-23 12:02:28,641 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #48#return; {1155#true} is VALID [2018-11-23 12:02:28,641 INFO L256 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret2 := main(); {1155#true} is VALID [2018-11-23 12:02:28,642 INFO L273 TraceCheckUtils]: 5: Hoare triple {1155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1157#(= main_~i~0 0)} is VALID [2018-11-23 12:02:28,645 INFO L273 TraceCheckUtils]: 6: Hoare triple {1157#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1158#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:28,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1159#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:28,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {1159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1160#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:28,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1161#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:28,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1162#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:28,650 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:28,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {1163#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1156#false} is VALID [2018-11-23 12:02:28,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {1156#false} havoc ~x~0;~x~0 := 0; {1156#false} is VALID [2018-11-23 12:02:28,651 INFO L273 TraceCheckUtils]: 14: Hoare triple {1156#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1156#false} is VALID [2018-11-23 12:02:28,652 INFO L256 TraceCheckUtils]: 15: Hoare triple {1156#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1156#false} is VALID [2018-11-23 12:02:28,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2018-11-23 12:02:28,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2018-11-23 12:02:28,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2018-11-23 12:02:28,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:28,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:28,655 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:28,670 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:28,700 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:02:28,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:28,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:28,835 INFO L256 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1155#true} is VALID [2018-11-23 12:02:28,836 INFO L273 TraceCheckUtils]: 1: Hoare triple {1155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1155#true} is VALID [2018-11-23 12:02:28,836 INFO L273 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2018-11-23 12:02:28,837 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #48#return; {1155#true} is VALID [2018-11-23 12:02:28,837 INFO L256 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret2 := main(); {1155#true} is VALID [2018-11-23 12:02:28,838 INFO L273 TraceCheckUtils]: 5: Hoare triple {1155#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1182#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:28,839 INFO L273 TraceCheckUtils]: 6: Hoare triple {1182#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1158#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:28,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1159#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:28,840 INFO L273 TraceCheckUtils]: 8: Hoare triple {1159#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1160#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:28,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {1160#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1161#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:28,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1161#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1162#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:28,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {1162#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1163#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:28,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {1163#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1156#false} is VALID [2018-11-23 12:02:28,845 INFO L273 TraceCheckUtils]: 13: Hoare triple {1156#false} havoc ~x~0;~x~0 := 0; {1156#false} is VALID [2018-11-23 12:02:28,845 INFO L273 TraceCheckUtils]: 14: Hoare triple {1156#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1156#false} is VALID [2018-11-23 12:02:28,846 INFO L256 TraceCheckUtils]: 15: Hoare triple {1156#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1156#false} is VALID [2018-11-23 12:02:28,846 INFO L273 TraceCheckUtils]: 16: Hoare triple {1156#false} ~cond := #in~cond; {1156#false} is VALID [2018-11-23 12:02:28,847 INFO L273 TraceCheckUtils]: 17: Hoare triple {1156#false} assume 0 == ~cond; {1156#false} is VALID [2018-11-23 12:02:28,847 INFO L273 TraceCheckUtils]: 18: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2018-11-23 12:02:28,848 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-11-23 12:02:28,869 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-23 12:02:28,870 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:28,870 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:02:28,891 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:28,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:02:28,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:02:28,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:28,893 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 10 states. [2018-11-23 12:02:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,083 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-23 12:02:29,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:02:29,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-11-23 12:02:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 12:02:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:02:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2018-11-23 12:02:29,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2018-11-23 12:02:29,139 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:29,140 INFO L225 Difference]: With dead ends: 36 [2018-11-23 12:02:29,141 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 12:02:29,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:02:29,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 12:02:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 12:02:29,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:29,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:29,176 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:29,177 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:29,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,179 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:02:29,180 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:02:29,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:29,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:29,180 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:29,181 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 12:02:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:29,182 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 12:02:29,182 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:02:29,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:29,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:29,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:29,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:02:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-11-23 12:02:29,185 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 19 [2018-11-23 12:02:29,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:29,185 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-11-23 12:02:29,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:02:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 12:02:29,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:02:29,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:29,186 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:29,187 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:29,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:29,187 INFO L82 PathProgramCache]: Analyzing trace with hash 479094766, now seen corresponding path program 7 times [2018-11-23 12:02:29,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:29,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:29,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 12:02:29,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1365#true} is VALID [2018-11-23 12:02:29,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 12:02:29,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #48#return; {1365#true} is VALID [2018-11-23 12:02:29,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 12:02:29,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1367#(= main_~i~0 0)} is VALID [2018-11-23 12:02:29,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {1367#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1368#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:29,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1369#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:29,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1370#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:29,345 INFO L273 TraceCheckUtils]: 9: Hoare triple {1370#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1371#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:29,347 INFO L273 TraceCheckUtils]: 10: Hoare triple {1371#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1372#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:29,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {1372#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1373#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:29,349 INFO L273 TraceCheckUtils]: 12: Hoare triple {1373#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1374#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:29,350 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1366#false} is VALID [2018-11-23 12:02:29,350 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} havoc ~x~0;~x~0 := 0; {1366#false} is VALID [2018-11-23 12:02:29,350 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1366#false} is VALID [2018-11-23 12:02:29,350 INFO L256 TraceCheckUtils]: 16: Hoare triple {1366#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1366#false} is VALID [2018-11-23 12:02:29,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 12:02:29,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume 0 == ~cond; {1366#false} is VALID [2018-11-23 12:02:29,351 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 12:02:29,352 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:29,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:29,353 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:29,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:29,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:29,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:29,655 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 12:02:29,655 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1365#true} is VALID [2018-11-23 12:02:29,656 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 12:02:29,656 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #48#return; {1365#true} is VALID [2018-11-23 12:02:29,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 12:02:29,659 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1393#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:29,661 INFO L273 TraceCheckUtils]: 6: Hoare triple {1393#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1368#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:29,662 INFO L273 TraceCheckUtils]: 7: Hoare triple {1368#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1369#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:29,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {1369#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1370#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:29,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {1370#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1371#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:29,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {1371#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1372#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:29,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {1372#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1373#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:29,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {1373#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1374#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:29,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1366#false} is VALID [2018-11-23 12:02:29,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} havoc ~x~0;~x~0 := 0; {1366#false} is VALID [2018-11-23 12:02:29,676 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1366#false} is VALID [2018-11-23 12:02:29,676 INFO L256 TraceCheckUtils]: 16: Hoare triple {1366#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1366#false} is VALID [2018-11-23 12:02:29,676 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 12:02:29,676 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume 0 == ~cond; {1366#false} is VALID [2018-11-23 12:02:29,676 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 12:02:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:29,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:29,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2018-11-23 12:02:29,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 12:02:29,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:29,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:02:29,719 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-23 12:02:29,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:02:29,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:02:29,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:29,720 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 11 states. [2018-11-23 12:02:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,012 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:02:30,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:02:30,012 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-23 12:02:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:30,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:30,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:02:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:02:30,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:02:30,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 12:02:30,121 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,122 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:02:30,123 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:02:30,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:02:30,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:02:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 12:02:30,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:30,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,142 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,143 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,145 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:02:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:02:30,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,146 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,146 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 12:02:30,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:30,148 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 12:02:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:02:30,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:30,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:30,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:30,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:30,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 12:02:30,150 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 20 [2018-11-23 12:02:30,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:30,150 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 12:02:30,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:02:30,151 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 12:02:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:02:30,151 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:30,151 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:30,152 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:30,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:30,152 INFO L82 PathProgramCache]: Analyzing trace with hash -124042830, now seen corresponding path program 8 times [2018-11-23 12:02:30,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:30,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:30,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:30,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2018-11-23 12:02:30,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1585#true} is VALID [2018-11-23 12:02:30,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2018-11-23 12:02:30,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #48#return; {1585#true} is VALID [2018-11-23 12:02:30,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret2 := main(); {1585#true} is VALID [2018-11-23 12:02:30,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {1585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1587#(= main_~i~0 0)} is VALID [2018-11-23 12:02:30,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {1587#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1588#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {1588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1589#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {1589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1590#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {1590#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1591#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:30,372 INFO L273 TraceCheckUtils]: 10: Hoare triple {1591#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1592#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:30,373 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1593#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:30,378 INFO L273 TraceCheckUtils]: 12: Hoare triple {1593#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1594#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:30,380 INFO L273 TraceCheckUtils]: 13: Hoare triple {1594#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1595#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:30,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {1595#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1586#false} is VALID [2018-11-23 12:02:30,380 INFO L273 TraceCheckUtils]: 15: Hoare triple {1586#false} havoc ~x~0;~x~0 := 0; {1586#false} is VALID [2018-11-23 12:02:30,381 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1586#false} is VALID [2018-11-23 12:02:30,381 INFO L256 TraceCheckUtils]: 17: Hoare triple {1586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1586#false} is VALID [2018-11-23 12:02:30,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2018-11-23 12:02:30,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2018-11-23 12:02:30,382 INFO L273 TraceCheckUtils]: 20: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2018-11-23 12:02:30,383 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:30,384 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:30,384 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:30,395 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:30,440 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:30,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:30,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:30,880 INFO L256 TraceCheckUtils]: 0: Hoare triple {1585#true} call ULTIMATE.init(); {1585#true} is VALID [2018-11-23 12:02:30,880 INFO L273 TraceCheckUtils]: 1: Hoare triple {1585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1585#true} is VALID [2018-11-23 12:02:30,880 INFO L273 TraceCheckUtils]: 2: Hoare triple {1585#true} assume true; {1585#true} is VALID [2018-11-23 12:02:30,881 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1585#true} {1585#true} #48#return; {1585#true} is VALID [2018-11-23 12:02:30,881 INFO L256 TraceCheckUtils]: 4: Hoare triple {1585#true} call #t~ret2 := main(); {1585#true} is VALID [2018-11-23 12:02:30,881 INFO L273 TraceCheckUtils]: 5: Hoare triple {1585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1614#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:30,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {1614#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1588#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:30,882 INFO L273 TraceCheckUtils]: 7: Hoare triple {1588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1589#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:30,883 INFO L273 TraceCheckUtils]: 8: Hoare triple {1589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1590#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:30,884 INFO L273 TraceCheckUtils]: 9: Hoare triple {1590#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1591#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:30,884 INFO L273 TraceCheckUtils]: 10: Hoare triple {1591#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1592#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:30,885 INFO L273 TraceCheckUtils]: 11: Hoare triple {1592#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1593#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:30,885 INFO L273 TraceCheckUtils]: 12: Hoare triple {1593#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1594#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:30,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {1594#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1595#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:30,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {1595#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1586#false} is VALID [2018-11-23 12:02:30,887 INFO L273 TraceCheckUtils]: 15: Hoare triple {1586#false} havoc ~x~0;~x~0 := 0; {1586#false} is VALID [2018-11-23 12:02:30,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {1586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1586#false} is VALID [2018-11-23 12:02:30,887 INFO L256 TraceCheckUtils]: 17: Hoare triple {1586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1586#false} is VALID [2018-11-23 12:02:30,888 INFO L273 TraceCheckUtils]: 18: Hoare triple {1586#false} ~cond := #in~cond; {1586#false} is VALID [2018-11-23 12:02:30,888 INFO L273 TraceCheckUtils]: 19: Hoare triple {1586#false} assume 0 == ~cond; {1586#false} is VALID [2018-11-23 12:02:30,888 INFO L273 TraceCheckUtils]: 20: Hoare triple {1586#false} assume !false; {1586#false} is VALID [2018-11-23 12:02:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:30,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:30,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2018-11-23 12:02:30,910 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 12:02:30,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:30,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:02:30,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:30,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:02:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:02:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:30,929 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 12 states. [2018-11-23 12:02:31,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,442 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-23 12:02:31,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:02:31,442 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-23 12:02:31,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 12:02:31,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:02:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 40 transitions. [2018-11-23 12:02:31,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 40 transitions. [2018-11-23 12:02:31,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:31,488 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:02:31,488 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:02:31,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:02:31,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:02:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:02:31,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:31,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:02:31,509 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:02:31,509 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:02:31,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,510 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:02:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:02:31,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,511 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:02:31,511 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:02:31,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:31,512 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:02:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:02:31,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:31,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:31,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:31,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:02:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-11-23 12:02:31,514 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2018-11-23 12:02:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:31,514 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-11-23 12:02:31,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:02:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:02:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:02:31,515 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:31,515 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:31,515 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:31,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1641439122, now seen corresponding path program 9 times [2018-11-23 12:02:31,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:31,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:31,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,744 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 12:02:31,744 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 12:02:31,744 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 12:02:31,745 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #48#return; {1815#true} is VALID [2018-11-23 12:02:31,745 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 12:02:31,746 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1817#(= main_~i~0 0)} is VALID [2018-11-23 12:02:31,747 INFO L273 TraceCheckUtils]: 6: Hoare triple {1817#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:31,747 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:31,748 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:31,748 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:31,749 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1822#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:31,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {1822#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1823#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:31,751 INFO L273 TraceCheckUtils]: 12: Hoare triple {1823#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1824#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:31,752 INFO L273 TraceCheckUtils]: 13: Hoare triple {1824#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1825#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:31,753 INFO L273 TraceCheckUtils]: 14: Hoare triple {1825#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1826#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:31,754 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:31,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 12:02:31,755 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 12:02:31,755 INFO L256 TraceCheckUtils]: 18: Hoare triple {1816#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 12:02:31,755 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 12:02:31,755 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 12:02:31,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 12:02:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:31,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:31,757 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:31,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:31,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:02:31,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:31,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:31,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:31,972 INFO L256 TraceCheckUtils]: 0: Hoare triple {1815#true} call ULTIMATE.init(); {1815#true} is VALID [2018-11-23 12:02:31,972 INFO L273 TraceCheckUtils]: 1: Hoare triple {1815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1815#true} is VALID [2018-11-23 12:02:31,972 INFO L273 TraceCheckUtils]: 2: Hoare triple {1815#true} assume true; {1815#true} is VALID [2018-11-23 12:02:31,973 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1815#true} {1815#true} #48#return; {1815#true} is VALID [2018-11-23 12:02:31,973 INFO L256 TraceCheckUtils]: 4: Hoare triple {1815#true} call #t~ret2 := main(); {1815#true} is VALID [2018-11-23 12:02:31,974 INFO L273 TraceCheckUtils]: 5: Hoare triple {1815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {1845#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:31,975 INFO L273 TraceCheckUtils]: 6: Hoare triple {1845#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1818#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:31,977 INFO L273 TraceCheckUtils]: 7: Hoare triple {1818#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1819#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:31,995 INFO L273 TraceCheckUtils]: 8: Hoare triple {1819#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1820#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:32,010 INFO L273 TraceCheckUtils]: 9: Hoare triple {1820#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1821#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:32,025 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1822#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:32,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {1822#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1823#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:32,027 INFO L273 TraceCheckUtils]: 12: Hoare triple {1823#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1824#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:32,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {1824#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1825#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:32,028 INFO L273 TraceCheckUtils]: 14: Hoare triple {1825#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {1826#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:32,029 INFO L273 TraceCheckUtils]: 15: Hoare triple {1826#(<= main_~i~0 9)} assume !(~i~0 < 100000); {1816#false} is VALID [2018-11-23 12:02:32,029 INFO L273 TraceCheckUtils]: 16: Hoare triple {1816#false} havoc ~x~0;~x~0 := 0; {1816#false} is VALID [2018-11-23 12:02:32,029 INFO L273 TraceCheckUtils]: 17: Hoare triple {1816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {1816#false} is VALID [2018-11-23 12:02:32,029 INFO L256 TraceCheckUtils]: 18: Hoare triple {1816#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {1816#false} is VALID [2018-11-23 12:02:32,030 INFO L273 TraceCheckUtils]: 19: Hoare triple {1816#false} ~cond := #in~cond; {1816#false} is VALID [2018-11-23 12:02:32,030 INFO L273 TraceCheckUtils]: 20: Hoare triple {1816#false} assume 0 == ~cond; {1816#false} is VALID [2018-11-23 12:02:32,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {1816#false} assume !false; {1816#false} is VALID [2018-11-23 12:02:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:32,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:32,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2018-11-23 12:02:32,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 12:02:32,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:32,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:02:32,099 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:02:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:02:32,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:32,100 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 13 states. [2018-11-23 12:02:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,374 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2018-11-23 12:02:32,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:02:32,374 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-11-23 12:02:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:02:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:02:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2018-11-23 12:02:32,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2018-11-23 12:02:32,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:32,425 INFO L225 Difference]: With dead ends: 39 [2018-11-23 12:02:32,425 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 12:02:32,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:02:32,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 12:02:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 12:02:32,442 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:32,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,443 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,443 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,445 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:02:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:02:32,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,445 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,446 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 12:02:32,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:32,447 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 12:02:32,447 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:02:32,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:32,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:32,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:32,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:32,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:32,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 12:02:32,448 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2018-11-23 12:02:32,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:32,449 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 12:02:32,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:02:32,449 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 12:02:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 12:02:32,449 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:32,450 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:32,450 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:32,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:32,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1436083918, now seen corresponding path program 10 times [2018-11-23 12:02:32,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:32,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:32,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:32,964 INFO L256 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2018-11-23 12:02:32,964 INFO L273 TraceCheckUtils]: 1: Hoare triple {2055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2055#true} is VALID [2018-11-23 12:02:32,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2018-11-23 12:02:32,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #48#return; {2055#true} is VALID [2018-11-23 12:02:32,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret2 := main(); {2055#true} is VALID [2018-11-23 12:02:32,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2057#(= main_~i~0 0)} is VALID [2018-11-23 12:02:32,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {2057#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:32,969 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2059#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:32,969 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2060#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:32,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2061#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:32,971 INFO L273 TraceCheckUtils]: 10: Hoare triple {2061#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2062#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:32,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {2062#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2063#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:32,974 INFO L273 TraceCheckUtils]: 12: Hoare triple {2063#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2064#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:32,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {2064#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2065#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:32,976 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2066#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:32,977 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2067#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:32,978 INFO L273 TraceCheckUtils]: 16: Hoare triple {2067#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2056#false} is VALID [2018-11-23 12:02:32,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#false} havoc ~x~0;~x~0 := 0; {2056#false} is VALID [2018-11-23 12:02:32,978 INFO L273 TraceCheckUtils]: 18: Hoare triple {2056#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2056#false} is VALID [2018-11-23 12:02:32,978 INFO L256 TraceCheckUtils]: 19: Hoare triple {2056#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2056#false} is VALID [2018-11-23 12:02:32,979 INFO L273 TraceCheckUtils]: 20: Hoare triple {2056#false} ~cond := #in~cond; {2056#false} is VALID [2018-11-23 12:02:32,979 INFO L273 TraceCheckUtils]: 21: Hoare triple {2056#false} assume 0 == ~cond; {2056#false} is VALID [2018-11-23 12:02:32,979 INFO L273 TraceCheckUtils]: 22: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2018-11-23 12:02:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:32,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:32,981 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:32,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:33,015 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:33,015 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:33,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {2055#true} call ULTIMATE.init(); {2055#true} is VALID [2018-11-23 12:02:33,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {2055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2055#true} is VALID [2018-11-23 12:02:33,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {2055#true} assume true; {2055#true} is VALID [2018-11-23 12:02:33,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2055#true} {2055#true} #48#return; {2055#true} is VALID [2018-11-23 12:02:33,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {2055#true} call #t~ret2 := main(); {2055#true} is VALID [2018-11-23 12:02:33,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {2055#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2086#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:33,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2058#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {2058#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2059#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {2059#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2060#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2061#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {2061#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2062#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {2062#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2063#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {2063#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2064#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {2064#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2065#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {2065#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2066#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {2066#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2067#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {2067#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2056#false} is VALID [2018-11-23 12:02:33,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {2056#false} havoc ~x~0;~x~0 := 0; {2056#false} is VALID [2018-11-23 12:02:33,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {2056#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2056#false} is VALID [2018-11-23 12:02:33,225 INFO L256 TraceCheckUtils]: 19: Hoare triple {2056#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2056#false} is VALID [2018-11-23 12:02:33,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {2056#false} ~cond := #in~cond; {2056#false} is VALID [2018-11-23 12:02:33,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {2056#false} assume 0 == ~cond; {2056#false} is VALID [2018-11-23 12:02:33,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {2056#false} assume !false; {2056#false} is VALID [2018-11-23 12:02:33,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:33,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:33,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2018-11-23 12:02:33,248 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 12:02:33,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:33,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 12:02:33,270 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:33,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 12:02:33,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 12:02:33,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:02:33,271 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 14 states. [2018-11-23 12:02:33,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,506 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-11-23 12:02:33,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:02:33,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-11-23 12:02:33,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:33,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 12:02:33,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 12:02:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 42 transitions. [2018-11-23 12:02:33,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 42 transitions. [2018-11-23 12:02:33,570 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-23 12:02:33,571 INFO L225 Difference]: With dead ends: 40 [2018-11-23 12:02:33,572 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 12:02:33,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 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-23 12:02:33,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 12:02:33,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 12:02:33,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:33,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 12:02:33,606 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:02:33,607 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:02:33,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,608 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:02:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:02:33,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:33,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:33,609 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 12:02:33,609 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 12:02:33,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:33,610 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-11-23 12:02:33,611 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:02:33,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:33,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:33,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:33,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:02:33,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-23 12:02:33,612 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 23 [2018-11-23 12:02:33,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:33,612 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-23 12:02:33,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 12:02:33,613 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-23 12:02:33,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 12:02:33,613 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:33,613 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:33,614 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:33,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:33,614 INFO L82 PathProgramCache]: Analyzing trace with hash 634960110, now seen corresponding path program 11 times [2018-11-23 12:02:33,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:33,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:33,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:33,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:33,848 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-23 12:02:33,849 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2305#true} is VALID [2018-11-23 12:02:33,849 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 12:02:33,849 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #48#return; {2305#true} is VALID [2018-11-23 12:02:33,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret2 := main(); {2305#true} is VALID [2018-11-23 12:02:33,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2307#(= main_~i~0 0)} is VALID [2018-11-23 12:02:33,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {2307#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:33,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2309#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:33,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2310#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:33,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {2310#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2311#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:33,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2312#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:33,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {2312#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2313#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:33,855 INFO L273 TraceCheckUtils]: 12: Hoare triple {2313#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2314#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:33,856 INFO L273 TraceCheckUtils]: 13: Hoare triple {2314#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2315#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:33,857 INFO L273 TraceCheckUtils]: 14: Hoare triple {2315#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2316#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:33,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {2316#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2317#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:33,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {2317#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2318#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:33,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2306#false} is VALID [2018-11-23 12:02:33,860 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#false} havoc ~x~0;~x~0 := 0; {2306#false} is VALID [2018-11-23 12:02:33,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {2306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2306#false} is VALID [2018-11-23 12:02:33,861 INFO L256 TraceCheckUtils]: 20: Hoare triple {2306#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2306#false} is VALID [2018-11-23 12:02:33,861 INFO L273 TraceCheckUtils]: 21: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-23 12:02:33,861 INFO L273 TraceCheckUtils]: 22: Hoare triple {2306#false} assume 0 == ~cond; {2306#false} is VALID [2018-11-23 12:02:33,861 INFO L273 TraceCheckUtils]: 23: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-23 12:02:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:33,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:33,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:33,873 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:33,989 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-23 12:02:33,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:34,154 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-23 12:02:34,154 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2305#true} is VALID [2018-11-23 12:02:34,155 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 12:02:34,155 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #48#return; {2305#true} is VALID [2018-11-23 12:02:34,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret2 := main(); {2305#true} is VALID [2018-11-23 12:02:34,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2337#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:34,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {2337#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2308#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:34,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {2308#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2309#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:34,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {2309#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2310#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:34,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {2310#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2311#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:34,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {2311#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2312#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:34,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {2312#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2313#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:34,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {2313#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2314#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:34,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {2314#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2315#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:34,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {2315#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2316#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:34,165 INFO L273 TraceCheckUtils]: 15: Hoare triple {2316#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2317#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:34,166 INFO L273 TraceCheckUtils]: 16: Hoare triple {2317#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2318#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:34,167 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(<= main_~i~0 11)} assume !(~i~0 < 100000); {2306#false} is VALID [2018-11-23 12:02:34,167 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#false} havoc ~x~0;~x~0 := 0; {2306#false} is VALID [2018-11-23 12:02:34,167 INFO L273 TraceCheckUtils]: 19: Hoare triple {2306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2306#false} is VALID [2018-11-23 12:02:34,168 INFO L256 TraceCheckUtils]: 20: Hoare triple {2306#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2306#false} is VALID [2018-11-23 12:02:34,168 INFO L273 TraceCheckUtils]: 21: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-23 12:02:34,168 INFO L273 TraceCheckUtils]: 22: Hoare triple {2306#false} assume 0 == ~cond; {2306#false} is VALID [2018-11-23 12:02:34,169 INFO L273 TraceCheckUtils]: 23: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-23 12:02:34,170 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:34,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:34,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2018-11-23 12:02:34,189 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 12:02:34,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:34,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:02:34,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:02:34,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:02:34,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:02:34,214 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 15 states. [2018-11-23 12:02:34,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,447 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 12:02:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 12:02:34,448 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-11-23 12:02:34,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:34,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 12:02:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:02:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 43 transitions. [2018-11-23 12:02:34,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 43 transitions. [2018-11-23 12:02:34,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:34,501 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:02:34,501 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:02:34,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 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-23 12:02:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:02:34,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 12:02:34,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:34,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:34,520 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:34,520 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,521 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:02:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:02:34,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,521 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:34,521 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 12:02:34,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:34,523 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2018-11-23 12:02:34,523 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:02:34,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:34,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:34,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:34,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:02:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-11-23 12:02:34,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 24 [2018-11-23 12:02:34,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:34,525 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-11-23 12:02:34,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:02:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-11-23 12:02:34,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:02:34,525 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:34,525 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:34,526 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:34,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 412815538, now seen corresponding path program 12 times [2018-11-23 12:02:34,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:34,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,527 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:34,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-23 12:02:34,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-23 12:02:34,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-23 12:02:34,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #48#return; {2565#true} is VALID [2018-11-23 12:02:34,861 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-23 12:02:34,861 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-23 12:02:34,862 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2568#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:34,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2569#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:34,864 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2570#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:34,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2571#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:34,865 INFO L273 TraceCheckUtils]: 10: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2572#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:34,866 INFO L273 TraceCheckUtils]: 11: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2573#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:34,867 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2574#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:34,868 INFO L273 TraceCheckUtils]: 13: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2575#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:34,869 INFO L273 TraceCheckUtils]: 14: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2576#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:34,870 INFO L273 TraceCheckUtils]: 15: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2577#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:34,872 INFO L273 TraceCheckUtils]: 16: Hoare triple {2577#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2578#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:34,873 INFO L273 TraceCheckUtils]: 17: Hoare triple {2578#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2579#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:34,874 INFO L273 TraceCheckUtils]: 18: Hoare triple {2579#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-23 12:02:34,874 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-23 12:02:34,874 INFO L273 TraceCheckUtils]: 20: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2566#false} is VALID [2018-11-23 12:02:34,875 INFO L256 TraceCheckUtils]: 21: Hoare triple {2566#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2566#false} is VALID [2018-11-23 12:02:34,875 INFO L273 TraceCheckUtils]: 22: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-23 12:02:34,875 INFO L273 TraceCheckUtils]: 23: Hoare triple {2566#false} assume 0 == ~cond; {2566#false} is VALID [2018-11-23 12:02:34,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-23 12:02:34,877 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:34,877 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:34,877 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:34,889 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:34,933 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 12:02:34,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:34,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:35,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {2565#true} call ULTIMATE.init(); {2565#true} is VALID [2018-11-23 12:02:35,039 INFO L273 TraceCheckUtils]: 1: Hoare triple {2565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2565#true} is VALID [2018-11-23 12:02:35,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {2565#true} assume true; {2565#true} is VALID [2018-11-23 12:02:35,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2565#true} {2565#true} #48#return; {2565#true} is VALID [2018-11-23 12:02:35,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {2565#true} call #t~ret2 := main(); {2565#true} is VALID [2018-11-23 12:02:35,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {2565#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2598#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:35,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {2598#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2568#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:35,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {2568#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2569#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:35,042 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2570#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:35,043 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2571#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:35,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {2571#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2572#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:35,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {2572#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2573#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:35,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {2573#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2574#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:35,047 INFO L273 TraceCheckUtils]: 13: Hoare triple {2574#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2575#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:35,048 INFO L273 TraceCheckUtils]: 14: Hoare triple {2575#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2576#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:35,049 INFO L273 TraceCheckUtils]: 15: Hoare triple {2576#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2577#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:35,050 INFO L273 TraceCheckUtils]: 16: Hoare triple {2577#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2578#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:35,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {2578#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2579#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:35,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {2579#(<= main_~i~0 12)} assume !(~i~0 < 100000); {2566#false} is VALID [2018-11-23 12:02:35,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {2566#false} havoc ~x~0;~x~0 := 0; {2566#false} is VALID [2018-11-23 12:02:35,052 INFO L273 TraceCheckUtils]: 20: Hoare triple {2566#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2566#false} is VALID [2018-11-23 12:02:35,052 INFO L256 TraceCheckUtils]: 21: Hoare triple {2566#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2566#false} is VALID [2018-11-23 12:02:35,052 INFO L273 TraceCheckUtils]: 22: Hoare triple {2566#false} ~cond := #in~cond; {2566#false} is VALID [2018-11-23 12:02:35,053 INFO L273 TraceCheckUtils]: 23: Hoare triple {2566#false} assume 0 == ~cond; {2566#false} is VALID [2018-11-23 12:02:35,053 INFO L273 TraceCheckUtils]: 24: Hoare triple {2566#false} assume !false; {2566#false} is VALID [2018-11-23 12:02:35,054 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:35,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:35,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 16 [2018-11-23 12:02:35,075 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 12:02:35,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:35,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 12:02:35,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:35,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 12:02:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 12:02:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:35,097 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 16 states. [2018-11-23 12:02:35,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,314 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2018-11-23 12:02:35,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 12:02:35,314 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2018-11-23 12:02:35,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:35,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 12:02:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 12:02:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 12:02:35,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-23 12:02:35,360 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-23 12:02:35,361 INFO L225 Difference]: With dead ends: 42 [2018-11-23 12:02:35,361 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:02:35,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:02:35,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:02:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 12:02:35,377 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:35,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:35,378 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:35,378 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:35,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,379 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:02:35,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:02:35,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,379 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:35,380 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 12:02:35,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:35,380 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-23 12:02:35,380 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:02:35,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:35,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:35,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:35,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:02:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-23 12:02:35,382 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-11-23 12:02:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:35,382 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-23 12:02:35,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 12:02:35,382 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-23 12:02:35,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 12:02:35,382 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:35,383 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:35,383 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:35,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:35,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2116268398, now seen corresponding path program 13 times [2018-11-23 12:02:35,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,384 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:35,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:35,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,854 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:02:35,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:02:35,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:02:35,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #48#return; {2835#true} is VALID [2018-11-23 12:02:35,854 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret2 := main(); {2835#true} is VALID [2018-11-23 12:02:35,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2837#(= main_~i~0 0)} is VALID [2018-11-23 12:02:35,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {2837#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:35,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:35,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:35,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:35,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:35,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:35,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:35,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:35,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:35,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:35,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {2847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2848#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:35,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {2848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2849#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:35,881 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2850#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:35,882 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:02:35,882 INFO L273 TraceCheckUtils]: 20: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:02:35,882 INFO L273 TraceCheckUtils]: 21: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:02:35,882 INFO L256 TraceCheckUtils]: 22: Hoare triple {2836#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:02:35,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:02:35,883 INFO L273 TraceCheckUtils]: 24: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:02:35,883 INFO L273 TraceCheckUtils]: 25: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:02:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:35,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:35,884 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:35,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:35,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:36,075 INFO L256 TraceCheckUtils]: 0: Hoare triple {2835#true} call ULTIMATE.init(); {2835#true} is VALID [2018-11-23 12:02:36,075 INFO L273 TraceCheckUtils]: 1: Hoare triple {2835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2835#true} is VALID [2018-11-23 12:02:36,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {2835#true} assume true; {2835#true} is VALID [2018-11-23 12:02:36,076 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2835#true} {2835#true} #48#return; {2835#true} is VALID [2018-11-23 12:02:36,076 INFO L256 TraceCheckUtils]: 4: Hoare triple {2835#true} call #t~ret2 := main(); {2835#true} is VALID [2018-11-23 12:02:36,077 INFO L273 TraceCheckUtils]: 5: Hoare triple {2835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {2869#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:36,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {2869#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2838#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {2838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2839#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:36,079 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2840#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:36,079 INFO L273 TraceCheckUtils]: 9: Hoare triple {2840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2841#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:36,099 INFO L273 TraceCheckUtils]: 10: Hoare triple {2841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2842#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:36,100 INFO L273 TraceCheckUtils]: 11: Hoare triple {2842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2843#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:36,101 INFO L273 TraceCheckUtils]: 12: Hoare triple {2843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2844#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:36,101 INFO L273 TraceCheckUtils]: 13: Hoare triple {2844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2845#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:36,102 INFO L273 TraceCheckUtils]: 14: Hoare triple {2845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2846#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:36,103 INFO L273 TraceCheckUtils]: 15: Hoare triple {2846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2847#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:36,103 INFO L273 TraceCheckUtils]: 16: Hoare triple {2847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2848#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:36,104 INFO L273 TraceCheckUtils]: 17: Hoare triple {2848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2849#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:36,106 INFO L273 TraceCheckUtils]: 18: Hoare triple {2849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {2850#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:36,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {2850#(<= main_~i~0 13)} assume !(~i~0 < 100000); {2836#false} is VALID [2018-11-23 12:02:36,107 INFO L273 TraceCheckUtils]: 20: Hoare triple {2836#false} havoc ~x~0;~x~0 := 0; {2836#false} is VALID [2018-11-23 12:02:36,107 INFO L273 TraceCheckUtils]: 21: Hoare triple {2836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {2836#false} is VALID [2018-11-23 12:02:36,107 INFO L256 TraceCheckUtils]: 22: Hoare triple {2836#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {2836#false} is VALID [2018-11-23 12:02:36,107 INFO L273 TraceCheckUtils]: 23: Hoare triple {2836#false} ~cond := #in~cond; {2836#false} is VALID [2018-11-23 12:02:36,108 INFO L273 TraceCheckUtils]: 24: Hoare triple {2836#false} assume 0 == ~cond; {2836#false} is VALID [2018-11-23 12:02:36,108 INFO L273 TraceCheckUtils]: 25: Hoare triple {2836#false} assume !false; {2836#false} is VALID [2018-11-23 12:02:36,110 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:36,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:36,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2018-11-23 12:02:36,130 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 12:02:36,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:36,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:02:36,156 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-23 12:02:36,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:02:36,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:02:36,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:36,158 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 17 states. [2018-11-23 12:02:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,260 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-11-23 12:02:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 12:02:36,260 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 12:02:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:36,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 12:02:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:02:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 45 transitions. [2018-11-23 12:02:36,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 45 transitions. [2018-11-23 12:02:36,299 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,300 INFO L225 Difference]: With dead ends: 43 [2018-11-23 12:02:36,300 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 12:02:36,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:02:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 12:02:36,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-11-23 12:02:36,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:36,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:36,324 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:36,324 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:36,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,325 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:02:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:02:36,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,326 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:36,326 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 32 states. [2018-11-23 12:02:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:36,327 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-23 12:02:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:02:36,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:36,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:36,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:36,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:02:36,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2018-11-23 12:02:36,329 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2018-11-23 12:02:36,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:36,329 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2018-11-23 12:02:36,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:02:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-23 12:02:36,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 12:02:36,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:36,330 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:36,330 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:36,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:36,330 INFO L82 PathProgramCache]: Analyzing trace with hash -911267790, now seen corresponding path program 14 times [2018-11-23 12:02:36,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:36,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:36,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,594 INFO L256 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2018-11-23 12:02:36,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3115#true} is VALID [2018-11-23 12:02:36,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2018-11-23 12:02:36,595 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #48#return; {3115#true} is VALID [2018-11-23 12:02:36,595 INFO L256 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret2 := main(); {3115#true} is VALID [2018-11-23 12:02:36,596 INFO L273 TraceCheckUtils]: 5: Hoare triple {3115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3117#(= main_~i~0 0)} is VALID [2018-11-23 12:02:36,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {3117#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3118#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,597 INFO L273 TraceCheckUtils]: 7: Hoare triple {3118#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3119#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:36,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3120#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:36,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {3120#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3121#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:36,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {3121#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3122#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:36,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {3122#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3123#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:36,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {3123#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3124#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:36,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {3124#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3125#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:36,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {3125#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3126#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:36,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {3126#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3127#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:36,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {3127#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3128#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:36,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {3128#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3129#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:36,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {3129#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3130#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:36,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {3130#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3131#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:36,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3116#false} is VALID [2018-11-23 12:02:36,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {3116#false} havoc ~x~0;~x~0 := 0; {3116#false} is VALID [2018-11-23 12:02:36,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3116#false} is VALID [2018-11-23 12:02:36,609 INFO L256 TraceCheckUtils]: 23: Hoare triple {3116#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3116#false} is VALID [2018-11-23 12:02:36,609 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2018-11-23 12:02:36,609 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2018-11-23 12:02:36,610 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2018-11-23 12:02:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:36,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:36,611 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:36,620 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:36,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:36,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:36,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:36,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {3115#true} call ULTIMATE.init(); {3115#true} is VALID [2018-11-23 12:02:36,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {3115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3115#true} is VALID [2018-11-23 12:02:36,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {3115#true} assume true; {3115#true} is VALID [2018-11-23 12:02:36,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3115#true} {3115#true} #48#return; {3115#true} is VALID [2018-11-23 12:02:36,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {3115#true} call #t~ret2 := main(); {3115#true} is VALID [2018-11-23 12:02:36,856 INFO L273 TraceCheckUtils]: 5: Hoare triple {3115#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3150#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:36,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {3150#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3118#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:36,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {3118#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3119#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:36,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {3119#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3120#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:36,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {3120#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3121#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:36,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {3121#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3122#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:36,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {3122#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3123#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:36,862 INFO L273 TraceCheckUtils]: 12: Hoare triple {3123#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3124#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:36,863 INFO L273 TraceCheckUtils]: 13: Hoare triple {3124#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3125#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:36,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {3125#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3126#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:36,868 INFO L273 TraceCheckUtils]: 15: Hoare triple {3126#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3127#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:36,868 INFO L273 TraceCheckUtils]: 16: Hoare triple {3127#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3128#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:36,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {3128#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3129#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:36,870 INFO L273 TraceCheckUtils]: 18: Hoare triple {3129#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3130#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:36,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {3130#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3131#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:36,871 INFO L273 TraceCheckUtils]: 20: Hoare triple {3131#(<= main_~i~0 14)} assume !(~i~0 < 100000); {3116#false} is VALID [2018-11-23 12:02:36,872 INFO L273 TraceCheckUtils]: 21: Hoare triple {3116#false} havoc ~x~0;~x~0 := 0; {3116#false} is VALID [2018-11-23 12:02:36,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {3116#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3116#false} is VALID [2018-11-23 12:02:36,872 INFO L256 TraceCheckUtils]: 23: Hoare triple {3116#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3116#false} is VALID [2018-11-23 12:02:36,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {3116#false} ~cond := #in~cond; {3116#false} is VALID [2018-11-23 12:02:36,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {3116#false} assume 0 == ~cond; {3116#false} is VALID [2018-11-23 12:02:36,873 INFO L273 TraceCheckUtils]: 26: Hoare triple {3116#false} assume !false; {3116#false} is VALID [2018-11-23 12:02:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:36,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:36,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2018-11-23 12:02:36,895 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-23 12:02:36,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:36,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 12:02:36,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:36,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 12:02:36,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 12:02:36,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:36,973 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 18 states. [2018-11-23 12:02:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,245 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-23 12:02:37,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:02:37,245 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-11-23 12:02:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:37,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 12:02:37,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:02:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 46 transitions. [2018-11-23 12:02:37,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 46 transitions. [2018-11-23 12:02:37,295 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-23 12:02:37,296 INFO L225 Difference]: With dead ends: 44 [2018-11-23 12:02:37,297 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 12:02:37,297 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:02:37,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 12:02:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 12:02:37,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:37,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 12:02:37,324 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:02:37,324 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:02:37,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,325 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:02:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:02:37,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,325 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 12:02:37,326 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 12:02:37,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:37,327 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-23 12:02:37,327 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:02:37,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:37,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:37,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:37,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:37,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:02:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-11-23 12:02:37,329 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 27 [2018-11-23 12:02:37,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:37,329 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-11-23 12:02:37,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 12:02:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-11-23 12:02:37,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 12:02:37,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:37,330 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:37,331 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:37,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:37,331 INFO L82 PathProgramCache]: Analyzing trace with hash -275609106, now seen corresponding path program 15 times [2018-11-23 12:02:37,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:37,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:37,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:37,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 12:02:38,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-23 12:02:38,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 12:02:38,247 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #48#return; {3405#true} is VALID [2018-11-23 12:02:38,247 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret2 := main(); {3405#true} is VALID [2018-11-23 12:02:38,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3407#(= main_~i~0 0)} is VALID [2018-11-23 12:02:38,248 INFO L273 TraceCheckUtils]: 6: Hoare triple {3407#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3408#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {3408#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3409#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {3409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3410#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:38,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {3410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3411#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:38,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {3411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3412#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:38,252 INFO L273 TraceCheckUtils]: 11: Hoare triple {3412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3413#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:38,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3414#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:38,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {3414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3415#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:38,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {3415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3416#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:38,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {3416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3417#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:38,257 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3418#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:38,258 INFO L273 TraceCheckUtils]: 17: Hoare triple {3418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3419#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:38,259 INFO L273 TraceCheckUtils]: 18: Hoare triple {3419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3420#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:38,260 INFO L273 TraceCheckUtils]: 19: Hoare triple {3420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3421#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:38,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {3421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3422#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:38,262 INFO L273 TraceCheckUtils]: 21: Hoare triple {3422#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-23 12:02:38,263 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#false} havoc ~x~0;~x~0 := 0; {3406#false} is VALID [2018-11-23 12:02:38,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {3406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3406#false} is VALID [2018-11-23 12:02:38,263 INFO L256 TraceCheckUtils]: 24: Hoare triple {3406#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3406#false} is VALID [2018-11-23 12:02:38,264 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-23 12:02:38,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {3406#false} assume 0 == ~cond; {3406#false} is VALID [2018-11-23 12:02:38,264 INFO L273 TraceCheckUtils]: 27: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 12:02:38,266 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:38,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:38,267 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:38,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:38,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 12:02:38,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:38,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:38,553 INFO L256 TraceCheckUtils]: 0: Hoare triple {3405#true} call ULTIMATE.init(); {3405#true} is VALID [2018-11-23 12:02:38,553 INFO L273 TraceCheckUtils]: 1: Hoare triple {3405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3405#true} is VALID [2018-11-23 12:02:38,553 INFO L273 TraceCheckUtils]: 2: Hoare triple {3405#true} assume true; {3405#true} is VALID [2018-11-23 12:02:38,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3405#true} {3405#true} #48#return; {3405#true} is VALID [2018-11-23 12:02:38,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {3405#true} call #t~ret2 := main(); {3405#true} is VALID [2018-11-23 12:02:38,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {3405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3441#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:38,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {3441#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3408#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:38,558 INFO L273 TraceCheckUtils]: 7: Hoare triple {3408#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3409#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:38,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {3409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3410#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:38,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {3410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3411#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:38,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {3411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3412#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:38,561 INFO L273 TraceCheckUtils]: 11: Hoare triple {3412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3413#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:38,561 INFO L273 TraceCheckUtils]: 12: Hoare triple {3413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3414#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:38,562 INFO L273 TraceCheckUtils]: 13: Hoare triple {3414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3415#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:38,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {3415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3416#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:38,564 INFO L273 TraceCheckUtils]: 15: Hoare triple {3416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3417#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:38,565 INFO L273 TraceCheckUtils]: 16: Hoare triple {3417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3418#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:38,565 INFO L273 TraceCheckUtils]: 17: Hoare triple {3418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3419#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:38,566 INFO L273 TraceCheckUtils]: 18: Hoare triple {3419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3420#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:38,567 INFO L273 TraceCheckUtils]: 19: Hoare triple {3420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3421#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:38,568 INFO L273 TraceCheckUtils]: 20: Hoare triple {3421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3422#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:38,569 INFO L273 TraceCheckUtils]: 21: Hoare triple {3422#(<= main_~i~0 15)} assume !(~i~0 < 100000); {3406#false} is VALID [2018-11-23 12:02:38,569 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#false} havoc ~x~0;~x~0 := 0; {3406#false} is VALID [2018-11-23 12:02:38,570 INFO L273 TraceCheckUtils]: 23: Hoare triple {3406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3406#false} is VALID [2018-11-23 12:02:38,570 INFO L256 TraceCheckUtils]: 24: Hoare triple {3406#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3406#false} is VALID [2018-11-23 12:02:38,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#false} ~cond := #in~cond; {3406#false} is VALID [2018-11-23 12:02:38,570 INFO L273 TraceCheckUtils]: 26: Hoare triple {3406#false} assume 0 == ~cond; {3406#false} is VALID [2018-11-23 12:02:38,570 INFO L273 TraceCheckUtils]: 27: Hoare triple {3406#false} assume !false; {3406#false} is VALID [2018-11-23 12:02:38,572 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:38,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:38,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2018-11-23 12:02:38,591 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 12:02:38,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:38,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 12:02:38,642 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:38,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 12:02:38,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 12:02:38,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:38,642 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 19 states. [2018-11-23 12:02:39,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,130 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-23 12:02:39,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 12:02:39,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2018-11-23 12:02:39,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:39,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 12:02:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 12:02:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 47 transitions. [2018-11-23 12:02:39,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 47 transitions. [2018-11-23 12:02:39,170 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,171 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:02:39,171 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:02:39,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:02:39,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:02:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-23 12:02:39,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:39,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:39,243 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:39,244 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,244 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:02:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:02:39,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,245 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:39,245 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 34 states. [2018-11-23 12:02:39,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:39,246 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-11-23 12:02:39,246 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:02:39,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:39,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:39,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:39,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:39,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:02:39,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-23 12:02:39,247 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 28 [2018-11-23 12:02:39,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:39,247 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-23 12:02:39,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 12:02:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-23 12:02:39,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 12:02:39,248 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:39,248 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:39,248 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:39,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:39,248 INFO L82 PathProgramCache]: Analyzing trace with hash -2045026382, now seen corresponding path program 16 times [2018-11-23 12:02:39,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:39,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:39,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,607 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 12:02:39,608 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 12:02:39,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 12:02:39,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #48#return; {3705#true} is VALID [2018-11-23 12:02:39,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 12:02:39,609 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3707#(= main_~i~0 0)} is VALID [2018-11-23 12:02:39,609 INFO L273 TraceCheckUtils]: 6: Hoare triple {3707#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {3708#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {3709#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {3711#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,633 INFO L273 TraceCheckUtils]: 11: Hoare triple {3712#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,633 INFO L273 TraceCheckUtils]: 12: Hoare triple {3713#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,634 INFO L273 TraceCheckUtils]: 13: Hoare triple {3714#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {3715#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,636 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3717#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3718#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:39,637 INFO L273 TraceCheckUtils]: 17: Hoare triple {3718#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3719#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:39,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3720#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:39,639 INFO L273 TraceCheckUtils]: 19: Hoare triple {3720#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3721#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:39,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {3721#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3722#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:39,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {3722#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3723#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:39,642 INFO L273 TraceCheckUtils]: 22: Hoare triple {3723#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:39,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 12:02:39,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 12:02:39,642 INFO L256 TraceCheckUtils]: 25: Hoare triple {3706#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 12:02:39,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 12:02:39,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 12:02:39,643 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 12:02:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:39,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:39,644 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:39,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:39,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:39,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:39,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:39,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:39,839 INFO L256 TraceCheckUtils]: 0: Hoare triple {3705#true} call ULTIMATE.init(); {3705#true} is VALID [2018-11-23 12:02:39,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {3705#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3705#true} is VALID [2018-11-23 12:02:39,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {3705#true} assume true; {3705#true} is VALID [2018-11-23 12:02:39,840 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3705#true} {3705#true} #48#return; {3705#true} is VALID [2018-11-23 12:02:39,840 INFO L256 TraceCheckUtils]: 4: Hoare triple {3705#true} call #t~ret2 := main(); {3705#true} is VALID [2018-11-23 12:02:39,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {3705#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {3742#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:39,841 INFO L273 TraceCheckUtils]: 6: Hoare triple {3742#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3708#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:39,842 INFO L273 TraceCheckUtils]: 7: Hoare triple {3708#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3709#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:39,842 INFO L273 TraceCheckUtils]: 8: Hoare triple {3709#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3710#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:39,843 INFO L273 TraceCheckUtils]: 9: Hoare triple {3710#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3711#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:39,844 INFO L273 TraceCheckUtils]: 10: Hoare triple {3711#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3712#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:39,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {3712#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3713#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:39,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {3713#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3714#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:39,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {3714#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3715#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:39,847 INFO L273 TraceCheckUtils]: 14: Hoare triple {3715#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3716#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:39,848 INFO L273 TraceCheckUtils]: 15: Hoare triple {3716#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3717#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:39,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {3717#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3718#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:39,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {3718#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3719#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:39,851 INFO L273 TraceCheckUtils]: 18: Hoare triple {3719#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3720#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:39,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {3720#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3721#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:39,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {3721#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3722#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:39,853 INFO L273 TraceCheckUtils]: 21: Hoare triple {3722#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {3723#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:39,854 INFO L273 TraceCheckUtils]: 22: Hoare triple {3723#(<= main_~i~0 16)} assume !(~i~0 < 100000); {3706#false} is VALID [2018-11-23 12:02:39,854 INFO L273 TraceCheckUtils]: 23: Hoare triple {3706#false} havoc ~x~0;~x~0 := 0; {3706#false} is VALID [2018-11-23 12:02:39,855 INFO L273 TraceCheckUtils]: 24: Hoare triple {3706#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {3706#false} is VALID [2018-11-23 12:02:39,855 INFO L256 TraceCheckUtils]: 25: Hoare triple {3706#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {3706#false} is VALID [2018-11-23 12:02:39,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {3706#false} ~cond := #in~cond; {3706#false} is VALID [2018-11-23 12:02:39,855 INFO L273 TraceCheckUtils]: 27: Hoare triple {3706#false} assume 0 == ~cond; {3706#false} is VALID [2018-11-23 12:02:39,855 INFO L273 TraceCheckUtils]: 28: Hoare triple {3706#false} assume !false; {3706#false} is VALID [2018-11-23 12:02:39,857 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:39,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:39,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2018-11-23 12:02:39,876 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-23 12:02:39,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:39,876 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 12:02:39,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:39,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 12:02:39,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 12:02:39,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 12:02:39,900 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 20 states. [2018-11-23 12:02:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,123 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-11-23 12:02:40,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 12:02:40,123 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-11-23 12:02:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 12:02:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:02:40,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 48 transitions. [2018-11-23 12:02:40,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 48 transitions. [2018-11-23 12:02:40,513 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:40,514 INFO L225 Difference]: With dead ends: 46 [2018-11-23 12:02:40,514 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:02:40,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 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-23 12:02:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:02:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:02:40,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:40,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:02:40,535 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:02:40,535 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:02:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,536 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:02:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:02:40,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,537 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:02:40,537 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:02:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:40,538 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 12:02:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:02:40,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:40,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:40,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:40,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:40,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:02:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-11-23 12:02:40,539 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2018-11-23 12:02:40,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:40,539 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-11-23 12:02:40,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 12:02:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-11-23 12:02:40,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:02:40,540 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:40,540 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:40,540 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:40,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:40,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1062387090, now seen corresponding path program 17 times [2018-11-23 12:02:40,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:40,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:40,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,542 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:40,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:40,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2018-11-23 12:02:40,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {4015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4015#true} is VALID [2018-11-23 12:02:40,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2018-11-23 12:02:40,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #48#return; {4015#true} is VALID [2018-11-23 12:02:40,848 INFO L256 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret2 := main(); {4015#true} is VALID [2018-11-23 12:02:40,849 INFO L273 TraceCheckUtils]: 5: Hoare triple {4015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4017#(= main_~i~0 0)} is VALID [2018-11-23 12:02:40,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {4017#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4018#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:40,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {4018#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4019#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:40,852 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4020#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:40,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {4020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4021#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:40,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4022#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:40,855 INFO L273 TraceCheckUtils]: 11: Hoare triple {4022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4023#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:40,856 INFO L273 TraceCheckUtils]: 12: Hoare triple {4023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4024#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:40,857 INFO L273 TraceCheckUtils]: 13: Hoare triple {4024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4025#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:40,858 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4026#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:40,858 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4027#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:40,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {4027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4028#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:40,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {4028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:40,861 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4030#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:40,862 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4031#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:40,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {4031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4032#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:40,864 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4033#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:40,865 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4034#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:40,866 INFO L273 TraceCheckUtils]: 23: Hoare triple {4034#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4016#false} is VALID [2018-11-23 12:02:40,866 INFO L273 TraceCheckUtils]: 24: Hoare triple {4016#false} havoc ~x~0;~x~0 := 0; {4016#false} is VALID [2018-11-23 12:02:40,866 INFO L273 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4016#false} is VALID [2018-11-23 12:02:40,866 INFO L256 TraceCheckUtils]: 26: Hoare triple {4016#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4016#false} is VALID [2018-11-23 12:02:40,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {4016#false} ~cond := #in~cond; {4016#false} is VALID [2018-11-23 12:02:40,867 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#false} assume 0 == ~cond; {4016#false} is VALID [2018-11-23 12:02:40,867 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2018-11-23 12:02:40,868 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:40,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:40,869 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:40,878 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:40,964 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:02:40,964 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:40,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:41,174 INFO L256 TraceCheckUtils]: 0: Hoare triple {4015#true} call ULTIMATE.init(); {4015#true} is VALID [2018-11-23 12:02:41,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {4015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4015#true} is VALID [2018-11-23 12:02:41,175 INFO L273 TraceCheckUtils]: 2: Hoare triple {4015#true} assume true; {4015#true} is VALID [2018-11-23 12:02:41,175 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4015#true} {4015#true} #48#return; {4015#true} is VALID [2018-11-23 12:02:41,175 INFO L256 TraceCheckUtils]: 4: Hoare triple {4015#true} call #t~ret2 := main(); {4015#true} is VALID [2018-11-23 12:02:41,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {4015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4053#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:41,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {4053#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4018#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:41,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {4018#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4019#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:41,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4020#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:41,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {4020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4021#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:41,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {4021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4022#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:41,180 INFO L273 TraceCheckUtils]: 11: Hoare triple {4022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4023#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:41,181 INFO L273 TraceCheckUtils]: 12: Hoare triple {4023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4024#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:41,182 INFO L273 TraceCheckUtils]: 13: Hoare triple {4024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4025#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:41,183 INFO L273 TraceCheckUtils]: 14: Hoare triple {4025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4026#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:41,190 INFO L273 TraceCheckUtils]: 15: Hoare triple {4026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4027#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:41,190 INFO L273 TraceCheckUtils]: 16: Hoare triple {4027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4028#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:41,191 INFO L273 TraceCheckUtils]: 17: Hoare triple {4028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4029#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:41,192 INFO L273 TraceCheckUtils]: 18: Hoare triple {4029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4030#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:41,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {4030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4031#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:41,193 INFO L273 TraceCheckUtils]: 20: Hoare triple {4031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4032#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:41,193 INFO L273 TraceCheckUtils]: 21: Hoare triple {4032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4033#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:41,194 INFO L273 TraceCheckUtils]: 22: Hoare triple {4033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4034#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:41,195 INFO L273 TraceCheckUtils]: 23: Hoare triple {4034#(<= main_~i~0 17)} assume !(~i~0 < 100000); {4016#false} is VALID [2018-11-23 12:02:41,195 INFO L273 TraceCheckUtils]: 24: Hoare triple {4016#false} havoc ~x~0;~x~0 := 0; {4016#false} is VALID [2018-11-23 12:02:41,195 INFO L273 TraceCheckUtils]: 25: Hoare triple {4016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4016#false} is VALID [2018-11-23 12:02:41,195 INFO L256 TraceCheckUtils]: 26: Hoare triple {4016#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4016#false} is VALID [2018-11-23 12:02:41,196 INFO L273 TraceCheckUtils]: 27: Hoare triple {4016#false} ~cond := #in~cond; {4016#false} is VALID [2018-11-23 12:02:41,196 INFO L273 TraceCheckUtils]: 28: Hoare triple {4016#false} assume 0 == ~cond; {4016#false} is VALID [2018-11-23 12:02:41,196 INFO L273 TraceCheckUtils]: 29: Hoare triple {4016#false} assume !false; {4016#false} is VALID [2018-11-23 12:02:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:41,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:41,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2018-11-23 12:02:41,218 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 12:02:41,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:41,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 12:02:41,240 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 12:02:41,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 12:02:41,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:02:41,241 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 21 states. [2018-11-23 12:02:41,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,356 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2018-11-23 12:02:41,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:02:41,357 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 30 [2018-11-23 12:02:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:41,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:02:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 12:02:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 12:02:41,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 49 transitions. [2018-11-23 12:02:41,360 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 49 transitions. [2018-11-23 12:02:41,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:41,859 INFO L225 Difference]: With dead ends: 47 [2018-11-23 12:02:41,859 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 12:02:41,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 12:02:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 12:02:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-11-23 12:02:41,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:41,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:41,892 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:41,892 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,892 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:02:41,893 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:02:41,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,893 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:41,893 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 36 states. [2018-11-23 12:02:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:41,894 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2018-11-23 12:02:41,894 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:02:41,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:41,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:41,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:41,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:41,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:02:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-11-23 12:02:41,895 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2018-11-23 12:02:41,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:41,895 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-11-23 12:02:41,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 12:02:41,895 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-11-23 12:02:41,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 12:02:41,896 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:41,896 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:41,896 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:41,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:41,896 INFO L82 PathProgramCache]: Analyzing trace with hash -665340110, now seen corresponding path program 18 times [2018-11-23 12:02:41,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:41,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:41,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:41,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:41,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:42,932 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 12:02:42,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 12:02:42,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 12:02:42,933 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #48#return; {4335#true} is VALID [2018-11-23 12:02:42,933 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 12:02:42,951 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4337#(= main_~i~0 0)} is VALID [2018-11-23 12:02:42,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {4337#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:42,973 INFO L273 TraceCheckUtils]: 7: Hoare triple {4338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:42,985 INFO L273 TraceCheckUtils]: 8: Hoare triple {4339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:42,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {4340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,011 INFO L273 TraceCheckUtils]: 10: Hoare triple {4341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {4342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,036 INFO L273 TraceCheckUtils]: 12: Hoare triple {4343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:43,041 INFO L273 TraceCheckUtils]: 13: Hoare triple {4344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:43,042 INFO L273 TraceCheckUtils]: 14: Hoare triple {4345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:43,043 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4347#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:43,043 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4348#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:43,045 INFO L273 TraceCheckUtils]: 17: Hoare triple {4348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4349#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:43,046 INFO L273 TraceCheckUtils]: 18: Hoare triple {4349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4350#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:43,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {4350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4351#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:43,048 INFO L273 TraceCheckUtils]: 20: Hoare triple {4351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4352#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:43,049 INFO L273 TraceCheckUtils]: 21: Hoare triple {4352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4353#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:43,050 INFO L273 TraceCheckUtils]: 22: Hoare triple {4353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4354#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:43,051 INFO L273 TraceCheckUtils]: 23: Hoare triple {4354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4355#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:43,051 INFO L273 TraceCheckUtils]: 24: Hoare triple {4355#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:43,052 INFO L273 TraceCheckUtils]: 25: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 12:02:43,052 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 12:02:43,052 INFO L256 TraceCheckUtils]: 27: Hoare triple {4336#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 12:02:43,052 INFO L273 TraceCheckUtils]: 28: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 12:02:43,052 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 12:02:43,053 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 12:02:43,054 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:43,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:43,054 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:02:43,064 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:43,420 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2018-11-23 12:02:43,421 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:43,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:43,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {4335#true} call ULTIMATE.init(); {4335#true} is VALID [2018-11-23 12:02:43,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {4335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4335#true} is VALID [2018-11-23 12:02:43,794 INFO L273 TraceCheckUtils]: 2: Hoare triple {4335#true} assume true; {4335#true} is VALID [2018-11-23 12:02:43,794 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4335#true} {4335#true} #48#return; {4335#true} is VALID [2018-11-23 12:02:43,794 INFO L256 TraceCheckUtils]: 4: Hoare triple {4335#true} call #t~ret2 := main(); {4335#true} is VALID [2018-11-23 12:02:43,794 INFO L273 TraceCheckUtils]: 5: Hoare triple {4335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4374#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:43,795 INFO L273 TraceCheckUtils]: 6: Hoare triple {4374#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4338#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:43,796 INFO L273 TraceCheckUtils]: 7: Hoare triple {4338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4339#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:43,796 INFO L273 TraceCheckUtils]: 8: Hoare triple {4339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4340#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:43,797 INFO L273 TraceCheckUtils]: 9: Hoare triple {4340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4341#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:43,797 INFO L273 TraceCheckUtils]: 10: Hoare triple {4341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4342#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:43,798 INFO L273 TraceCheckUtils]: 11: Hoare triple {4342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4343#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:43,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {4343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4344#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:43,800 INFO L273 TraceCheckUtils]: 13: Hoare triple {4344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4345#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:43,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {4345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4346#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:43,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {4346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4347#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:43,803 INFO L273 TraceCheckUtils]: 16: Hoare triple {4347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4348#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:43,804 INFO L273 TraceCheckUtils]: 17: Hoare triple {4348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4349#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:43,805 INFO L273 TraceCheckUtils]: 18: Hoare triple {4349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4350#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:43,805 INFO L273 TraceCheckUtils]: 19: Hoare triple {4350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4351#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:43,806 INFO L273 TraceCheckUtils]: 20: Hoare triple {4351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4352#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:43,807 INFO L273 TraceCheckUtils]: 21: Hoare triple {4352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4353#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:43,808 INFO L273 TraceCheckUtils]: 22: Hoare triple {4353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4354#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:43,809 INFO L273 TraceCheckUtils]: 23: Hoare triple {4354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4355#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:43,810 INFO L273 TraceCheckUtils]: 24: Hoare triple {4355#(<= main_~i~0 18)} assume !(~i~0 < 100000); {4336#false} is VALID [2018-11-23 12:02:43,810 INFO L273 TraceCheckUtils]: 25: Hoare triple {4336#false} havoc ~x~0;~x~0 := 0; {4336#false} is VALID [2018-11-23 12:02:43,810 INFO L273 TraceCheckUtils]: 26: Hoare triple {4336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4336#false} is VALID [2018-11-23 12:02:43,811 INFO L256 TraceCheckUtils]: 27: Hoare triple {4336#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4336#false} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 28: Hoare triple {4336#false} ~cond := #in~cond; {4336#false} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 29: Hoare triple {4336#false} assume 0 == ~cond; {4336#false} is VALID [2018-11-23 12:02:43,811 INFO L273 TraceCheckUtils]: 30: Hoare triple {4336#false} assume !false; {4336#false} is VALID [2018-11-23 12:02:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:43,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:43,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2018-11-23 12:02:43,837 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-23 12:02:43,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:43,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:02:43,863 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:43,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:02:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:02:43,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:02:43,864 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 22 states. [2018-11-23 12:02:44,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,025 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-11-23 12:02:44,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 12:02:44,026 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-23 12:02:44,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:02:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 12:02:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:02:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 50 transitions. [2018-11-23 12:02:44,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 50 transitions. [2018-11-23 12:02:44,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:44,393 INFO L225 Difference]: With dead ends: 48 [2018-11-23 12:02:44,393 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 12:02:44,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:02:44,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 12:02:44,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 12:02:44,416 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:44,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:44,416 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:44,417 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,418 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:02:44,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:02:44,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,418 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:44,419 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 12:02:44,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:44,420 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-23 12:02:44,420 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:02:44,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:44,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:44,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:44,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:44,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:02:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-11-23 12:02:44,421 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 31 [2018-11-23 12:02:44,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:44,422 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-11-23 12:02:44,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:02:44,422 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-11-23 12:02:44,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 12:02:44,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:44,423 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:44,423 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:44,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:44,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1241785618, now seen corresponding path program 19 times [2018-11-23 12:02:44,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:44,424 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:44,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {4665#true} call ULTIMATE.init(); {4665#true} is VALID [2018-11-23 12:02:45,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {4665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4665#true} is VALID [2018-11-23 12:02:45,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {4665#true} assume true; {4665#true} is VALID [2018-11-23 12:02:45,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4665#true} {4665#true} #48#return; {4665#true} is VALID [2018-11-23 12:02:45,222 INFO L256 TraceCheckUtils]: 4: Hoare triple {4665#true} call #t~ret2 := main(); {4665#true} is VALID [2018-11-23 12:02:45,222 INFO L273 TraceCheckUtils]: 5: Hoare triple {4665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4667#(= main_~i~0 0)} is VALID [2018-11-23 12:02:45,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {4667#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4668#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {4668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4669#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,225 INFO L273 TraceCheckUtils]: 8: Hoare triple {4669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4670#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {4670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4671#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:45,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4672#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:45,228 INFO L273 TraceCheckUtils]: 11: Hoare triple {4672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4673#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:45,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {4673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4674#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:45,230 INFO L273 TraceCheckUtils]: 13: Hoare triple {4674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4675#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:45,231 INFO L273 TraceCheckUtils]: 14: Hoare triple {4675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4676#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:45,232 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4677#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:45,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {4677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4678#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:45,234 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4679#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:45,235 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4680#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:45,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {4680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4681#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:45,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {4681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4682#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:45,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {4682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4683#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:45,239 INFO L273 TraceCheckUtils]: 22: Hoare triple {4683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4684#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:45,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {4684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4685#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:45,241 INFO L273 TraceCheckUtils]: 24: Hoare triple {4685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:45,242 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4666#false} is VALID [2018-11-23 12:02:45,242 INFO L273 TraceCheckUtils]: 26: Hoare triple {4666#false} havoc ~x~0;~x~0 := 0; {4666#false} is VALID [2018-11-23 12:02:45,242 INFO L273 TraceCheckUtils]: 27: Hoare triple {4666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4666#false} is VALID [2018-11-23 12:02:45,242 INFO L256 TraceCheckUtils]: 28: Hoare triple {4666#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4666#false} is VALID [2018-11-23 12:02:45,243 INFO L273 TraceCheckUtils]: 29: Hoare triple {4666#false} ~cond := #in~cond; {4666#false} is VALID [2018-11-23 12:02:45,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {4666#false} assume 0 == ~cond; {4666#false} is VALID [2018-11-23 12:02:45,243 INFO L273 TraceCheckUtils]: 31: Hoare triple {4666#false} assume !false; {4666#false} is VALID [2018-11-23 12:02:45,245 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:45,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:45,245 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-23 12:02:45,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:45,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:45,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {4665#true} call ULTIMATE.init(); {4665#true} is VALID [2018-11-23 12:02:45,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {4665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4665#true} is VALID [2018-11-23 12:02:45,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {4665#true} assume true; {4665#true} is VALID [2018-11-23 12:02:45,459 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4665#true} {4665#true} #48#return; {4665#true} is VALID [2018-11-23 12:02:45,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {4665#true} call #t~ret2 := main(); {4665#true} is VALID [2018-11-23 12:02:45,460 INFO L273 TraceCheckUtils]: 5: Hoare triple {4665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {4705#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:45,461 INFO L273 TraceCheckUtils]: 6: Hoare triple {4705#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4668#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:45,461 INFO L273 TraceCheckUtils]: 7: Hoare triple {4668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4669#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:45,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {4669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4670#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:45,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {4670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4671#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:45,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {4671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4672#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:45,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {4672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4673#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:45,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {4673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4674#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:45,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {4674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4675#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:45,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {4675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4676#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:45,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {4676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4677#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:45,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {4677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4678#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:45,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {4678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4679#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:45,470 INFO L273 TraceCheckUtils]: 18: Hoare triple {4679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4680#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:45,471 INFO L273 TraceCheckUtils]: 19: Hoare triple {4680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4681#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:45,472 INFO L273 TraceCheckUtils]: 20: Hoare triple {4681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4682#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:45,473 INFO L273 TraceCheckUtils]: 21: Hoare triple {4682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4683#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:45,474 INFO L273 TraceCheckUtils]: 22: Hoare triple {4683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4684#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:45,475 INFO L273 TraceCheckUtils]: 23: Hoare triple {4684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4685#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:45,476 INFO L273 TraceCheckUtils]: 24: Hoare triple {4685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {4686#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:45,477 INFO L273 TraceCheckUtils]: 25: Hoare triple {4686#(<= main_~i~0 19)} assume !(~i~0 < 100000); {4666#false} is VALID [2018-11-23 12:02:45,477 INFO L273 TraceCheckUtils]: 26: Hoare triple {4666#false} havoc ~x~0;~x~0 := 0; {4666#false} is VALID [2018-11-23 12:02:45,477 INFO L273 TraceCheckUtils]: 27: Hoare triple {4666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {4666#false} is VALID [2018-11-23 12:02:45,477 INFO L256 TraceCheckUtils]: 28: Hoare triple {4666#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {4666#false} is VALID [2018-11-23 12:02:45,478 INFO L273 TraceCheckUtils]: 29: Hoare triple {4666#false} ~cond := #in~cond; {4666#false} is VALID [2018-11-23 12:02:45,478 INFO L273 TraceCheckUtils]: 30: Hoare triple {4666#false} assume 0 == ~cond; {4666#false} is VALID [2018-11-23 12:02:45,478 INFO L273 TraceCheckUtils]: 31: Hoare triple {4666#false} assume !false; {4666#false} is VALID [2018-11-23 12:02:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:45,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:45,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2018-11-23 12:02:45,499 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 12:02:45,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:45,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:02:45,526 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-23 12:02:45,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:02:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:02:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:02:45,528 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 23 states. [2018-11-23 12:02:45,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:45,986 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-11-23 12:02:45,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 12:02:45,986 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-11-23 12:02:45,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:45,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:02:45,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 12:02:45,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:02:45,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 51 transitions. [2018-11-23 12:02:45,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 51 transitions. [2018-11-23 12:02:46,408 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:46,410 INFO L225 Difference]: With dead ends: 49 [2018-11-23 12:02:46,410 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:02:46,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 12:02:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:02:46,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 12:02:46,438 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:46,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:46,438 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:46,438 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:46,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,439 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:02:46,439 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:02:46,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,440 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:46,440 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 38 states. [2018-11-23 12:02:46,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:46,440 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2018-11-23 12:02:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:02:46,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:46,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:46,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:46,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:46,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:02:46,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-11-23 12:02:46,442 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 32 [2018-11-23 12:02:46,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:46,442 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-11-23 12:02:46,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:02:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-11-23 12:02:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 12:02:46,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:46,443 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:46,443 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:46,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:46,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1931727182, now seen corresponding path program 20 times [2018-11-23 12:02:46,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:46,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:46,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,087 INFO L256 TraceCheckUtils]: 0: Hoare triple {5005#true} call ULTIMATE.init(); {5005#true} is VALID [2018-11-23 12:02:47,087 INFO L273 TraceCheckUtils]: 1: Hoare triple {5005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5005#true} is VALID [2018-11-23 12:02:47,088 INFO L273 TraceCheckUtils]: 2: Hoare triple {5005#true} assume true; {5005#true} is VALID [2018-11-23 12:02:47,088 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5005#true} {5005#true} #48#return; {5005#true} is VALID [2018-11-23 12:02:47,088 INFO L256 TraceCheckUtils]: 4: Hoare triple {5005#true} call #t~ret2 := main(); {5005#true} is VALID [2018-11-23 12:02:47,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {5005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5007#(= main_~i~0 0)} is VALID [2018-11-23 12:02:47,089 INFO L273 TraceCheckUtils]: 6: Hoare triple {5007#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5008#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,090 INFO L273 TraceCheckUtils]: 7: Hoare triple {5008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5009#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,091 INFO L273 TraceCheckUtils]: 8: Hoare triple {5009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5010#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:47,092 INFO L273 TraceCheckUtils]: 9: Hoare triple {5010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5011#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:47,093 INFO L273 TraceCheckUtils]: 10: Hoare triple {5011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5012#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:47,094 INFO L273 TraceCheckUtils]: 11: Hoare triple {5012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5013#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:47,095 INFO L273 TraceCheckUtils]: 12: Hoare triple {5013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5014#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:47,096 INFO L273 TraceCheckUtils]: 13: Hoare triple {5014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5015#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:47,096 INFO L273 TraceCheckUtils]: 14: Hoare triple {5015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5016#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:47,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {5016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:47,098 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5018#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:47,099 INFO L273 TraceCheckUtils]: 17: Hoare triple {5018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5019#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:47,100 INFO L273 TraceCheckUtils]: 18: Hoare triple {5019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5020#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:47,101 INFO L273 TraceCheckUtils]: 19: Hoare triple {5020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5021#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:47,102 INFO L273 TraceCheckUtils]: 20: Hoare triple {5021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5022#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:47,102 INFO L273 TraceCheckUtils]: 21: Hoare triple {5022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5023#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:47,103 INFO L273 TraceCheckUtils]: 22: Hoare triple {5023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5024#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:47,104 INFO L273 TraceCheckUtils]: 23: Hoare triple {5024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5025#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:47,105 INFO L273 TraceCheckUtils]: 24: Hoare triple {5025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5026#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:47,106 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5027#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:47,107 INFO L273 TraceCheckUtils]: 26: Hoare triple {5027#(<= main_~i~0 20)} assume !(~i~0 < 100000); {5006#false} is VALID [2018-11-23 12:02:47,107 INFO L273 TraceCheckUtils]: 27: Hoare triple {5006#false} havoc ~x~0;~x~0 := 0; {5006#false} is VALID [2018-11-23 12:02:47,107 INFO L273 TraceCheckUtils]: 28: Hoare triple {5006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5006#false} is VALID [2018-11-23 12:02:47,107 INFO L256 TraceCheckUtils]: 29: Hoare triple {5006#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5006#false} is VALID [2018-11-23 12:02:47,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {5006#false} ~cond := #in~cond; {5006#false} is VALID [2018-11-23 12:02:47,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {5006#false} assume 0 == ~cond; {5006#false} is VALID [2018-11-23 12:02:47,108 INFO L273 TraceCheckUtils]: 32: Hoare triple {5006#false} assume !false; {5006#false} is VALID [2018-11-23 12:02:47,109 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-23 12:02:47,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:47,110 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-23 12:02:47,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:47,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:47,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:47,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:47,325 INFO L256 TraceCheckUtils]: 0: Hoare triple {5005#true} call ULTIMATE.init(); {5005#true} is VALID [2018-11-23 12:02:47,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {5005#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5005#true} is VALID [2018-11-23 12:02:47,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {5005#true} assume true; {5005#true} is VALID [2018-11-23 12:02:47,326 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5005#true} {5005#true} #48#return; {5005#true} is VALID [2018-11-23 12:02:47,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {5005#true} call #t~ret2 := main(); {5005#true} is VALID [2018-11-23 12:02:47,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {5005#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5046#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:47,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {5046#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5008#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:47,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {5008#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5009#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:47,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {5009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5010#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:47,331 INFO L273 TraceCheckUtils]: 9: Hoare triple {5010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5011#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:47,332 INFO L273 TraceCheckUtils]: 10: Hoare triple {5011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5012#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:47,333 INFO L273 TraceCheckUtils]: 11: Hoare triple {5012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5013#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:47,334 INFO L273 TraceCheckUtils]: 12: Hoare triple {5013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5014#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:47,335 INFO L273 TraceCheckUtils]: 13: Hoare triple {5014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5015#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:47,336 INFO L273 TraceCheckUtils]: 14: Hoare triple {5015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5016#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:47,337 INFO L273 TraceCheckUtils]: 15: Hoare triple {5016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5017#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:47,338 INFO L273 TraceCheckUtils]: 16: Hoare triple {5017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5018#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:47,339 INFO L273 TraceCheckUtils]: 17: Hoare triple {5018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5019#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:47,340 INFO L273 TraceCheckUtils]: 18: Hoare triple {5019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5020#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:47,341 INFO L273 TraceCheckUtils]: 19: Hoare triple {5020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5021#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:47,342 INFO L273 TraceCheckUtils]: 20: Hoare triple {5021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5022#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:47,343 INFO L273 TraceCheckUtils]: 21: Hoare triple {5022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5023#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:47,344 INFO L273 TraceCheckUtils]: 22: Hoare triple {5023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5024#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:47,345 INFO L273 TraceCheckUtils]: 23: Hoare triple {5024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5025#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:47,346 INFO L273 TraceCheckUtils]: 24: Hoare triple {5025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5026#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:47,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {5026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5027#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:47,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {5027#(<= main_~i~0 20)} assume !(~i~0 < 100000); {5006#false} is VALID [2018-11-23 12:02:47,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {5006#false} havoc ~x~0;~x~0 := 0; {5006#false} is VALID [2018-11-23 12:02:47,349 INFO L273 TraceCheckUtils]: 28: Hoare triple {5006#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5006#false} is VALID [2018-11-23 12:02:47,349 INFO L256 TraceCheckUtils]: 29: Hoare triple {5006#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5006#false} is VALID [2018-11-23 12:02:47,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {5006#false} ~cond := #in~cond; {5006#false} is VALID [2018-11-23 12:02:47,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {5006#false} assume 0 == ~cond; {5006#false} is VALID [2018-11-23 12:02:47,350 INFO L273 TraceCheckUtils]: 32: Hoare triple {5006#false} assume !false; {5006#false} is VALID [2018-11-23 12:02:47,352 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-23 12:02:47,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:47,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2018-11-23 12:02:47,372 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 12:02:47,372 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:47,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:02:47,402 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:47,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:02:47,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:02:47,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:02:47,404 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 24 states. [2018-11-23 12:02:47,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,553 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-11-23 12:02:47,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:02:47,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-11-23 12:02:47,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:47,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:02:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 12:02:47,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:02:47,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 52 transitions. [2018-11-23 12:02:47,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 52 transitions. [2018-11-23 12:02:47,698 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-23 12:02:47,699 INFO L225 Difference]: With dead ends: 50 [2018-11-23 12:02:47,700 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:02:47,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 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-23 12:02:47,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:02:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-23 12:02:47,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:47,724 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 39 states. [2018-11-23 12:02:47,724 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:02:47,724 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:02:47,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,726 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:02:47,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:02:47,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,727 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 39 states. [2018-11-23 12:02:47,727 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 39 states. [2018-11-23 12:02:47,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:47,728 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-11-23 12:02:47,729 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:02:47,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:47,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:47,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:47,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:47,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:02:47,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-11-23 12:02:47,731 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 33 [2018-11-23 12:02:47,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:47,731 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-11-23 12:02:47,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:02:47,731 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-11-23 12:02:47,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:02:47,732 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:47,732 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:47,732 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:47,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:47,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1845079186, now seen corresponding path program 21 times [2018-11-23 12:02:47,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:47,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:47,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,730 INFO L256 TraceCheckUtils]: 0: Hoare triple {5355#true} call ULTIMATE.init(); {5355#true} is VALID [2018-11-23 12:02:48,730 INFO L273 TraceCheckUtils]: 1: Hoare triple {5355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5355#true} is VALID [2018-11-23 12:02:48,731 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#true} assume true; {5355#true} is VALID [2018-11-23 12:02:48,731 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5355#true} {5355#true} #48#return; {5355#true} is VALID [2018-11-23 12:02:48,731 INFO L256 TraceCheckUtils]: 4: Hoare triple {5355#true} call #t~ret2 := main(); {5355#true} is VALID [2018-11-23 12:02:48,731 INFO L273 TraceCheckUtils]: 5: Hoare triple {5355#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5357#(= main_~i~0 0)} is VALID [2018-11-23 12:02:48,732 INFO L273 TraceCheckUtils]: 6: Hoare triple {5357#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5358#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:48,733 INFO L273 TraceCheckUtils]: 7: Hoare triple {5358#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5359#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:48,733 INFO L273 TraceCheckUtils]: 8: Hoare triple {5359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5360#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:48,734 INFO L273 TraceCheckUtils]: 9: Hoare triple {5360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5361#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:48,735 INFO L273 TraceCheckUtils]: 10: Hoare triple {5361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5362#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:48,735 INFO L273 TraceCheckUtils]: 11: Hoare triple {5362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5363#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:48,736 INFO L273 TraceCheckUtils]: 12: Hoare triple {5363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5364#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:48,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {5364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5365#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:48,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {5365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5366#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:48,740 INFO L273 TraceCheckUtils]: 15: Hoare triple {5366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5367#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:48,741 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5368#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:48,742 INFO L273 TraceCheckUtils]: 17: Hoare triple {5368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5369#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:48,743 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5370#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:48,744 INFO L273 TraceCheckUtils]: 19: Hoare triple {5370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5371#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:48,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {5371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5372#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:48,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {5372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5373#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:48,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {5373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5374#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:48,748 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5375#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:48,749 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5376#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:48,750 INFO L273 TraceCheckUtils]: 25: Hoare triple {5376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5377#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:48,751 INFO L273 TraceCheckUtils]: 26: Hoare triple {5377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5378#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:48,752 INFO L273 TraceCheckUtils]: 27: Hoare triple {5378#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5356#false} is VALID [2018-11-23 12:02:48,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {5356#false} havoc ~x~0;~x~0 := 0; {5356#false} is VALID [2018-11-23 12:02:48,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {5356#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5356#false} is VALID [2018-11-23 12:02:48,753 INFO L256 TraceCheckUtils]: 30: Hoare triple {5356#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5356#false} is VALID [2018-11-23 12:02:48,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {5356#false} ~cond := #in~cond; {5356#false} is VALID [2018-11-23 12:02:48,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {5356#false} assume 0 == ~cond; {5356#false} is VALID [2018-11-23 12:02:48,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {5356#false} assume !false; {5356#false} is VALID [2018-11-23 12:02:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:48,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:48,758 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-23 12:02:48,786 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:02:48,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:02:48,988 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:48,998 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:49,124 INFO L256 TraceCheckUtils]: 0: Hoare triple {5355#true} call ULTIMATE.init(); {5355#true} is VALID [2018-11-23 12:02:49,124 INFO L273 TraceCheckUtils]: 1: Hoare triple {5355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5355#true} is VALID [2018-11-23 12:02:49,124 INFO L273 TraceCheckUtils]: 2: Hoare triple {5355#true} assume true; {5355#true} is VALID [2018-11-23 12:02:49,124 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5355#true} {5355#true} #48#return; {5355#true} is VALID [2018-11-23 12:02:49,125 INFO L256 TraceCheckUtils]: 4: Hoare triple {5355#true} call #t~ret2 := main(); {5355#true} is VALID [2018-11-23 12:02:49,125 INFO L273 TraceCheckUtils]: 5: Hoare triple {5355#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5397#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:49,126 INFO L273 TraceCheckUtils]: 6: Hoare triple {5397#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5358#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:49,127 INFO L273 TraceCheckUtils]: 7: Hoare triple {5358#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5359#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:49,127 INFO L273 TraceCheckUtils]: 8: Hoare triple {5359#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5360#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:49,128 INFO L273 TraceCheckUtils]: 9: Hoare triple {5360#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5361#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:49,129 INFO L273 TraceCheckUtils]: 10: Hoare triple {5361#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5362#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:49,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {5362#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5363#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:49,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {5363#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5364#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:49,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {5364#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5365#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:49,132 INFO L273 TraceCheckUtils]: 14: Hoare triple {5365#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5366#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:49,133 INFO L273 TraceCheckUtils]: 15: Hoare triple {5366#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5367#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:49,134 INFO L273 TraceCheckUtils]: 16: Hoare triple {5367#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5368#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:49,135 INFO L273 TraceCheckUtils]: 17: Hoare triple {5368#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5369#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:49,136 INFO L273 TraceCheckUtils]: 18: Hoare triple {5369#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5370#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:49,137 INFO L273 TraceCheckUtils]: 19: Hoare triple {5370#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5371#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:49,138 INFO L273 TraceCheckUtils]: 20: Hoare triple {5371#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5372#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:49,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {5372#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5373#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:49,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {5373#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5374#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:49,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {5374#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5375#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:49,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {5375#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5376#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:49,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {5376#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5377#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:49,143 INFO L273 TraceCheckUtils]: 26: Hoare triple {5377#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5378#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:49,144 INFO L273 TraceCheckUtils]: 27: Hoare triple {5378#(<= main_~i~0 21)} assume !(~i~0 < 100000); {5356#false} is VALID [2018-11-23 12:02:49,144 INFO L273 TraceCheckUtils]: 28: Hoare triple {5356#false} havoc ~x~0;~x~0 := 0; {5356#false} is VALID [2018-11-23 12:02:49,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {5356#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5356#false} is VALID [2018-11-23 12:02:49,145 INFO L256 TraceCheckUtils]: 30: Hoare triple {5356#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5356#false} is VALID [2018-11-23 12:02:49,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {5356#false} ~cond := #in~cond; {5356#false} is VALID [2018-11-23 12:02:49,145 INFO L273 TraceCheckUtils]: 32: Hoare triple {5356#false} assume 0 == ~cond; {5356#false} is VALID [2018-11-23 12:02:49,145 INFO L273 TraceCheckUtils]: 33: Hoare triple {5356#false} assume !false; {5356#false} is VALID [2018-11-23 12:02:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 25 [2018-11-23 12:02:49,167 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 12:02:49,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:49,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 12:02:49,193 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 12:02:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 12:02:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:02:49,194 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 25 states. [2018-11-23 12:02:49,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,316 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2018-11-23 12:02:49,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 12:02:49,317 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 34 [2018-11-23 12:02:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:02:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:02:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 12:02:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 53 transitions. [2018-11-23 12:02:49,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 53 transitions. [2018-11-23 12:02:49,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:49,359 INFO L225 Difference]: With dead ends: 51 [2018-11-23 12:02:49,360 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 12:02:49,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 12:02:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 12:02:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 12:02:49,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:49,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:49,396 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:49,396 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:49,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,397 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:02:49,397 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:02:49,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,398 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:49,398 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 12:02:49,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:49,399 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 12:02:49,399 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:02:49,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:49,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:49,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:49,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:02:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 12:02:49,401 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 34 [2018-11-23 12:02:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:49,401 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 12:02:49,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 12:02:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 12:02:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 12:02:49,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:49,402 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:49,402 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:49,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash 841008690, now seen corresponding path program 22 times [2018-11-23 12:02:49,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:49,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:49,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2018-11-23 12:02:50,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5715#true} is VALID [2018-11-23 12:02:50,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2018-11-23 12:02:50,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #48#return; {5715#true} is VALID [2018-11-23 12:02:50,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret2 := main(); {5715#true} is VALID [2018-11-23 12:02:50,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {5715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5717#(= main_~i~0 0)} is VALID [2018-11-23 12:02:50,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {5717#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5718#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {5718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5719#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,202 INFO L273 TraceCheckUtils]: 8: Hoare triple {5719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5720#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,203 INFO L273 TraceCheckUtils]: 9: Hoare triple {5720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5721#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,204 INFO L273 TraceCheckUtils]: 10: Hoare triple {5721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,205 INFO L273 TraceCheckUtils]: 11: Hoare triple {5722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5723#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,206 INFO L273 TraceCheckUtils]: 12: Hoare triple {5723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5724#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,207 INFO L273 TraceCheckUtils]: 13: Hoare triple {5724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5725#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,208 INFO L273 TraceCheckUtils]: 14: Hoare triple {5725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5726#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,209 INFO L273 TraceCheckUtils]: 15: Hoare triple {5726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5727#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,209 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5728#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,210 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5729#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:50,211 INFO L273 TraceCheckUtils]: 18: Hoare triple {5729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5730#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:50,212 INFO L273 TraceCheckUtils]: 19: Hoare triple {5730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5731#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:50,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {5731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5732#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:50,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {5732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5733#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:50,215 INFO L273 TraceCheckUtils]: 22: Hoare triple {5733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5734#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:50,216 INFO L273 TraceCheckUtils]: 23: Hoare triple {5734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5735#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:50,217 INFO L273 TraceCheckUtils]: 24: Hoare triple {5735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5736#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:50,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {5736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5737#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:50,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {5737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5738#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:50,220 INFO L273 TraceCheckUtils]: 27: Hoare triple {5738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5739#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:50,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5716#false} is VALID [2018-11-23 12:02:50,221 INFO L273 TraceCheckUtils]: 29: Hoare triple {5716#false} havoc ~x~0;~x~0 := 0; {5716#false} is VALID [2018-11-23 12:02:50,221 INFO L273 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5716#false} is VALID [2018-11-23 12:02:50,221 INFO L256 TraceCheckUtils]: 31: Hoare triple {5716#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5716#false} is VALID [2018-11-23 12:02:50,221 INFO L273 TraceCheckUtils]: 32: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2018-11-23 12:02:50,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2018-11-23 12:02:50,222 INFO L273 TraceCheckUtils]: 34: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2018-11-23 12:02:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:50,224 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:50,224 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-23 12:02:50,232 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:02:50,251 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:02:50,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:50,260 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:50,449 INFO L256 TraceCheckUtils]: 0: Hoare triple {5715#true} call ULTIMATE.init(); {5715#true} is VALID [2018-11-23 12:02:50,450 INFO L273 TraceCheckUtils]: 1: Hoare triple {5715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5715#true} is VALID [2018-11-23 12:02:50,450 INFO L273 TraceCheckUtils]: 2: Hoare triple {5715#true} assume true; {5715#true} is VALID [2018-11-23 12:02:50,450 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5715#true} {5715#true} #48#return; {5715#true} is VALID [2018-11-23 12:02:50,450 INFO L256 TraceCheckUtils]: 4: Hoare triple {5715#true} call #t~ret2 := main(); {5715#true} is VALID [2018-11-23 12:02:50,451 INFO L273 TraceCheckUtils]: 5: Hoare triple {5715#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {5758#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:50,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {5758#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5718#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:50,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {5718#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5719#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:50,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {5719#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5720#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:50,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {5720#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5721#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:50,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {5721#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5722#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:50,455 INFO L273 TraceCheckUtils]: 11: Hoare triple {5722#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5723#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:50,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {5723#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5724#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:50,456 INFO L273 TraceCheckUtils]: 13: Hoare triple {5724#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5725#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:50,457 INFO L273 TraceCheckUtils]: 14: Hoare triple {5725#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5726#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:50,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {5726#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5727#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:50,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {5727#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5728#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:50,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {5728#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5729#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:50,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {5729#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5730#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:50,462 INFO L273 TraceCheckUtils]: 19: Hoare triple {5730#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5731#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:50,462 INFO L273 TraceCheckUtils]: 20: Hoare triple {5731#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5732#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:50,463 INFO L273 TraceCheckUtils]: 21: Hoare triple {5732#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5733#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:50,464 INFO L273 TraceCheckUtils]: 22: Hoare triple {5733#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5734#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:50,465 INFO L273 TraceCheckUtils]: 23: Hoare triple {5734#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5735#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:50,466 INFO L273 TraceCheckUtils]: 24: Hoare triple {5735#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5736#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:50,467 INFO L273 TraceCheckUtils]: 25: Hoare triple {5736#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5737#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:50,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {5737#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5738#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:50,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {5738#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {5739#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:50,469 INFO L273 TraceCheckUtils]: 28: Hoare triple {5739#(<= main_~i~0 22)} assume !(~i~0 < 100000); {5716#false} is VALID [2018-11-23 12:02:50,469 INFO L273 TraceCheckUtils]: 29: Hoare triple {5716#false} havoc ~x~0;~x~0 := 0; {5716#false} is VALID [2018-11-23 12:02:50,470 INFO L273 TraceCheckUtils]: 30: Hoare triple {5716#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {5716#false} is VALID [2018-11-23 12:02:50,470 INFO L256 TraceCheckUtils]: 31: Hoare triple {5716#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {5716#false} is VALID [2018-11-23 12:02:50,470 INFO L273 TraceCheckUtils]: 32: Hoare triple {5716#false} ~cond := #in~cond; {5716#false} is VALID [2018-11-23 12:02:50,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {5716#false} assume 0 == ~cond; {5716#false} is VALID [2018-11-23 12:02:50,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {5716#false} assume !false; {5716#false} is VALID [2018-11-23 12:02:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:50,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:50,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2018-11-23 12:02:50,491 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-11-23 12:02:50,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:50,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:02:50,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:50,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:02:50,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:02:50,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:02:50,519 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 26 states. [2018-11-23 12:02:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,729 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-11-23 12:02:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:02:50,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 35 [2018-11-23 12:02:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 12:02:50,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:02:50,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2018-11-23 12:02:50,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2018-11-23 12:02:50,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:50,779 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:02:50,780 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:02:50,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:02:50,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:02:50,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 12:02:50,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:50,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:50,826 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:50,826 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:50,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,828 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:02:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:02:50,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,828 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:50,829 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 41 states. [2018-11-23 12:02:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:50,830 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-11-23 12:02:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:02:50,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:50,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:50,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:50,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:02:50,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-11-23 12:02:50,831 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 35 [2018-11-23 12:02:50,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:50,832 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-11-23 12:02:50,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:02:50,832 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-11-23 12:02:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 12:02:50,832 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:50,833 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:50,833 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:50,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:50,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1789613074, now seen corresponding path program 23 times [2018-11-23 12:02:50,833 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:50,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:50,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:50,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:51,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2018-11-23 12:02:51,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {6085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6085#true} is VALID [2018-11-23 12:02:51,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {6085#true} assume true; {6085#true} is VALID [2018-11-23 12:02:51,227 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6085#true} {6085#true} #48#return; {6085#true} is VALID [2018-11-23 12:02:51,227 INFO L256 TraceCheckUtils]: 4: Hoare triple {6085#true} call #t~ret2 := main(); {6085#true} is VALID [2018-11-23 12:02:51,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {6085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6087#(= main_~i~0 0)} is VALID [2018-11-23 12:02:51,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {6087#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6088#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:51,229 INFO L273 TraceCheckUtils]: 7: Hoare triple {6088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6089#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:51,229 INFO L273 TraceCheckUtils]: 8: Hoare triple {6089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6090#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:51,230 INFO L273 TraceCheckUtils]: 9: Hoare triple {6090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6091#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:51,231 INFO L273 TraceCheckUtils]: 10: Hoare triple {6091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6092#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:51,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {6092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6093#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:51,232 INFO L273 TraceCheckUtils]: 12: Hoare triple {6093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6094#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:51,233 INFO L273 TraceCheckUtils]: 13: Hoare triple {6094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6095#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:51,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {6095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6096#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:51,235 INFO L273 TraceCheckUtils]: 15: Hoare triple {6096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6097#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:51,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {6097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6098#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:51,237 INFO L273 TraceCheckUtils]: 17: Hoare triple {6098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6099#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:51,238 INFO L273 TraceCheckUtils]: 18: Hoare triple {6099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6100#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:51,239 INFO L273 TraceCheckUtils]: 19: Hoare triple {6100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6101#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:51,240 INFO L273 TraceCheckUtils]: 20: Hoare triple {6101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6102#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:51,241 INFO L273 TraceCheckUtils]: 21: Hoare triple {6102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6103#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:51,242 INFO L273 TraceCheckUtils]: 22: Hoare triple {6103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6104#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:51,243 INFO L273 TraceCheckUtils]: 23: Hoare triple {6104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6105#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:51,244 INFO L273 TraceCheckUtils]: 24: Hoare triple {6105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6106#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:51,245 INFO L273 TraceCheckUtils]: 25: Hoare triple {6106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6107#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:51,246 INFO L273 TraceCheckUtils]: 26: Hoare triple {6107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6108#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:51,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {6108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6109#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:51,247 INFO L273 TraceCheckUtils]: 28: Hoare triple {6109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6110#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:51,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(<= main_~i~0 23)} assume !(~i~0 < 100000); {6086#false} is VALID [2018-11-23 12:02:51,248 INFO L273 TraceCheckUtils]: 30: Hoare triple {6086#false} havoc ~x~0;~x~0 := 0; {6086#false} is VALID [2018-11-23 12:02:51,249 INFO L273 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6086#false} is VALID [2018-11-23 12:02:51,249 INFO L256 TraceCheckUtils]: 32: Hoare triple {6086#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6086#false} is VALID [2018-11-23 12:02:51,249 INFO L273 TraceCheckUtils]: 33: Hoare triple {6086#false} ~cond := #in~cond; {6086#false} is VALID [2018-11-23 12:02:51,249 INFO L273 TraceCheckUtils]: 34: Hoare triple {6086#false} assume 0 == ~cond; {6086#false} is VALID [2018-11-23 12:02:51,249 INFO L273 TraceCheckUtils]: 35: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2018-11-23 12:02:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:51,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:51,252 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-23 12:02:51,261 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:02:51,469 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2018-11-23 12:02:51,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:51,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:51,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {6085#true} call ULTIMATE.init(); {6085#true} is VALID [2018-11-23 12:02:51,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {6085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6085#true} is VALID [2018-11-23 12:02:51,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {6085#true} assume true; {6085#true} is VALID [2018-11-23 12:02:51,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6085#true} {6085#true} #48#return; {6085#true} is VALID [2018-11-23 12:02:51,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {6085#true} call #t~ret2 := main(); {6085#true} is VALID [2018-11-23 12:02:51,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {6085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6129#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:51,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {6129#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6088#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:51,714 INFO L273 TraceCheckUtils]: 7: Hoare triple {6088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6089#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:51,715 INFO L273 TraceCheckUtils]: 8: Hoare triple {6089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6090#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:51,715 INFO L273 TraceCheckUtils]: 9: Hoare triple {6090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6091#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:51,716 INFO L273 TraceCheckUtils]: 10: Hoare triple {6091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6092#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:51,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {6092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6093#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:51,718 INFO L273 TraceCheckUtils]: 12: Hoare triple {6093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6094#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:51,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {6094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6095#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:51,720 INFO L273 TraceCheckUtils]: 14: Hoare triple {6095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6096#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:51,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {6096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6097#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:51,722 INFO L273 TraceCheckUtils]: 16: Hoare triple {6097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6098#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:51,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {6098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6099#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:51,724 INFO L273 TraceCheckUtils]: 18: Hoare triple {6099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6100#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:51,725 INFO L273 TraceCheckUtils]: 19: Hoare triple {6100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6101#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:51,726 INFO L273 TraceCheckUtils]: 20: Hoare triple {6101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6102#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:51,727 INFO L273 TraceCheckUtils]: 21: Hoare triple {6102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6103#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:51,728 INFO L273 TraceCheckUtils]: 22: Hoare triple {6103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6104#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:51,729 INFO L273 TraceCheckUtils]: 23: Hoare triple {6104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6105#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:51,730 INFO L273 TraceCheckUtils]: 24: Hoare triple {6105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6106#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:51,730 INFO L273 TraceCheckUtils]: 25: Hoare triple {6106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6107#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:51,731 INFO L273 TraceCheckUtils]: 26: Hoare triple {6107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6108#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:51,732 INFO L273 TraceCheckUtils]: 27: Hoare triple {6108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6109#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:51,733 INFO L273 TraceCheckUtils]: 28: Hoare triple {6109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6110#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:51,734 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(<= main_~i~0 23)} assume !(~i~0 < 100000); {6086#false} is VALID [2018-11-23 12:02:51,734 INFO L273 TraceCheckUtils]: 30: Hoare triple {6086#false} havoc ~x~0;~x~0 := 0; {6086#false} is VALID [2018-11-23 12:02:51,734 INFO L273 TraceCheckUtils]: 31: Hoare triple {6086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6086#false} is VALID [2018-11-23 12:02:51,735 INFO L256 TraceCheckUtils]: 32: Hoare triple {6086#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6086#false} is VALID [2018-11-23 12:02:51,735 INFO L273 TraceCheckUtils]: 33: Hoare triple {6086#false} ~cond := #in~cond; {6086#false} is VALID [2018-11-23 12:02:51,735 INFO L273 TraceCheckUtils]: 34: Hoare triple {6086#false} assume 0 == ~cond; {6086#false} is VALID [2018-11-23 12:02:51,735 INFO L273 TraceCheckUtils]: 35: Hoare triple {6086#false} assume !false; {6086#false} is VALID [2018-11-23 12:02:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:51,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:51,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2018-11-23 12:02:51,759 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 12:02:51,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:51,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:02:51,789 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:51,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:02:51,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:02:51,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:02:51,790 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 27 states. [2018-11-23 12:02:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,498 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-11-23 12:02:52,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:02:52,498 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2018-11-23 12:02:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:52,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:02:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 12:02:52,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:02:52,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 55 transitions. [2018-11-23 12:02:52,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 55 transitions. [2018-11-23 12:02:52,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:52,544 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:02:52,545 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:02:52,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 36 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-23 12:02:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:02:52,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 12:02:52,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:52,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:52,629 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:52,630 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,631 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:02:52,631 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:02:52,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:52,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:52,631 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:52,632 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 12:02:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:52,632 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2018-11-23 12:02:52,632 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:02:52,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:52,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:52,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:52,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:52,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:02:52,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-11-23 12:02:52,633 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 36 [2018-11-23 12:02:52,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:52,634 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-11-23 12:02:52,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:02:52,634 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-11-23 12:02:52,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 12:02:52,634 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:52,635 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:52,635 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:52,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:52,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1734509134, now seen corresponding path program 24 times [2018-11-23 12:02:52,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:52,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:52,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:52,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:53,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 12:02:53,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 12:02:53,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 12:02:53,677 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #48#return; {6465#true} is VALID [2018-11-23 12:02:53,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret2 := main(); {6465#true} is VALID [2018-11-23 12:02:53,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6467#(= main_~i~0 0)} is VALID [2018-11-23 12:02:53,678 INFO L273 TraceCheckUtils]: 6: Hoare triple {6467#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6468#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:53,679 INFO L273 TraceCheckUtils]: 7: Hoare triple {6468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6469#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:53,679 INFO L273 TraceCheckUtils]: 8: Hoare triple {6469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6470#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:53,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {6470#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6471#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:53,680 INFO L273 TraceCheckUtils]: 10: Hoare triple {6471#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6472#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:53,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {6472#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6473#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:53,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6474#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:53,683 INFO L273 TraceCheckUtils]: 13: Hoare triple {6474#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6475#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:53,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {6475#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6476#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:53,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {6476#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6477#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:53,686 INFO L273 TraceCheckUtils]: 16: Hoare triple {6477#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6478#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:53,687 INFO L273 TraceCheckUtils]: 17: Hoare triple {6478#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:53,687 INFO L273 TraceCheckUtils]: 18: Hoare triple {6479#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6480#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:53,688 INFO L273 TraceCheckUtils]: 19: Hoare triple {6480#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6481#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:53,689 INFO L273 TraceCheckUtils]: 20: Hoare triple {6481#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6482#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:53,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6483#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:53,691 INFO L273 TraceCheckUtils]: 22: Hoare triple {6483#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6484#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:53,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {6484#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:53,693 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:53,694 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6487#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:53,695 INFO L273 TraceCheckUtils]: 26: Hoare triple {6487#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6488#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:53,696 INFO L273 TraceCheckUtils]: 27: Hoare triple {6488#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6489#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:53,697 INFO L273 TraceCheckUtils]: 28: Hoare triple {6489#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6490#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:53,698 INFO L273 TraceCheckUtils]: 29: Hoare triple {6490#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6491#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:53,699 INFO L273 TraceCheckUtils]: 30: Hoare triple {6491#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 12:02:53,699 INFO L273 TraceCheckUtils]: 31: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 12:02:53,699 INFO L273 TraceCheckUtils]: 32: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 12:02:53,699 INFO L256 TraceCheckUtils]: 33: Hoare triple {6466#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6466#false} is VALID [2018-11-23 12:02:53,699 INFO L273 TraceCheckUtils]: 34: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 12:02:53,700 INFO L273 TraceCheckUtils]: 35: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 12:02:53,700 INFO L273 TraceCheckUtils]: 36: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 12:02:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:53,702 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:53,702 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-23 12:02:53,713 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:02:55,187 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 12:02:55,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:55,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:55,369 INFO L256 TraceCheckUtils]: 0: Hoare triple {6465#true} call ULTIMATE.init(); {6465#true} is VALID [2018-11-23 12:02:55,369 INFO L273 TraceCheckUtils]: 1: Hoare triple {6465#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6465#true} is VALID [2018-11-23 12:02:55,370 INFO L273 TraceCheckUtils]: 2: Hoare triple {6465#true} assume true; {6465#true} is VALID [2018-11-23 12:02:55,370 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6465#true} {6465#true} #48#return; {6465#true} is VALID [2018-11-23 12:02:55,370 INFO L256 TraceCheckUtils]: 4: Hoare triple {6465#true} call #t~ret2 := main(); {6465#true} is VALID [2018-11-23 12:02:55,371 INFO L273 TraceCheckUtils]: 5: Hoare triple {6465#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6510#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:55,372 INFO L273 TraceCheckUtils]: 6: Hoare triple {6510#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6468#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:55,372 INFO L273 TraceCheckUtils]: 7: Hoare triple {6468#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6469#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:55,373 INFO L273 TraceCheckUtils]: 8: Hoare triple {6469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6470#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:55,373 INFO L273 TraceCheckUtils]: 9: Hoare triple {6470#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6471#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:55,374 INFO L273 TraceCheckUtils]: 10: Hoare triple {6471#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6472#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:55,375 INFO L273 TraceCheckUtils]: 11: Hoare triple {6472#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6473#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:55,375 INFO L273 TraceCheckUtils]: 12: Hoare triple {6473#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6474#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:55,376 INFO L273 TraceCheckUtils]: 13: Hoare triple {6474#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6475#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:55,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {6475#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6476#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:55,378 INFO L273 TraceCheckUtils]: 15: Hoare triple {6476#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6477#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:55,379 INFO L273 TraceCheckUtils]: 16: Hoare triple {6477#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6478#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:55,380 INFO L273 TraceCheckUtils]: 17: Hoare triple {6478#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6479#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:55,381 INFO L273 TraceCheckUtils]: 18: Hoare triple {6479#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6480#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:55,382 INFO L273 TraceCheckUtils]: 19: Hoare triple {6480#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6481#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:55,383 INFO L273 TraceCheckUtils]: 20: Hoare triple {6481#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6482#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:55,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {6482#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6483#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:55,385 INFO L273 TraceCheckUtils]: 22: Hoare triple {6483#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6484#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:55,386 INFO L273 TraceCheckUtils]: 23: Hoare triple {6484#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6485#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:55,387 INFO L273 TraceCheckUtils]: 24: Hoare triple {6485#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6486#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:55,388 INFO L273 TraceCheckUtils]: 25: Hoare triple {6486#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6487#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:55,389 INFO L273 TraceCheckUtils]: 26: Hoare triple {6487#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6488#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:55,390 INFO L273 TraceCheckUtils]: 27: Hoare triple {6488#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6489#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:55,391 INFO L273 TraceCheckUtils]: 28: Hoare triple {6489#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6490#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:55,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {6490#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6491#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:55,392 INFO L273 TraceCheckUtils]: 30: Hoare triple {6491#(<= main_~i~0 24)} assume !(~i~0 < 100000); {6466#false} is VALID [2018-11-23 12:02:55,392 INFO L273 TraceCheckUtils]: 31: Hoare triple {6466#false} havoc ~x~0;~x~0 := 0; {6466#false} is VALID [2018-11-23 12:02:55,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {6466#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6466#false} is VALID [2018-11-23 12:02:55,393 INFO L256 TraceCheckUtils]: 33: Hoare triple {6466#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6466#false} is VALID [2018-11-23 12:02:55,393 INFO L273 TraceCheckUtils]: 34: Hoare triple {6466#false} ~cond := #in~cond; {6466#false} is VALID [2018-11-23 12:02:55,393 INFO L273 TraceCheckUtils]: 35: Hoare triple {6466#false} assume 0 == ~cond; {6466#false} is VALID [2018-11-23 12:02:55,394 INFO L273 TraceCheckUtils]: 36: Hoare triple {6466#false} assume !false; {6466#false} is VALID [2018-11-23 12:02:55,396 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:55,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:55,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 28 [2018-11-23 12:02:55,418 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2018-11-23 12:02:55,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:55,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:02:55,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:55,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:02:55,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:02:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:02:55,452 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 28 states. [2018-11-23 12:02:55,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,857 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:02:55,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 12:02:55,858 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 37 [2018-11-23 12:02:55,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 12:02:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:02:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 56 transitions. [2018-11-23 12:02:55,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 56 transitions. [2018-11-23 12:02:55,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:55,907 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:02:55,907 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 12:02:55,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 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-23 12:02:55,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 12:02:55,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-11-23 12:02:55,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:55,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:55,934 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:55,934 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:55,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,935 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:02:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:02:55,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:55,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:55,936 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:55,936 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 43 states. [2018-11-23 12:02:55,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:55,937 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-11-23 12:02:55,937 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:02:55,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:55,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:55,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:55,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:02:55,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-11-23 12:02:55,938 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 37 [2018-11-23 12:02:55,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:55,938 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-11-23 12:02:55,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:02:55,938 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-11-23 12:02:55,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:02:55,939 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:55,939 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:55,939 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:55,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:55,939 INFO L82 PathProgramCache]: Analyzing trace with hash -26286994, now seen corresponding path program 25 times [2018-11-23 12:02:55,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:55,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:55,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:55,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:56,901 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 12:02:56,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 12:02:56,902 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 12:02:56,902 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #48#return; {6855#true} is VALID [2018-11-23 12:02:56,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 12:02:56,903 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6857#(= main_~i~0 0)} is VALID [2018-11-23 12:02:56,904 INFO L273 TraceCheckUtils]: 6: Hoare triple {6857#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:56,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {6858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:56,905 INFO L273 TraceCheckUtils]: 8: Hoare triple {6859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:56,906 INFO L273 TraceCheckUtils]: 9: Hoare triple {6860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:56,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:56,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:56,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {6863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:56,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {6864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:56,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {6865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:56,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {6866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6867#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:56,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {6867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6868#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:56,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {6868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6869#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:56,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {6869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6870#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:56,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {6870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6871#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:56,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {6871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6872#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:56,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {6872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6873#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:56,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {6873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6874#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:56,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {6874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6875#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:56,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {6875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6876#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:56,922 INFO L273 TraceCheckUtils]: 25: Hoare triple {6876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6877#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:56,923 INFO L273 TraceCheckUtils]: 26: Hoare triple {6877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6878#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:56,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {6878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6879#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:56,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {6879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:56,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {6880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6881#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:56,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {6881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6882#(<= main_~i~0 25)} is VALID [2018-11-23 12:02:56,927 INFO L273 TraceCheckUtils]: 31: Hoare triple {6882#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:02:56,927 INFO L273 TraceCheckUtils]: 32: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 12:02:56,927 INFO L273 TraceCheckUtils]: 33: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 12:02:56,928 INFO L256 TraceCheckUtils]: 34: Hoare triple {6856#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 12:02:56,928 INFO L273 TraceCheckUtils]: 35: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 12:02:56,928 INFO L273 TraceCheckUtils]: 36: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 12:02:56,928 INFO L273 TraceCheckUtils]: 37: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 12:02:56,930 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:56,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:56,931 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-23 12:02:56,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:56,977 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:57,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {6855#true} call ULTIMATE.init(); {6855#true} is VALID [2018-11-23 12:02:57,173 INFO L273 TraceCheckUtils]: 1: Hoare triple {6855#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6855#true} is VALID [2018-11-23 12:02:57,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {6855#true} assume true; {6855#true} is VALID [2018-11-23 12:02:57,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6855#true} {6855#true} #48#return; {6855#true} is VALID [2018-11-23 12:02:57,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {6855#true} call #t~ret2 := main(); {6855#true} is VALID [2018-11-23 12:02:57,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {6855#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {6901#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:57,175 INFO L273 TraceCheckUtils]: 6: Hoare triple {6901#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6858#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:57,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {6858#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6859#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:57,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {6859#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6860#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:57,177 INFO L273 TraceCheckUtils]: 9: Hoare triple {6860#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6861#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:57,177 INFO L273 TraceCheckUtils]: 10: Hoare triple {6861#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6862#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:57,178 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6863#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:57,178 INFO L273 TraceCheckUtils]: 12: Hoare triple {6863#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6864#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:57,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {6864#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6865#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:57,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {6865#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6866#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:57,181 INFO L273 TraceCheckUtils]: 15: Hoare triple {6866#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6867#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:57,182 INFO L273 TraceCheckUtils]: 16: Hoare triple {6867#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6868#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:57,183 INFO L273 TraceCheckUtils]: 17: Hoare triple {6868#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6869#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:57,184 INFO L273 TraceCheckUtils]: 18: Hoare triple {6869#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6870#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:57,185 INFO L273 TraceCheckUtils]: 19: Hoare triple {6870#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6871#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:57,185 INFO L273 TraceCheckUtils]: 20: Hoare triple {6871#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6872#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:57,186 INFO L273 TraceCheckUtils]: 21: Hoare triple {6872#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6873#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:57,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {6873#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6874#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:57,188 INFO L273 TraceCheckUtils]: 23: Hoare triple {6874#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6875#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:57,189 INFO L273 TraceCheckUtils]: 24: Hoare triple {6875#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6876#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:57,190 INFO L273 TraceCheckUtils]: 25: Hoare triple {6876#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6877#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:57,191 INFO L273 TraceCheckUtils]: 26: Hoare triple {6877#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6878#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:57,192 INFO L273 TraceCheckUtils]: 27: Hoare triple {6878#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6879#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:57,193 INFO L273 TraceCheckUtils]: 28: Hoare triple {6879#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6880#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:57,193 INFO L273 TraceCheckUtils]: 29: Hoare triple {6880#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6881#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:57,194 INFO L273 TraceCheckUtils]: 30: Hoare triple {6881#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {6882#(<= main_~i~0 25)} is VALID [2018-11-23 12:02:57,195 INFO L273 TraceCheckUtils]: 31: Hoare triple {6882#(<= main_~i~0 25)} assume !(~i~0 < 100000); {6856#false} is VALID [2018-11-23 12:02:57,195 INFO L273 TraceCheckUtils]: 32: Hoare triple {6856#false} havoc ~x~0;~x~0 := 0; {6856#false} is VALID [2018-11-23 12:02:57,196 INFO L273 TraceCheckUtils]: 33: Hoare triple {6856#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {6856#false} is VALID [2018-11-23 12:02:57,196 INFO L256 TraceCheckUtils]: 34: Hoare triple {6856#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {6856#false} is VALID [2018-11-23 12:02:57,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {6856#false} ~cond := #in~cond; {6856#false} is VALID [2018-11-23 12:02:57,196 INFO L273 TraceCheckUtils]: 36: Hoare triple {6856#false} assume 0 == ~cond; {6856#false} is VALID [2018-11-23 12:02:57,196 INFO L273 TraceCheckUtils]: 37: Hoare triple {6856#false} assume !false; {6856#false} is VALID [2018-11-23 12:02:57,198 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:57,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:57,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2018-11-23 12:02:57,218 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-11-23 12:02:57,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:57,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 12:02:57,246 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:57,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 12:02:57,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 12:02:57,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 12:02:57,247 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 29 states. [2018-11-23 12:02:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:57,617 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-11-23 12:02:57,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:02:57,618 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 38 [2018-11-23 12:02:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:02:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 12:02:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 12:02:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 57 transitions. [2018-11-23 12:02:57,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 57 transitions. [2018-11-23 12:02:57,660 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:57,661 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:02:57,661 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:02:57,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 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-23 12:02:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:02:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 12:02:57,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:57,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:57,689 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:57,689 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:57,690 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:02:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:02:57,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:57,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:57,691 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:57,691 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-23 12:02:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:57,692 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2018-11-23 12:02:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:02:57,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:57,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:57,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:57,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:57,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:02:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2018-11-23 12:02:57,693 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 38 [2018-11-23 12:02:57,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:57,694 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2018-11-23 12:02:57,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 12:02:57,694 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2018-11-23 12:02:57,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 12:02:57,694 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:57,694 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:57,694 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:57,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:57,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1388991794, now seen corresponding path program 26 times [2018-11-23 12:02:57,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:57,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:57,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:57,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:02:57,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:58,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {7255#true} call ULTIMATE.init(); {7255#true} is VALID [2018-11-23 12:02:58,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {7255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7255#true} is VALID [2018-11-23 12:02:58,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {7255#true} assume true; {7255#true} is VALID [2018-11-23 12:02:58,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7255#true} {7255#true} #48#return; {7255#true} is VALID [2018-11-23 12:02:58,714 INFO L256 TraceCheckUtils]: 4: Hoare triple {7255#true} call #t~ret2 := main(); {7255#true} is VALID [2018-11-23 12:02:58,714 INFO L273 TraceCheckUtils]: 5: Hoare triple {7255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7257#(= main_~i~0 0)} is VALID [2018-11-23 12:02:58,714 INFO L273 TraceCheckUtils]: 6: Hoare triple {7257#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:58,715 INFO L273 TraceCheckUtils]: 7: Hoare triple {7258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7259#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:58,716 INFO L273 TraceCheckUtils]: 8: Hoare triple {7259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7260#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:58,717 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7261#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:58,718 INFO L273 TraceCheckUtils]: 10: Hoare triple {7261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7262#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:58,719 INFO L273 TraceCheckUtils]: 11: Hoare triple {7262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7263#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:58,720 INFO L273 TraceCheckUtils]: 12: Hoare triple {7263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7264#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:58,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {7264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7265#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:58,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {7265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7266#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:58,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {7266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7267#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:58,743 INFO L273 TraceCheckUtils]: 16: Hoare triple {7267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7268#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:58,744 INFO L273 TraceCheckUtils]: 17: Hoare triple {7268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7269#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:58,744 INFO L273 TraceCheckUtils]: 18: Hoare triple {7269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7270#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:58,745 INFO L273 TraceCheckUtils]: 19: Hoare triple {7270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7271#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:58,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {7271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7272#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:58,746 INFO L273 TraceCheckUtils]: 21: Hoare triple {7272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7273#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:58,747 INFO L273 TraceCheckUtils]: 22: Hoare triple {7273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7274#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:58,747 INFO L273 TraceCheckUtils]: 23: Hoare triple {7274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7275#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:58,748 INFO L273 TraceCheckUtils]: 24: Hoare triple {7275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7276#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:58,749 INFO L273 TraceCheckUtils]: 25: Hoare triple {7276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7277#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:58,750 INFO L273 TraceCheckUtils]: 26: Hoare triple {7277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7278#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:58,751 INFO L273 TraceCheckUtils]: 27: Hoare triple {7278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7279#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:58,752 INFO L273 TraceCheckUtils]: 28: Hoare triple {7279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7280#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:58,753 INFO L273 TraceCheckUtils]: 29: Hoare triple {7280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7281#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:58,754 INFO L273 TraceCheckUtils]: 30: Hoare triple {7281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7282#(<= main_~i~0 25)} is VALID [2018-11-23 12:02:58,755 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7283#(<= main_~i~0 26)} is VALID [2018-11-23 12:02:58,756 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7256#false} is VALID [2018-11-23 12:02:58,756 INFO L273 TraceCheckUtils]: 33: Hoare triple {7256#false} havoc ~x~0;~x~0 := 0; {7256#false} is VALID [2018-11-23 12:02:58,756 INFO L273 TraceCheckUtils]: 34: Hoare triple {7256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7256#false} is VALID [2018-11-23 12:02:58,756 INFO L256 TraceCheckUtils]: 35: Hoare triple {7256#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7256#false} is VALID [2018-11-23 12:02:58,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {7256#false} ~cond := #in~cond; {7256#false} is VALID [2018-11-23 12:02:58,757 INFO L273 TraceCheckUtils]: 37: Hoare triple {7256#false} assume 0 == ~cond; {7256#false} is VALID [2018-11-23 12:02:58,757 INFO L273 TraceCheckUtils]: 38: Hoare triple {7256#false} assume !false; {7256#false} is VALID [2018-11-23 12:02:58,759 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:58,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:02:58,759 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-23 12:02:58,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:02:58,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:02:58,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:02:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:02:58,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:02:58,947 INFO L256 TraceCheckUtils]: 0: Hoare triple {7255#true} call ULTIMATE.init(); {7255#true} is VALID [2018-11-23 12:02:58,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {7255#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7255#true} is VALID [2018-11-23 12:02:58,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {7255#true} assume true; {7255#true} is VALID [2018-11-23 12:02:58,948 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7255#true} {7255#true} #48#return; {7255#true} is VALID [2018-11-23 12:02:58,948 INFO L256 TraceCheckUtils]: 4: Hoare triple {7255#true} call #t~ret2 := main(); {7255#true} is VALID [2018-11-23 12:02:58,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {7255#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7302#(<= main_~i~0 0)} is VALID [2018-11-23 12:02:58,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {7302#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7258#(<= main_~i~0 1)} is VALID [2018-11-23 12:02:58,951 INFO L273 TraceCheckUtils]: 7: Hoare triple {7258#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7259#(<= main_~i~0 2)} is VALID [2018-11-23 12:02:58,951 INFO L273 TraceCheckUtils]: 8: Hoare triple {7259#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7260#(<= main_~i~0 3)} is VALID [2018-11-23 12:02:58,952 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7261#(<= main_~i~0 4)} is VALID [2018-11-23 12:02:58,952 INFO L273 TraceCheckUtils]: 10: Hoare triple {7261#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7262#(<= main_~i~0 5)} is VALID [2018-11-23 12:02:58,953 INFO L273 TraceCheckUtils]: 11: Hoare triple {7262#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7263#(<= main_~i~0 6)} is VALID [2018-11-23 12:02:58,954 INFO L273 TraceCheckUtils]: 12: Hoare triple {7263#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7264#(<= main_~i~0 7)} is VALID [2018-11-23 12:02:58,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {7264#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7265#(<= main_~i~0 8)} is VALID [2018-11-23 12:02:58,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {7265#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7266#(<= main_~i~0 9)} is VALID [2018-11-23 12:02:58,957 INFO L273 TraceCheckUtils]: 15: Hoare triple {7266#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7267#(<= main_~i~0 10)} is VALID [2018-11-23 12:02:58,958 INFO L273 TraceCheckUtils]: 16: Hoare triple {7267#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7268#(<= main_~i~0 11)} is VALID [2018-11-23 12:02:58,959 INFO L273 TraceCheckUtils]: 17: Hoare triple {7268#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7269#(<= main_~i~0 12)} is VALID [2018-11-23 12:02:58,959 INFO L273 TraceCheckUtils]: 18: Hoare triple {7269#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7270#(<= main_~i~0 13)} is VALID [2018-11-23 12:02:58,960 INFO L273 TraceCheckUtils]: 19: Hoare triple {7270#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7271#(<= main_~i~0 14)} is VALID [2018-11-23 12:02:58,961 INFO L273 TraceCheckUtils]: 20: Hoare triple {7271#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7272#(<= main_~i~0 15)} is VALID [2018-11-23 12:02:58,962 INFO L273 TraceCheckUtils]: 21: Hoare triple {7272#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7273#(<= main_~i~0 16)} is VALID [2018-11-23 12:02:58,963 INFO L273 TraceCheckUtils]: 22: Hoare triple {7273#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7274#(<= main_~i~0 17)} is VALID [2018-11-23 12:02:58,964 INFO L273 TraceCheckUtils]: 23: Hoare triple {7274#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7275#(<= main_~i~0 18)} is VALID [2018-11-23 12:02:58,965 INFO L273 TraceCheckUtils]: 24: Hoare triple {7275#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7276#(<= main_~i~0 19)} is VALID [2018-11-23 12:02:58,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {7276#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7277#(<= main_~i~0 20)} is VALID [2018-11-23 12:02:58,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {7277#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7278#(<= main_~i~0 21)} is VALID [2018-11-23 12:02:58,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {7278#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7279#(<= main_~i~0 22)} is VALID [2018-11-23 12:02:58,968 INFO L273 TraceCheckUtils]: 28: Hoare triple {7279#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7280#(<= main_~i~0 23)} is VALID [2018-11-23 12:02:58,969 INFO L273 TraceCheckUtils]: 29: Hoare triple {7280#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7281#(<= main_~i~0 24)} is VALID [2018-11-23 12:02:58,970 INFO L273 TraceCheckUtils]: 30: Hoare triple {7281#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7282#(<= main_~i~0 25)} is VALID [2018-11-23 12:02:58,971 INFO L273 TraceCheckUtils]: 31: Hoare triple {7282#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7283#(<= main_~i~0 26)} is VALID [2018-11-23 12:02:58,972 INFO L273 TraceCheckUtils]: 32: Hoare triple {7283#(<= main_~i~0 26)} assume !(~i~0 < 100000); {7256#false} is VALID [2018-11-23 12:02:58,972 INFO L273 TraceCheckUtils]: 33: Hoare triple {7256#false} havoc ~x~0;~x~0 := 0; {7256#false} is VALID [2018-11-23 12:02:58,972 INFO L273 TraceCheckUtils]: 34: Hoare triple {7256#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7256#false} is VALID [2018-11-23 12:02:58,972 INFO L256 TraceCheckUtils]: 35: Hoare triple {7256#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7256#false} is VALID [2018-11-23 12:02:58,973 INFO L273 TraceCheckUtils]: 36: Hoare triple {7256#false} ~cond := #in~cond; {7256#false} is VALID [2018-11-23 12:02:58,973 INFO L273 TraceCheckUtils]: 37: Hoare triple {7256#false} assume 0 == ~cond; {7256#false} is VALID [2018-11-23 12:02:58,973 INFO L273 TraceCheckUtils]: 38: Hoare triple {7256#false} assume !false; {7256#false} is VALID [2018-11-23 12:02:58,975 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:02:58,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:02:58,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2018-11-23 12:02:58,994 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-11-23 12:02:58,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:02:58,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:02:59,024 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:02:59,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:02:59,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:02:59,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:02:59,026 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 30 states. [2018-11-23 12:02:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,465 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2018-11-23 12:02:59,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:02:59,466 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 39 [2018-11-23 12:02:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:02:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:02:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 12:02:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:02:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 58 transitions. [2018-11-23 12:02:59,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 58 transitions. [2018-11-23 12:02:59,595 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-23 12:02:59,596 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:02:59,596 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:02:59,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:02:59,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:02:59,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 12:02:59,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:02:59,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-23 12:02:59,620 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:02:59,620 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:02:59,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,621 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:02:59,621 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:02:59,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:59,621 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:59,622 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-23 12:02:59,622 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-23 12:02:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:02:59,623 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-11-23 12:02:59,623 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:02:59,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:02:59,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:02:59,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:02:59,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:02:59,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:02:59,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:02:59,625 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 39 [2018-11-23 12:02:59,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:02:59,625 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:02:59,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:02:59,625 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:02:59,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 12:02:59,626 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:02:59,626 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:02:59,626 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:02:59,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:02:59,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1982006034, now seen corresponding path program 27 times [2018-11-23 12:02:59,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:02:59,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:02:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:59,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:02:59,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:02:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:00,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {7665#true} call ULTIMATE.init(); {7665#true} is VALID [2018-11-23 12:03:00,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {7665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7665#true} is VALID [2018-11-23 12:03:00,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {7665#true} assume true; {7665#true} is VALID [2018-11-23 12:03:00,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7665#true} {7665#true} #48#return; {7665#true} is VALID [2018-11-23 12:03:00,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {7665#true} call #t~ret2 := main(); {7665#true} is VALID [2018-11-23 12:03:00,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {7665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7667#(= main_~i~0 0)} is VALID [2018-11-23 12:03:00,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {7667#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7668#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:00,214 INFO L273 TraceCheckUtils]: 7: Hoare triple {7668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7669#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:00,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {7669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7670#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:00,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {7670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7671#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:00,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {7671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7672#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:00,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {7672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7673#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:00,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {7673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7674#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:00,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7675#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:00,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {7675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7676#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:00,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {7676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7677#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:00,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {7677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7678#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:00,222 INFO L273 TraceCheckUtils]: 17: Hoare triple {7678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7679#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:00,223 INFO L273 TraceCheckUtils]: 18: Hoare triple {7679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7680#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:00,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {7680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7681#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:00,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7682#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:00,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {7682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7683#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:00,227 INFO L273 TraceCheckUtils]: 22: Hoare triple {7683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7684#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:00,228 INFO L273 TraceCheckUtils]: 23: Hoare triple {7684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7685#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:00,229 INFO L273 TraceCheckUtils]: 24: Hoare triple {7685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7686#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:00,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {7686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7687#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:00,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7688#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:00,231 INFO L273 TraceCheckUtils]: 27: Hoare triple {7688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7689#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:00,232 INFO L273 TraceCheckUtils]: 28: Hoare triple {7689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7690#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:00,233 INFO L273 TraceCheckUtils]: 29: Hoare triple {7690#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7691#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:00,234 INFO L273 TraceCheckUtils]: 30: Hoare triple {7691#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7692#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:00,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7693#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:00,236 INFO L273 TraceCheckUtils]: 32: Hoare triple {7693#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7694#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:00,237 INFO L273 TraceCheckUtils]: 33: Hoare triple {7694#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7666#false} is VALID [2018-11-23 12:03:00,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {7666#false} havoc ~x~0;~x~0 := 0; {7666#false} is VALID [2018-11-23 12:03:00,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {7666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7666#false} is VALID [2018-11-23 12:03:00,237 INFO L256 TraceCheckUtils]: 36: Hoare triple {7666#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7666#false} is VALID [2018-11-23 12:03:00,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {7666#false} ~cond := #in~cond; {7666#false} is VALID [2018-11-23 12:03:00,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {7666#false} assume 0 == ~cond; {7666#false} is VALID [2018-11-23 12:03:00,238 INFO L273 TraceCheckUtils]: 39: Hoare triple {7666#false} assume !false; {7666#false} is VALID [2018-11-23 12:03:00,240 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:00,240 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-23 12:03:00,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:01,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 12:03:01,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:01,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:01,968 INFO L256 TraceCheckUtils]: 0: Hoare triple {7665#true} call ULTIMATE.init(); {7665#true} is VALID [2018-11-23 12:03:01,969 INFO L273 TraceCheckUtils]: 1: Hoare triple {7665#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7665#true} is VALID [2018-11-23 12:03:01,969 INFO L273 TraceCheckUtils]: 2: Hoare triple {7665#true} assume true; {7665#true} is VALID [2018-11-23 12:03:01,969 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7665#true} {7665#true} #48#return; {7665#true} is VALID [2018-11-23 12:03:01,969 INFO L256 TraceCheckUtils]: 4: Hoare triple {7665#true} call #t~ret2 := main(); {7665#true} is VALID [2018-11-23 12:03:01,969 INFO L273 TraceCheckUtils]: 5: Hoare triple {7665#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {7713#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:01,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {7713#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7668#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:01,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {7668#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7669#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:01,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {7669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7670#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:01,972 INFO L273 TraceCheckUtils]: 9: Hoare triple {7670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7671#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:01,973 INFO L273 TraceCheckUtils]: 10: Hoare triple {7671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7672#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:01,974 INFO L273 TraceCheckUtils]: 11: Hoare triple {7672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7673#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:01,975 INFO L273 TraceCheckUtils]: 12: Hoare triple {7673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7674#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:01,976 INFO L273 TraceCheckUtils]: 13: Hoare triple {7674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7675#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:01,977 INFO L273 TraceCheckUtils]: 14: Hoare triple {7675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7676#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:01,978 INFO L273 TraceCheckUtils]: 15: Hoare triple {7676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7677#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:01,979 INFO L273 TraceCheckUtils]: 16: Hoare triple {7677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7678#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:01,980 INFO L273 TraceCheckUtils]: 17: Hoare triple {7678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7679#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:01,981 INFO L273 TraceCheckUtils]: 18: Hoare triple {7679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7680#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:01,982 INFO L273 TraceCheckUtils]: 19: Hoare triple {7680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7681#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:01,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {7681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7682#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:01,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {7682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7683#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:01,984 INFO L273 TraceCheckUtils]: 22: Hoare triple {7683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7684#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:01,985 INFO L273 TraceCheckUtils]: 23: Hoare triple {7684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7685#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:01,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {7685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7686#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:01,987 INFO L273 TraceCheckUtils]: 25: Hoare triple {7686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7687#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:01,988 INFO L273 TraceCheckUtils]: 26: Hoare triple {7687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7688#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:01,989 INFO L273 TraceCheckUtils]: 27: Hoare triple {7688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7689#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:01,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {7689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7690#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:01,991 INFO L273 TraceCheckUtils]: 29: Hoare triple {7690#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7691#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:01,992 INFO L273 TraceCheckUtils]: 30: Hoare triple {7691#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7692#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:01,993 INFO L273 TraceCheckUtils]: 31: Hoare triple {7692#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7693#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:01,994 INFO L273 TraceCheckUtils]: 32: Hoare triple {7693#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {7694#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:01,994 INFO L273 TraceCheckUtils]: 33: Hoare triple {7694#(<= main_~i~0 27)} assume !(~i~0 < 100000); {7666#false} is VALID [2018-11-23 12:03:01,995 INFO L273 TraceCheckUtils]: 34: Hoare triple {7666#false} havoc ~x~0;~x~0 := 0; {7666#false} is VALID [2018-11-23 12:03:01,995 INFO L273 TraceCheckUtils]: 35: Hoare triple {7666#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {7666#false} is VALID [2018-11-23 12:03:01,995 INFO L256 TraceCheckUtils]: 36: Hoare triple {7666#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {7666#false} is VALID [2018-11-23 12:03:01,995 INFO L273 TraceCheckUtils]: 37: Hoare triple {7666#false} ~cond := #in~cond; {7666#false} is VALID [2018-11-23 12:03:01,995 INFO L273 TraceCheckUtils]: 38: Hoare triple {7666#false} assume 0 == ~cond; {7666#false} is VALID [2018-11-23 12:03:01,996 INFO L273 TraceCheckUtils]: 39: Hoare triple {7666#false} assume !false; {7666#false} is VALID [2018-11-23 12:03:01,998 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:02,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:02,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2018-11-23 12:03:02,019 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-23 12:03:02,020 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:02,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 12:03:02,051 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-23 12:03:02,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 12:03:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 12:03:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 12:03:02,052 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 31 states. [2018-11-23 12:03:02,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:02,311 INFO L93 Difference]: Finished difference Result 57 states and 59 transitions. [2018-11-23 12:03:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 12:03:02,311 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 40 [2018-11-23 12:03:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:02,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:03:02,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 12:03:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:03:02,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 59 transitions. [2018-11-23 12:03:02,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 59 transitions. [2018-11-23 12:03:02,364 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:02,365 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:03:02,365 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 12:03:02,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 40 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-23 12:03:02,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 12:03:02,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 12:03:02,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:02,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 12:03:02,393 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:03:02,393 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:03:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:02,394 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:03:02,394 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:03:02,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:02,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:02,395 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 12:03:02,395 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 12:03:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:02,396 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-11-23 12:03:02,396 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:03:02,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:02,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:02,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:02,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:03:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-11-23 12:03:02,397 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 40 [2018-11-23 12:03:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:02,398 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-11-23 12:03:02,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 12:03:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-11-23 12:03:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 12:03:02,398 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:02,399 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:02,399 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:02,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:02,399 INFO L82 PathProgramCache]: Analyzing trace with hash 891243698, now seen corresponding path program 28 times [2018-11-23 12:03:02,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:02,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:02,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:02,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,903 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-23 12:03:02,904 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8085#true} is VALID [2018-11-23 12:03:02,904 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-23 12:03:02,904 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #48#return; {8085#true} is VALID [2018-11-23 12:03:02,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret2 := main(); {8085#true} is VALID [2018-11-23 12:03:02,905 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8087#(= main_~i~0 0)} is VALID [2018-11-23 12:03:02,906 INFO L273 TraceCheckUtils]: 6: Hoare triple {8087#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:02,906 INFO L273 TraceCheckUtils]: 7: Hoare triple {8088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8089#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:02,907 INFO L273 TraceCheckUtils]: 8: Hoare triple {8089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8090#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:02,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {8090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8091#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:02,908 INFO L273 TraceCheckUtils]: 10: Hoare triple {8091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8092#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:02,908 INFO L273 TraceCheckUtils]: 11: Hoare triple {8092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8093#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:02,909 INFO L273 TraceCheckUtils]: 12: Hoare triple {8093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8094#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:02,910 INFO L273 TraceCheckUtils]: 13: Hoare triple {8094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8095#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:02,911 INFO L273 TraceCheckUtils]: 14: Hoare triple {8095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8096#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:02,912 INFO L273 TraceCheckUtils]: 15: Hoare triple {8096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8097#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:02,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {8097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8098#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:02,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {8098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8099#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:02,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {8099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8100#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:02,916 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8101#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:02,917 INFO L273 TraceCheckUtils]: 20: Hoare triple {8101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8102#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:02,918 INFO L273 TraceCheckUtils]: 21: Hoare triple {8102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8103#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:02,919 INFO L273 TraceCheckUtils]: 22: Hoare triple {8103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8104#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:02,920 INFO L273 TraceCheckUtils]: 23: Hoare triple {8104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8105#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:02,921 INFO L273 TraceCheckUtils]: 24: Hoare triple {8105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8106#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:02,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {8106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8107#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:02,922 INFO L273 TraceCheckUtils]: 26: Hoare triple {8107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8108#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:02,923 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8109#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:02,924 INFO L273 TraceCheckUtils]: 28: Hoare triple {8109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8110#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:02,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {8110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8111#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:02,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {8111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8112#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:02,927 INFO L273 TraceCheckUtils]: 31: Hoare triple {8112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8113#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:02,928 INFO L273 TraceCheckUtils]: 32: Hoare triple {8113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8114#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:02,929 INFO L273 TraceCheckUtils]: 33: Hoare triple {8114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8115#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:02,930 INFO L273 TraceCheckUtils]: 34: Hoare triple {8115#(<= main_~i~0 28)} assume !(~i~0 < 100000); {8086#false} is VALID [2018-11-23 12:03:02,930 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} havoc ~x~0;~x~0 := 0; {8086#false} is VALID [2018-11-23 12:03:02,930 INFO L273 TraceCheckUtils]: 36: Hoare triple {8086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8086#false} is VALID [2018-11-23 12:03:02,930 INFO L256 TraceCheckUtils]: 37: Hoare triple {8086#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8086#false} is VALID [2018-11-23 12:03:02,931 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-23 12:03:02,931 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume 0 == ~cond; {8086#false} is VALID [2018-11-23 12:03:02,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-23 12:03:02,933 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:02,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:02,934 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-23 12:03:02,943 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:02,969 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:02,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:02,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:03,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {8085#true} call ULTIMATE.init(); {8085#true} is VALID [2018-11-23 12:03:03,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {8085#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8085#true} is VALID [2018-11-23 12:03:03,142 INFO L273 TraceCheckUtils]: 2: Hoare triple {8085#true} assume true; {8085#true} is VALID [2018-11-23 12:03:03,142 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8085#true} {8085#true} #48#return; {8085#true} is VALID [2018-11-23 12:03:03,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {8085#true} call #t~ret2 := main(); {8085#true} is VALID [2018-11-23 12:03:03,143 INFO L273 TraceCheckUtils]: 5: Hoare triple {8085#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8134#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:03,144 INFO L273 TraceCheckUtils]: 6: Hoare triple {8134#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8088#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:03,144 INFO L273 TraceCheckUtils]: 7: Hoare triple {8088#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8089#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:03,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {8089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8090#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:03,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {8090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8091#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:03,146 INFO L273 TraceCheckUtils]: 10: Hoare triple {8091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8092#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:03,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {8092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8093#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:03,148 INFO L273 TraceCheckUtils]: 12: Hoare triple {8093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8094#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:03,149 INFO L273 TraceCheckUtils]: 13: Hoare triple {8094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8095#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:03,150 INFO L273 TraceCheckUtils]: 14: Hoare triple {8095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8096#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:03,151 INFO L273 TraceCheckUtils]: 15: Hoare triple {8096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8097#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:03,152 INFO L273 TraceCheckUtils]: 16: Hoare triple {8097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8098#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:03,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {8098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8099#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:03,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {8099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8100#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:03,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {8100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8101#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:03,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {8101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8102#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:03,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {8102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8103#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:03,157 INFO L273 TraceCheckUtils]: 22: Hoare triple {8103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8104#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:03,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {8104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8105#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:03,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {8105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8106#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:03,160 INFO L273 TraceCheckUtils]: 25: Hoare triple {8106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8107#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:03,161 INFO L273 TraceCheckUtils]: 26: Hoare triple {8107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8108#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:03,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {8108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8109#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:03,163 INFO L273 TraceCheckUtils]: 28: Hoare triple {8109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8110#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:03,164 INFO L273 TraceCheckUtils]: 29: Hoare triple {8110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8111#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:03,165 INFO L273 TraceCheckUtils]: 30: Hoare triple {8111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8112#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:03,166 INFO L273 TraceCheckUtils]: 31: Hoare triple {8112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8113#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:03,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {8113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8114#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:03,168 INFO L273 TraceCheckUtils]: 33: Hoare triple {8114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8115#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:03,168 INFO L273 TraceCheckUtils]: 34: Hoare triple {8115#(<= main_~i~0 28)} assume !(~i~0 < 100000); {8086#false} is VALID [2018-11-23 12:03:03,168 INFO L273 TraceCheckUtils]: 35: Hoare triple {8086#false} havoc ~x~0;~x~0 := 0; {8086#false} is VALID [2018-11-23 12:03:03,169 INFO L273 TraceCheckUtils]: 36: Hoare triple {8086#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8086#false} is VALID [2018-11-23 12:03:03,169 INFO L256 TraceCheckUtils]: 37: Hoare triple {8086#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8086#false} is VALID [2018-11-23 12:03:03,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {8086#false} ~cond := #in~cond; {8086#false} is VALID [2018-11-23 12:03:03,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {8086#false} assume 0 == ~cond; {8086#false} is VALID [2018-11-23 12:03:03,170 INFO L273 TraceCheckUtils]: 40: Hoare triple {8086#false} assume !false; {8086#false} is VALID [2018-11-23 12:03:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:03,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:03,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2018-11-23 12:03:03,191 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-11-23 12:03:03,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:03,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 12:03:03,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:03,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 12:03:03,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 12:03:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 12:03:03,224 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 32 states. [2018-11-23 12:03:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:03,868 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2018-11-23 12:03:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 12:03:03,869 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 41 [2018-11-23 12:03:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:03:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 12:03:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:03:03,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 60 transitions. [2018-11-23 12:03:03,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 60 transitions. [2018-11-23 12:03:03,921 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-23 12:03:03,922 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:03:03,922 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:03:03,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 41 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-23 12:03:03,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:03:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 12:03:04,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:04,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 12:03:04,081 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:03:04,081 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:03:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:04,081 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:03:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:03:04,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:04,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:04,082 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 12:03:04,082 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 12:03:04,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:04,083 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2018-11-23 12:03:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:03:04,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:04,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:04,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:04,083 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:04,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:03:04,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-11-23 12:03:04,084 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 41 [2018-11-23 12:03:04,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:04,084 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-11-23 12:03:04,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 12:03:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-11-23 12:03:04,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:03:04,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:04,085 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:04,085 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:04,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:04,085 INFO L82 PathProgramCache]: Analyzing trace with hash -232327826, now seen corresponding path program 29 times [2018-11-23 12:03:04,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:04,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:04,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:04,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:04,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2018-11-23 12:03:05,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8515#true} is VALID [2018-11-23 12:03:05,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2018-11-23 12:03:05,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #48#return; {8515#true} is VALID [2018-11-23 12:03:05,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret2 := main(); {8515#true} is VALID [2018-11-23 12:03:05,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {8515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8517#(= main_~i~0 0)} is VALID [2018-11-23 12:03:05,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {8517#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {8518#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {8519#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {8520#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,152 INFO L273 TraceCheckUtils]: 10: Hoare triple {8521#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,153 INFO L273 TraceCheckUtils]: 11: Hoare triple {8522#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:05,154 INFO L273 TraceCheckUtils]: 12: Hoare triple {8523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8524#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:05,155 INFO L273 TraceCheckUtils]: 13: Hoare triple {8524#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:05,156 INFO L273 TraceCheckUtils]: 14: Hoare triple {8525#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:05,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {8526#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:05,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {8527#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:05,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:05,160 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:05,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:05,162 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:05,163 INFO L273 TraceCheckUtils]: 21: Hoare triple {8532#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:05,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {8533#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:05,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {8534#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:05,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {8535#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:05,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {8536#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:05,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {8537#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:05,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {8538#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:05,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {8539#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:05,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {8540#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:05,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {8541#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8542#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:05,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {8542#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8543#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:05,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {8543#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8544#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:05,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {8544#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8545#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:05,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8546#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:05,177 INFO L273 TraceCheckUtils]: 35: Hoare triple {8546#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8516#false} is VALID [2018-11-23 12:03:05,177 INFO L273 TraceCheckUtils]: 36: Hoare triple {8516#false} havoc ~x~0;~x~0 := 0; {8516#false} is VALID [2018-11-23 12:03:05,177 INFO L273 TraceCheckUtils]: 37: Hoare triple {8516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8516#false} is VALID [2018-11-23 12:03:05,178 INFO L256 TraceCheckUtils]: 38: Hoare triple {8516#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8516#false} is VALID [2018-11-23 12:03:05,178 INFO L273 TraceCheckUtils]: 39: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2018-11-23 12:03:05,178 INFO L273 TraceCheckUtils]: 40: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2018-11-23 12:03:05,179 INFO L273 TraceCheckUtils]: 41: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2018-11-23 12:03:05,181 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:05,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:05,182 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-23 12:03:05,193 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:05,580 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2018-11-23 12:03:05,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:05,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:05,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:05,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {8515#true} call ULTIMATE.init(); {8515#true} is VALID [2018-11-23 12:03:05,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {8515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8515#true} is VALID [2018-11-23 12:03:05,812 INFO L273 TraceCheckUtils]: 2: Hoare triple {8515#true} assume true; {8515#true} is VALID [2018-11-23 12:03:05,812 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8515#true} {8515#true} #48#return; {8515#true} is VALID [2018-11-23 12:03:05,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {8515#true} call #t~ret2 := main(); {8515#true} is VALID [2018-11-23 12:03:05,813 INFO L273 TraceCheckUtils]: 5: Hoare triple {8515#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8565#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:05,814 INFO L273 TraceCheckUtils]: 6: Hoare triple {8565#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8518#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:05,815 INFO L273 TraceCheckUtils]: 7: Hoare triple {8518#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8519#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:05,815 INFO L273 TraceCheckUtils]: 8: Hoare triple {8519#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8520#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:05,816 INFO L273 TraceCheckUtils]: 9: Hoare triple {8520#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8521#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:05,817 INFO L273 TraceCheckUtils]: 10: Hoare triple {8521#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8522#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:05,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {8522#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8523#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:05,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {8523#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8524#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:05,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {8524#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8525#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:05,821 INFO L273 TraceCheckUtils]: 14: Hoare triple {8525#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8526#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:05,833 INFO L273 TraceCheckUtils]: 15: Hoare triple {8526#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8527#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:05,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {8527#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8528#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:05,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {8528#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8529#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:05,835 INFO L273 TraceCheckUtils]: 18: Hoare triple {8529#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8530#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:05,836 INFO L273 TraceCheckUtils]: 19: Hoare triple {8530#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8531#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:05,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {8531#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8532#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:05,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {8532#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8533#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:05,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {8533#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8534#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:05,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {8534#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8535#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:05,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {8535#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8536#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:05,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {8536#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8537#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:05,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {8537#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8538#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:05,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {8538#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8539#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:05,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {8539#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8540#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:05,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {8540#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8541#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:05,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {8541#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8542#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:05,847 INFO L273 TraceCheckUtils]: 31: Hoare triple {8542#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8543#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:05,848 INFO L273 TraceCheckUtils]: 32: Hoare triple {8543#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8544#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:05,849 INFO L273 TraceCheckUtils]: 33: Hoare triple {8544#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8545#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:05,850 INFO L273 TraceCheckUtils]: 34: Hoare triple {8545#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8546#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:05,850 INFO L273 TraceCheckUtils]: 35: Hoare triple {8546#(<= main_~i~0 29)} assume !(~i~0 < 100000); {8516#false} is VALID [2018-11-23 12:03:05,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {8516#false} havoc ~x~0;~x~0 := 0; {8516#false} is VALID [2018-11-23 12:03:05,851 INFO L273 TraceCheckUtils]: 37: Hoare triple {8516#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8516#false} is VALID [2018-11-23 12:03:05,851 INFO L256 TraceCheckUtils]: 38: Hoare triple {8516#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8516#false} is VALID [2018-11-23 12:03:05,851 INFO L273 TraceCheckUtils]: 39: Hoare triple {8516#false} ~cond := #in~cond; {8516#false} is VALID [2018-11-23 12:03:05,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {8516#false} assume 0 == ~cond; {8516#false} is VALID [2018-11-23 12:03:05,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {8516#false} assume !false; {8516#false} is VALID [2018-11-23 12:03:05,856 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:05,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:05,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2018-11-23 12:03:05,876 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2018-11-23 12:03:05,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:05,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:03:05,914 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-23 12:03:05,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:03:05,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:03:05,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:03:05,916 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 33 states. [2018-11-23 12:03:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,732 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2018-11-23 12:03:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 12:03:06,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 42 [2018-11-23 12:03:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:06,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:03:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 12:03:06,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:03:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 61 transitions. [2018-11-23 12:03:06,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 61 transitions. [2018-11-23 12:03:06,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:06,782 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:03:06,782 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 12:03:06,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:03:06,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 12:03:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 12:03:06,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:06,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 12:03:06,814 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:03:06,815 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:03:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,816 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:03:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:03:06,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,817 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 12:03:06,817 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 12:03:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:06,818 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2018-11-23 12:03:06,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:03:06,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:06,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:06,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:06,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:03:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-11-23 12:03:06,819 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2018-11-23 12:03:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:06,819 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-11-23 12:03:06,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:03:06,819 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-11-23 12:03:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:03:06,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:06,820 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:06,820 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:06,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:06,820 INFO L82 PathProgramCache]: Analyzing trace with hash -703306702, now seen corresponding path program 30 times [2018-11-23 12:03:06,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:06,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:06,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:07,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2018-11-23 12:03:07,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8955#true} is VALID [2018-11-23 12:03:07,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2018-11-23 12:03:07,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #48#return; {8955#true} is VALID [2018-11-23 12:03:07,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret2 := main(); {8955#true} is VALID [2018-11-23 12:03:07,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {8955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {8957#(= main_~i~0 0)} is VALID [2018-11-23 12:03:07,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {8957#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8958#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:07,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {8958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8959#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:07,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {8959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8960#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:07,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {8960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8961#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:07,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {8961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8962#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:07,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {8962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8963#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:07,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {8963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8964#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:07,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {8964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8965#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:07,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {8965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8966#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:07,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {8966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8967#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:07,526 INFO L273 TraceCheckUtils]: 16: Hoare triple {8967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8968#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:07,527 INFO L273 TraceCheckUtils]: 17: Hoare triple {8968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8969#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:07,528 INFO L273 TraceCheckUtils]: 18: Hoare triple {8969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8970#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:07,529 INFO L273 TraceCheckUtils]: 19: Hoare triple {8970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8971#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:07,529 INFO L273 TraceCheckUtils]: 20: Hoare triple {8971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8972#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:07,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {8972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8973#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:07,531 INFO L273 TraceCheckUtils]: 22: Hoare triple {8973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8974#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:07,532 INFO L273 TraceCheckUtils]: 23: Hoare triple {8974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8975#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:07,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {8975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8976#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:07,534 INFO L273 TraceCheckUtils]: 25: Hoare triple {8976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8977#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:07,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {8977#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8978#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:07,536 INFO L273 TraceCheckUtils]: 27: Hoare triple {8978#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8979#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:07,537 INFO L273 TraceCheckUtils]: 28: Hoare triple {8979#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8980#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:07,538 INFO L273 TraceCheckUtils]: 29: Hoare triple {8980#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8981#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:07,539 INFO L273 TraceCheckUtils]: 30: Hoare triple {8981#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8982#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:07,540 INFO L273 TraceCheckUtils]: 31: Hoare triple {8982#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8983#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:07,541 INFO L273 TraceCheckUtils]: 32: Hoare triple {8983#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8984#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:07,542 INFO L273 TraceCheckUtils]: 33: Hoare triple {8984#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8985#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:07,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {8985#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8986#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:07,544 INFO L273 TraceCheckUtils]: 35: Hoare triple {8986#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8987#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:07,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {8987#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8956#false} is VALID [2018-11-23 12:03:07,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {8956#false} havoc ~x~0;~x~0 := 0; {8956#false} is VALID [2018-11-23 12:03:07,545 INFO L273 TraceCheckUtils]: 38: Hoare triple {8956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8956#false} is VALID [2018-11-23 12:03:07,545 INFO L256 TraceCheckUtils]: 39: Hoare triple {8956#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8956#false} is VALID [2018-11-23 12:03:07,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2018-11-23 12:03:07,545 INFO L273 TraceCheckUtils]: 41: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2018-11-23 12:03:07,545 INFO L273 TraceCheckUtils]: 42: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2018-11-23 12:03:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:07,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:07,548 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-23 12:03:07,556 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:13,742 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2018-11-23 12:03:13,742 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:13,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:14,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {8955#true} call ULTIMATE.init(); {8955#true} is VALID [2018-11-23 12:03:14,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {8955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8955#true} is VALID [2018-11-23 12:03:14,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {8955#true} assume true; {8955#true} is VALID [2018-11-23 12:03:14,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8955#true} {8955#true} #48#return; {8955#true} is VALID [2018-11-23 12:03:14,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {8955#true} call #t~ret2 := main(); {8955#true} is VALID [2018-11-23 12:03:14,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {8955#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9006#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:14,148 INFO L273 TraceCheckUtils]: 6: Hoare triple {9006#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8958#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:14,149 INFO L273 TraceCheckUtils]: 7: Hoare triple {8958#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8959#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:14,149 INFO L273 TraceCheckUtils]: 8: Hoare triple {8959#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8960#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:14,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {8960#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8961#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:14,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {8961#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8962#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:14,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {8962#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8963#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:14,153 INFO L273 TraceCheckUtils]: 12: Hoare triple {8963#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8964#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:14,154 INFO L273 TraceCheckUtils]: 13: Hoare triple {8964#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8965#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:14,155 INFO L273 TraceCheckUtils]: 14: Hoare triple {8965#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8966#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:14,156 INFO L273 TraceCheckUtils]: 15: Hoare triple {8966#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8967#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:14,157 INFO L273 TraceCheckUtils]: 16: Hoare triple {8967#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8968#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:14,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {8968#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8969#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:14,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {8969#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8970#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:14,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {8970#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8971#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:14,160 INFO L273 TraceCheckUtils]: 20: Hoare triple {8971#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8972#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:14,161 INFO L273 TraceCheckUtils]: 21: Hoare triple {8972#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8973#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:14,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {8973#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8974#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:14,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {8974#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8975#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:14,164 INFO L273 TraceCheckUtils]: 24: Hoare triple {8975#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8976#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:14,165 INFO L273 TraceCheckUtils]: 25: Hoare triple {8976#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8977#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:14,166 INFO L273 TraceCheckUtils]: 26: Hoare triple {8977#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8978#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:14,167 INFO L273 TraceCheckUtils]: 27: Hoare triple {8978#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8979#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:14,168 INFO L273 TraceCheckUtils]: 28: Hoare triple {8979#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8980#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:14,169 INFO L273 TraceCheckUtils]: 29: Hoare triple {8980#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8981#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:14,170 INFO L273 TraceCheckUtils]: 30: Hoare triple {8981#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8982#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:14,171 INFO L273 TraceCheckUtils]: 31: Hoare triple {8982#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8983#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:14,172 INFO L273 TraceCheckUtils]: 32: Hoare triple {8983#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8984#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:14,173 INFO L273 TraceCheckUtils]: 33: Hoare triple {8984#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8985#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:14,174 INFO L273 TraceCheckUtils]: 34: Hoare triple {8985#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8986#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:14,175 INFO L273 TraceCheckUtils]: 35: Hoare triple {8986#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {8987#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:14,175 INFO L273 TraceCheckUtils]: 36: Hoare triple {8987#(<= main_~i~0 30)} assume !(~i~0 < 100000); {8956#false} is VALID [2018-11-23 12:03:14,175 INFO L273 TraceCheckUtils]: 37: Hoare triple {8956#false} havoc ~x~0;~x~0 := 0; {8956#false} is VALID [2018-11-23 12:03:14,176 INFO L273 TraceCheckUtils]: 38: Hoare triple {8956#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {8956#false} is VALID [2018-11-23 12:03:14,176 INFO L256 TraceCheckUtils]: 39: Hoare triple {8956#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {8956#false} is VALID [2018-11-23 12:03:14,176 INFO L273 TraceCheckUtils]: 40: Hoare triple {8956#false} ~cond := #in~cond; {8956#false} is VALID [2018-11-23 12:03:14,176 INFO L273 TraceCheckUtils]: 41: Hoare triple {8956#false} assume 0 == ~cond; {8956#false} is VALID [2018-11-23 12:03:14,176 INFO L273 TraceCheckUtils]: 42: Hoare triple {8956#false} assume !false; {8956#false} is VALID [2018-11-23 12:03:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:14,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:14,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 34 [2018-11-23 12:03:14,202 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-23 12:03:14,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:14,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:03:14,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:14,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:03:14,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:03:14,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:03:14,241 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 34 states. [2018-11-23 12:03:14,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,868 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-11-23 12:03:14,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 12:03:14,868 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 43 [2018-11-23 12:03:14,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:03:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 12:03:14,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:03:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 62 transitions. [2018-11-23 12:03:14,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 62 transitions. [2018-11-23 12:03:14,918 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-23 12:03:14,919 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:03:14,919 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:03:14,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:03:14,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:03:14,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-11-23 12:03:14,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:14,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2018-11-23 12:03:14,953 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:03:14,953 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:03:14,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,954 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:03:14,954 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:03:14,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:14,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:14,954 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2018-11-23 12:03:14,955 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2018-11-23 12:03:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:14,956 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:03:14,956 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:03:14,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:14,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:14,956 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:14,956 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:14,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:03:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:03:14,957 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 43 [2018-11-23 12:03:14,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:14,958 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:03:14,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:03:14,958 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:03:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 12:03:14,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:14,959 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:14,959 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:14,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1876217326, now seen corresponding path program 31 times [2018-11-23 12:03:14,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:14,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:14,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:14,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {9405#true} call ULTIMATE.init(); {9405#true} is VALID [2018-11-23 12:03:15,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {9405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9405#true} is VALID [2018-11-23 12:03:15,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {9405#true} assume true; {9405#true} is VALID [2018-11-23 12:03:15,769 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9405#true} {9405#true} #48#return; {9405#true} is VALID [2018-11-23 12:03:15,769 INFO L256 TraceCheckUtils]: 4: Hoare triple {9405#true} call #t~ret2 := main(); {9405#true} is VALID [2018-11-23 12:03:15,770 INFO L273 TraceCheckUtils]: 5: Hoare triple {9405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9407#(= main_~i~0 0)} is VALID [2018-11-23 12:03:15,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {9407#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9408#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:15,771 INFO L273 TraceCheckUtils]: 7: Hoare triple {9408#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9409#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:15,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {9409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9410#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {9410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9411#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:15,773 INFO L273 TraceCheckUtils]: 10: Hoare triple {9411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9412#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:15,774 INFO L273 TraceCheckUtils]: 11: Hoare triple {9412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9413#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:15,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {9413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9414#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:15,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {9414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9415#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:15,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {9415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9416#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:15,778 INFO L273 TraceCheckUtils]: 15: Hoare triple {9416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:15,779 INFO L273 TraceCheckUtils]: 16: Hoare triple {9417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:15,780 INFO L273 TraceCheckUtils]: 17: Hoare triple {9418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9419#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:15,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {9419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9420#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:15,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {9420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9421#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:15,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {9421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9422#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:15,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {9422#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9423#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:15,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9424#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:15,786 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9425#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:15,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9426#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:15,788 INFO L273 TraceCheckUtils]: 25: Hoare triple {9426#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9427#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:15,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {9427#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9428#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:15,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {9428#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9429#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:15,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {9429#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9430#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:15,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {9430#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9431#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:15,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {9431#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9432#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:15,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {9432#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9433#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:15,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {9433#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9434#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:15,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {9434#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9435#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:15,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {9435#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9436#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:15,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {9436#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:15,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {9437#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:15,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {9438#(<= main_~i~0 31)} assume !(~i~0 < 100000); {9406#false} is VALID [2018-11-23 12:03:15,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {9406#false} havoc ~x~0;~x~0 := 0; {9406#false} is VALID [2018-11-23 12:03:15,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {9406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9406#false} is VALID [2018-11-23 12:03:15,799 INFO L256 TraceCheckUtils]: 40: Hoare triple {9406#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9406#false} is VALID [2018-11-23 12:03:15,799 INFO L273 TraceCheckUtils]: 41: Hoare triple {9406#false} ~cond := #in~cond; {9406#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {9406#false} assume 0 == ~cond; {9406#false} is VALID [2018-11-23 12:03:15,800 INFO L273 TraceCheckUtils]: 43: Hoare triple {9406#false} assume !false; {9406#false} is VALID [2018-11-23 12:03:15,802 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:15,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:15,803 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-23 12:03:15,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:15,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:16,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {9405#true} call ULTIMATE.init(); {9405#true} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 1: Hoare triple {9405#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9405#true} is VALID [2018-11-23 12:03:16,040 INFO L273 TraceCheckUtils]: 2: Hoare triple {9405#true} assume true; {9405#true} is VALID [2018-11-23 12:03:16,040 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9405#true} {9405#true} #48#return; {9405#true} is VALID [2018-11-23 12:03:16,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {9405#true} call #t~ret2 := main(); {9405#true} is VALID [2018-11-23 12:03:16,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {9405#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9457#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:16,042 INFO L273 TraceCheckUtils]: 6: Hoare triple {9457#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9408#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {9408#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9409#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:16,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {9409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9410#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:16,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {9410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9411#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:16,045 INFO L273 TraceCheckUtils]: 10: Hoare triple {9411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9412#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:16,046 INFO L273 TraceCheckUtils]: 11: Hoare triple {9412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9413#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:16,047 INFO L273 TraceCheckUtils]: 12: Hoare triple {9413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9414#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:16,048 INFO L273 TraceCheckUtils]: 13: Hoare triple {9414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9415#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:16,049 INFO L273 TraceCheckUtils]: 14: Hoare triple {9415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9416#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:16,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {9416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9417#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:16,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {9417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9418#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:16,052 INFO L273 TraceCheckUtils]: 17: Hoare triple {9418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9419#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:16,052 INFO L273 TraceCheckUtils]: 18: Hoare triple {9419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9420#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:16,053 INFO L273 TraceCheckUtils]: 19: Hoare triple {9420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9421#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:16,054 INFO L273 TraceCheckUtils]: 20: Hoare triple {9421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9422#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:16,055 INFO L273 TraceCheckUtils]: 21: Hoare triple {9422#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9423#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:16,056 INFO L273 TraceCheckUtils]: 22: Hoare triple {9423#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9424#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:16,057 INFO L273 TraceCheckUtils]: 23: Hoare triple {9424#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9425#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:16,058 INFO L273 TraceCheckUtils]: 24: Hoare triple {9425#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9426#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:16,059 INFO L273 TraceCheckUtils]: 25: Hoare triple {9426#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9427#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:16,060 INFO L273 TraceCheckUtils]: 26: Hoare triple {9427#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9428#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:16,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {9428#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9429#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:16,062 INFO L273 TraceCheckUtils]: 28: Hoare triple {9429#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9430#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:16,063 INFO L273 TraceCheckUtils]: 29: Hoare triple {9430#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9431#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:16,064 INFO L273 TraceCheckUtils]: 30: Hoare triple {9431#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9432#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:16,065 INFO L273 TraceCheckUtils]: 31: Hoare triple {9432#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9433#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:16,066 INFO L273 TraceCheckUtils]: 32: Hoare triple {9433#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9434#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:16,067 INFO L273 TraceCheckUtils]: 33: Hoare triple {9434#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9435#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:16,067 INFO L273 TraceCheckUtils]: 34: Hoare triple {9435#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9436#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:16,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {9436#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9437#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:16,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {9437#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9438#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:16,070 INFO L273 TraceCheckUtils]: 37: Hoare triple {9438#(<= main_~i~0 31)} assume !(~i~0 < 100000); {9406#false} is VALID [2018-11-23 12:03:16,070 INFO L273 TraceCheckUtils]: 38: Hoare triple {9406#false} havoc ~x~0;~x~0 := 0; {9406#false} is VALID [2018-11-23 12:03:16,070 INFO L273 TraceCheckUtils]: 39: Hoare triple {9406#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9406#false} is VALID [2018-11-23 12:03:16,071 INFO L256 TraceCheckUtils]: 40: Hoare triple {9406#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9406#false} is VALID [2018-11-23 12:03:16,071 INFO L273 TraceCheckUtils]: 41: Hoare triple {9406#false} ~cond := #in~cond; {9406#false} is VALID [2018-11-23 12:03:16,071 INFO L273 TraceCheckUtils]: 42: Hoare triple {9406#false} assume 0 == ~cond; {9406#false} is VALID [2018-11-23 12:03:16,071 INFO L273 TraceCheckUtils]: 43: Hoare triple {9406#false} assume !false; {9406#false} is VALID [2018-11-23 12:03:16,074 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:16,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:16,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2018-11-23 12:03:16,094 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-23 12:03:16,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:16,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 12:03:16,129 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-23 12:03:16,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 12:03:16,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 12:03:16,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 12:03:16,131 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 35 states. [2018-11-23 12:03:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,606 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-11-23 12:03:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:03:16,607 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 44 [2018-11-23 12:03:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:03:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 12:03:16,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:03:16,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 63 transitions. [2018-11-23 12:03:16,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 63 transitions. [2018-11-23 12:03:16,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:16,688 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:03:16,688 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 12:03:16,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 44 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-23 12:03:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 12:03:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-23 12:03:16,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:16,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-23 12:03:16,716 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:03:16,716 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:03:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,717 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:03:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:03:16,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,717 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-23 12:03:16,718 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-23 12:03:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:16,719 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-11-23 12:03:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:03:16,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:16,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:16,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:16,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:03:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-11-23 12:03:16,720 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 44 [2018-11-23 12:03:16,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:16,721 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-11-23 12:03:16,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 12:03:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-11-23 12:03:16,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:03:16,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:16,721 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:16,722 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:16,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:16,722 INFO L82 PathProgramCache]: Analyzing trace with hash 237083570, now seen corresponding path program 32 times [2018-11-23 12:03:16,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:16,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:16,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:16,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:17,407 INFO L256 TraceCheckUtils]: 0: Hoare triple {9865#true} call ULTIMATE.init(); {9865#true} is VALID [2018-11-23 12:03:17,407 INFO L273 TraceCheckUtils]: 1: Hoare triple {9865#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9865#true} is VALID [2018-11-23 12:03:17,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {9865#true} assume true; {9865#true} is VALID [2018-11-23 12:03:17,408 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9865#true} {9865#true} #48#return; {9865#true} is VALID [2018-11-23 12:03:17,408 INFO L256 TraceCheckUtils]: 4: Hoare triple {9865#true} call #t~ret2 := main(); {9865#true} is VALID [2018-11-23 12:03:17,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {9865#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9867#(= main_~i~0 0)} is VALID [2018-11-23 12:03:17,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {9867#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:17,409 INFO L273 TraceCheckUtils]: 7: Hoare triple {9868#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9869#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:17,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {9869#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9870#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:17,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {9870#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9871#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:17,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {9871#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9872#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:17,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {9872#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9873#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:17,414 INFO L273 TraceCheckUtils]: 12: Hoare triple {9873#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9874#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:17,415 INFO L273 TraceCheckUtils]: 13: Hoare triple {9874#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9875#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:17,416 INFO L273 TraceCheckUtils]: 14: Hoare triple {9875#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9876#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:17,417 INFO L273 TraceCheckUtils]: 15: Hoare triple {9876#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9877#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:17,417 INFO L273 TraceCheckUtils]: 16: Hoare triple {9877#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9878#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:17,418 INFO L273 TraceCheckUtils]: 17: Hoare triple {9878#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9879#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:17,419 INFO L273 TraceCheckUtils]: 18: Hoare triple {9879#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9880#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:17,420 INFO L273 TraceCheckUtils]: 19: Hoare triple {9880#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9881#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:17,421 INFO L273 TraceCheckUtils]: 20: Hoare triple {9881#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9882#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:17,422 INFO L273 TraceCheckUtils]: 21: Hoare triple {9882#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9883#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:17,423 INFO L273 TraceCheckUtils]: 22: Hoare triple {9883#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9884#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:17,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {9884#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9885#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:17,425 INFO L273 TraceCheckUtils]: 24: Hoare triple {9885#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9886#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:17,426 INFO L273 TraceCheckUtils]: 25: Hoare triple {9886#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9887#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:17,427 INFO L273 TraceCheckUtils]: 26: Hoare triple {9887#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9888#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:17,428 INFO L273 TraceCheckUtils]: 27: Hoare triple {9888#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9889#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:17,429 INFO L273 TraceCheckUtils]: 28: Hoare triple {9889#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9890#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:17,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {9890#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9891#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:17,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {9891#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9892#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:17,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {9892#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9893#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:17,433 INFO L273 TraceCheckUtils]: 32: Hoare triple {9893#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9894#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:17,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {9894#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9895#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:17,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {9895#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9896#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:17,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {9896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:17,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {9897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:17,437 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:17,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9866#false} is VALID [2018-11-23 12:03:17,438 INFO L273 TraceCheckUtils]: 39: Hoare triple {9866#false} havoc ~x~0;~x~0 := 0; {9866#false} is VALID [2018-11-23 12:03:17,439 INFO L273 TraceCheckUtils]: 40: Hoare triple {9866#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9866#false} is VALID [2018-11-23 12:03:17,439 INFO L256 TraceCheckUtils]: 41: Hoare triple {9866#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9866#false} is VALID [2018-11-23 12:03:17,439 INFO L273 TraceCheckUtils]: 42: Hoare triple {9866#false} ~cond := #in~cond; {9866#false} is VALID [2018-11-23 12:03:17,439 INFO L273 TraceCheckUtils]: 43: Hoare triple {9866#false} assume 0 == ~cond; {9866#false} is VALID [2018-11-23 12:03:17,439 INFO L273 TraceCheckUtils]: 44: Hoare triple {9866#false} assume !false; {9866#false} is VALID [2018-11-23 12:03:17,442 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:17,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:17,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 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-23 12:03:17,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:17,481 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:17,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:17,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:17,685 INFO L256 TraceCheckUtils]: 0: Hoare triple {9865#true} call ULTIMATE.init(); {9865#true} is VALID [2018-11-23 12:03:17,686 INFO L273 TraceCheckUtils]: 1: Hoare triple {9865#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9865#true} is VALID [2018-11-23 12:03:17,686 INFO L273 TraceCheckUtils]: 2: Hoare triple {9865#true} assume true; {9865#true} is VALID [2018-11-23 12:03:17,686 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9865#true} {9865#true} #48#return; {9865#true} is VALID [2018-11-23 12:03:17,686 INFO L256 TraceCheckUtils]: 4: Hoare triple {9865#true} call #t~ret2 := main(); {9865#true} is VALID [2018-11-23 12:03:17,687 INFO L273 TraceCheckUtils]: 5: Hoare triple {9865#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {9918#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:17,688 INFO L273 TraceCheckUtils]: 6: Hoare triple {9918#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9868#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:17,688 INFO L273 TraceCheckUtils]: 7: Hoare triple {9868#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9869#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:17,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {9869#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9870#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:17,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {9870#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9871#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:17,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {9871#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9872#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:17,691 INFO L273 TraceCheckUtils]: 11: Hoare triple {9872#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9873#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:17,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {9873#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9874#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:17,693 INFO L273 TraceCheckUtils]: 13: Hoare triple {9874#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9875#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:17,694 INFO L273 TraceCheckUtils]: 14: Hoare triple {9875#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9876#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:17,695 INFO L273 TraceCheckUtils]: 15: Hoare triple {9876#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9877#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:17,696 INFO L273 TraceCheckUtils]: 16: Hoare triple {9877#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9878#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:17,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {9878#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9879#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:17,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {9879#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9880#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:17,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {9880#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9881#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:17,699 INFO L273 TraceCheckUtils]: 20: Hoare triple {9881#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9882#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:17,700 INFO L273 TraceCheckUtils]: 21: Hoare triple {9882#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9883#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:17,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {9883#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9884#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:17,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {9884#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9885#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:17,703 INFO L273 TraceCheckUtils]: 24: Hoare triple {9885#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9886#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:17,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {9886#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9887#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:17,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {9887#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9888#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:17,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {9888#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9889#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:17,707 INFO L273 TraceCheckUtils]: 28: Hoare triple {9889#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9890#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:17,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {9890#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9891#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:17,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {9891#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9892#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:17,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {9892#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9893#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:17,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {9893#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9894#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:17,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {9894#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9895#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:17,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {9895#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9896#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:17,713 INFO L273 TraceCheckUtils]: 35: Hoare triple {9896#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9897#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:17,714 INFO L273 TraceCheckUtils]: 36: Hoare triple {9897#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9898#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:17,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {9899#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:17,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 32)} assume !(~i~0 < 100000); {9866#false} is VALID [2018-11-23 12:03:17,716 INFO L273 TraceCheckUtils]: 39: Hoare triple {9866#false} havoc ~x~0;~x~0 := 0; {9866#false} is VALID [2018-11-23 12:03:17,716 INFO L273 TraceCheckUtils]: 40: Hoare triple {9866#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {9866#false} is VALID [2018-11-23 12:03:17,717 INFO L256 TraceCheckUtils]: 41: Hoare triple {9866#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {9866#false} is VALID [2018-11-23 12:03:17,717 INFO L273 TraceCheckUtils]: 42: Hoare triple {9866#false} ~cond := #in~cond; {9866#false} is VALID [2018-11-23 12:03:17,717 INFO L273 TraceCheckUtils]: 43: Hoare triple {9866#false} assume 0 == ~cond; {9866#false} is VALID [2018-11-23 12:03:17,717 INFO L273 TraceCheckUtils]: 44: Hoare triple {9866#false} assume !false; {9866#false} is VALID [2018-11-23 12:03:17,720 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:17,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:17,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2018-11-23 12:03:17,740 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-11-23 12:03:17,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:17,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:03:17,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:17,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:03:17,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:03:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:03:17,776 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 36 states. [2018-11-23 12:03:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:18,245 INFO L93 Difference]: Finished difference Result 62 states and 64 transitions. [2018-11-23 12:03:18,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 12:03:18,245 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 45 [2018-11-23 12:03:18,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:03:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 12:03:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:03:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 64 transitions. [2018-11-23 12:03:18,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 64 transitions. [2018-11-23 12:03:18,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:18,306 INFO L225 Difference]: With dead ends: 62 [2018-11-23 12:03:18,306 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:03:18,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:03:18,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:03:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-11-23 12:03:18,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:18,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 51 states. [2018-11-23 12:03:18,334 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:03:18,334 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:03:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:18,335 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:03:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:03:18,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:18,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:18,336 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 51 states. [2018-11-23 12:03:18,336 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 51 states. [2018-11-23 12:03:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:18,337 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-11-23 12:03:18,337 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:03:18,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:18,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:18,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:18,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:18,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:03:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-11-23 12:03:18,338 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 45 [2018-11-23 12:03:18,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:18,338 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-11-23 12:03:18,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:03:18,338 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-11-23 12:03:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:03:18,339 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:18,339 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:18,339 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:18,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:18,339 INFO L82 PathProgramCache]: Analyzing trace with hash 963544686, now seen corresponding path program 33 times [2018-11-23 12:03:18,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:18,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:18,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:18,340 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:18,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:19,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 12:03:19,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 12:03:19,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:03:19,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #48#return; {10335#true} is VALID [2018-11-23 12:03:19,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret2 := main(); {10335#true} is VALID [2018-11-23 12:03:19,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10337#(= main_~i~0 0)} is VALID [2018-11-23 12:03:19,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {10337#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10338#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:19,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {10338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10339#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:19,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {10339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10340#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:19,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10341#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:19,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10342#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:19,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {10342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10343#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:19,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {10343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10344#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:19,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {10344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10345#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:19,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {10345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10346#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:19,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {10346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10347#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:19,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {10347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10348#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:19,351 INFO L273 TraceCheckUtils]: 17: Hoare triple {10348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10349#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:19,352 INFO L273 TraceCheckUtils]: 18: Hoare triple {10349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10350#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:19,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {10350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10351#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:19,354 INFO L273 TraceCheckUtils]: 20: Hoare triple {10351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10352#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:19,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {10352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10353#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:19,355 INFO L273 TraceCheckUtils]: 22: Hoare triple {10353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10354#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:19,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {10354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10355#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:19,357 INFO L273 TraceCheckUtils]: 24: Hoare triple {10355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10356#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:19,358 INFO L273 TraceCheckUtils]: 25: Hoare triple {10356#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10357#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:19,359 INFO L273 TraceCheckUtils]: 26: Hoare triple {10357#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10358#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:19,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {10358#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10359#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:19,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {10359#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10360#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:19,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {10360#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10361#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:19,363 INFO L273 TraceCheckUtils]: 30: Hoare triple {10361#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10362#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:19,364 INFO L273 TraceCheckUtils]: 31: Hoare triple {10362#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10363#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:19,365 INFO L273 TraceCheckUtils]: 32: Hoare triple {10363#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10364#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:19,366 INFO L273 TraceCheckUtils]: 33: Hoare triple {10364#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10365#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:19,367 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10366#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:19,376 INFO L273 TraceCheckUtils]: 35: Hoare triple {10366#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10367#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:19,377 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10368#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:19,378 INFO L273 TraceCheckUtils]: 37: Hoare triple {10368#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10369#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:19,378 INFO L273 TraceCheckUtils]: 38: Hoare triple {10369#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10370#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:19,379 INFO L273 TraceCheckUtils]: 39: Hoare triple {10370#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10336#false} is VALID [2018-11-23 12:03:19,379 INFO L273 TraceCheckUtils]: 40: Hoare triple {10336#false} havoc ~x~0;~x~0 := 0; {10336#false} is VALID [2018-11-23 12:03:19,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {10336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10336#false} is VALID [2018-11-23 12:03:19,379 INFO L256 TraceCheckUtils]: 42: Hoare triple {10336#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10336#false} is VALID [2018-11-23 12:03:19,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#false} ~cond := #in~cond; {10336#false} is VALID [2018-11-23 12:03:19,379 INFO L273 TraceCheckUtils]: 44: Hoare triple {10336#false} assume 0 == ~cond; {10336#false} is VALID [2018-11-23 12:03:19,380 INFO L273 TraceCheckUtils]: 45: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 12:03:19,381 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:19,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:19,382 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-23 12:03:19,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:03:25,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 12:03:25,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:25,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:25,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {10335#true} call ULTIMATE.init(); {10335#true} is VALID [2018-11-23 12:03:25,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {10335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10335#true} is VALID [2018-11-23 12:03:25,924 INFO L273 TraceCheckUtils]: 2: Hoare triple {10335#true} assume true; {10335#true} is VALID [2018-11-23 12:03:25,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10335#true} {10335#true} #48#return; {10335#true} is VALID [2018-11-23 12:03:25,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {10335#true} call #t~ret2 := main(); {10335#true} is VALID [2018-11-23 12:03:25,925 INFO L273 TraceCheckUtils]: 5: Hoare triple {10335#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10389#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:25,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {10389#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10338#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:25,926 INFO L273 TraceCheckUtils]: 7: Hoare triple {10338#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10339#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:25,926 INFO L273 TraceCheckUtils]: 8: Hoare triple {10339#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10340#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:25,927 INFO L273 TraceCheckUtils]: 9: Hoare triple {10340#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10341#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:25,928 INFO L273 TraceCheckUtils]: 10: Hoare triple {10341#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10342#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:25,929 INFO L273 TraceCheckUtils]: 11: Hoare triple {10342#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10343#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:25,930 INFO L273 TraceCheckUtils]: 12: Hoare triple {10343#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10344#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:25,931 INFO L273 TraceCheckUtils]: 13: Hoare triple {10344#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10345#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:25,931 INFO L273 TraceCheckUtils]: 14: Hoare triple {10345#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10346#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:25,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {10346#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10347#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:25,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {10347#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10348#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:25,934 INFO L273 TraceCheckUtils]: 17: Hoare triple {10348#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10349#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:25,935 INFO L273 TraceCheckUtils]: 18: Hoare triple {10349#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10350#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:25,936 INFO L273 TraceCheckUtils]: 19: Hoare triple {10350#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10351#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:25,937 INFO L273 TraceCheckUtils]: 20: Hoare triple {10351#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10352#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:25,938 INFO L273 TraceCheckUtils]: 21: Hoare triple {10352#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10353#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:25,939 INFO L273 TraceCheckUtils]: 22: Hoare triple {10353#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10354#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:25,940 INFO L273 TraceCheckUtils]: 23: Hoare triple {10354#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10355#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:25,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {10355#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10356#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:25,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {10356#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10357#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:25,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {10357#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10358#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:25,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {10358#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10359#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:25,945 INFO L273 TraceCheckUtils]: 28: Hoare triple {10359#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10360#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:25,946 INFO L273 TraceCheckUtils]: 29: Hoare triple {10360#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10361#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:25,947 INFO L273 TraceCheckUtils]: 30: Hoare triple {10361#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10362#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:25,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {10362#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10363#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:25,949 INFO L273 TraceCheckUtils]: 32: Hoare triple {10363#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10364#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:25,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {10364#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10365#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:25,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {10365#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10366#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:25,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {10366#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10367#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:25,952 INFO L273 TraceCheckUtils]: 36: Hoare triple {10367#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10368#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:25,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {10368#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10369#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:25,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {10369#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10370#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:25,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {10370#(<= main_~i~0 33)} assume !(~i~0 < 100000); {10336#false} is VALID [2018-11-23 12:03:25,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {10336#false} havoc ~x~0;~x~0 := 0; {10336#false} is VALID [2018-11-23 12:03:25,955 INFO L273 TraceCheckUtils]: 41: Hoare triple {10336#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10336#false} is VALID [2018-11-23 12:03:25,956 INFO L256 TraceCheckUtils]: 42: Hoare triple {10336#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10336#false} is VALID [2018-11-23 12:03:25,956 INFO L273 TraceCheckUtils]: 43: Hoare triple {10336#false} ~cond := #in~cond; {10336#false} is VALID [2018-11-23 12:03:25,956 INFO L273 TraceCheckUtils]: 44: Hoare triple {10336#false} assume 0 == ~cond; {10336#false} is VALID [2018-11-23 12:03:25,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {10336#false} assume !false; {10336#false} is VALID [2018-11-23 12:03:25,958 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:25,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:25,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 37 [2018-11-23 12:03:25,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-11-23 12:03:25,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:25,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:03:26,017 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:26,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:03:26,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:03:26,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:03:26,019 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 37 states. [2018-11-23 12:03:26,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:26,216 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2018-11-23 12:03:26,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 12:03:26,216 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 46 [2018-11-23 12:03:26,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:03:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 12:03:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 12:03:26,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 65 transitions. [2018-11-23 12:03:26,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 65 transitions. [2018-11-23 12:03:26,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:26,268 INFO L225 Difference]: With dead ends: 63 [2018-11-23 12:03:26,269 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 12:03:26,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 12:03:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 12:03:26,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-11-23 12:03:26,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:26,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 52 states. [2018-11-23 12:03:26,305 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:03:26,305 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:03:26,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:26,307 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:03:26,307 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:03:26,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:26,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:26,308 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 52 states. [2018-11-23 12:03:26,308 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 52 states. [2018-11-23 12:03:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:26,309 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-11-23 12:03:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:03:26,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:26,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:26,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:26,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:03:26,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2018-11-23 12:03:26,311 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 46 [2018-11-23 12:03:26,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:26,311 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2018-11-23 12:03:26,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 12:03:26,311 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2018-11-23 12:03:26,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:03:26,312 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:26,312 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:26,312 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:26,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:26,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2009002802, now seen corresponding path program 34 times [2018-11-23 12:03:26,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:26,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:26,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:26,313 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:26,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:27,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {10815#true} call ULTIMATE.init(); {10815#true} is VALID [2018-11-23 12:03:27,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {10815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10815#true} is VALID [2018-11-23 12:03:27,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {10815#true} assume true; {10815#true} is VALID [2018-11-23 12:03:27,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10815#true} {10815#true} #48#return; {10815#true} is VALID [2018-11-23 12:03:27,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {10815#true} call #t~ret2 := main(); {10815#true} is VALID [2018-11-23 12:03:27,004 INFO L273 TraceCheckUtils]: 5: Hoare triple {10815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10817#(= main_~i~0 0)} is VALID [2018-11-23 12:03:27,005 INFO L273 TraceCheckUtils]: 6: Hoare triple {10817#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10818#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:27,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {10818#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10819#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:27,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {10819#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10820#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:27,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {10820#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10821#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:27,007 INFO L273 TraceCheckUtils]: 10: Hoare triple {10821#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10822#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:27,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {10822#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10823#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:27,009 INFO L273 TraceCheckUtils]: 12: Hoare triple {10823#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10824#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:27,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {10824#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10825#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:27,011 INFO L273 TraceCheckUtils]: 14: Hoare triple {10825#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10826#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:27,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {10826#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10827#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:27,013 INFO L273 TraceCheckUtils]: 16: Hoare triple {10827#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10828#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:27,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10829#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:27,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:27,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {10830#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10831#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:27,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {10831#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10832#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:27,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {10832#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10833#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:27,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {10833#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10834#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:27,019 INFO L273 TraceCheckUtils]: 23: Hoare triple {10834#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10835#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:27,020 INFO L273 TraceCheckUtils]: 24: Hoare triple {10835#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10836#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:27,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {10836#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10837#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:27,022 INFO L273 TraceCheckUtils]: 26: Hoare triple {10837#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10838#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:27,023 INFO L273 TraceCheckUtils]: 27: Hoare triple {10838#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10839#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:27,024 INFO L273 TraceCheckUtils]: 28: Hoare triple {10839#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10840#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:27,025 INFO L273 TraceCheckUtils]: 29: Hoare triple {10840#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10841#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:27,026 INFO L273 TraceCheckUtils]: 30: Hoare triple {10841#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10842#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:27,027 INFO L273 TraceCheckUtils]: 31: Hoare triple {10842#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10843#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:27,028 INFO L273 TraceCheckUtils]: 32: Hoare triple {10843#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10844#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:27,029 INFO L273 TraceCheckUtils]: 33: Hoare triple {10844#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:27,029 INFO L273 TraceCheckUtils]: 34: Hoare triple {10845#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:27,030 INFO L273 TraceCheckUtils]: 35: Hoare triple {10846#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10847#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:27,031 INFO L273 TraceCheckUtils]: 36: Hoare triple {10847#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10848#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:27,032 INFO L273 TraceCheckUtils]: 37: Hoare triple {10848#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10849#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:27,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {10849#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10850#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:27,034 INFO L273 TraceCheckUtils]: 39: Hoare triple {10850#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10851#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:27,035 INFO L273 TraceCheckUtils]: 40: Hoare triple {10851#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10816#false} is VALID [2018-11-23 12:03:27,035 INFO L273 TraceCheckUtils]: 41: Hoare triple {10816#false} havoc ~x~0;~x~0 := 0; {10816#false} is VALID [2018-11-23 12:03:27,035 INFO L273 TraceCheckUtils]: 42: Hoare triple {10816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10816#false} is VALID [2018-11-23 12:03:27,036 INFO L256 TraceCheckUtils]: 43: Hoare triple {10816#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10816#false} is VALID [2018-11-23 12:03:27,036 INFO L273 TraceCheckUtils]: 44: Hoare triple {10816#false} ~cond := #in~cond; {10816#false} is VALID [2018-11-23 12:03:27,036 INFO L273 TraceCheckUtils]: 45: Hoare triple {10816#false} assume 0 == ~cond; {10816#false} is VALID [2018-11-23 12:03:27,036 INFO L273 TraceCheckUtils]: 46: Hoare triple {10816#false} assume !false; {10816#false} is VALID [2018-11-23 12:03:27,039 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:27,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:27,040 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-23 12:03:27,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:03:27,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:03:27,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:27,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:27,298 INFO L256 TraceCheckUtils]: 0: Hoare triple {10815#true} call ULTIMATE.init(); {10815#true} is VALID [2018-11-23 12:03:27,299 INFO L273 TraceCheckUtils]: 1: Hoare triple {10815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10815#true} is VALID [2018-11-23 12:03:27,299 INFO L273 TraceCheckUtils]: 2: Hoare triple {10815#true} assume true; {10815#true} is VALID [2018-11-23 12:03:27,299 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10815#true} {10815#true} #48#return; {10815#true} is VALID [2018-11-23 12:03:27,299 INFO L256 TraceCheckUtils]: 4: Hoare triple {10815#true} call #t~ret2 := main(); {10815#true} is VALID [2018-11-23 12:03:27,300 INFO L273 TraceCheckUtils]: 5: Hoare triple {10815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {10870#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:27,301 INFO L273 TraceCheckUtils]: 6: Hoare triple {10870#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10818#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:27,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {10818#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10819#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:27,302 INFO L273 TraceCheckUtils]: 8: Hoare triple {10819#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10820#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:27,303 INFO L273 TraceCheckUtils]: 9: Hoare triple {10820#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10821#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:27,304 INFO L273 TraceCheckUtils]: 10: Hoare triple {10821#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10822#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:27,305 INFO L273 TraceCheckUtils]: 11: Hoare triple {10822#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10823#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:27,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {10823#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10824#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:27,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {10824#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10825#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:27,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {10825#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10826#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:27,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {10826#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10827#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:27,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {10827#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10828#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:27,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {10828#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10829#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:27,311 INFO L273 TraceCheckUtils]: 18: Hoare triple {10829#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10830#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:27,312 INFO L273 TraceCheckUtils]: 19: Hoare triple {10830#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10831#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:27,313 INFO L273 TraceCheckUtils]: 20: Hoare triple {10831#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10832#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:27,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {10832#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10833#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:27,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {10833#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10834#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:27,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {10834#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10835#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:27,317 INFO L273 TraceCheckUtils]: 24: Hoare triple {10835#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10836#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:27,318 INFO L273 TraceCheckUtils]: 25: Hoare triple {10836#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10837#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:27,319 INFO L273 TraceCheckUtils]: 26: Hoare triple {10837#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10838#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:27,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {10838#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10839#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:27,321 INFO L273 TraceCheckUtils]: 28: Hoare triple {10839#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10840#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:27,322 INFO L273 TraceCheckUtils]: 29: Hoare triple {10840#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10841#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:27,323 INFO L273 TraceCheckUtils]: 30: Hoare triple {10841#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10842#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:27,323 INFO L273 TraceCheckUtils]: 31: Hoare triple {10842#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10843#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:27,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {10843#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10844#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:27,325 INFO L273 TraceCheckUtils]: 33: Hoare triple {10844#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10845#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:27,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {10845#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10846#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:27,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {10846#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10847#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:27,328 INFO L273 TraceCheckUtils]: 36: Hoare triple {10847#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10848#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:27,329 INFO L273 TraceCheckUtils]: 37: Hoare triple {10848#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10849#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:27,330 INFO L273 TraceCheckUtils]: 38: Hoare triple {10849#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10850#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:27,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {10850#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {10851#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:27,332 INFO L273 TraceCheckUtils]: 40: Hoare triple {10851#(<= main_~i~0 34)} assume !(~i~0 < 100000); {10816#false} is VALID [2018-11-23 12:03:27,332 INFO L273 TraceCheckUtils]: 41: Hoare triple {10816#false} havoc ~x~0;~x~0 := 0; {10816#false} is VALID [2018-11-23 12:03:27,332 INFO L273 TraceCheckUtils]: 42: Hoare triple {10816#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {10816#false} is VALID [2018-11-23 12:03:27,332 INFO L256 TraceCheckUtils]: 43: Hoare triple {10816#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {10816#false} is VALID [2018-11-23 12:03:27,333 INFO L273 TraceCheckUtils]: 44: Hoare triple {10816#false} ~cond := #in~cond; {10816#false} is VALID [2018-11-23 12:03:27,333 INFO L273 TraceCheckUtils]: 45: Hoare triple {10816#false} assume 0 == ~cond; {10816#false} is VALID [2018-11-23 12:03:27,333 INFO L273 TraceCheckUtils]: 46: Hoare triple {10816#false} assume !false; {10816#false} is VALID [2018-11-23 12:03:27,336 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:27,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:27,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 38 [2018-11-23 12:03:27,356 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2018-11-23 12:03:27,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:27,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 12:03:27,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:27,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 12:03:27,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 12:03:27,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:03:27,393 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 38 states. [2018-11-23 12:03:27,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:27,872 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:03:27,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 12:03:27,872 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 47 [2018-11-23 12:03:27,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:27,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:03:27,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 12:03:27,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:03:27,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2018-11-23 12:03:27,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 66 transitions. [2018-11-23 12:03:27,926 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:27,927 INFO L225 Difference]: With dead ends: 64 [2018-11-23 12:03:27,927 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 12:03:27,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 12:03:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 12:03:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-11-23 12:03:27,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:27,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 53 states. [2018-11-23 12:03:27,959 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 12:03:27,959 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 12:03:27,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:27,961 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:03:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:03:27,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:27,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:27,962 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 53 states. [2018-11-23 12:03:27,962 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 53 states. [2018-11-23 12:03:27,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:27,963 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-11-23 12:03:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:03:27,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:27,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:27,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:27,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:03:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-11-23 12:03:27,964 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 47 [2018-11-23 12:03:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-11-23 12:03:27,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 12:03:27,964 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-11-23 12:03:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:03:27,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:27,965 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:27,965 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:27,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash 58466030, now seen corresponding path program 35 times [2018-11-23 12:03:27,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:27,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:27,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:27,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:28,896 INFO L256 TraceCheckUtils]: 0: Hoare triple {11305#true} call ULTIMATE.init(); {11305#true} is VALID [2018-11-23 12:03:28,896 INFO L273 TraceCheckUtils]: 1: Hoare triple {11305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11305#true} is VALID [2018-11-23 12:03:28,896 INFO L273 TraceCheckUtils]: 2: Hoare triple {11305#true} assume true; {11305#true} is VALID [2018-11-23 12:03:28,897 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11305#true} {11305#true} #48#return; {11305#true} is VALID [2018-11-23 12:03:28,897 INFO L256 TraceCheckUtils]: 4: Hoare triple {11305#true} call #t~ret2 := main(); {11305#true} is VALID [2018-11-23 12:03:28,897 INFO L273 TraceCheckUtils]: 5: Hoare triple {11305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11307#(= main_~i~0 0)} is VALID [2018-11-23 12:03:28,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {11307#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11308#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:28,899 INFO L273 TraceCheckUtils]: 7: Hoare triple {11308#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11309#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:28,900 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11310#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:28,900 INFO L273 TraceCheckUtils]: 9: Hoare triple {11310#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11311#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:28,901 INFO L273 TraceCheckUtils]: 10: Hoare triple {11311#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11312#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:28,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {11312#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11313#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:28,903 INFO L273 TraceCheckUtils]: 12: Hoare triple {11313#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:28,904 INFO L273 TraceCheckUtils]: 13: Hoare triple {11314#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11315#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:28,905 INFO L273 TraceCheckUtils]: 14: Hoare triple {11315#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11316#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:28,906 INFO L273 TraceCheckUtils]: 15: Hoare triple {11316#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11317#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:28,906 INFO L273 TraceCheckUtils]: 16: Hoare triple {11317#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11318#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:28,907 INFO L273 TraceCheckUtils]: 17: Hoare triple {11318#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11319#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:28,908 INFO L273 TraceCheckUtils]: 18: Hoare triple {11319#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11320#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:28,909 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11321#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:28,910 INFO L273 TraceCheckUtils]: 20: Hoare triple {11321#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11322#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:28,911 INFO L273 TraceCheckUtils]: 21: Hoare triple {11322#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11323#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:28,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11324#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:28,913 INFO L273 TraceCheckUtils]: 23: Hoare triple {11324#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11325#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:28,914 INFO L273 TraceCheckUtils]: 24: Hoare triple {11325#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11326#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:28,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {11326#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11327#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:28,916 INFO L273 TraceCheckUtils]: 26: Hoare triple {11327#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11328#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:28,917 INFO L273 TraceCheckUtils]: 27: Hoare triple {11328#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11329#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:28,918 INFO L273 TraceCheckUtils]: 28: Hoare triple {11329#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11330#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:28,919 INFO L273 TraceCheckUtils]: 29: Hoare triple {11330#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11331#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:28,920 INFO L273 TraceCheckUtils]: 30: Hoare triple {11331#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11332#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:28,921 INFO L273 TraceCheckUtils]: 31: Hoare triple {11332#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11333#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:28,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {11333#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11334#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:28,922 INFO L273 TraceCheckUtils]: 33: Hoare triple {11334#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11335#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:28,923 INFO L273 TraceCheckUtils]: 34: Hoare triple {11335#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11336#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:28,924 INFO L273 TraceCheckUtils]: 35: Hoare triple {11336#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11337#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:28,925 INFO L273 TraceCheckUtils]: 36: Hoare triple {11337#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11338#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:28,926 INFO L273 TraceCheckUtils]: 37: Hoare triple {11338#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11339#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:28,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {11339#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11340#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:28,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {11340#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11341#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:28,929 INFO L273 TraceCheckUtils]: 40: Hoare triple {11341#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11342#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:28,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {11342#(<= main_~i~0 35)} assume !(~i~0 < 100000); {11306#false} is VALID [2018-11-23 12:03:28,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {11306#false} havoc ~x~0;~x~0 := 0; {11306#false} is VALID [2018-11-23 12:03:28,930 INFO L273 TraceCheckUtils]: 43: Hoare triple {11306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11306#false} is VALID [2018-11-23 12:03:28,930 INFO L256 TraceCheckUtils]: 44: Hoare triple {11306#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11306#false} is VALID [2018-11-23 12:03:28,931 INFO L273 TraceCheckUtils]: 45: Hoare triple {11306#false} ~cond := #in~cond; {11306#false} is VALID [2018-11-23 12:03:28,931 INFO L273 TraceCheckUtils]: 46: Hoare triple {11306#false} assume 0 == ~cond; {11306#false} is VALID [2018-11-23 12:03:28,931 INFO L273 TraceCheckUtils]: 47: Hoare triple {11306#false} assume !false; {11306#false} is VALID [2018-11-23 12:03:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:28,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:28,934 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-23 12:03:28,943 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:03:29,568 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2018-11-23 12:03:29,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:29,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:29,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:29,811 INFO L256 TraceCheckUtils]: 0: Hoare triple {11305#true} call ULTIMATE.init(); {11305#true} is VALID [2018-11-23 12:03:29,811 INFO L273 TraceCheckUtils]: 1: Hoare triple {11305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11305#true} is VALID [2018-11-23 12:03:29,811 INFO L273 TraceCheckUtils]: 2: Hoare triple {11305#true} assume true; {11305#true} is VALID [2018-11-23 12:03:29,811 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11305#true} {11305#true} #48#return; {11305#true} is VALID [2018-11-23 12:03:29,811 INFO L256 TraceCheckUtils]: 4: Hoare triple {11305#true} call #t~ret2 := main(); {11305#true} is VALID [2018-11-23 12:03:29,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {11305#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11361#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:29,813 INFO L273 TraceCheckUtils]: 6: Hoare triple {11361#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11308#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:29,814 INFO L273 TraceCheckUtils]: 7: Hoare triple {11308#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11309#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:29,814 INFO L273 TraceCheckUtils]: 8: Hoare triple {11309#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11310#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:29,815 INFO L273 TraceCheckUtils]: 9: Hoare triple {11310#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11311#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:29,815 INFO L273 TraceCheckUtils]: 10: Hoare triple {11311#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11312#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:29,816 INFO L273 TraceCheckUtils]: 11: Hoare triple {11312#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11313#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:29,816 INFO L273 TraceCheckUtils]: 12: Hoare triple {11313#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11314#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:29,817 INFO L273 TraceCheckUtils]: 13: Hoare triple {11314#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11315#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:29,818 INFO L273 TraceCheckUtils]: 14: Hoare triple {11315#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11316#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:29,819 INFO L273 TraceCheckUtils]: 15: Hoare triple {11316#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11317#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:29,820 INFO L273 TraceCheckUtils]: 16: Hoare triple {11317#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11318#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:29,821 INFO L273 TraceCheckUtils]: 17: Hoare triple {11318#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11319#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:29,822 INFO L273 TraceCheckUtils]: 18: Hoare triple {11319#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11320#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:29,823 INFO L273 TraceCheckUtils]: 19: Hoare triple {11320#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11321#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:29,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {11321#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11322#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:29,825 INFO L273 TraceCheckUtils]: 21: Hoare triple {11322#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11323#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:29,826 INFO L273 TraceCheckUtils]: 22: Hoare triple {11323#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11324#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:29,827 INFO L273 TraceCheckUtils]: 23: Hoare triple {11324#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11325#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:29,827 INFO L273 TraceCheckUtils]: 24: Hoare triple {11325#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11326#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:29,828 INFO L273 TraceCheckUtils]: 25: Hoare triple {11326#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11327#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:29,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {11327#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11328#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:29,830 INFO L273 TraceCheckUtils]: 27: Hoare triple {11328#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11329#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:29,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {11329#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11330#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:29,832 INFO L273 TraceCheckUtils]: 29: Hoare triple {11330#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11331#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:29,833 INFO L273 TraceCheckUtils]: 30: Hoare triple {11331#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11332#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:29,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {11332#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11333#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:29,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {11333#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11334#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:29,836 INFO L273 TraceCheckUtils]: 33: Hoare triple {11334#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11335#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:29,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {11335#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11336#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:29,838 INFO L273 TraceCheckUtils]: 35: Hoare triple {11336#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11337#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:29,839 INFO L273 TraceCheckUtils]: 36: Hoare triple {11337#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11338#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:29,840 INFO L273 TraceCheckUtils]: 37: Hoare triple {11338#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11339#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:29,841 INFO L273 TraceCheckUtils]: 38: Hoare triple {11339#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11340#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:29,842 INFO L273 TraceCheckUtils]: 39: Hoare triple {11340#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11341#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:29,843 INFO L273 TraceCheckUtils]: 40: Hoare triple {11341#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11342#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:29,843 INFO L273 TraceCheckUtils]: 41: Hoare triple {11342#(<= main_~i~0 35)} assume !(~i~0 < 100000); {11306#false} is VALID [2018-11-23 12:03:29,843 INFO L273 TraceCheckUtils]: 42: Hoare triple {11306#false} havoc ~x~0;~x~0 := 0; {11306#false} is VALID [2018-11-23 12:03:29,844 INFO L273 TraceCheckUtils]: 43: Hoare triple {11306#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11306#false} is VALID [2018-11-23 12:03:29,844 INFO L256 TraceCheckUtils]: 44: Hoare triple {11306#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11306#false} is VALID [2018-11-23 12:03:29,844 INFO L273 TraceCheckUtils]: 45: Hoare triple {11306#false} ~cond := #in~cond; {11306#false} is VALID [2018-11-23 12:03:29,844 INFO L273 TraceCheckUtils]: 46: Hoare triple {11306#false} assume 0 == ~cond; {11306#false} is VALID [2018-11-23 12:03:29,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {11306#false} assume !false; {11306#false} is VALID [2018-11-23 12:03:29,847 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:29,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:29,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 39 [2018-11-23 12:03:29,870 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2018-11-23 12:03:29,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:29,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 12:03:29,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:29,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 12:03:29,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 12:03:29,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:03:29,908 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 39 states. [2018-11-23 12:03:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:30,201 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-11-23 12:03:30,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 12:03:30,201 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 48 [2018-11-23 12:03:30,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:30,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:03:30,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 12:03:30,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:03:30,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 67 transitions. [2018-11-23 12:03:30,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 67 transitions. [2018-11-23 12:03:30,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:30,256 INFO L225 Difference]: With dead ends: 65 [2018-11-23 12:03:30,256 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:03:30,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:03:30,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:03:30,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-23 12:03:30,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:30,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 54 states. [2018-11-23 12:03:30,285 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:03:30,285 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:03:30,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:30,286 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:03:30,286 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:03:30,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:30,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:30,287 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 54 states. [2018-11-23 12:03:30,287 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 54 states. [2018-11-23 12:03:30,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:30,288 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-11-23 12:03:30,288 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:03:30,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:30,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:30,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:30,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:30,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:03:30,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-11-23 12:03:30,290 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 48 [2018-11-23 12:03:30,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:30,290 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-11-23 12:03:30,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 12:03:30,290 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-11-23 12:03:30,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:03:30,291 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:30,291 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:30,291 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:30,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:30,291 INFO L82 PathProgramCache]: Analyzing trace with hash -278631758, now seen corresponding path program 36 times [2018-11-23 12:03:30,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:30,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:30,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:30,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:30,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:30,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:31,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 12:03:31,371 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 12:03:31,371 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:03:31,371 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #48#return; {11805#true} is VALID [2018-11-23 12:03:31,371 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret2 := main(); {11805#true} is VALID [2018-11-23 12:03:31,372 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11807#(= main_~i~0 0)} is VALID [2018-11-23 12:03:31,373 INFO L273 TraceCheckUtils]: 6: Hoare triple {11807#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11808#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:31,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {11808#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11809#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:31,374 INFO L273 TraceCheckUtils]: 8: Hoare triple {11809#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11810#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:31,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {11810#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11811#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:31,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {11811#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11812#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:31,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {11812#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11813#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:31,377 INFO L273 TraceCheckUtils]: 12: Hoare triple {11813#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11814#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:31,379 INFO L273 TraceCheckUtils]: 13: Hoare triple {11814#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11815#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:31,380 INFO L273 TraceCheckUtils]: 14: Hoare triple {11815#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11816#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:31,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {11816#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11817#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:31,382 INFO L273 TraceCheckUtils]: 16: Hoare triple {11817#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11818#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:31,383 INFO L273 TraceCheckUtils]: 17: Hoare triple {11818#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11819#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:31,384 INFO L273 TraceCheckUtils]: 18: Hoare triple {11819#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11820#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:31,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {11820#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11821#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:31,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {11821#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11822#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:31,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {11822#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11823#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:31,387 INFO L273 TraceCheckUtils]: 22: Hoare triple {11823#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11824#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:31,388 INFO L273 TraceCheckUtils]: 23: Hoare triple {11824#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11825#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:31,389 INFO L273 TraceCheckUtils]: 24: Hoare triple {11825#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11826#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:31,390 INFO L273 TraceCheckUtils]: 25: Hoare triple {11826#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11827#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:31,391 INFO L273 TraceCheckUtils]: 26: Hoare triple {11827#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11828#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:31,392 INFO L273 TraceCheckUtils]: 27: Hoare triple {11828#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11829#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:31,393 INFO L273 TraceCheckUtils]: 28: Hoare triple {11829#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11830#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:31,394 INFO L273 TraceCheckUtils]: 29: Hoare triple {11830#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11831#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:31,395 INFO L273 TraceCheckUtils]: 30: Hoare triple {11831#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11832#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:31,396 INFO L273 TraceCheckUtils]: 31: Hoare triple {11832#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11833#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:31,397 INFO L273 TraceCheckUtils]: 32: Hoare triple {11833#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11834#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:31,398 INFO L273 TraceCheckUtils]: 33: Hoare triple {11834#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11835#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:31,399 INFO L273 TraceCheckUtils]: 34: Hoare triple {11835#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11836#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:31,400 INFO L273 TraceCheckUtils]: 35: Hoare triple {11836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11837#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:31,401 INFO L273 TraceCheckUtils]: 36: Hoare triple {11837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11838#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:31,402 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11839#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:31,403 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11840#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:31,404 INFO L273 TraceCheckUtils]: 39: Hoare triple {11840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11841#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:31,405 INFO L273 TraceCheckUtils]: 40: Hoare triple {11841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11842#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:31,406 INFO L273 TraceCheckUtils]: 41: Hoare triple {11842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11843#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:31,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {11843#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11806#false} is VALID [2018-11-23 12:03:31,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {11806#false} havoc ~x~0;~x~0 := 0; {11806#false} is VALID [2018-11-23 12:03:31,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {11806#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11806#false} is VALID [2018-11-23 12:03:31,408 INFO L256 TraceCheckUtils]: 45: Hoare triple {11806#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11806#false} is VALID [2018-11-23 12:03:31,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2018-11-23 12:03:31,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2018-11-23 12:03:31,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 12:03:31,412 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:31,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:31,413 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:31,424 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:03:49,191 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 12:03:49,192 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:49,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:49,853 INFO L256 TraceCheckUtils]: 0: Hoare triple {11805#true} call ULTIMATE.init(); {11805#true} is VALID [2018-11-23 12:03:49,854 INFO L273 TraceCheckUtils]: 1: Hoare triple {11805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11805#true} is VALID [2018-11-23 12:03:49,854 INFO L273 TraceCheckUtils]: 2: Hoare triple {11805#true} assume true; {11805#true} is VALID [2018-11-23 12:03:49,854 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11805#true} {11805#true} #48#return; {11805#true} is VALID [2018-11-23 12:03:49,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {11805#true} call #t~ret2 := main(); {11805#true} is VALID [2018-11-23 12:03:49,855 INFO L273 TraceCheckUtils]: 5: Hoare triple {11805#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {11862#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:49,856 INFO L273 TraceCheckUtils]: 6: Hoare triple {11862#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11808#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:49,857 INFO L273 TraceCheckUtils]: 7: Hoare triple {11808#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11809#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:49,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {11809#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11810#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:49,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {11810#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11811#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:49,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {11811#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11812#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:49,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {11812#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11813#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:49,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {11813#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11814#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:49,862 INFO L273 TraceCheckUtils]: 13: Hoare triple {11814#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11815#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:49,863 INFO L273 TraceCheckUtils]: 14: Hoare triple {11815#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11816#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:49,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {11816#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11817#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:49,864 INFO L273 TraceCheckUtils]: 16: Hoare triple {11817#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11818#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:49,865 INFO L273 TraceCheckUtils]: 17: Hoare triple {11818#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11819#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:49,866 INFO L273 TraceCheckUtils]: 18: Hoare triple {11819#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11820#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:49,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {11820#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11821#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:49,868 INFO L273 TraceCheckUtils]: 20: Hoare triple {11821#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11822#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:49,869 INFO L273 TraceCheckUtils]: 21: Hoare triple {11822#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11823#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:49,870 INFO L273 TraceCheckUtils]: 22: Hoare triple {11823#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11824#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:49,871 INFO L273 TraceCheckUtils]: 23: Hoare triple {11824#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11825#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:49,872 INFO L273 TraceCheckUtils]: 24: Hoare triple {11825#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11826#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:49,873 INFO L273 TraceCheckUtils]: 25: Hoare triple {11826#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11827#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:49,874 INFO L273 TraceCheckUtils]: 26: Hoare triple {11827#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11828#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:49,875 INFO L273 TraceCheckUtils]: 27: Hoare triple {11828#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11829#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:49,876 INFO L273 TraceCheckUtils]: 28: Hoare triple {11829#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11830#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:49,877 INFO L273 TraceCheckUtils]: 29: Hoare triple {11830#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11831#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:49,878 INFO L273 TraceCheckUtils]: 30: Hoare triple {11831#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11832#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:49,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {11832#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11833#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:49,879 INFO L273 TraceCheckUtils]: 32: Hoare triple {11833#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11834#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:49,880 INFO L273 TraceCheckUtils]: 33: Hoare triple {11834#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11835#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:49,881 INFO L273 TraceCheckUtils]: 34: Hoare triple {11835#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11836#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:49,882 INFO L273 TraceCheckUtils]: 35: Hoare triple {11836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11837#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:49,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {11837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11838#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:49,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {11838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11839#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:49,885 INFO L273 TraceCheckUtils]: 38: Hoare triple {11839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11840#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:49,886 INFO L273 TraceCheckUtils]: 39: Hoare triple {11840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11841#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:49,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {11841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11842#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:49,888 INFO L273 TraceCheckUtils]: 41: Hoare triple {11842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {11843#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:49,888 INFO L273 TraceCheckUtils]: 42: Hoare triple {11843#(<= main_~i~0 36)} assume !(~i~0 < 100000); {11806#false} is VALID [2018-11-23 12:03:49,889 INFO L273 TraceCheckUtils]: 43: Hoare triple {11806#false} havoc ~x~0;~x~0 := 0; {11806#false} is VALID [2018-11-23 12:03:49,889 INFO L273 TraceCheckUtils]: 44: Hoare triple {11806#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {11806#false} is VALID [2018-11-23 12:03:49,889 INFO L256 TraceCheckUtils]: 45: Hoare triple {11806#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {11806#false} is VALID [2018-11-23 12:03:49,889 INFO L273 TraceCheckUtils]: 46: Hoare triple {11806#false} ~cond := #in~cond; {11806#false} is VALID [2018-11-23 12:03:49,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {11806#false} assume 0 == ~cond; {11806#false} is VALID [2018-11-23 12:03:49,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {11806#false} assume !false; {11806#false} is VALID [2018-11-23 12:03:49,893 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:49,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:49,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 40 [2018-11-23 12:03:49,918 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2018-11-23 12:03:49,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:49,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 12:03:49,955 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:49,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 12:03:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 12:03:49,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:03:49,957 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 40 states. [2018-11-23 12:03:50,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:50,149 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:03:50,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 12:03:50,150 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 49 [2018-11-23 12:03:50,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:03:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 12:03:50,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:03:50,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 68 transitions. [2018-11-23 12:03:50,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 68 transitions. [2018-11-23 12:03:50,204 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-23 12:03:50,205 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:03:50,205 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 12:03:50,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 12:03:50,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 12:03:50,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-23 12:03:50,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:50,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-23 12:03:50,237 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:03:50,237 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:03:50,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:50,239 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:03:50,239 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:03:50,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:50,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:50,240 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-23 12:03:50,240 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-23 12:03:50,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:50,241 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-11-23 12:03:50,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:03:50,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:50,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:50,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:50,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:03:50,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-11-23 12:03:50,242 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2018-11-23 12:03:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:50,243 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-11-23 12:03:50,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 12:03:50,243 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-11-23 12:03:50,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:03:50,243 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:50,243 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:50,244 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:50,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:50,244 INFO L82 PathProgramCache]: Analyzing trace with hash -2138728594, now seen corresponding path program 37 times [2018-11-23 12:03:50,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:50,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:50,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:50,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:51,107 INFO L256 TraceCheckUtils]: 0: Hoare triple {12315#true} call ULTIMATE.init(); {12315#true} is VALID [2018-11-23 12:03:51,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {12315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12315#true} is VALID [2018-11-23 12:03:51,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {12315#true} assume true; {12315#true} is VALID [2018-11-23 12:03:51,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12315#true} {12315#true} #48#return; {12315#true} is VALID [2018-11-23 12:03:51,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {12315#true} call #t~ret2 := main(); {12315#true} is VALID [2018-11-23 12:03:51,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {12315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12317#(= main_~i~0 0)} is VALID [2018-11-23 12:03:51,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {12317#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12318#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:51,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {12318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12319#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:51,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {12319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12320#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:51,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {12320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12321#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:51,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {12321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12322#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:51,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {12322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12323#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:51,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {12323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12324#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:51,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {12324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12325#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:51,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {12325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12326#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:51,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {12326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12327#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:51,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {12327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12328#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:51,121 INFO L273 TraceCheckUtils]: 17: Hoare triple {12328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12329#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:51,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12330#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:51,122 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12331#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:51,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {12331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12332#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:51,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {12332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12333#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:51,124 INFO L273 TraceCheckUtils]: 22: Hoare triple {12333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12334#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:51,125 INFO L273 TraceCheckUtils]: 23: Hoare triple {12334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12335#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:51,126 INFO L273 TraceCheckUtils]: 24: Hoare triple {12335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12336#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:51,127 INFO L273 TraceCheckUtils]: 25: Hoare triple {12336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12337#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:51,128 INFO L273 TraceCheckUtils]: 26: Hoare triple {12337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12338#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:51,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {12338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12339#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:51,130 INFO L273 TraceCheckUtils]: 28: Hoare triple {12339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:51,131 INFO L273 TraceCheckUtils]: 29: Hoare triple {12340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12341#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:51,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {12341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12342#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:51,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {12342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12343#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:51,134 INFO L273 TraceCheckUtils]: 32: Hoare triple {12343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12344#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:51,135 INFO L273 TraceCheckUtils]: 33: Hoare triple {12344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12345#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:51,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {12345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12346#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:51,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {12346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12347#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:51,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {12347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12348#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:51,139 INFO L273 TraceCheckUtils]: 37: Hoare triple {12348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12349#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:51,139 INFO L273 TraceCheckUtils]: 38: Hoare triple {12349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12350#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:51,140 INFO L273 TraceCheckUtils]: 39: Hoare triple {12350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12351#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:51,141 INFO L273 TraceCheckUtils]: 40: Hoare triple {12351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:51,142 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12353#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:51,143 INFO L273 TraceCheckUtils]: 42: Hoare triple {12353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#(<= main_~i~0 37)} is VALID [2018-11-23 12:03:51,144 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12316#false} is VALID [2018-11-23 12:03:51,144 INFO L273 TraceCheckUtils]: 44: Hoare triple {12316#false} havoc ~x~0;~x~0 := 0; {12316#false} is VALID [2018-11-23 12:03:51,144 INFO L273 TraceCheckUtils]: 45: Hoare triple {12316#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12316#false} is VALID [2018-11-23 12:03:51,145 INFO L256 TraceCheckUtils]: 46: Hoare triple {12316#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12316#false} is VALID [2018-11-23 12:03:51,145 INFO L273 TraceCheckUtils]: 47: Hoare triple {12316#false} ~cond := #in~cond; {12316#false} is VALID [2018-11-23 12:03:51,145 INFO L273 TraceCheckUtils]: 48: Hoare triple {12316#false} assume 0 == ~cond; {12316#false} is VALID [2018-11-23 12:03:51,145 INFO L273 TraceCheckUtils]: 49: Hoare triple {12316#false} assume !false; {12316#false} is VALID [2018-11-23 12:03:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:51,149 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:51,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:51,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:51,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:51,444 INFO L256 TraceCheckUtils]: 0: Hoare triple {12315#true} call ULTIMATE.init(); {12315#true} is VALID [2018-11-23 12:03:51,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {12315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12315#true} is VALID [2018-11-23 12:03:51,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {12315#true} assume true; {12315#true} is VALID [2018-11-23 12:03:51,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12315#true} {12315#true} #48#return; {12315#true} is VALID [2018-11-23 12:03:51,445 INFO L256 TraceCheckUtils]: 4: Hoare triple {12315#true} call #t~ret2 := main(); {12315#true} is VALID [2018-11-23 12:03:51,446 INFO L273 TraceCheckUtils]: 5: Hoare triple {12315#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12373#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:51,447 INFO L273 TraceCheckUtils]: 6: Hoare triple {12373#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12318#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:51,447 INFO L273 TraceCheckUtils]: 7: Hoare triple {12318#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12319#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:51,448 INFO L273 TraceCheckUtils]: 8: Hoare triple {12319#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12320#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:51,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {12320#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12321#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:51,449 INFO L273 TraceCheckUtils]: 10: Hoare triple {12321#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12322#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:51,449 INFO L273 TraceCheckUtils]: 11: Hoare triple {12322#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12323#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:51,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {12323#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12324#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:51,451 INFO L273 TraceCheckUtils]: 13: Hoare triple {12324#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12325#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:51,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {12325#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12326#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:51,453 INFO L273 TraceCheckUtils]: 15: Hoare triple {12326#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12327#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:51,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {12327#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12328#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:51,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {12328#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12329#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:51,456 INFO L273 TraceCheckUtils]: 18: Hoare triple {12329#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12330#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:51,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {12330#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12331#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:51,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {12331#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12332#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:51,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {12332#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12333#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:51,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {12333#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12334#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:51,461 INFO L273 TraceCheckUtils]: 23: Hoare triple {12334#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12335#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:51,462 INFO L273 TraceCheckUtils]: 24: Hoare triple {12335#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12336#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:51,462 INFO L273 TraceCheckUtils]: 25: Hoare triple {12336#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12337#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:51,463 INFO L273 TraceCheckUtils]: 26: Hoare triple {12337#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12338#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:51,464 INFO L273 TraceCheckUtils]: 27: Hoare triple {12338#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12339#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:51,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {12339#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12340#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:51,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {12340#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12341#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:51,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {12341#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12342#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:51,468 INFO L273 TraceCheckUtils]: 31: Hoare triple {12342#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12343#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:51,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {12343#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12344#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:51,470 INFO L273 TraceCheckUtils]: 33: Hoare triple {12344#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12345#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:51,471 INFO L273 TraceCheckUtils]: 34: Hoare triple {12345#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12346#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:51,472 INFO L273 TraceCheckUtils]: 35: Hoare triple {12346#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12347#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:51,473 INFO L273 TraceCheckUtils]: 36: Hoare triple {12347#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12348#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:51,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {12348#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12349#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:51,475 INFO L273 TraceCheckUtils]: 38: Hoare triple {12349#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12350#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:51,476 INFO L273 TraceCheckUtils]: 39: Hoare triple {12350#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12351#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:51,476 INFO L273 TraceCheckUtils]: 40: Hoare triple {12351#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12352#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:51,477 INFO L273 TraceCheckUtils]: 41: Hoare triple {12352#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12353#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:51,478 INFO L273 TraceCheckUtils]: 42: Hoare triple {12353#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12354#(<= main_~i~0 37)} is VALID [2018-11-23 12:03:51,479 INFO L273 TraceCheckUtils]: 43: Hoare triple {12354#(<= main_~i~0 37)} assume !(~i~0 < 100000); {12316#false} is VALID [2018-11-23 12:03:51,479 INFO L273 TraceCheckUtils]: 44: Hoare triple {12316#false} havoc ~x~0;~x~0 := 0; {12316#false} is VALID [2018-11-23 12:03:51,480 INFO L273 TraceCheckUtils]: 45: Hoare triple {12316#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12316#false} is VALID [2018-11-23 12:03:51,480 INFO L256 TraceCheckUtils]: 46: Hoare triple {12316#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12316#false} is VALID [2018-11-23 12:03:51,480 INFO L273 TraceCheckUtils]: 47: Hoare triple {12316#false} ~cond := #in~cond; {12316#false} is VALID [2018-11-23 12:03:51,480 INFO L273 TraceCheckUtils]: 48: Hoare triple {12316#false} assume 0 == ~cond; {12316#false} is VALID [2018-11-23 12:03:51,480 INFO L273 TraceCheckUtils]: 49: Hoare triple {12316#false} assume !false; {12316#false} is VALID [2018-11-23 12:03:51,483 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:51,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:51,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 41 [2018-11-23 12:03:51,503 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-11-23 12:03:51,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:51,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 12:03:51,544 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-23 12:03:51,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 12:03:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 12:03:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:03:51,545 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-11-23 12:03:51,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:51,716 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-11-23 12:03:51,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 12:03:51,716 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 50 [2018-11-23 12:03:51,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:51,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:03:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 12:03:51,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:03:51,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2018-11-23 12:03:51,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 69 transitions. [2018-11-23 12:03:51,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:51,783 INFO L225 Difference]: With dead ends: 67 [2018-11-23 12:03:51,783 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 12:03:51,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:03:51,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 12:03:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-11-23 12:03:51,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:51,822 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:51,822 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:51,823 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:51,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:51,824 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:03:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:03:51,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:51,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:51,825 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:51,825 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 56 states. [2018-11-23 12:03:51,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:51,826 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2018-11-23 12:03:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:03:51,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:51,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:51,826 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:51,826 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:51,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:03:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2018-11-23 12:03:51,828 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2018-11-23 12:03:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:51,828 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2018-11-23 12:03:51,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 12:03:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2018-11-23 12:03:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 12:03:51,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:51,829 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:51,829 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:51,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:51,829 INFO L82 PathProgramCache]: Analyzing trace with hash 327811634, now seen corresponding path program 38 times [2018-11-23 12:03:51,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:51,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:03:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:51,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:52,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {12835#true} call ULTIMATE.init(); {12835#true} is VALID [2018-11-23 12:03:52,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {12835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12835#true} is VALID [2018-11-23 12:03:52,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {12835#true} assume true; {12835#true} is VALID [2018-11-23 12:03:52,658 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12835#true} {12835#true} #48#return; {12835#true} is VALID [2018-11-23 12:03:52,658 INFO L256 TraceCheckUtils]: 4: Hoare triple {12835#true} call #t~ret2 := main(); {12835#true} is VALID [2018-11-23 12:03:52,658 INFO L273 TraceCheckUtils]: 5: Hoare triple {12835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12837#(= main_~i~0 0)} is VALID [2018-11-23 12:03:52,659 INFO L273 TraceCheckUtils]: 6: Hoare triple {12837#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12838#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:52,660 INFO L273 TraceCheckUtils]: 7: Hoare triple {12838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12839#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:52,661 INFO L273 TraceCheckUtils]: 8: Hoare triple {12839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12840#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:52,661 INFO L273 TraceCheckUtils]: 9: Hoare triple {12840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12841#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:52,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {12841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12842#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:52,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {12842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12843#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:52,664 INFO L273 TraceCheckUtils]: 12: Hoare triple {12843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12844#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:52,665 INFO L273 TraceCheckUtils]: 13: Hoare triple {12844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12845#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:52,666 INFO L273 TraceCheckUtils]: 14: Hoare triple {12845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12846#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:52,666 INFO L273 TraceCheckUtils]: 15: Hoare triple {12846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12847#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:52,667 INFO L273 TraceCheckUtils]: 16: Hoare triple {12847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12848#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:52,668 INFO L273 TraceCheckUtils]: 17: Hoare triple {12848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12849#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:52,669 INFO L273 TraceCheckUtils]: 18: Hoare triple {12849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12850#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:52,670 INFO L273 TraceCheckUtils]: 19: Hoare triple {12850#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12851#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:52,671 INFO L273 TraceCheckUtils]: 20: Hoare triple {12851#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12852#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:52,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {12852#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12853#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:52,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {12853#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12854#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:52,674 INFO L273 TraceCheckUtils]: 23: Hoare triple {12854#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12855#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:52,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {12855#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12856#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:52,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {12856#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12857#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:52,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {12857#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12858#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:52,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12859#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:52,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12860#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:52,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {12860#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12861#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:52,681 INFO L273 TraceCheckUtils]: 30: Hoare triple {12861#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12862#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:52,682 INFO L273 TraceCheckUtils]: 31: Hoare triple {12862#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12863#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:52,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {12863#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12864#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:52,683 INFO L273 TraceCheckUtils]: 33: Hoare triple {12864#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12865#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:52,684 INFO L273 TraceCheckUtils]: 34: Hoare triple {12865#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12866#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:52,685 INFO L273 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12867#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:52,686 INFO L273 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12868#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:52,687 INFO L273 TraceCheckUtils]: 37: Hoare triple {12868#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12869#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:52,688 INFO L273 TraceCheckUtils]: 38: Hoare triple {12869#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12870#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:52,689 INFO L273 TraceCheckUtils]: 39: Hoare triple {12870#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12871#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:52,690 INFO L273 TraceCheckUtils]: 40: Hoare triple {12871#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12872#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:52,691 INFO L273 TraceCheckUtils]: 41: Hoare triple {12872#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12873#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:52,692 INFO L273 TraceCheckUtils]: 42: Hoare triple {12873#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12874#(<= main_~i~0 37)} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 43: Hoare triple {12874#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 38)} is VALID [2018-11-23 12:03:52,693 INFO L273 TraceCheckUtils]: 44: Hoare triple {12875#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12836#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 45: Hoare triple {12836#false} havoc ~x~0;~x~0 := 0; {12836#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 46: Hoare triple {12836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12836#false} is VALID [2018-11-23 12:03:52,694 INFO L256 TraceCheckUtils]: 47: Hoare triple {12836#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12836#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 48: Hoare triple {12836#false} ~cond := #in~cond; {12836#false} is VALID [2018-11-23 12:03:52,694 INFO L273 TraceCheckUtils]: 49: Hoare triple {12836#false} assume 0 == ~cond; {12836#false} is VALID [2018-11-23 12:03:52,695 INFO L273 TraceCheckUtils]: 50: Hoare triple {12836#false} assume !false; {12836#false} is VALID [2018-11-23 12:03:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:52,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:52,699 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:52,708 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:03:52,761 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:03:52,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:03:52,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:52,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:03:53,147 INFO L256 TraceCheckUtils]: 0: Hoare triple {12835#true} call ULTIMATE.init(); {12835#true} is VALID [2018-11-23 12:03:53,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {12835#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12835#true} is VALID [2018-11-23 12:03:53,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {12835#true} assume true; {12835#true} is VALID [2018-11-23 12:03:53,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12835#true} {12835#true} #48#return; {12835#true} is VALID [2018-11-23 12:03:53,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {12835#true} call #t~ret2 := main(); {12835#true} is VALID [2018-11-23 12:03:53,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {12835#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {12894#(<= main_~i~0 0)} is VALID [2018-11-23 12:03:53,150 INFO L273 TraceCheckUtils]: 6: Hoare triple {12894#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12838#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:53,151 INFO L273 TraceCheckUtils]: 7: Hoare triple {12838#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12839#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:53,152 INFO L273 TraceCheckUtils]: 8: Hoare triple {12839#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12840#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:53,152 INFO L273 TraceCheckUtils]: 9: Hoare triple {12840#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12841#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:53,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {12841#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12842#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:53,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {12842#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12843#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:53,155 INFO L273 TraceCheckUtils]: 12: Hoare triple {12843#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12844#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:53,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {12844#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12845#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:53,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {12845#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12846#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:53,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {12846#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12847#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:53,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {12847#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12848#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:53,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {12848#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12849#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:53,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {12849#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12850#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:53,162 INFO L273 TraceCheckUtils]: 19: Hoare triple {12850#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12851#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:53,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {12851#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12852#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:53,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {12852#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12853#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:53,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {12853#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12854#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:53,165 INFO L273 TraceCheckUtils]: 23: Hoare triple {12854#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12855#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:53,166 INFO L273 TraceCheckUtils]: 24: Hoare triple {12855#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12856#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:53,167 INFO L273 TraceCheckUtils]: 25: Hoare triple {12856#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12857#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:53,168 INFO L273 TraceCheckUtils]: 26: Hoare triple {12857#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12858#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:53,169 INFO L273 TraceCheckUtils]: 27: Hoare triple {12858#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12859#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:53,170 INFO L273 TraceCheckUtils]: 28: Hoare triple {12859#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12860#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:53,171 INFO L273 TraceCheckUtils]: 29: Hoare triple {12860#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12861#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:53,172 INFO L273 TraceCheckUtils]: 30: Hoare triple {12861#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12862#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:53,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {12862#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12863#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:53,174 INFO L273 TraceCheckUtils]: 32: Hoare triple {12863#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12864#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:53,175 INFO L273 TraceCheckUtils]: 33: Hoare triple {12864#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12865#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:53,176 INFO L273 TraceCheckUtils]: 34: Hoare triple {12865#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12866#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:53,177 INFO L273 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12867#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:53,178 INFO L273 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12868#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:53,178 INFO L273 TraceCheckUtils]: 37: Hoare triple {12868#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12869#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:53,190 INFO L273 TraceCheckUtils]: 38: Hoare triple {12869#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12870#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:53,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {12870#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12871#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:53,196 INFO L273 TraceCheckUtils]: 40: Hoare triple {12871#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12872#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:53,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {12872#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12873#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:53,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {12873#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12874#(<= main_~i~0 37)} is VALID [2018-11-23 12:03:53,198 INFO L273 TraceCheckUtils]: 43: Hoare triple {12874#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {12875#(<= main_~i~0 38)} is VALID [2018-11-23 12:03:53,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {12875#(<= main_~i~0 38)} assume !(~i~0 < 100000); {12836#false} is VALID [2018-11-23 12:03:53,198 INFO L273 TraceCheckUtils]: 45: Hoare triple {12836#false} havoc ~x~0;~x~0 := 0; {12836#false} is VALID [2018-11-23 12:03:53,199 INFO L273 TraceCheckUtils]: 46: Hoare triple {12836#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {12836#false} is VALID [2018-11-23 12:03:53,199 INFO L256 TraceCheckUtils]: 47: Hoare triple {12836#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {12836#false} is VALID [2018-11-23 12:03:53,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {12836#false} ~cond := #in~cond; {12836#false} is VALID [2018-11-23 12:03:53,199 INFO L273 TraceCheckUtils]: 49: Hoare triple {12836#false} assume 0 == ~cond; {12836#false} is VALID [2018-11-23 12:03:53,199 INFO L273 TraceCheckUtils]: 50: Hoare triple {12836#false} assume !false; {12836#false} is VALID [2018-11-23 12:03:53,202 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:53,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:03:53,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 42 [2018-11-23 12:03:53,222 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2018-11-23 12:03:53,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:03:53,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 12:03:53,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:03:53,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 12:03:53,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 12:03:53,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:03:53,303 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 42 states. [2018-11-23 12:03:53,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:53,588 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-11-23 12:03:53,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 12:03:53,588 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 51 [2018-11-23 12:03:53,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:03:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:03:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 12:03:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 12:03:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 70 transitions. [2018-11-23 12:03:53,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 70 transitions. [2018-11-23 12:03:53,642 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-23 12:03:53,643 INFO L225 Difference]: With dead ends: 68 [2018-11-23 12:03:53,643 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 12:03:53,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 12:03:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 12:03:53,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-11-23 12:03:53,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:03:53,678 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 57 states. [2018-11-23 12:03:53,678 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:03:53,678 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:03:53,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:53,679 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:03:53,679 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:03:53,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:53,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:53,680 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 57 states. [2018-11-23 12:03:53,680 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 57 states. [2018-11-23 12:03:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:03:53,681 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-11-23 12:03:53,681 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:03:53,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:03:53,682 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:03:53,682 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:03:53,682 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:03:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:03:53,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 12:03:53,683 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 51 [2018-11-23 12:03:53,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:03:53,683 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 12:03:53,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 12:03:53,683 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:03:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:03:53,684 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:03:53,684 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:03:53,684 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:03:53,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:03:53,684 INFO L82 PathProgramCache]: Analyzing trace with hash -518852626, now seen corresponding path program 39 times [2018-11-23 12:03:53,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:03:53,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:03:53,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:53,685 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:03:53,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:03:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:03:54,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {13365#true} call ULTIMATE.init(); {13365#true} is VALID [2018-11-23 12:03:54,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {13365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13365#true} is VALID [2018-11-23 12:03:54,600 INFO L273 TraceCheckUtils]: 2: Hoare triple {13365#true} assume true; {13365#true} is VALID [2018-11-23 12:03:54,600 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13365#true} {13365#true} #48#return; {13365#true} is VALID [2018-11-23 12:03:54,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {13365#true} call #t~ret2 := main(); {13365#true} is VALID [2018-11-23 12:03:54,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {13365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13367#(= main_~i~0 0)} is VALID [2018-11-23 12:03:54,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {13367#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13368#(<= main_~i~0 1)} is VALID [2018-11-23 12:03:54,605 INFO L273 TraceCheckUtils]: 7: Hoare triple {13368#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13369#(<= main_~i~0 2)} is VALID [2018-11-23 12:03:54,605 INFO L273 TraceCheckUtils]: 8: Hoare triple {13369#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13370#(<= main_~i~0 3)} is VALID [2018-11-23 12:03:54,607 INFO L273 TraceCheckUtils]: 9: Hoare triple {13370#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13371#(<= main_~i~0 4)} is VALID [2018-11-23 12:03:54,607 INFO L273 TraceCheckUtils]: 10: Hoare triple {13371#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13372#(<= main_~i~0 5)} is VALID [2018-11-23 12:03:54,609 INFO L273 TraceCheckUtils]: 11: Hoare triple {13372#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13373#(<= main_~i~0 6)} is VALID [2018-11-23 12:03:54,610 INFO L273 TraceCheckUtils]: 12: Hoare triple {13373#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13374#(<= main_~i~0 7)} is VALID [2018-11-23 12:03:54,611 INFO L273 TraceCheckUtils]: 13: Hoare triple {13374#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13375#(<= main_~i~0 8)} is VALID [2018-11-23 12:03:54,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {13375#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13376#(<= main_~i~0 9)} is VALID [2018-11-23 12:03:54,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {13376#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13377#(<= main_~i~0 10)} is VALID [2018-11-23 12:03:54,614 INFO L273 TraceCheckUtils]: 16: Hoare triple {13377#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13378#(<= main_~i~0 11)} is VALID [2018-11-23 12:03:54,615 INFO L273 TraceCheckUtils]: 17: Hoare triple {13378#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13379#(<= main_~i~0 12)} is VALID [2018-11-23 12:03:54,616 INFO L273 TraceCheckUtils]: 18: Hoare triple {13379#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13380#(<= main_~i~0 13)} is VALID [2018-11-23 12:03:54,617 INFO L273 TraceCheckUtils]: 19: Hoare triple {13380#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13381#(<= main_~i~0 14)} is VALID [2018-11-23 12:03:54,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {13381#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13382#(<= main_~i~0 15)} is VALID [2018-11-23 12:03:54,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {13382#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13383#(<= main_~i~0 16)} is VALID [2018-11-23 12:03:54,640 INFO L273 TraceCheckUtils]: 22: Hoare triple {13383#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13384#(<= main_~i~0 17)} is VALID [2018-11-23 12:03:54,640 INFO L273 TraceCheckUtils]: 23: Hoare triple {13384#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13385#(<= main_~i~0 18)} is VALID [2018-11-23 12:03:54,641 INFO L273 TraceCheckUtils]: 24: Hoare triple {13385#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13386#(<= main_~i~0 19)} is VALID [2018-11-23 12:03:54,641 INFO L273 TraceCheckUtils]: 25: Hoare triple {13386#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13387#(<= main_~i~0 20)} is VALID [2018-11-23 12:03:54,642 INFO L273 TraceCheckUtils]: 26: Hoare triple {13387#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13388#(<= main_~i~0 21)} is VALID [2018-11-23 12:03:54,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {13388#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13389#(<= main_~i~0 22)} is VALID [2018-11-23 12:03:54,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {13389#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13390#(<= main_~i~0 23)} is VALID [2018-11-23 12:03:54,645 INFO L273 TraceCheckUtils]: 29: Hoare triple {13390#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13391#(<= main_~i~0 24)} is VALID [2018-11-23 12:03:54,645 INFO L273 TraceCheckUtils]: 30: Hoare triple {13391#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13392#(<= main_~i~0 25)} is VALID [2018-11-23 12:03:54,646 INFO L273 TraceCheckUtils]: 31: Hoare triple {13392#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13393#(<= main_~i~0 26)} is VALID [2018-11-23 12:03:54,647 INFO L273 TraceCheckUtils]: 32: Hoare triple {13393#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13394#(<= main_~i~0 27)} is VALID [2018-11-23 12:03:54,648 INFO L273 TraceCheckUtils]: 33: Hoare triple {13394#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13395#(<= main_~i~0 28)} is VALID [2018-11-23 12:03:54,649 INFO L273 TraceCheckUtils]: 34: Hoare triple {13395#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13396#(<= main_~i~0 29)} is VALID [2018-11-23 12:03:54,650 INFO L273 TraceCheckUtils]: 35: Hoare triple {13396#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13397#(<= main_~i~0 30)} is VALID [2018-11-23 12:03:54,651 INFO L273 TraceCheckUtils]: 36: Hoare triple {13397#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13398#(<= main_~i~0 31)} is VALID [2018-11-23 12:03:54,652 INFO L273 TraceCheckUtils]: 37: Hoare triple {13398#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13399#(<= main_~i~0 32)} is VALID [2018-11-23 12:03:54,653 INFO L273 TraceCheckUtils]: 38: Hoare triple {13399#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13400#(<= main_~i~0 33)} is VALID [2018-11-23 12:03:54,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {13400#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13401#(<= main_~i~0 34)} is VALID [2018-11-23 12:03:54,656 INFO L273 TraceCheckUtils]: 40: Hoare triple {13401#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13402#(<= main_~i~0 35)} is VALID [2018-11-23 12:03:54,657 INFO L273 TraceCheckUtils]: 41: Hoare triple {13402#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13403#(<= main_~i~0 36)} is VALID [2018-11-23 12:03:54,658 INFO L273 TraceCheckUtils]: 42: Hoare triple {13403#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13404#(<= main_~i~0 37)} is VALID [2018-11-23 12:03:54,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {13404#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13405#(<= main_~i~0 38)} is VALID [2018-11-23 12:03:54,660 INFO L273 TraceCheckUtils]: 44: Hoare triple {13405#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13406#(<= main_~i~0 39)} is VALID [2018-11-23 12:03:54,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {13406#(<= main_~i~0 39)} assume !(~i~0 < 100000); {13366#false} is VALID [2018-11-23 12:03:54,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {13366#false} havoc ~x~0;~x~0 := 0; {13366#false} is VALID [2018-11-23 12:03:54,660 INFO L273 TraceCheckUtils]: 47: Hoare triple {13366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13366#false} is VALID [2018-11-23 12:03:54,660 INFO L256 TraceCheckUtils]: 48: Hoare triple {13366#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13366#false} is VALID [2018-11-23 12:03:54,661 INFO L273 TraceCheckUtils]: 49: Hoare triple {13366#false} ~cond := #in~cond; {13366#false} is VALID [2018-11-23 12:03:54,661 INFO L273 TraceCheckUtils]: 50: Hoare triple {13366#false} assume 0 == ~cond; {13366#false} is VALID [2018-11-23 12:03:54,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {13366#false} assume !false; {13366#false} is VALID [2018-11-23 12:03:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:03:54,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:03:54,665 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:03:54,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:04:27,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-11-23 12:04:27,243 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:27,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:27,526 INFO L256 TraceCheckUtils]: 0: Hoare triple {13365#true} call ULTIMATE.init(); {13365#true} is VALID [2018-11-23 12:04:27,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {13365#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13365#true} is VALID [2018-11-23 12:04:27,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {13365#true} assume true; {13365#true} is VALID [2018-11-23 12:04:27,527 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13365#true} {13365#true} #48#return; {13365#true} is VALID [2018-11-23 12:04:27,527 INFO L256 TraceCheckUtils]: 4: Hoare triple {13365#true} call #t~ret2 := main(); {13365#true} is VALID [2018-11-23 12:04:27,528 INFO L273 TraceCheckUtils]: 5: Hoare triple {13365#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13425#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:27,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {13425#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13368#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:27,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {13368#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13369#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:27,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {13369#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13370#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:27,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {13370#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13371#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:27,531 INFO L273 TraceCheckUtils]: 10: Hoare triple {13371#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13372#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:27,531 INFO L273 TraceCheckUtils]: 11: Hoare triple {13372#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13373#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:27,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {13373#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13374#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:27,533 INFO L273 TraceCheckUtils]: 13: Hoare triple {13374#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13375#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:27,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {13375#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13376#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:27,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {13376#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13377#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:27,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {13377#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13378#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:27,537 INFO L273 TraceCheckUtils]: 17: Hoare triple {13378#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13379#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:27,538 INFO L273 TraceCheckUtils]: 18: Hoare triple {13379#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13380#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:27,539 INFO L273 TraceCheckUtils]: 19: Hoare triple {13380#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13381#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:27,540 INFO L273 TraceCheckUtils]: 20: Hoare triple {13381#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13382#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:27,541 INFO L273 TraceCheckUtils]: 21: Hoare triple {13382#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13383#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:27,542 INFO L273 TraceCheckUtils]: 22: Hoare triple {13383#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13384#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:27,543 INFO L273 TraceCheckUtils]: 23: Hoare triple {13384#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13385#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:27,544 INFO L273 TraceCheckUtils]: 24: Hoare triple {13385#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13386#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:27,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {13386#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13387#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:27,546 INFO L273 TraceCheckUtils]: 26: Hoare triple {13387#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13388#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:27,547 INFO L273 TraceCheckUtils]: 27: Hoare triple {13388#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13389#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:27,548 INFO L273 TraceCheckUtils]: 28: Hoare triple {13389#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13390#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:27,549 INFO L273 TraceCheckUtils]: 29: Hoare triple {13390#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13391#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:27,550 INFO L273 TraceCheckUtils]: 30: Hoare triple {13391#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13392#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:27,550 INFO L273 TraceCheckUtils]: 31: Hoare triple {13392#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13393#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:27,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {13393#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13394#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:27,552 INFO L273 TraceCheckUtils]: 33: Hoare triple {13394#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13395#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:27,553 INFO L273 TraceCheckUtils]: 34: Hoare triple {13395#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13396#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:27,554 INFO L273 TraceCheckUtils]: 35: Hoare triple {13396#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13397#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:27,555 INFO L273 TraceCheckUtils]: 36: Hoare triple {13397#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13398#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:27,556 INFO L273 TraceCheckUtils]: 37: Hoare triple {13398#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13399#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:27,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {13399#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13400#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:27,558 INFO L273 TraceCheckUtils]: 39: Hoare triple {13400#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13401#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:27,559 INFO L273 TraceCheckUtils]: 40: Hoare triple {13401#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13402#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:27,560 INFO L273 TraceCheckUtils]: 41: Hoare triple {13402#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13403#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:27,561 INFO L273 TraceCheckUtils]: 42: Hoare triple {13403#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13404#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:27,562 INFO L273 TraceCheckUtils]: 43: Hoare triple {13404#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13405#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:27,563 INFO L273 TraceCheckUtils]: 44: Hoare triple {13405#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13406#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:27,563 INFO L273 TraceCheckUtils]: 45: Hoare triple {13406#(<= main_~i~0 39)} assume !(~i~0 < 100000); {13366#false} is VALID [2018-11-23 12:04:27,564 INFO L273 TraceCheckUtils]: 46: Hoare triple {13366#false} havoc ~x~0;~x~0 := 0; {13366#false} is VALID [2018-11-23 12:04:27,564 INFO L273 TraceCheckUtils]: 47: Hoare triple {13366#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13366#false} is VALID [2018-11-23 12:04:27,564 INFO L256 TraceCheckUtils]: 48: Hoare triple {13366#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13366#false} is VALID [2018-11-23 12:04:27,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {13366#false} ~cond := #in~cond; {13366#false} is VALID [2018-11-23 12:04:27,564 INFO L273 TraceCheckUtils]: 50: Hoare triple {13366#false} assume 0 == ~cond; {13366#false} is VALID [2018-11-23 12:04:27,565 INFO L273 TraceCheckUtils]: 51: Hoare triple {13366#false} assume !false; {13366#false} is VALID [2018-11-23 12:04:27,569 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:27,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:27,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 43 [2018-11-23 12:04:27,598 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2018-11-23 12:04:27,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:27,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 12:04:27,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:27,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 12:04:27,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 12:04:27,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:04:27,642 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 43 states. [2018-11-23 12:04:28,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:28,160 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2018-11-23 12:04:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 12:04:28,161 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 52 [2018-11-23 12:04:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:28,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:04:28,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 12:04:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:04:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 71 transitions. [2018-11-23 12:04:28,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 71 transitions. [2018-11-23 12:04:28,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:28,223 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:04:28,223 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:04:28,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:04:28,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:04:28,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-11-23 12:04:28,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:28,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 58 states. [2018-11-23 12:04:28,256 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:04:28,257 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:04:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:28,258 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:04:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:04:28,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:28,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:28,259 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 58 states. [2018-11-23 12:04:28,259 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 58 states. [2018-11-23 12:04:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:28,260 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-11-23 12:04:28,260 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:04:28,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:28,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:28,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:28,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:28,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:04:28,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-11-23 12:04:28,262 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 52 [2018-11-23 12:04:28,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:28,262 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-11-23 12:04:28,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 12:04:28,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-11-23 12:04:28,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-11-23 12:04:28,262 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:28,262 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:28,263 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:28,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:28,263 INFO L82 PathProgramCache]: Analyzing trace with hash -995640910, now seen corresponding path program 40 times [2018-11-23 12:04:28,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:28,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:28,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:28,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {13905#true} call ULTIMATE.init(); {13905#true} is VALID [2018-11-23 12:04:29,647 INFO L273 TraceCheckUtils]: 1: Hoare triple {13905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13905#true} is VALID [2018-11-23 12:04:29,647 INFO L273 TraceCheckUtils]: 2: Hoare triple {13905#true} assume true; {13905#true} is VALID [2018-11-23 12:04:29,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13905#true} {13905#true} #48#return; {13905#true} is VALID [2018-11-23 12:04:29,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {13905#true} call #t~ret2 := main(); {13905#true} is VALID [2018-11-23 12:04:29,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {13905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13907#(= main_~i~0 0)} is VALID [2018-11-23 12:04:29,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {13907#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13908#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:29,650 INFO L273 TraceCheckUtils]: 7: Hoare triple {13908#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13909#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:29,651 INFO L273 TraceCheckUtils]: 8: Hoare triple {13909#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13910#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:29,651 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13911#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:29,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13912#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:29,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {13912#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13913#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:29,654 INFO L273 TraceCheckUtils]: 12: Hoare triple {13913#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13914#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:29,655 INFO L273 TraceCheckUtils]: 13: Hoare triple {13914#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13915#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:29,655 INFO L273 TraceCheckUtils]: 14: Hoare triple {13915#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13916#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:29,656 INFO L273 TraceCheckUtils]: 15: Hoare triple {13916#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13917#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:29,657 INFO L273 TraceCheckUtils]: 16: Hoare triple {13917#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13918#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:29,658 INFO L273 TraceCheckUtils]: 17: Hoare triple {13918#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13919#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:29,659 INFO L273 TraceCheckUtils]: 18: Hoare triple {13919#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13920#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:29,660 INFO L273 TraceCheckUtils]: 19: Hoare triple {13920#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13921#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:29,661 INFO L273 TraceCheckUtils]: 20: Hoare triple {13921#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13922#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:29,662 INFO L273 TraceCheckUtils]: 21: Hoare triple {13922#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13923#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:29,663 INFO L273 TraceCheckUtils]: 22: Hoare triple {13923#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13924#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:29,664 INFO L273 TraceCheckUtils]: 23: Hoare triple {13924#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13925#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:29,665 INFO L273 TraceCheckUtils]: 24: Hoare triple {13925#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13926#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:29,666 INFO L273 TraceCheckUtils]: 25: Hoare triple {13926#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13927#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:29,667 INFO L273 TraceCheckUtils]: 26: Hoare triple {13927#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13928#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:29,668 INFO L273 TraceCheckUtils]: 27: Hoare triple {13928#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13929#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:29,669 INFO L273 TraceCheckUtils]: 28: Hoare triple {13929#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13930#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:29,670 INFO L273 TraceCheckUtils]: 29: Hoare triple {13930#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13931#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:29,671 INFO L273 TraceCheckUtils]: 30: Hoare triple {13931#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13932#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:29,672 INFO L273 TraceCheckUtils]: 31: Hoare triple {13932#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13933#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:29,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {13933#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13934#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:29,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13935#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:29,674 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13936#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:29,675 INFO L273 TraceCheckUtils]: 35: Hoare triple {13936#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13937#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:29,676 INFO L273 TraceCheckUtils]: 36: Hoare triple {13937#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13938#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:29,677 INFO L273 TraceCheckUtils]: 37: Hoare triple {13938#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13939#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:29,678 INFO L273 TraceCheckUtils]: 38: Hoare triple {13939#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13940#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:29,679 INFO L273 TraceCheckUtils]: 39: Hoare triple {13940#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13941#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:29,680 INFO L273 TraceCheckUtils]: 40: Hoare triple {13941#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13942#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:29,681 INFO L273 TraceCheckUtils]: 41: Hoare triple {13942#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13943#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:29,682 INFO L273 TraceCheckUtils]: 42: Hoare triple {13943#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13944#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:29,683 INFO L273 TraceCheckUtils]: 43: Hoare triple {13944#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13945#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:29,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {13945#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13946#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:29,685 INFO L273 TraceCheckUtils]: 45: Hoare triple {13946#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13947#(<= main_~i~0 40)} is VALID [2018-11-23 12:04:29,686 INFO L273 TraceCheckUtils]: 46: Hoare triple {13947#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13906#false} is VALID [2018-11-23 12:04:29,686 INFO L273 TraceCheckUtils]: 47: Hoare triple {13906#false} havoc ~x~0;~x~0 := 0; {13906#false} is VALID [2018-11-23 12:04:29,686 INFO L273 TraceCheckUtils]: 48: Hoare triple {13906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13906#false} is VALID [2018-11-23 12:04:29,688 INFO L256 TraceCheckUtils]: 49: Hoare triple {13906#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13906#false} is VALID [2018-11-23 12:04:29,688 INFO L273 TraceCheckUtils]: 50: Hoare triple {13906#false} ~cond := #in~cond; {13906#false} is VALID [2018-11-23 12:04:29,688 INFO L273 TraceCheckUtils]: 51: Hoare triple {13906#false} assume 0 == ~cond; {13906#false} is VALID [2018-11-23 12:04:29,689 INFO L273 TraceCheckUtils]: 52: Hoare triple {13906#false} assume !false; {13906#false} is VALID [2018-11-23 12:04:29,692 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:29,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:29,693 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:29,707 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:04:29,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:04:29,741 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:29,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:29,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {13905#true} call ULTIMATE.init(); {13905#true} is VALID [2018-11-23 12:04:29,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {13905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13905#true} is VALID [2018-11-23 12:04:29,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {13905#true} assume true; {13905#true} is VALID [2018-11-23 12:04:29,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13905#true} {13905#true} #48#return; {13905#true} is VALID [2018-11-23 12:04:29,984 INFO L256 TraceCheckUtils]: 4: Hoare triple {13905#true} call #t~ret2 := main(); {13905#true} is VALID [2018-11-23 12:04:29,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {13905#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {13966#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:29,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {13966#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13908#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:29,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {13908#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13909#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:29,987 INFO L273 TraceCheckUtils]: 8: Hoare triple {13909#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13910#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:29,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {13910#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13911#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:29,988 INFO L273 TraceCheckUtils]: 10: Hoare triple {13911#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13912#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:29,989 INFO L273 TraceCheckUtils]: 11: Hoare triple {13912#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13913#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:29,990 INFO L273 TraceCheckUtils]: 12: Hoare triple {13913#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13914#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:29,991 INFO L273 TraceCheckUtils]: 13: Hoare triple {13914#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13915#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:29,992 INFO L273 TraceCheckUtils]: 14: Hoare triple {13915#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13916#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:29,993 INFO L273 TraceCheckUtils]: 15: Hoare triple {13916#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13917#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:29,994 INFO L273 TraceCheckUtils]: 16: Hoare triple {13917#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13918#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:29,995 INFO L273 TraceCheckUtils]: 17: Hoare triple {13918#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13919#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:29,996 INFO L273 TraceCheckUtils]: 18: Hoare triple {13919#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13920#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:29,997 INFO L273 TraceCheckUtils]: 19: Hoare triple {13920#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13921#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:29,997 INFO L273 TraceCheckUtils]: 20: Hoare triple {13921#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13922#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:29,998 INFO L273 TraceCheckUtils]: 21: Hoare triple {13922#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13923#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:29,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {13923#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13924#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:30,000 INFO L273 TraceCheckUtils]: 23: Hoare triple {13924#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13925#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:30,001 INFO L273 TraceCheckUtils]: 24: Hoare triple {13925#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13926#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:30,002 INFO L273 TraceCheckUtils]: 25: Hoare triple {13926#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13927#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:30,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {13927#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13928#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:30,004 INFO L273 TraceCheckUtils]: 27: Hoare triple {13928#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13929#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:30,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {13929#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13930#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:30,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {13930#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13931#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:30,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {13931#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13932#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:30,008 INFO L273 TraceCheckUtils]: 31: Hoare triple {13932#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13933#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:30,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {13933#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13934#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:30,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {13934#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13935#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:30,011 INFO L273 TraceCheckUtils]: 34: Hoare triple {13935#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13936#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:30,014 INFO L273 TraceCheckUtils]: 35: Hoare triple {13936#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13937#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:30,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {13937#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13938#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:30,017 INFO L273 TraceCheckUtils]: 37: Hoare triple {13938#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13939#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:30,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {13939#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13940#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:30,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {13940#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13941#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:30,019 INFO L273 TraceCheckUtils]: 40: Hoare triple {13941#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13942#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:30,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {13942#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13943#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:30,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {13943#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13944#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:30,021 INFO L273 TraceCheckUtils]: 43: Hoare triple {13944#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13945#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:30,022 INFO L273 TraceCheckUtils]: 44: Hoare triple {13945#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13946#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:30,023 INFO L273 TraceCheckUtils]: 45: Hoare triple {13946#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {13947#(<= main_~i~0 40)} is VALID [2018-11-23 12:04:30,024 INFO L273 TraceCheckUtils]: 46: Hoare triple {13947#(<= main_~i~0 40)} assume !(~i~0 < 100000); {13906#false} is VALID [2018-11-23 12:04:30,024 INFO L273 TraceCheckUtils]: 47: Hoare triple {13906#false} havoc ~x~0;~x~0 := 0; {13906#false} is VALID [2018-11-23 12:04:30,024 INFO L273 TraceCheckUtils]: 48: Hoare triple {13906#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {13906#false} is VALID [2018-11-23 12:04:30,025 INFO L256 TraceCheckUtils]: 49: Hoare triple {13906#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {13906#false} is VALID [2018-11-23 12:04:30,025 INFO L273 TraceCheckUtils]: 50: Hoare triple {13906#false} ~cond := #in~cond; {13906#false} is VALID [2018-11-23 12:04:30,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {13906#false} assume 0 == ~cond; {13906#false} is VALID [2018-11-23 12:04:30,025 INFO L273 TraceCheckUtils]: 52: Hoare triple {13906#false} assume !false; {13906#false} is VALID [2018-11-23 12:04:30,029 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:30,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:30,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 44 [2018-11-23 12:04:30,048 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-11-23 12:04:30,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:30,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 12:04:30,098 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 12:04:30,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 12:04:30,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:04:30,100 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 44 states. [2018-11-23 12:04:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:30,812 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2018-11-23 12:04:30,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 12:04:30,812 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 53 [2018-11-23 12:04:30,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:30,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:04:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 12:04:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:04:30,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 72 transitions. [2018-11-23 12:04:30,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 72 transitions. [2018-11-23 12:04:30,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:30,884 INFO L225 Difference]: With dead ends: 70 [2018-11-23 12:04:30,884 INFO L226 Difference]: Without dead ends: 59 [2018-11-23 12:04:30,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:04:30,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-23 12:04:30,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-11-23 12:04:30,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:30,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 59 states. [2018-11-23 12:04:30,923 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:04:30,923 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:04:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:30,925 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:04:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:04:30,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:30,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:30,926 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 59 states. [2018-11-23 12:04:30,926 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 59 states. [2018-11-23 12:04:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:30,927 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-11-23 12:04:30,927 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:04:30,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:30,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:30,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:30,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 12:04:30,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-11-23 12:04:30,928 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 53 [2018-11-23 12:04:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:30,929 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-11-23 12:04:30,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:04:30,929 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-11-23 12:04:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:04:30,929 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:30,929 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:30,929 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:30,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:30,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1403791470, now seen corresponding path program 41 times [2018-11-23 12:04:30,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:30,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:30,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:30,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:30,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:30,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:32,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {14455#true} call ULTIMATE.init(); {14455#true} is VALID [2018-11-23 12:04:32,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {14455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14455#true} is VALID [2018-11-23 12:04:32,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {14455#true} assume true; {14455#true} is VALID [2018-11-23 12:04:32,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14455#true} {14455#true} #48#return; {14455#true} is VALID [2018-11-23 12:04:32,399 INFO L256 TraceCheckUtils]: 4: Hoare triple {14455#true} call #t~ret2 := main(); {14455#true} is VALID [2018-11-23 12:04:32,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {14455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14457#(= main_~i~0 0)} is VALID [2018-11-23 12:04:32,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {14457#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:32,426 INFO L273 TraceCheckUtils]: 7: Hoare triple {14458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:32,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {14459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:32,428 INFO L273 TraceCheckUtils]: 9: Hoare triple {14460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:32,428 INFO L273 TraceCheckUtils]: 10: Hoare triple {14461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:32,429 INFO L273 TraceCheckUtils]: 11: Hoare triple {14462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:32,429 INFO L273 TraceCheckUtils]: 12: Hoare triple {14463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:32,430 INFO L273 TraceCheckUtils]: 13: Hoare triple {14464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:32,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {14465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14466#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:32,432 INFO L273 TraceCheckUtils]: 15: Hoare triple {14466#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14467#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:32,433 INFO L273 TraceCheckUtils]: 16: Hoare triple {14467#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14468#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:32,434 INFO L273 TraceCheckUtils]: 17: Hoare triple {14468#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14469#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:32,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {14469#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14470#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:32,435 INFO L273 TraceCheckUtils]: 19: Hoare triple {14470#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14471#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:32,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {14471#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14472#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:32,437 INFO L273 TraceCheckUtils]: 21: Hoare triple {14472#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14473#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:32,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {14473#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14474#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:32,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {14474#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14475#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:32,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {14475#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14476#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:32,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {14476#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14477#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:32,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {14477#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14478#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:32,443 INFO L273 TraceCheckUtils]: 27: Hoare triple {14478#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14479#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:32,444 INFO L273 TraceCheckUtils]: 28: Hoare triple {14479#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14480#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:32,445 INFO L273 TraceCheckUtils]: 29: Hoare triple {14480#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14481#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:32,446 INFO L273 TraceCheckUtils]: 30: Hoare triple {14481#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14482#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:32,447 INFO L273 TraceCheckUtils]: 31: Hoare triple {14482#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14483#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:32,448 INFO L273 TraceCheckUtils]: 32: Hoare triple {14483#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14484#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:32,449 INFO L273 TraceCheckUtils]: 33: Hoare triple {14484#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14485#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:32,450 INFO L273 TraceCheckUtils]: 34: Hoare triple {14485#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14486#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:32,451 INFO L273 TraceCheckUtils]: 35: Hoare triple {14486#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:32,451 INFO L273 TraceCheckUtils]: 36: Hoare triple {14487#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:32,452 INFO L273 TraceCheckUtils]: 37: Hoare triple {14488#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:32,453 INFO L273 TraceCheckUtils]: 38: Hoare triple {14489#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:32,454 INFO L273 TraceCheckUtils]: 39: Hoare triple {14490#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:32,455 INFO L273 TraceCheckUtils]: 40: Hoare triple {14491#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:32,456 INFO L273 TraceCheckUtils]: 41: Hoare triple {14492#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:32,457 INFO L273 TraceCheckUtils]: 42: Hoare triple {14493#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:32,458 INFO L273 TraceCheckUtils]: 43: Hoare triple {14494#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:32,459 INFO L273 TraceCheckUtils]: 44: Hoare triple {14495#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:32,460 INFO L273 TraceCheckUtils]: 45: Hoare triple {14496#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 40)} is VALID [2018-11-23 12:04:32,464 INFO L273 TraceCheckUtils]: 46: Hoare triple {14497#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 41)} is VALID [2018-11-23 12:04:32,464 INFO L273 TraceCheckUtils]: 47: Hoare triple {14498#(<= main_~i~0 41)} assume !(~i~0 < 100000); {14456#false} is VALID [2018-11-23 12:04:32,464 INFO L273 TraceCheckUtils]: 48: Hoare triple {14456#false} havoc ~x~0;~x~0 := 0; {14456#false} is VALID [2018-11-23 12:04:32,465 INFO L273 TraceCheckUtils]: 49: Hoare triple {14456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14456#false} is VALID [2018-11-23 12:04:32,465 INFO L256 TraceCheckUtils]: 50: Hoare triple {14456#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {14456#false} is VALID [2018-11-23 12:04:32,465 INFO L273 TraceCheckUtils]: 51: Hoare triple {14456#false} ~cond := #in~cond; {14456#false} is VALID [2018-11-23 12:04:32,465 INFO L273 TraceCheckUtils]: 52: Hoare triple {14456#false} assume 0 == ~cond; {14456#false} is VALID [2018-11-23 12:04:32,465 INFO L273 TraceCheckUtils]: 53: Hoare triple {14456#false} assume !false; {14456#false} is VALID [2018-11-23 12:04:32,468 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:32,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:32,468 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:32,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:04:34,180 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 22 check-sat command(s) [2018-11-23 12:04:34,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:04:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:34,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:04:34,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {14455#true} call ULTIMATE.init(); {14455#true} is VALID [2018-11-23 12:04:34,439 INFO L273 TraceCheckUtils]: 1: Hoare triple {14455#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14455#true} is VALID [2018-11-23 12:04:34,439 INFO L273 TraceCheckUtils]: 2: Hoare triple {14455#true} assume true; {14455#true} is VALID [2018-11-23 12:04:34,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14455#true} {14455#true} #48#return; {14455#true} is VALID [2018-11-23 12:04:34,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {14455#true} call #t~ret2 := main(); {14455#true} is VALID [2018-11-23 12:04:34,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {14455#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {14517#(<= main_~i~0 0)} is VALID [2018-11-23 12:04:34,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {14517#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14458#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:34,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {14458#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14459#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:34,442 INFO L273 TraceCheckUtils]: 8: Hoare triple {14459#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14460#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:34,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {14460#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14461#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:34,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {14461#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14462#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:34,445 INFO L273 TraceCheckUtils]: 11: Hoare triple {14462#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14463#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:34,446 INFO L273 TraceCheckUtils]: 12: Hoare triple {14463#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14464#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:34,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {14464#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14465#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:34,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {14465#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14466#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:34,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {14466#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14467#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:34,449 INFO L273 TraceCheckUtils]: 16: Hoare triple {14467#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14468#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:34,450 INFO L273 TraceCheckUtils]: 17: Hoare triple {14468#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14469#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:34,451 INFO L273 TraceCheckUtils]: 18: Hoare triple {14469#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14470#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:34,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {14470#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14471#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:34,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {14471#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14472#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:34,454 INFO L273 TraceCheckUtils]: 21: Hoare triple {14472#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14473#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:34,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {14473#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14474#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:34,456 INFO L273 TraceCheckUtils]: 23: Hoare triple {14474#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14475#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:34,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {14475#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14476#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:34,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {14476#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14477#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:34,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {14477#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14478#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:34,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {14478#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14479#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:34,461 INFO L273 TraceCheckUtils]: 28: Hoare triple {14479#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14480#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:34,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {14480#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14481#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:34,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {14481#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14482#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:34,464 INFO L273 TraceCheckUtils]: 31: Hoare triple {14482#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14483#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:34,465 INFO L273 TraceCheckUtils]: 32: Hoare triple {14483#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14484#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:34,466 INFO L273 TraceCheckUtils]: 33: Hoare triple {14484#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14485#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:34,467 INFO L273 TraceCheckUtils]: 34: Hoare triple {14485#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14486#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:34,468 INFO L273 TraceCheckUtils]: 35: Hoare triple {14486#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14487#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:34,469 INFO L273 TraceCheckUtils]: 36: Hoare triple {14487#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14488#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:34,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {14488#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14489#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:34,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {14489#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14490#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:34,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {14490#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14491#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:34,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {14491#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14492#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:34,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {14492#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14493#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:34,474 INFO L273 TraceCheckUtils]: 42: Hoare triple {14493#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14494#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:34,475 INFO L273 TraceCheckUtils]: 43: Hoare triple {14494#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14495#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:34,476 INFO L273 TraceCheckUtils]: 44: Hoare triple {14495#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14496#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:34,477 INFO L273 TraceCheckUtils]: 45: Hoare triple {14496#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14497#(<= main_~i~0 40)} is VALID [2018-11-23 12:04:34,478 INFO L273 TraceCheckUtils]: 46: Hoare triple {14497#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {14498#(<= main_~i~0 41)} is VALID [2018-11-23 12:04:34,479 INFO L273 TraceCheckUtils]: 47: Hoare triple {14498#(<= main_~i~0 41)} assume !(~i~0 < 100000); {14456#false} is VALID [2018-11-23 12:04:34,479 INFO L273 TraceCheckUtils]: 48: Hoare triple {14456#false} havoc ~x~0;~x~0 := 0; {14456#false} is VALID [2018-11-23 12:04:34,479 INFO L273 TraceCheckUtils]: 49: Hoare triple {14456#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {14456#false} is VALID [2018-11-23 12:04:34,479 INFO L256 TraceCheckUtils]: 50: Hoare triple {14456#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {14456#false} is VALID [2018-11-23 12:04:34,480 INFO L273 TraceCheckUtils]: 51: Hoare triple {14456#false} ~cond := #in~cond; {14456#false} is VALID [2018-11-23 12:04:34,480 INFO L273 TraceCheckUtils]: 52: Hoare triple {14456#false} assume 0 == ~cond; {14456#false} is VALID [2018-11-23 12:04:34,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {14456#false} assume !false; {14456#false} is VALID [2018-11-23 12:04:34,483 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:34,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:04:34,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 45 [2018-11-23 12:04:34,505 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-23 12:04:34,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:04:34,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:04:34,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:34,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:04:34,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:04:34,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:04:34,550 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 45 states. [2018-11-23 12:04:35,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:35,372 INFO L93 Difference]: Finished difference Result 71 states and 73 transitions. [2018-11-23 12:04:35,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:04:35,373 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 54 [2018-11-23 12:04:35,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:04:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:04:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 12:04:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:04:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 73 transitions. [2018-11-23 12:04:35,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 73 transitions. [2018-11-23 12:04:35,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:04:35,561 INFO L225 Difference]: With dead ends: 71 [2018-11-23 12:04:35,561 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:04:35,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:04:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:04:36,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-23 12:04:36,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:04:36,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-23 12:04:36,700 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:04:36,701 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:04:36,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:36,702 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 12:04:36,702 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:04:36,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:36,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:36,703 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-23 12:04:36,703 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-23 12:04:36,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:04:36,704 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2018-11-23 12:04:36,704 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:04:36,704 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:04:36,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:04:36,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:04:36,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:04:36,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:04:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-11-23 12:04:36,706 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-11-23 12:04:36,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:04:36,706 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-11-23 12:04:36,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:04:36,706 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-11-23 12:04:36,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-23 12:04:36,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:04:36,707 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:04:36,707 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:04:36,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:04:36,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1523216078, now seen corresponding path program 42 times [2018-11-23 12:04:36,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:04:36,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:04:36,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:36,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:04:36,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:04:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:04:39,014 INFO L256 TraceCheckUtils]: 0: Hoare triple {15015#true} call ULTIMATE.init(); {15015#true} is VALID [2018-11-23 12:04:39,014 INFO L273 TraceCheckUtils]: 1: Hoare triple {15015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15015#true} is VALID [2018-11-23 12:04:39,014 INFO L273 TraceCheckUtils]: 2: Hoare triple {15015#true} assume true; {15015#true} is VALID [2018-11-23 12:04:39,014 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15015#true} {15015#true} #48#return; {15015#true} is VALID [2018-11-23 12:04:39,014 INFO L256 TraceCheckUtils]: 4: Hoare triple {15015#true} call #t~ret2 := main(); {15015#true} is VALID [2018-11-23 12:04:39,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {15015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15017#(= main_~i~0 0)} is VALID [2018-11-23 12:04:39,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {15017#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 1)} is VALID [2018-11-23 12:04:39,016 INFO L273 TraceCheckUtils]: 7: Hoare triple {15018#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15019#(<= main_~i~0 2)} is VALID [2018-11-23 12:04:39,017 INFO L273 TraceCheckUtils]: 8: Hoare triple {15019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15020#(<= main_~i~0 3)} is VALID [2018-11-23 12:04:39,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15021#(<= main_~i~0 4)} is VALID [2018-11-23 12:04:39,019 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15022#(<= main_~i~0 5)} is VALID [2018-11-23 12:04:39,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {15022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15023#(<= main_~i~0 6)} is VALID [2018-11-23 12:04:39,021 INFO L273 TraceCheckUtils]: 12: Hoare triple {15023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15024#(<= main_~i~0 7)} is VALID [2018-11-23 12:04:39,022 INFO L273 TraceCheckUtils]: 13: Hoare triple {15024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15025#(<= main_~i~0 8)} is VALID [2018-11-23 12:04:39,023 INFO L273 TraceCheckUtils]: 14: Hoare triple {15025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15026#(<= main_~i~0 9)} is VALID [2018-11-23 12:04:39,024 INFO L273 TraceCheckUtils]: 15: Hoare triple {15026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15027#(<= main_~i~0 10)} is VALID [2018-11-23 12:04:39,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {15027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15028#(<= main_~i~0 11)} is VALID [2018-11-23 12:04:39,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {15028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15029#(<= main_~i~0 12)} is VALID [2018-11-23 12:04:39,027 INFO L273 TraceCheckUtils]: 18: Hoare triple {15029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15030#(<= main_~i~0 13)} is VALID [2018-11-23 12:04:39,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {15030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15031#(<= main_~i~0 14)} is VALID [2018-11-23 12:04:39,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {15031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15032#(<= main_~i~0 15)} is VALID [2018-11-23 12:04:39,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {15032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15033#(<= main_~i~0 16)} is VALID [2018-11-23 12:04:39,031 INFO L273 TraceCheckUtils]: 22: Hoare triple {15033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15034#(<= main_~i~0 17)} is VALID [2018-11-23 12:04:39,032 INFO L273 TraceCheckUtils]: 23: Hoare triple {15034#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15035#(<= main_~i~0 18)} is VALID [2018-11-23 12:04:39,033 INFO L273 TraceCheckUtils]: 24: Hoare triple {15035#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15036#(<= main_~i~0 19)} is VALID [2018-11-23 12:04:39,034 INFO L273 TraceCheckUtils]: 25: Hoare triple {15036#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15037#(<= main_~i~0 20)} is VALID [2018-11-23 12:04:39,034 INFO L273 TraceCheckUtils]: 26: Hoare triple {15037#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15038#(<= main_~i~0 21)} is VALID [2018-11-23 12:04:39,035 INFO L273 TraceCheckUtils]: 27: Hoare triple {15038#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15039#(<= main_~i~0 22)} is VALID [2018-11-23 12:04:39,036 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15040#(<= main_~i~0 23)} is VALID [2018-11-23 12:04:39,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15041#(<= main_~i~0 24)} is VALID [2018-11-23 12:04:39,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {15041#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15042#(<= main_~i~0 25)} is VALID [2018-11-23 12:04:39,039 INFO L273 TraceCheckUtils]: 31: Hoare triple {15042#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15043#(<= main_~i~0 26)} is VALID [2018-11-23 12:04:39,040 INFO L273 TraceCheckUtils]: 32: Hoare triple {15043#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15044#(<= main_~i~0 27)} is VALID [2018-11-23 12:04:39,041 INFO L273 TraceCheckUtils]: 33: Hoare triple {15044#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15045#(<= main_~i~0 28)} is VALID [2018-11-23 12:04:39,042 INFO L273 TraceCheckUtils]: 34: Hoare triple {15045#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15046#(<= main_~i~0 29)} is VALID [2018-11-23 12:04:39,043 INFO L273 TraceCheckUtils]: 35: Hoare triple {15046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15047#(<= main_~i~0 30)} is VALID [2018-11-23 12:04:39,044 INFO L273 TraceCheckUtils]: 36: Hoare triple {15047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15048#(<= main_~i~0 31)} is VALID [2018-11-23 12:04:39,045 INFO L273 TraceCheckUtils]: 37: Hoare triple {15048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15049#(<= main_~i~0 32)} is VALID [2018-11-23 12:04:39,046 INFO L273 TraceCheckUtils]: 38: Hoare triple {15049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15050#(<= main_~i~0 33)} is VALID [2018-11-23 12:04:39,047 INFO L273 TraceCheckUtils]: 39: Hoare triple {15050#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15051#(<= main_~i~0 34)} is VALID [2018-11-23 12:04:39,048 INFO L273 TraceCheckUtils]: 40: Hoare triple {15051#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15052#(<= main_~i~0 35)} is VALID [2018-11-23 12:04:39,049 INFO L273 TraceCheckUtils]: 41: Hoare triple {15052#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15053#(<= main_~i~0 36)} is VALID [2018-11-23 12:04:39,050 INFO L273 TraceCheckUtils]: 42: Hoare triple {15053#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15054#(<= main_~i~0 37)} is VALID [2018-11-23 12:04:39,051 INFO L273 TraceCheckUtils]: 43: Hoare triple {15054#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15055#(<= main_~i~0 38)} is VALID [2018-11-23 12:04:39,052 INFO L273 TraceCheckUtils]: 44: Hoare triple {15055#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15056#(<= main_~i~0 39)} is VALID [2018-11-23 12:04:39,053 INFO L273 TraceCheckUtils]: 45: Hoare triple {15056#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15057#(<= main_~i~0 40)} is VALID [2018-11-23 12:04:39,053 INFO L273 TraceCheckUtils]: 46: Hoare triple {15057#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15058#(<= main_~i~0 41)} is VALID [2018-11-23 12:04:39,054 INFO L273 TraceCheckUtils]: 47: Hoare triple {15058#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15059#(<= main_~i~0 42)} is VALID [2018-11-23 12:04:39,055 INFO L273 TraceCheckUtils]: 48: Hoare triple {15059#(<= main_~i~0 42)} assume !(~i~0 < 100000); {15016#false} is VALID [2018-11-23 12:04:39,055 INFO L273 TraceCheckUtils]: 49: Hoare triple {15016#false} havoc ~x~0;~x~0 := 0; {15016#false} is VALID [2018-11-23 12:04:39,056 INFO L273 TraceCheckUtils]: 50: Hoare triple {15016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15016#false} is VALID [2018-11-23 12:04:39,056 INFO L256 TraceCheckUtils]: 51: Hoare triple {15016#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {15016#false} is VALID [2018-11-23 12:04:39,056 INFO L273 TraceCheckUtils]: 52: Hoare triple {15016#false} ~cond := #in~cond; {15016#false} is VALID [2018-11-23 12:04:39,056 INFO L273 TraceCheckUtils]: 53: Hoare triple {15016#false} assume 0 == ~cond; {15016#false} is VALID [2018-11-23 12:04:39,056 INFO L273 TraceCheckUtils]: 54: Hoare triple {15016#false} assume !false; {15016#false} is VALID [2018-11-23 12:04:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:04:39,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:04:39,061 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:04:39,069 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:05:30,643 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-11-23 12:05:30,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:30,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:30,918 INFO L256 TraceCheckUtils]: 0: Hoare triple {15015#true} call ULTIMATE.init(); {15015#true} is VALID [2018-11-23 12:05:30,918 INFO L273 TraceCheckUtils]: 1: Hoare triple {15015#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15015#true} is VALID [2018-11-23 12:05:30,919 INFO L273 TraceCheckUtils]: 2: Hoare triple {15015#true} assume true; {15015#true} is VALID [2018-11-23 12:05:30,919 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15015#true} {15015#true} #48#return; {15015#true} is VALID [2018-11-23 12:05:30,919 INFO L256 TraceCheckUtils]: 4: Hoare triple {15015#true} call #t~ret2 := main(); {15015#true} is VALID [2018-11-23 12:05:30,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {15015#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15078#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:30,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {15078#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15018#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:30,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {15018#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15019#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:30,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {15019#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15020#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:30,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {15020#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15021#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:30,923 INFO L273 TraceCheckUtils]: 10: Hoare triple {15021#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15022#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:30,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {15022#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15023#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:30,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {15023#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15024#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:30,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {15024#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15025#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:30,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {15025#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15026#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:30,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {15026#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15027#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:30,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {15027#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15028#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:30,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {15028#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15029#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:30,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {15029#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15030#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:30,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {15030#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15031#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:30,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {15031#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15032#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:30,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {15032#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15033#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:30,935 INFO L273 TraceCheckUtils]: 22: Hoare triple {15033#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15034#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:30,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {15034#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15035#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:30,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {15035#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15036#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:30,937 INFO L273 TraceCheckUtils]: 25: Hoare triple {15036#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15037#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:30,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {15037#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15038#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:30,939 INFO L273 TraceCheckUtils]: 27: Hoare triple {15038#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15039#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:30,940 INFO L273 TraceCheckUtils]: 28: Hoare triple {15039#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15040#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:30,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {15040#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15041#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:30,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {15041#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15042#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:30,943 INFO L273 TraceCheckUtils]: 31: Hoare triple {15042#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15043#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:30,944 INFO L273 TraceCheckUtils]: 32: Hoare triple {15043#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15044#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:30,945 INFO L273 TraceCheckUtils]: 33: Hoare triple {15044#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15045#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:30,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {15045#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15046#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:30,947 INFO L273 TraceCheckUtils]: 35: Hoare triple {15046#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15047#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:30,948 INFO L273 TraceCheckUtils]: 36: Hoare triple {15047#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15048#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:30,949 INFO L273 TraceCheckUtils]: 37: Hoare triple {15048#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15049#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:30,949 INFO L273 TraceCheckUtils]: 38: Hoare triple {15049#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15050#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:30,950 INFO L273 TraceCheckUtils]: 39: Hoare triple {15050#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15051#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:30,951 INFO L273 TraceCheckUtils]: 40: Hoare triple {15051#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15052#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:30,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {15052#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15053#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:30,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {15053#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15054#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:30,954 INFO L273 TraceCheckUtils]: 43: Hoare triple {15054#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15055#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:30,955 INFO L273 TraceCheckUtils]: 44: Hoare triple {15055#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15056#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:30,956 INFO L273 TraceCheckUtils]: 45: Hoare triple {15056#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15057#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:30,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {15057#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15058#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:30,958 INFO L273 TraceCheckUtils]: 47: Hoare triple {15058#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15059#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:30,959 INFO L273 TraceCheckUtils]: 48: Hoare triple {15059#(<= main_~i~0 42)} assume !(~i~0 < 100000); {15016#false} is VALID [2018-11-23 12:05:30,959 INFO L273 TraceCheckUtils]: 49: Hoare triple {15016#false} havoc ~x~0;~x~0 := 0; {15016#false} is VALID [2018-11-23 12:05:30,959 INFO L273 TraceCheckUtils]: 50: Hoare triple {15016#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15016#false} is VALID [2018-11-23 12:05:30,959 INFO L256 TraceCheckUtils]: 51: Hoare triple {15016#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {15016#false} is VALID [2018-11-23 12:05:30,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {15016#false} ~cond := #in~cond; {15016#false} is VALID [2018-11-23 12:05:30,960 INFO L273 TraceCheckUtils]: 53: Hoare triple {15016#false} assume 0 == ~cond; {15016#false} is VALID [2018-11-23 12:05:30,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {15016#false} assume !false; {15016#false} is VALID [2018-11-23 12:05:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:30,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:30,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 46 [2018-11-23 12:05:30,992 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2018-11-23 12:05:30,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:30,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:05:31,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:05:31,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:05:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:05:31,037 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2018-11-23 12:05:31,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,451 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2018-11-23 12:05:31,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:05:31,452 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 55 [2018-11-23 12:05:31,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:05:31,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 12:05:31,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:05:31,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 74 transitions. [2018-11-23 12:05:31,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 74 transitions. [2018-11-23 12:05:31,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:31,510 INFO L225 Difference]: With dead ends: 72 [2018-11-23 12:05:31,511 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 12:05:31,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:05:31,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 12:05:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 12:05:31,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:31,562 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 12:05:31,562 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:05:31,562 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:05:31,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,564 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:05:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:05:31,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,565 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 12:05:31,565 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 12:05:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:31,566 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-11-23 12:05:31,566 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:05:31,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:31,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:31,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:31,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:05:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 12:05:31,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 55 [2018-11-23 12:05:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:31,568 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 12:05:31,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:05:31,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:05:31,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-23 12:05:31,569 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:31,569 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:31,569 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:31,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash -2066136850, now seen corresponding path program 43 times [2018-11-23 12:05:31,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:31,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:31,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:31,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,084 INFO L256 TraceCheckUtils]: 0: Hoare triple {15585#true} call ULTIMATE.init(); {15585#true} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {15585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15585#true} is VALID [2018-11-23 12:05:33,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {15585#true} assume true; {15585#true} is VALID [2018-11-23 12:05:33,085 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15585#true} {15585#true} #48#return; {15585#true} is VALID [2018-11-23 12:05:33,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {15585#true} call #t~ret2 := main(); {15585#true} is VALID [2018-11-23 12:05:33,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {15585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15587#(= main_~i~0 0)} is VALID [2018-11-23 12:05:33,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {15587#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15588#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {15588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15589#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {15589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15590#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,088 INFO L273 TraceCheckUtils]: 9: Hoare triple {15590#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15591#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,089 INFO L273 TraceCheckUtils]: 10: Hoare triple {15591#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15592#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,089 INFO L273 TraceCheckUtils]: 11: Hoare triple {15592#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15593#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,090 INFO L273 TraceCheckUtils]: 12: Hoare triple {15593#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15594#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,091 INFO L273 TraceCheckUtils]: 13: Hoare triple {15594#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15595#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,092 INFO L273 TraceCheckUtils]: 14: Hoare triple {15595#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15596#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {15596#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15597#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {15597#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15598#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {15598#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15599#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {15599#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15600#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {15600#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15601#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {15601#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15602#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,099 INFO L273 TraceCheckUtils]: 21: Hoare triple {15602#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15603#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,100 INFO L273 TraceCheckUtils]: 22: Hoare triple {15603#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15604#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {15604#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15605#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,101 INFO L273 TraceCheckUtils]: 24: Hoare triple {15605#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15606#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,102 INFO L273 TraceCheckUtils]: 25: Hoare triple {15606#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15607#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:33,103 INFO L273 TraceCheckUtils]: 26: Hoare triple {15607#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15608#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:33,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {15608#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15609#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:33,105 INFO L273 TraceCheckUtils]: 28: Hoare triple {15609#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15610#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:33,106 INFO L273 TraceCheckUtils]: 29: Hoare triple {15610#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15611#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:33,107 INFO L273 TraceCheckUtils]: 30: Hoare triple {15611#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15612#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:33,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {15612#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15613#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:33,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {15613#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15614#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:33,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {15614#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15615#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:33,111 INFO L273 TraceCheckUtils]: 34: Hoare triple {15615#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15616#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:33,112 INFO L273 TraceCheckUtils]: 35: Hoare triple {15616#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15617#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:33,113 INFO L273 TraceCheckUtils]: 36: Hoare triple {15617#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15618#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:33,114 INFO L273 TraceCheckUtils]: 37: Hoare triple {15618#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15619#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:33,115 INFO L273 TraceCheckUtils]: 38: Hoare triple {15619#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15620#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:33,116 INFO L273 TraceCheckUtils]: 39: Hoare triple {15620#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15621#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:33,116 INFO L273 TraceCheckUtils]: 40: Hoare triple {15621#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15622#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:33,117 INFO L273 TraceCheckUtils]: 41: Hoare triple {15622#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15623#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:33,118 INFO L273 TraceCheckUtils]: 42: Hoare triple {15623#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15624#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:33,119 INFO L273 TraceCheckUtils]: 43: Hoare triple {15624#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15625#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:33,120 INFO L273 TraceCheckUtils]: 44: Hoare triple {15625#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15626#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:33,121 INFO L273 TraceCheckUtils]: 45: Hoare triple {15626#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15627#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:33,122 INFO L273 TraceCheckUtils]: 46: Hoare triple {15627#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15628#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:33,123 INFO L273 TraceCheckUtils]: 47: Hoare triple {15628#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15629#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:33,124 INFO L273 TraceCheckUtils]: 48: Hoare triple {15629#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15630#(<= main_~i~0 43)} is VALID [2018-11-23 12:05:33,125 INFO L273 TraceCheckUtils]: 49: Hoare triple {15630#(<= main_~i~0 43)} assume !(~i~0 < 100000); {15586#false} is VALID [2018-11-23 12:05:33,125 INFO L273 TraceCheckUtils]: 50: Hoare triple {15586#false} havoc ~x~0;~x~0 := 0; {15586#false} is VALID [2018-11-23 12:05:33,125 INFO L273 TraceCheckUtils]: 51: Hoare triple {15586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15586#false} is VALID [2018-11-23 12:05:33,125 INFO L256 TraceCheckUtils]: 52: Hoare triple {15586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {15586#false} is VALID [2018-11-23 12:05:33,125 INFO L273 TraceCheckUtils]: 53: Hoare triple {15586#false} ~cond := #in~cond; {15586#false} is VALID [2018-11-23 12:05:33,126 INFO L273 TraceCheckUtils]: 54: Hoare triple {15586#false} assume 0 == ~cond; {15586#false} is VALID [2018-11-23 12:05:33,126 INFO L273 TraceCheckUtils]: 55: Hoare triple {15586#false} assume !false; {15586#false} is VALID [2018-11-23 12:05:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:33,131 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:33,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:33,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:33,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:33,551 INFO L256 TraceCheckUtils]: 0: Hoare triple {15585#true} call ULTIMATE.init(); {15585#true} is VALID [2018-11-23 12:05:33,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {15585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15585#true} is VALID [2018-11-23 12:05:33,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {15585#true} assume true; {15585#true} is VALID [2018-11-23 12:05:33,552 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15585#true} {15585#true} #48#return; {15585#true} is VALID [2018-11-23 12:05:33,552 INFO L256 TraceCheckUtils]: 4: Hoare triple {15585#true} call #t~ret2 := main(); {15585#true} is VALID [2018-11-23 12:05:33,553 INFO L273 TraceCheckUtils]: 5: Hoare triple {15585#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {15649#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:33,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {15649#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15588#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:33,554 INFO L273 TraceCheckUtils]: 7: Hoare triple {15588#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15589#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:33,555 INFO L273 TraceCheckUtils]: 8: Hoare triple {15589#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15590#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:33,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {15590#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15591#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:33,556 INFO L273 TraceCheckUtils]: 10: Hoare triple {15591#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15592#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:33,557 INFO L273 TraceCheckUtils]: 11: Hoare triple {15592#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15593#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:33,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {15593#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15594#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:33,559 INFO L273 TraceCheckUtils]: 13: Hoare triple {15594#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15595#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:33,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {15595#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15596#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:33,561 INFO L273 TraceCheckUtils]: 15: Hoare triple {15596#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15597#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:33,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {15597#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15598#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:33,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {15598#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15599#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:33,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {15599#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15600#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:33,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {15600#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15601#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:33,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {15601#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15602#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:33,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {15602#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15603#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:33,567 INFO L273 TraceCheckUtils]: 22: Hoare triple {15603#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15604#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:33,568 INFO L273 TraceCheckUtils]: 23: Hoare triple {15604#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15605#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:33,569 INFO L273 TraceCheckUtils]: 24: Hoare triple {15605#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15606#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:33,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {15606#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15607#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:33,571 INFO L273 TraceCheckUtils]: 26: Hoare triple {15607#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15608#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:33,572 INFO L273 TraceCheckUtils]: 27: Hoare triple {15608#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15609#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:33,573 INFO L273 TraceCheckUtils]: 28: Hoare triple {15609#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15610#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:33,574 INFO L273 TraceCheckUtils]: 29: Hoare triple {15610#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15611#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:33,575 INFO L273 TraceCheckUtils]: 30: Hoare triple {15611#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15612#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:33,576 INFO L273 TraceCheckUtils]: 31: Hoare triple {15612#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15613#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:33,577 INFO L273 TraceCheckUtils]: 32: Hoare triple {15613#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15614#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:33,578 INFO L273 TraceCheckUtils]: 33: Hoare triple {15614#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15615#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:33,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {15615#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15616#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:33,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {15616#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15617#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:33,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {15617#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15618#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:33,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {15618#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15619#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:33,582 INFO L273 TraceCheckUtils]: 38: Hoare triple {15619#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15620#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:33,583 INFO L273 TraceCheckUtils]: 39: Hoare triple {15620#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15621#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:33,584 INFO L273 TraceCheckUtils]: 40: Hoare triple {15621#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15622#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:33,585 INFO L273 TraceCheckUtils]: 41: Hoare triple {15622#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15623#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:33,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {15623#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15624#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:33,587 INFO L273 TraceCheckUtils]: 43: Hoare triple {15624#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15625#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:33,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {15625#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15626#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:33,589 INFO L273 TraceCheckUtils]: 45: Hoare triple {15626#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15627#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:33,590 INFO L273 TraceCheckUtils]: 46: Hoare triple {15627#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15628#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:33,591 INFO L273 TraceCheckUtils]: 47: Hoare triple {15628#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15629#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:33,592 INFO L273 TraceCheckUtils]: 48: Hoare triple {15629#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {15630#(<= main_~i~0 43)} is VALID [2018-11-23 12:05:33,592 INFO L273 TraceCheckUtils]: 49: Hoare triple {15630#(<= main_~i~0 43)} assume !(~i~0 < 100000); {15586#false} is VALID [2018-11-23 12:05:33,593 INFO L273 TraceCheckUtils]: 50: Hoare triple {15586#false} havoc ~x~0;~x~0 := 0; {15586#false} is VALID [2018-11-23 12:05:33,593 INFO L273 TraceCheckUtils]: 51: Hoare triple {15586#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {15586#false} is VALID [2018-11-23 12:05:33,593 INFO L256 TraceCheckUtils]: 52: Hoare triple {15586#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {15586#false} is VALID [2018-11-23 12:05:33,593 INFO L273 TraceCheckUtils]: 53: Hoare triple {15586#false} ~cond := #in~cond; {15586#false} is VALID [2018-11-23 12:05:33,593 INFO L273 TraceCheckUtils]: 54: Hoare triple {15586#false} assume 0 == ~cond; {15586#false} is VALID [2018-11-23 12:05:33,594 INFO L273 TraceCheckUtils]: 55: Hoare triple {15586#false} assume !false; {15586#false} is VALID [2018-11-23 12:05:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:33,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:33,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 47 [2018-11-23 12:05:33,619 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2018-11-23 12:05:33,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:33,619 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:05:33,661 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-23 12:05:33,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:05:33,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:05:33,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:05:33,662 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 47 states. [2018-11-23 12:05:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:33,978 INFO L93 Difference]: Finished difference Result 73 states and 75 transitions. [2018-11-23 12:05:33,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:05:33,978 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 56 [2018-11-23 12:05:33,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:05:33,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 12:05:33,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:05:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2018-11-23 12:05:33,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 75 transitions. [2018-11-23 12:05:34,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:34,037 INFO L225 Difference]: With dead ends: 73 [2018-11-23 12:05:34,037 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 12:05:34,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:05:34,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 12:05:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-11-23 12:05:34,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:34,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 62 states. [2018-11-23 12:05:34,087 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:05:34,087 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:05:34,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,088 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 12:05:34,088 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:05:34,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,088 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 62 states. [2018-11-23 12:05:34,088 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 62 states. [2018-11-23 12:05:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:34,089 INFO L93 Difference]: Finished difference Result 62 states and 63 transitions. [2018-11-23 12:05:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:05:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:34,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:34,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:34,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:34,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 12:05:34,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2018-11-23 12:05:34,091 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 56 [2018-11-23 12:05:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:34,091 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2018-11-23 12:05:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:05:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2018-11-23 12:05:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 12:05:34,091 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:34,091 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:34,091 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:34,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:34,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1716811598, now seen corresponding path program 44 times [2018-11-23 12:05:34,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:34,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:34,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:05:34,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,106 INFO L256 TraceCheckUtils]: 0: Hoare triple {16165#true} call ULTIMATE.init(); {16165#true} is VALID [2018-11-23 12:05:35,107 INFO L273 TraceCheckUtils]: 1: Hoare triple {16165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16165#true} is VALID [2018-11-23 12:05:35,107 INFO L273 TraceCheckUtils]: 2: Hoare triple {16165#true} assume true; {16165#true} is VALID [2018-11-23 12:05:35,107 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16165#true} {16165#true} #48#return; {16165#true} is VALID [2018-11-23 12:05:35,107 INFO L256 TraceCheckUtils]: 4: Hoare triple {16165#true} call #t~ret2 := main(); {16165#true} is VALID [2018-11-23 12:05:35,108 INFO L273 TraceCheckUtils]: 5: Hoare triple {16165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16167#(= main_~i~0 0)} is VALID [2018-11-23 12:05:35,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {16167#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16168#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,110 INFO L273 TraceCheckUtils]: 7: Hoare triple {16168#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16169#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {16169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16170#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,112 INFO L273 TraceCheckUtils]: 9: Hoare triple {16170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16171#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,113 INFO L273 TraceCheckUtils]: 10: Hoare triple {16171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16172#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,114 INFO L273 TraceCheckUtils]: 11: Hoare triple {16172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16173#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,115 INFO L273 TraceCheckUtils]: 12: Hoare triple {16173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16174#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {16174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16175#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,117 INFO L273 TraceCheckUtils]: 14: Hoare triple {16175#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16176#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,118 INFO L273 TraceCheckUtils]: 15: Hoare triple {16176#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16177#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,119 INFO L273 TraceCheckUtils]: 16: Hoare triple {16177#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16178#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {16178#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16179#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,121 INFO L273 TraceCheckUtils]: 18: Hoare triple {16179#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16180#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,122 INFO L273 TraceCheckUtils]: 19: Hoare triple {16180#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16181#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,123 INFO L273 TraceCheckUtils]: 20: Hoare triple {16181#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16182#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,124 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16183#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,125 INFO L273 TraceCheckUtils]: 22: Hoare triple {16183#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16184#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,126 INFO L273 TraceCheckUtils]: 23: Hoare triple {16184#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16185#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {16185#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16186#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {16186#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16187#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {16187#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16188#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {16188#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16189#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:35,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {16189#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16190#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:35,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {16190#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16191#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:35,133 INFO L273 TraceCheckUtils]: 30: Hoare triple {16191#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16192#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:35,134 INFO L273 TraceCheckUtils]: 31: Hoare triple {16192#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16193#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:35,135 INFO L273 TraceCheckUtils]: 32: Hoare triple {16193#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16194#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:35,136 INFO L273 TraceCheckUtils]: 33: Hoare triple {16194#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16195#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:35,136 INFO L273 TraceCheckUtils]: 34: Hoare triple {16195#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16196#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:35,137 INFO L273 TraceCheckUtils]: 35: Hoare triple {16196#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16197#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:35,138 INFO L273 TraceCheckUtils]: 36: Hoare triple {16197#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16198#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:35,139 INFO L273 TraceCheckUtils]: 37: Hoare triple {16198#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16199#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:35,140 INFO L273 TraceCheckUtils]: 38: Hoare triple {16199#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16200#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:35,141 INFO L273 TraceCheckUtils]: 39: Hoare triple {16200#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16201#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:35,142 INFO L273 TraceCheckUtils]: 40: Hoare triple {16201#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16202#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:35,143 INFO L273 TraceCheckUtils]: 41: Hoare triple {16202#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16203#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:35,144 INFO L273 TraceCheckUtils]: 42: Hoare triple {16203#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16204#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:35,145 INFO L273 TraceCheckUtils]: 43: Hoare triple {16204#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16205#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:35,146 INFO L273 TraceCheckUtils]: 44: Hoare triple {16205#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16206#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:35,147 INFO L273 TraceCheckUtils]: 45: Hoare triple {16206#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16207#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:35,148 INFO L273 TraceCheckUtils]: 46: Hoare triple {16207#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16208#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:35,149 INFO L273 TraceCheckUtils]: 47: Hoare triple {16208#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16209#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:35,150 INFO L273 TraceCheckUtils]: 48: Hoare triple {16209#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16210#(<= main_~i~0 43)} is VALID [2018-11-23 12:05:35,150 INFO L273 TraceCheckUtils]: 49: Hoare triple {16210#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16211#(<= main_~i~0 44)} is VALID [2018-11-23 12:05:35,151 INFO L273 TraceCheckUtils]: 50: Hoare triple {16211#(<= main_~i~0 44)} assume !(~i~0 < 100000); {16166#false} is VALID [2018-11-23 12:05:35,151 INFO L273 TraceCheckUtils]: 51: Hoare triple {16166#false} havoc ~x~0;~x~0 := 0; {16166#false} is VALID [2018-11-23 12:05:35,152 INFO L273 TraceCheckUtils]: 52: Hoare triple {16166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16166#false} is VALID [2018-11-23 12:05:35,152 INFO L256 TraceCheckUtils]: 53: Hoare triple {16166#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {16166#false} is VALID [2018-11-23 12:05:35,152 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#false} ~cond := #in~cond; {16166#false} is VALID [2018-11-23 12:05:35,152 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#false} assume 0 == ~cond; {16166#false} is VALID [2018-11-23 12:05:35,152 INFO L273 TraceCheckUtils]: 56: Hoare triple {16166#false} assume !false; {16166#false} is VALID [2018-11-23 12:05:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:35,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:35,166 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:05:35,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:05:35,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:05:35,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:35,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:05:35,545 INFO L256 TraceCheckUtils]: 0: Hoare triple {16165#true} call ULTIMATE.init(); {16165#true} is VALID [2018-11-23 12:05:35,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {16165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16165#true} is VALID [2018-11-23 12:05:35,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {16165#true} assume true; {16165#true} is VALID [2018-11-23 12:05:35,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16165#true} {16165#true} #48#return; {16165#true} is VALID [2018-11-23 12:05:35,546 INFO L256 TraceCheckUtils]: 4: Hoare triple {16165#true} call #t~ret2 := main(); {16165#true} is VALID [2018-11-23 12:05:35,547 INFO L273 TraceCheckUtils]: 5: Hoare triple {16165#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16230#(<= main_~i~0 0)} is VALID [2018-11-23 12:05:35,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {16230#(<= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16168#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:35,548 INFO L273 TraceCheckUtils]: 7: Hoare triple {16168#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16169#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:35,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {16169#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16170#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:35,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {16170#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16171#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:35,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {16171#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16172#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:35,551 INFO L273 TraceCheckUtils]: 11: Hoare triple {16172#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16173#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:35,552 INFO L273 TraceCheckUtils]: 12: Hoare triple {16173#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16174#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:35,553 INFO L273 TraceCheckUtils]: 13: Hoare triple {16174#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16175#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:35,554 INFO L273 TraceCheckUtils]: 14: Hoare triple {16175#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16176#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:35,555 INFO L273 TraceCheckUtils]: 15: Hoare triple {16176#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16177#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:35,556 INFO L273 TraceCheckUtils]: 16: Hoare triple {16177#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16178#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:35,557 INFO L273 TraceCheckUtils]: 17: Hoare triple {16178#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16179#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:35,558 INFO L273 TraceCheckUtils]: 18: Hoare triple {16179#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16180#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:35,558 INFO L273 TraceCheckUtils]: 19: Hoare triple {16180#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16181#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:35,559 INFO L273 TraceCheckUtils]: 20: Hoare triple {16181#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16182#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:35,560 INFO L273 TraceCheckUtils]: 21: Hoare triple {16182#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16183#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:35,561 INFO L273 TraceCheckUtils]: 22: Hoare triple {16183#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16184#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:35,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {16184#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16185#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:35,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {16185#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16186#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:35,564 INFO L273 TraceCheckUtils]: 25: Hoare triple {16186#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16187#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:35,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {16187#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16188#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:35,566 INFO L273 TraceCheckUtils]: 27: Hoare triple {16188#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16189#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:35,567 INFO L273 TraceCheckUtils]: 28: Hoare triple {16189#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16190#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:35,568 INFO L273 TraceCheckUtils]: 29: Hoare triple {16190#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16191#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:35,569 INFO L273 TraceCheckUtils]: 30: Hoare triple {16191#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16192#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:35,570 INFO L273 TraceCheckUtils]: 31: Hoare triple {16192#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16193#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:35,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {16193#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16194#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:35,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {16194#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16195#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:35,573 INFO L273 TraceCheckUtils]: 34: Hoare triple {16195#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16196#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:35,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {16196#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16197#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:35,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {16197#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16198#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:35,575 INFO L273 TraceCheckUtils]: 37: Hoare triple {16198#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16199#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:35,576 INFO L273 TraceCheckUtils]: 38: Hoare triple {16199#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16200#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:35,577 INFO L273 TraceCheckUtils]: 39: Hoare triple {16200#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16201#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:35,578 INFO L273 TraceCheckUtils]: 40: Hoare triple {16201#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16202#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:35,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {16202#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16203#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:35,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {16203#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16204#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:35,581 INFO L273 TraceCheckUtils]: 43: Hoare triple {16204#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16205#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:35,582 INFO L273 TraceCheckUtils]: 44: Hoare triple {16205#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16206#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:35,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {16206#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16207#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:35,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {16207#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16208#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:35,606 INFO L273 TraceCheckUtils]: 47: Hoare triple {16208#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16209#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:35,619 INFO L273 TraceCheckUtils]: 48: Hoare triple {16209#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16210#(<= main_~i~0 43)} is VALID [2018-11-23 12:05:35,620 INFO L273 TraceCheckUtils]: 49: Hoare triple {16210#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16211#(<= main_~i~0 44)} is VALID [2018-11-23 12:05:35,620 INFO L273 TraceCheckUtils]: 50: Hoare triple {16211#(<= main_~i~0 44)} assume !(~i~0 < 100000); {16166#false} is VALID [2018-11-23 12:05:35,620 INFO L273 TraceCheckUtils]: 51: Hoare triple {16166#false} havoc ~x~0;~x~0 := 0; {16166#false} is VALID [2018-11-23 12:05:35,621 INFO L273 TraceCheckUtils]: 52: Hoare triple {16166#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16166#false} is VALID [2018-11-23 12:05:35,621 INFO L256 TraceCheckUtils]: 53: Hoare triple {16166#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {16166#false} is VALID [2018-11-23 12:05:35,621 INFO L273 TraceCheckUtils]: 54: Hoare triple {16166#false} ~cond := #in~cond; {16166#false} is VALID [2018-11-23 12:05:35,621 INFO L273 TraceCheckUtils]: 55: Hoare triple {16166#false} assume 0 == ~cond; {16166#false} is VALID [2018-11-23 12:05:35,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {16166#false} assume !false; {16166#false} is VALID [2018-11-23 12:05:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:35,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:05:35,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 48 [2018-11-23 12:05:35,644 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 12:05:35,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:05:35,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:05:35,686 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:05:35,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:05:35,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:05:35,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:05:35,687 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand 48 states. [2018-11-23 12:05:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,457 INFO L93 Difference]: Finished difference Result 74 states and 76 transitions. [2018-11-23 12:05:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:05:36,457 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 57 [2018-11-23 12:05:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:05:36,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:05:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 12:05:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:05:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 76 transitions. [2018-11-23 12:05:36,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 76 transitions. [2018-11-23 12:05:36,517 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-23 12:05:36,518 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:05:36,518 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:05:36,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:05:36,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:05:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-11-23 12:05:36,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:05:36,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 63 states. [2018-11-23 12:05:36,565 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 12:05:36,565 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 12:05:36,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,565 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:05:36,566 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:05:36,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,566 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 63 states. [2018-11-23 12:05:36,566 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 63 states. [2018-11-23 12:05:36,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:05:36,567 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:05:36,567 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:05:36,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:05:36,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:05:36,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:05:36,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:05:36,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-23 12:05:36,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-11-23 12:05:36,569 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2018-11-23 12:05:36,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:05:36,569 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-11-23 12:05:36,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:05:36,569 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:05:36,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:05:36,570 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:05:36,570 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:05:36,570 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:05:36,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:05:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash 522336622, now seen corresponding path program 45 times [2018-11-23 12:05:36,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:05:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:05:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:05:36,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:05:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:05:37,998 INFO L256 TraceCheckUtils]: 0: Hoare triple {16755#true} call ULTIMATE.init(); {16755#true} is VALID [2018-11-23 12:05:37,998 INFO L273 TraceCheckUtils]: 1: Hoare triple {16755#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16755#true} is VALID [2018-11-23 12:05:37,999 INFO L273 TraceCheckUtils]: 2: Hoare triple {16755#true} assume true; {16755#true} is VALID [2018-11-23 12:05:37,999 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16755#true} {16755#true} #48#return; {16755#true} is VALID [2018-11-23 12:05:37,999 INFO L256 TraceCheckUtils]: 4: Hoare triple {16755#true} call #t~ret2 := main(); {16755#true} is VALID [2018-11-23 12:05:38,000 INFO L273 TraceCheckUtils]: 5: Hoare triple {16755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000);~i~0 := 0; {16757#(= main_~i~0 0)} is VALID [2018-11-23 12:05:38,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {16757#(= main_~i~0 0)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16758#(<= main_~i~0 1)} is VALID [2018-11-23 12:05:38,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {16758#(<= main_~i~0 1)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16759#(<= main_~i~0 2)} is VALID [2018-11-23 12:05:38,003 INFO L273 TraceCheckUtils]: 8: Hoare triple {16759#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16760#(<= main_~i~0 3)} is VALID [2018-11-23 12:05:38,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {16760#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16761#(<= main_~i~0 4)} is VALID [2018-11-23 12:05:38,005 INFO L273 TraceCheckUtils]: 10: Hoare triple {16761#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16762#(<= main_~i~0 5)} is VALID [2018-11-23 12:05:38,006 INFO L273 TraceCheckUtils]: 11: Hoare triple {16762#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16763#(<= main_~i~0 6)} is VALID [2018-11-23 12:05:38,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {16763#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16764#(<= main_~i~0 7)} is VALID [2018-11-23 12:05:38,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {16764#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16765#(<= main_~i~0 8)} is VALID [2018-11-23 12:05:38,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {16765#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16766#(<= main_~i~0 9)} is VALID [2018-11-23 12:05:38,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {16766#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16767#(<= main_~i~0 10)} is VALID [2018-11-23 12:05:38,010 INFO L273 TraceCheckUtils]: 16: Hoare triple {16767#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16768#(<= main_~i~0 11)} is VALID [2018-11-23 12:05:38,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {16768#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16769#(<= main_~i~0 12)} is VALID [2018-11-23 12:05:38,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {16769#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16770#(<= main_~i~0 13)} is VALID [2018-11-23 12:05:38,013 INFO L273 TraceCheckUtils]: 19: Hoare triple {16770#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16771#(<= main_~i~0 14)} is VALID [2018-11-23 12:05:38,014 INFO L273 TraceCheckUtils]: 20: Hoare triple {16771#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16772#(<= main_~i~0 15)} is VALID [2018-11-23 12:05:38,015 INFO L273 TraceCheckUtils]: 21: Hoare triple {16772#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16773#(<= main_~i~0 16)} is VALID [2018-11-23 12:05:38,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {16773#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16774#(<= main_~i~0 17)} is VALID [2018-11-23 12:05:38,017 INFO L273 TraceCheckUtils]: 23: Hoare triple {16774#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16775#(<= main_~i~0 18)} is VALID [2018-11-23 12:05:38,018 INFO L273 TraceCheckUtils]: 24: Hoare triple {16775#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16776#(<= main_~i~0 19)} is VALID [2018-11-23 12:05:38,019 INFO L273 TraceCheckUtils]: 25: Hoare triple {16776#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16777#(<= main_~i~0 20)} is VALID [2018-11-23 12:05:38,020 INFO L273 TraceCheckUtils]: 26: Hoare triple {16777#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16778#(<= main_~i~0 21)} is VALID [2018-11-23 12:05:38,021 INFO L273 TraceCheckUtils]: 27: Hoare triple {16778#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16779#(<= main_~i~0 22)} is VALID [2018-11-23 12:05:38,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {16779#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16780#(<= main_~i~0 23)} is VALID [2018-11-23 12:05:38,023 INFO L273 TraceCheckUtils]: 29: Hoare triple {16780#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16781#(<= main_~i~0 24)} is VALID [2018-11-23 12:05:38,024 INFO L273 TraceCheckUtils]: 30: Hoare triple {16781#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16782#(<= main_~i~0 25)} is VALID [2018-11-23 12:05:38,025 INFO L273 TraceCheckUtils]: 31: Hoare triple {16782#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16783#(<= main_~i~0 26)} is VALID [2018-11-23 12:05:38,026 INFO L273 TraceCheckUtils]: 32: Hoare triple {16783#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16784#(<= main_~i~0 27)} is VALID [2018-11-23 12:05:38,027 INFO L273 TraceCheckUtils]: 33: Hoare triple {16784#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16785#(<= main_~i~0 28)} is VALID [2018-11-23 12:05:38,028 INFO L273 TraceCheckUtils]: 34: Hoare triple {16785#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16786#(<= main_~i~0 29)} is VALID [2018-11-23 12:05:38,029 INFO L273 TraceCheckUtils]: 35: Hoare triple {16786#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16787#(<= main_~i~0 30)} is VALID [2018-11-23 12:05:38,030 INFO L273 TraceCheckUtils]: 36: Hoare triple {16787#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16788#(<= main_~i~0 31)} is VALID [2018-11-23 12:05:38,031 INFO L273 TraceCheckUtils]: 37: Hoare triple {16788#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16789#(<= main_~i~0 32)} is VALID [2018-11-23 12:05:38,032 INFO L273 TraceCheckUtils]: 38: Hoare triple {16789#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16790#(<= main_~i~0 33)} is VALID [2018-11-23 12:05:38,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {16790#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16791#(<= main_~i~0 34)} is VALID [2018-11-23 12:05:38,033 INFO L273 TraceCheckUtils]: 40: Hoare triple {16791#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16792#(<= main_~i~0 35)} is VALID [2018-11-23 12:05:38,034 INFO L273 TraceCheckUtils]: 41: Hoare triple {16792#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16793#(<= main_~i~0 36)} is VALID [2018-11-23 12:05:38,035 INFO L273 TraceCheckUtils]: 42: Hoare triple {16793#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16794#(<= main_~i~0 37)} is VALID [2018-11-23 12:05:38,036 INFO L273 TraceCheckUtils]: 43: Hoare triple {16794#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16795#(<= main_~i~0 38)} is VALID [2018-11-23 12:05:38,037 INFO L273 TraceCheckUtils]: 44: Hoare triple {16795#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16796#(<= main_~i~0 39)} is VALID [2018-11-23 12:05:38,038 INFO L273 TraceCheckUtils]: 45: Hoare triple {16796#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16797#(<= main_~i~0 40)} is VALID [2018-11-23 12:05:38,039 INFO L273 TraceCheckUtils]: 46: Hoare triple {16797#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16798#(<= main_~i~0 41)} is VALID [2018-11-23 12:05:38,040 INFO L273 TraceCheckUtils]: 47: Hoare triple {16798#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16799#(<= main_~i~0 42)} is VALID [2018-11-23 12:05:38,041 INFO L273 TraceCheckUtils]: 48: Hoare triple {16799#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16800#(<= main_~i~0 43)} is VALID [2018-11-23 12:05:38,042 INFO L273 TraceCheckUtils]: 49: Hoare triple {16800#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16801#(<= main_~i~0 44)} is VALID [2018-11-23 12:05:38,043 INFO L273 TraceCheckUtils]: 50: Hoare triple {16801#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call write~int(42, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4);~i~0 := 1 + ~i~0; {16802#(<= main_~i~0 45)} is VALID [2018-11-23 12:05:38,043 INFO L273 TraceCheckUtils]: 51: Hoare triple {16802#(<= main_~i~0 45)} assume !(~i~0 < 100000); {16756#false} is VALID [2018-11-23 12:05:38,044 INFO L273 TraceCheckUtils]: 52: Hoare triple {16756#false} havoc ~x~0;~x~0 := 0; {16756#false} is VALID [2018-11-23 12:05:38,044 INFO L273 TraceCheckUtils]: 53: Hoare triple {16756#false} assume !!(~x~0 < 100000);call #t~mem1 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~x~0, 4); {16756#false} is VALID [2018-11-23 12:05:38,044 INFO L256 TraceCheckUtils]: 54: Hoare triple {16756#false} call __VERIFIER_assert((if 42 == #t~mem1 then 1 else 0)); {16756#false} is VALID [2018-11-23 12:05:38,045 INFO L273 TraceCheckUtils]: 55: Hoare triple {16756#false} ~cond := #in~cond; {16756#false} is VALID [2018-11-23 12:05:38,045 INFO L273 TraceCheckUtils]: 56: Hoare triple {16756#false} assume 0 == ~cond; {16756#false} is VALID [2018-11-23 12:05:38,045 INFO L273 TraceCheckUtils]: 57: Hoare triple {16756#false} assume !false; {16756#false} is VALID [2018-11-23 12:05:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:05:38,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:05:38,050 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:05:38,067 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2