/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/count_by_k.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:32:33,828 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:32:33,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:32:33,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:32:33,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:32:33,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:32:33,874 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:32:33,875 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:32:33,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:32:33,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:32:33,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:32:33,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:32:33,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:32:33,885 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:32:33,886 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:32:33,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:32:33,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:32:33,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:32:33,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:32:33,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:32:33,891 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:32:33,895 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:32:33,897 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:32:33,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:32:33,901 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:32:33,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:32:33,910 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:32:33,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:32:33,912 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:32:33,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:32:33,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:32:33,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:32:33,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:32:33,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:32:33,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:32:33,917 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:32:33,917 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:32:33,918 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:32:33,918 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:32:33,918 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:32:33,919 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:32:33,921 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:32:33,923 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:32:33,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:32:33,940 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:32:33,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:32:33,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:32:33,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:32:33,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:32:33,942 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:32:33,942 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:32:33,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:32:33,943 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:32:33,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:33,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:32:33,944 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 12:32:34,181 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:32:34,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:32:34,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:32:34,210 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:32:34,211 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:32:34,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-15 12:32:34,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd63d9420/91eefc3179e24a04bea5b957e51b0a2e/FLAGd371e13c2 [2022-04-15 12:32:34,678 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:32:34,678 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i [2022-04-15 12:32:34,684 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd63d9420/91eefc3179e24a04bea5b957e51b0a2e/FLAGd371e13c2 [2022-04-15 12:32:35,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd63d9420/91eefc3179e24a04bea5b957e51b0a2e [2022-04-15 12:32:35,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:32:35,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:32:35,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:35,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:32:35,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:32:35,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@665f4ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35, skipping insertion in model container [2022-04-15 12:32:35,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,094 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:32:35,107 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:32:35,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i[891,904] [2022-04-15 12:32:35,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:35,259 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:32:35,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-new/count_by_k.i[891,904] [2022-04-15 12:32:35,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:32:35,284 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:32:35,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35 WrapperNode [2022-04-15 12:32:35,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:32:35,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:32:35,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:32:35,286 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:32:35,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,299 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,308 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,316 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,328 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:32:35,329 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:32:35,329 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:32:35,329 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:32:35,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (1/1) ... [2022-04-15 12:32:35,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:32:35,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:35,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 12:32:35,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 12:32:35,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:32:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:32:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:32:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:32:35,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:32:35,399 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:32:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:32:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:32:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:32:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:32:35,399 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:32:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:32:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:32:35,400 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:32:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:32:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:32:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:32:35,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:32:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:32:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:32:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:32:35,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:32:35,464 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:32:35,467 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:32:35,617 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:32:35,660 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:32:35,661 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:32:35,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:35 BoogieIcfgContainer [2022-04-15 12:32:35,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:32:35,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:32:35,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:32:35,666 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:32:35,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:32:35" (1/3) ... [2022-04-15 12:32:35,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae74880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:35, skipping insertion in model container [2022-04-15 12:32:35,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:32:35" (2/3) ... [2022-04-15 12:32:35,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ae74880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:32:35, skipping insertion in model container [2022-04-15 12:32:35,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:32:35" (3/3) ... [2022-04-15 12:32:35,669 INFO L111 eAbstractionObserver]: Analyzing ICFG count_by_k.i [2022-04-15 12:32:35,673 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:32:35,673 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:32:35,750 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:32:35,758 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 12:32:35,758 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:32:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:32:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:32:35,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:35,798 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:35,798 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:35,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:35,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 1 times [2022-04-15 12:32:35,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:35,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488226287] [2022-04-15 12:32:35,826 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:32:35,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1676006891, now seen corresponding path program 2 times [2022-04-15 12:32:35,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:35,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782234892] [2022-04-15 12:32:35,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:35,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:36,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:36,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-15 12:32:36,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:32:36,202 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-15 12:32:36,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:36,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {24#true} is VALID [2022-04-15 12:32:36,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 12:32:36,204 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #55#return; {24#true} is VALID [2022-04-15 12:32:36,204 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret2 := main(); {24#true} is VALID [2022-04-15 12:32:36,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2022-04-15 12:32:36,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} is VALID [2022-04-15 12:32:36,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(or (and (<= 0 main_~k~0) (= main_~i~0 0)) (= (* main_~k~0 1000000) main_~i~0))} assume !(~i~0 < 1000000 * ~k~0); {30#(= (* main_~k~0 1000000) main_~i~0)} is VALID [2022-04-15 12:32:36,208 INFO L272 TraceCheckUtils]: 8: Hoare triple {30#(= (* main_~k~0 1000000) main_~i~0)} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {31#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:36,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {32#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:36,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-15 12:32:36,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 12:32:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:36,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782234892] [2022-04-15 12:32:36,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782234892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:36,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:36,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:32:36,215 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:36,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488226287] [2022-04-15 12:32:36,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488226287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:36,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:36,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:32:36,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537793911] [2022-04-15 12:32:36,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:36,221 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:32:36,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:36,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,245 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:36,246 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:32:36,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:36,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:32:36,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:32:36,270 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:36,670 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2022-04-15 12:32:36,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:32:36,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 12:32:36,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 12:32:36,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 51 transitions. [2022-04-15 12:32:36,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 51 transitions. [2022-04-15 12:32:36,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:36,764 INFO L225 Difference]: With dead ends: 43 [2022-04-15 12:32:36,764 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 12:32:36,767 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-15 12:32:36,770 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:36,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 45 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 12:32:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-15 12:32:36,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:36,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,800 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,801 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:36,803 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:32:36,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:32:36,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:36,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:36,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:32:36,804 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 12:32:36,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:36,811 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 12:32:36,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-15 12:32:36,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:36,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:36,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:36,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:36,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-15 12:32:36,814 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-15 12:32:36,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:36,815 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-15 12:32:36,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:36,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-15 12:32:36,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:36,838 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-15 12:32:36,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 12:32:36,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:36,839 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:36,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:32:36,839 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:36,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:36,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 1 times [2022-04-15 12:32:36,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:36,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1573890473] [2022-04-15 12:32:36,969 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 562650993, now seen corresponding path program 1 times [2022-04-15 12:32:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:36,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919004950] [2022-04-15 12:32:36,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:36,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:37,000 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:37,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:37,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1072109235, now seen corresponding path program 2 times [2022-04-15 12:32:37,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:37,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109390234] [2022-04-15 12:32:37,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:37,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:37,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {204#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {194#true} is VALID [2022-04-15 12:32:37,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:32:37,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-15 12:32:37,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {204#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:37,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {204#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {194#true} is VALID [2022-04-15 12:32:37,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:32:37,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-15 12:32:37,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret2 := main(); {194#true} is VALID [2022-04-15 12:32:37,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-15 12:32:37,134 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {199#(and (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:37,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {199#(and (<= 0 main_~k~0) (= main_~i~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {199#(and (<= 0 main_~k~0) (= main_~i~0 0))} is VALID [2022-04-15 12:32:37,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {199#(and (<= 0 main_~k~0) (= main_~i~0 0))} ~i~0 := ~i~0 + ~k~0; {200#(< main_~i~0 (+ (* main_~k~0 1000000) 1))} is VALID [2022-04-15 12:32:37,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {200#(< main_~i~0 (+ (* main_~k~0 1000000) 1))} assume !(~i~0 < 1000000 * ~k~0); {201#(and (< main_~i~0 (+ (* main_~k~0 1000000) 1)) (<= (* main_~k~0 1000000) main_~i~0))} is VALID [2022-04-15 12:32:37,137 INFO L272 TraceCheckUtils]: 10: Hoare triple {201#(and (< main_~i~0 (+ (* main_~k~0 1000000) 1)) (<= (* main_~k~0 1000000) main_~i~0))} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {202#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:32:37,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {202#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {203#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:32:37,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {195#false} is VALID [2022-04-15 12:32:37,138 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 12:32:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109390234] [2022-04-15 12:32:37,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109390234] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:37,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111763957] [2022-04-15 12:32:37,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:37,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:37,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:37,142 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:37,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 12:32:37,223 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:37,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:37,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:32:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:37,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:37,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-15 12:32:37,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {194#true} is VALID [2022-04-15 12:32:37,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:32:37,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-15 12:32:37,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret2 := main(); {194#true} is VALID [2022-04-15 12:32:37,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-15 12:32:37,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {226#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:37,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {230#(and (<= main_~i~0 0) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:37,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#(and (<= main_~i~0 0) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {234#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} is VALID [2022-04-15 12:32:37,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {234#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} assume !(~i~0 < 1000000 * ~k~0); {195#false} is VALID [2022-04-15 12:32:37,365 INFO L272 TraceCheckUtils]: 10: Hoare triple {195#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {195#false} is VALID [2022-04-15 12:32:37,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#false} ~cond := #in~cond; {195#false} is VALID [2022-04-15 12:32:37,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} assume 0 == ~cond; {195#false} is VALID [2022-04-15 12:32:37,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 12:32:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:37,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:37,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-15 12:32:37,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {195#false} assume 0 == ~cond; {195#false} is VALID [2022-04-15 12:32:37,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {195#false} ~cond := #in~cond; {195#false} is VALID [2022-04-15 12:32:37,970 INFO L272 TraceCheckUtils]: 10: Hoare triple {195#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {195#false} is VALID [2022-04-15 12:32:37,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#(< main_~i~0 (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {195#false} is VALID [2022-04-15 12:32:37,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {266#(< main_~i~0 (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {262#(< main_~i~0 (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:37,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {270#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999999)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 1000000)))} assume !!(~i~0 < 1000000 * ~k~0); {266#(< main_~i~0 (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:37,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {194#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {270#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999999)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 1000000)))} is VALID [2022-04-15 12:32:37,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {194#true} is VALID [2022-04-15 12:32:37,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret2 := main(); {194#true} is VALID [2022-04-15 12:32:37,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #55#return; {194#true} is VALID [2022-04-15 12:32:37,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-15 12:32:37,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {194#true} is VALID [2022-04-15 12:32:37,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-15 12:32:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:37,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111763957] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:37,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:37,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-15 12:32:37,978 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:37,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1573890473] [2022-04-15 12:32:37,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1573890473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:37,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:37,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:37,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451055093] [2022-04-15 12:32:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:32:37,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:37,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:37,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:37,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:32:37,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:37,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:32:37,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:32:37,994 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:38,182 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-15 12:32:38,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:32:38,183 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 12:32:38,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:38,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:32:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-15 12:32:38,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-15 12:32:38,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:38,237 INFO L225 Difference]: With dead ends: 22 [2022-04-15 12:32:38,237 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 12:32:38,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-15 12:32:38,240 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:38,244 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:32:38,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 12:32:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 12:32:38,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:38,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,261 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,261 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:38,262 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:32:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:32:38,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:38,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:38,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:32:38,264 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 12:32:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:38,265 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-15 12:32:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:32:38,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:38,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:38,265 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:38,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:38,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-15 12:32:38,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2022-04-15 12:32:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:38,267 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-15 12:32:38,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:38,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-15 12:32:38,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:38,284 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-15 12:32:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:32:38,284 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:38,284 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:38,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:38,485 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:38,486 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:38,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:38,486 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 3 times [2022-04-15 12:32:38,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:38,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1209802584] [2022-04-15 12:32:38,579 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:38,581 INFO L85 PathProgramCache]: Analyzing trace with hash 621756337, now seen corresponding path program 1 times [2022-04-15 12:32:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367173249] [2022-04-15 12:32:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:38,592 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:38,600 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash 606819281, now seen corresponding path program 4 times [2022-04-15 12:32:38,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687176675] [2022-04-15 12:32:38,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:38,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:38,660 INFO L290 TraceCheckUtils]: 0: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {416#true} is VALID [2022-04-15 12:32:38,660 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-15 12:32:38,660 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {416#true} {416#true} #55#return; {416#true} is VALID [2022-04-15 12:32:38,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:38,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {425#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {416#true} is VALID [2022-04-15 12:32:38,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-15 12:32:38,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #55#return; {416#true} is VALID [2022-04-15 12:32:38,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret2 := main(); {416#true} is VALID [2022-04-15 12:32:38,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {416#true} is VALID [2022-04-15 12:32:38,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {421#(= main_~i~0 0)} is VALID [2022-04-15 12:32:38,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {422#(and (<= (+ main_~i~0 1) (* main_~k~0 1000000)) (= main_~i~0 0))} is VALID [2022-04-15 12:32:38,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {422#(and (<= (+ main_~i~0 1) (* main_~k~0 1000000)) (= main_~i~0 0))} ~i~0 := ~i~0 + ~k~0; {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:38,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:38,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {424#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:38,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {417#false} is VALID [2022-04-15 12:32:38,680 INFO L272 TraceCheckUtils]: 12: Hoare triple {417#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {417#false} is VALID [2022-04-15 12:32:38,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-15 12:32:38,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-15 12:32:38,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-15 12:32:38,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:38,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:38,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687176675] [2022-04-15 12:32:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687176675] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:38,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79715148] [2022-04-15 12:32:38,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:38,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:38,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:38,696 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:38,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 12:32:38,756 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:38,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:38,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:32:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:38,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:38,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {416#true} is VALID [2022-04-15 12:32:38,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {416#true} is VALID [2022-04-15 12:32:38,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-15 12:32:38,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #55#return; {416#true} is VALID [2022-04-15 12:32:38,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret2 := main(); {416#true} is VALID [2022-04-15 12:32:38,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {416#true} is VALID [2022-04-15 12:32:38,915 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {447#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:38,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {447#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {447#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:38,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {447#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {454#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:38,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {454#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {458#(and (<= main_~i~0 main_~k~0) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:38,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#(and (<= main_~i~0 main_~k~0) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {462#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-15 12:32:38,918 INFO L290 TraceCheckUtils]: 11: Hoare triple {462#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} assume !(~i~0 < 1000000 * ~k~0); {417#false} is VALID [2022-04-15 12:32:38,918 INFO L272 TraceCheckUtils]: 12: Hoare triple {417#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {417#false} is VALID [2022-04-15 12:32:38,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-15 12:32:38,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-15 12:32:38,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-15 12:32:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:38,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:39,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {417#false} assume !false; {417#false} is VALID [2022-04-15 12:32:39,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {417#false} assume 0 == ~cond; {417#false} is VALID [2022-04-15 12:32:39,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {417#false} ~cond := #in~cond; {417#false} is VALID [2022-04-15 12:32:39,153 INFO L272 TraceCheckUtils]: 12: Hoare triple {417#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {417#false} is VALID [2022-04-15 12:32:39,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {424#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {417#false} is VALID [2022-04-15 12:32:39,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {424#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:39,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {496#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {423#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:39,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {500#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999998)) 1)} ~i~0 := ~i~0 + ~k~0; {496#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:39,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {500#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999998)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {500#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999998)) 1)} is VALID [2022-04-15 12:32:39,158 INFO L290 TraceCheckUtils]: 6: Hoare triple {416#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {500#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999998)) 1)} is VALID [2022-04-15 12:32:39,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {416#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {416#true} is VALID [2022-04-15 12:32:39,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {416#true} call #t~ret2 := main(); {416#true} is VALID [2022-04-15 12:32:39,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {416#true} {416#true} #55#return; {416#true} is VALID [2022-04-15 12:32:39,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {416#true} assume true; {416#true} is VALID [2022-04-15 12:32:39,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {416#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {416#true} is VALID [2022-04-15 12:32:39,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {416#true} call ULTIMATE.init(); {416#true} is VALID [2022-04-15 12:32:39,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:39,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79715148] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:39,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:39,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-15 12:32:39,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:39,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1209802584] [2022-04-15 12:32:39,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1209802584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:39,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:39,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:32:39,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125417155] [2022-04-15 12:32:39,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:39,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:39,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:39,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:32:39,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:39,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:32:39,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:32:39,175 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:39,307 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-04-15 12:32:39,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:32:39,307 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:32:39,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:39,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-15 12:32:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2022-04-15 12:32:39,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2022-04-15 12:32:39,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:39,333 INFO L225 Difference]: With dead ends: 24 [2022-04-15 12:32:39,333 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 12:32:39,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:32:39,335 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:39,335 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 29 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:32:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 12:32:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 12:32:39,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:39,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,346 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,346 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:39,348 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:32:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:39,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:39,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:39,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:32:39,348 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-15 12:32:39,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:39,349 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-15 12:32:39,349 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:39,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:39,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:39,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:39,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2022-04-15 12:32:39,351 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2022-04-15 12:32:39,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:39,351 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2022-04-15 12:32:39,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:39,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 19 transitions. [2022-04-15 12:32:39,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2022-04-15 12:32:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:32:39,370 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:39,370 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:39,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:39,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-15 12:32:39,593 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:39,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:39,593 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 5 times [2022-04-15 12:32:39,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:39,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309211527] [2022-04-15 12:32:39,686 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:39,692 INFO L85 PathProgramCache]: Analyzing trace with hash 680861681, now seen corresponding path program 1 times [2022-04-15 12:32:39,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:39,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080231564] [2022-04-15 12:32:39,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:39,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:39,719 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:39,726 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:39,727 INFO L85 PathProgramCache]: Analyzing trace with hash 139772271, now seen corresponding path program 6 times [2022-04-15 12:32:39,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:39,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450387787] [2022-04-15 12:32:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:39,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {659#true} is VALID [2022-04-15 12:32:39,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 12:32:39,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #55#return; {659#true} is VALID [2022-04-15 12:32:39,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:39,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {669#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {659#true} is VALID [2022-04-15 12:32:39,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 12:32:39,842 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #55#return; {659#true} is VALID [2022-04-15 12:32:39,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret2 := main(); {659#true} is VALID [2022-04-15 12:32:39,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {659#true} is VALID [2022-04-15 12:32:39,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {664#(= main_~i~0 0)} is VALID [2022-04-15 12:32:39,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {664#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {664#(= main_~i~0 0)} is VALID [2022-04-15 12:32:39,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {664#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {665#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:39,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {665#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {666#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:39,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:39,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:39,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {668#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:39,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {660#false} is VALID [2022-04-15 12:32:39,861 INFO L272 TraceCheckUtils]: 14: Hoare triple {660#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {660#false} is VALID [2022-04-15 12:32:39,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2022-04-15 12:32:39,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2022-04-15 12:32:39,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 12:32:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:39,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:39,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450387787] [2022-04-15 12:32:39,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450387787] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:39,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772708381] [2022-04-15 12:32:39,862 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:39,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:39,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:39,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:39,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 12:32:39,906 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 12:32:39,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:39,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 12:32:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:39,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:40,099 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 12:32:40,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {659#true} is VALID [2022-04-15 12:32:40,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 12:32:40,099 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #55#return; {659#true} is VALID [2022-04-15 12:32:40,099 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret2 := main(); {659#true} is VALID [2022-04-15 12:32:40,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {659#true} is VALID [2022-04-15 12:32:40,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {691#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {691#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {691#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:40,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {691#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {665#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:40,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {665#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {701#(and (<= main_~i~0 main_~k~0) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:40,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {701#(and (<= main_~i~0 main_~k~0) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {705#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-15 12:32:40,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {705#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} assume !!(~i~0 < 1000000 * ~k~0); {705#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-15 12:32:40,103 INFO L290 TraceCheckUtils]: 12: Hoare triple {705#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} ~i~0 := ~i~0 + ~k~0; {712#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} is VALID [2022-04-15 12:32:40,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {712#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} assume !(~i~0 < 1000000 * ~k~0); {660#false} is VALID [2022-04-15 12:32:40,104 INFO L272 TraceCheckUtils]: 14: Hoare triple {660#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {660#false} is VALID [2022-04-15 12:32:40,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2022-04-15 12:32:40,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2022-04-15 12:32:40,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 12:32:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:40,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 17: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 16: Hoare triple {660#false} assume 0 == ~cond; {660#false} is VALID [2022-04-15 12:32:40,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {660#false} ~cond := #in~cond; {660#false} is VALID [2022-04-15 12:32:40,379 INFO L272 TraceCheckUtils]: 14: Hoare triple {660#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {660#false} is VALID [2022-04-15 12:32:40,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {668#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {660#false} is VALID [2022-04-15 12:32:40,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {668#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:40,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:40,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {666#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {667#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:40,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {752#(or (<= (+ main_~i~0 1) (* main_~k~0 999998)) (not (< main_~i~0 (* main_~k~0 1000000))))} assume !!(~i~0 < 1000000 * ~k~0); {666#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:40,387 INFO L290 TraceCheckUtils]: 8: Hoare triple {756#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999997)) 1)} ~i~0 := ~i~0 + ~k~0; {752#(or (<= (+ main_~i~0 1) (* main_~k~0 999998)) (not (< main_~i~0 (* main_~k~0 1000000))))} is VALID [2022-04-15 12:32:40,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {756#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999997)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {756#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999997)) 1)} is VALID [2022-04-15 12:32:40,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {756#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999997)) 1)} is VALID [2022-04-15 12:32:40,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {659#true} is VALID [2022-04-15 12:32:40,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret2 := main(); {659#true} is VALID [2022-04-15 12:32:40,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #55#return; {659#true} is VALID [2022-04-15 12:32:40,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 12:32:40,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {659#true} is VALID [2022-04-15 12:32:40,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 12:32:40,388 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:40,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772708381] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:40,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:40,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 12:32:40,389 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:40,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309211527] [2022-04-15 12:32:40,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309211527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:40,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:40,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:32:40,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343108514] [2022-04-15 12:32:40,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:32:40,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:40,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:40,409 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:32:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:40,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:32:40,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:32:40,410 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:40,673 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-04-15 12:32:40,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:32:40,673 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 12:32:40,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-15 12:32:40,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 29 transitions. [2022-04-15 12:32:40,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 29 transitions. [2022-04-15 12:32:40,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:40,709 INFO L225 Difference]: With dead ends: 28 [2022-04-15 12:32:40,709 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 12:32:40,710 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-04-15 12:32:40,711 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 19 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:40,712 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 39 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:40,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 12:32:40,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 12:32:40,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:40,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,734 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,735 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:40,737 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:32:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:40,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:40,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:40,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:32:40,739 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 12:32:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:40,742 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-15 12:32:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:40,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:40,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:40,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:40,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-04-15 12:32:40,746 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2022-04-15 12:32:40,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:40,747 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-04-15 12:32:40,747 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:40,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 23 transitions. [2022-04-15 12:32:40,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:40,771 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-04-15 12:32:40,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 12:32:40,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:40,771 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:40,801 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:40,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:40,995 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:40,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 7 times [2022-04-15 12:32:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [16378727] [2022-04-15 12:32:41,077 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:41,079 INFO L85 PathProgramCache]: Analyzing trace with hash 739967025, now seen corresponding path program 1 times [2022-04-15 12:32:41,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:41,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189995442] [2022-04-15 12:32:41,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:41,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:41,102 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:41,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:41,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:41,119 INFO L85 PathProgramCache]: Analyzing trace with hash 943107627, now seen corresponding path program 8 times [2022-04-15 12:32:41,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:41,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031214494] [2022-04-15 12:32:41,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:41,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:41,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {943#true} is VALID [2022-04-15 12:32:41,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 12:32:41,208 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {943#true} {943#true} #55#return; {943#true} is VALID [2022-04-15 12:32:41,209 INFO L272 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:41,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {955#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {943#true} is VALID [2022-04-15 12:32:41,209 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 12:32:41,209 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #55#return; {943#true} is VALID [2022-04-15 12:32:41,209 INFO L272 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret2 := main(); {943#true} is VALID [2022-04-15 12:32:41,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {943#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {943#true} is VALID [2022-04-15 12:32:41,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {943#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {948#(= main_~i~0 0)} is VALID [2022-04-15 12:32:41,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {948#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {948#(= main_~i~0 0)} is VALID [2022-04-15 12:32:41,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {948#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {949#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:41,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {949#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:41,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {950#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:41,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {950#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:41,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {951#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:41,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {952#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:41,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {952#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:41,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:41,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {954#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:41,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {954#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {944#false} is VALID [2022-04-15 12:32:41,219 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {944#false} is VALID [2022-04-15 12:32:41,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#false} ~cond := #in~cond; {944#false} is VALID [2022-04-15 12:32:41,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#false} assume 0 == ~cond; {944#false} is VALID [2022-04-15 12:32:41,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#false} assume !false; {944#false} is VALID [2022-04-15 12:32:41,219 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:41,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:41,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031214494] [2022-04-15 12:32:41,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031214494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:41,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194055349] [2022-04-15 12:32:41,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:41,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:41,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:41,220 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:41,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 12:32:41,254 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:41,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:41,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 12:32:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:41,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:41,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2022-04-15 12:32:41,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {943#true} is VALID [2022-04-15 12:32:41,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 12:32:41,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #55#return; {943#true} is VALID [2022-04-15 12:32:41,504 INFO L272 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret2 := main(); {943#true} is VALID [2022-04-15 12:32:41,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {943#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {943#true} is VALID [2022-04-15 12:32:41,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {943#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {977#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:41,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {977#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {977#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:41,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {977#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {949#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:41,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {949#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {949#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:41,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {949#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {950#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:41,511 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {950#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:41,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {950#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {951#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:41,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {951#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {999#(and (<= main_~i~0 (* main_~k~0 3)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:41,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {999#(and (<= main_~i~0 (* main_~k~0 3)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {1003#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} is VALID [2022-04-15 12:32:41,514 INFO L290 TraceCheckUtils]: 15: Hoare triple {1003#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} assume !!(~i~0 < 1000000 * ~k~0); {1003#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} is VALID [2022-04-15 12:32:41,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {1003#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} ~i~0 := ~i~0 + ~k~0; {1010#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* 1000002 main_~k~0)))} is VALID [2022-04-15 12:32:41,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {1010#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* 1000002 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {944#false} is VALID [2022-04-15 12:32:41,515 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {944#false} is VALID [2022-04-15 12:32:41,515 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#false} ~cond := #in~cond; {944#false} is VALID [2022-04-15 12:32:41,515 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#false} assume 0 == ~cond; {944#false} is VALID [2022-04-15 12:32:41,516 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#false} assume !false; {944#false} is VALID [2022-04-15 12:32:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:41,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:41,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#false} assume !false; {944#false} is VALID [2022-04-15 12:32:41,885 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#false} assume 0 == ~cond; {944#false} is VALID [2022-04-15 12:32:41,885 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#false} ~cond := #in~cond; {944#false} is VALID [2022-04-15 12:32:41,885 INFO L272 TraceCheckUtils]: 18: Hoare triple {944#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {944#false} is VALID [2022-04-15 12:32:41,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {954#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {944#false} is VALID [2022-04-15 12:32:41,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {954#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:41,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:41,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {952#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {953#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:41,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {1050#(or (<= (+ main_~i~0 1) (* main_~k~0 999998)) (not (< main_~i~0 (* main_~k~0 1000000))))} assume !!(~i~0 < 1000000 * ~k~0); {952#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:41,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {1054#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {1050#(or (<= (+ main_~i~0 1) (* main_~k~0 999998)) (not (< main_~i~0 (* main_~k~0 1000000))))} is VALID [2022-04-15 12:32:41,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {1054#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {1054#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:41,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {1054#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:41,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {1061#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:41,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {1068#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999995)) 1)} ~i~0 := ~i~0 + ~k~0; {1061#(or (<= (* main_~k~0 2) 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:41,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1068#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999995)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {1068#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999995)) 1)} is VALID [2022-04-15 12:32:41,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {943#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1068#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999995)) 1)} is VALID [2022-04-15 12:32:41,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {943#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {943#true} is VALID [2022-04-15 12:32:41,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {943#true} call #t~ret2 := main(); {943#true} is VALID [2022-04-15 12:32:41,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {943#true} {943#true} #55#return; {943#true} is VALID [2022-04-15 12:32:41,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {943#true} assume true; {943#true} is VALID [2022-04-15 12:32:41,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {943#true} is VALID [2022-04-15 12:32:41,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {943#true} call ULTIMATE.init(); {943#true} is VALID [2022-04-15 12:32:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194055349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:41,893 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:41,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 12:32:41,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:41,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [16378727] [2022-04-15 12:32:41,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [16378727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:41,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:41,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:32:41,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397410254] [2022-04-15 12:32:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:32:41,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:41,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:41,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:41,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:32:41,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:41,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:32:41,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2022-04-15 12:32:41,917 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:42,266 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-15 12:32:42,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 12:32:42,266 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 12:32:42,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:42,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 12:32:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2022-04-15 12:32:42,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2022-04-15 12:32:42,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:42,310 INFO L225 Difference]: With dead ends: 32 [2022-04-15 12:32:42,310 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 12:32:42,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=181, Invalid=469, Unknown=0, NotChecked=0, Total=650 [2022-04-15 12:32:42,312 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 25 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:42,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:42,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 12:32:42,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 12:32:42,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:42,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,346 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,346 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:42,347 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:32:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:32:42,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:42,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:42,348 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:32:42,348 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 12:32:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:42,349 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-04-15 12:32:42,349 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:32:42,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:42,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:42,350 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:42,350 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:42,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-04-15 12:32:42,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2022-04-15 12:32:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:42,351 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-04-15 12:32:42,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.8) internal successors, (18), 9 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:42,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2022-04-15 12:32:42,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-04-15 12:32:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 12:32:42,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:42,375 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:42,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:42,576 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:42,576 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 9 times [2022-04-15 12:32:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:42,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [791761326] [2022-04-15 12:32:42,651 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:42,652 INFO L85 PathProgramCache]: Analyzing trace with hash 799072369, now seen corresponding path program 1 times [2022-04-15 12:32:42,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:42,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689982951] [2022-04-15 12:32:42,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:42,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:42,661 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:42,666 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:42,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1751393049, now seen corresponding path program 10 times [2022-04-15 12:32:42,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:42,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205494517] [2022-04-15 12:32:42,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:42,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:42,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {1297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1283#true} is VALID [2022-04-15 12:32:42,788 INFO L290 TraceCheckUtils]: 1: Hoare triple {1283#true} assume true; {1283#true} is VALID [2022-04-15 12:32:42,788 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1283#true} {1283#true} #55#return; {1283#true} is VALID [2022-04-15 12:32:42,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:42,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1297#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1283#true} is VALID [2022-04-15 12:32:42,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2022-04-15 12:32:42,789 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #55#return; {1283#true} is VALID [2022-04-15 12:32:42,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret2 := main(); {1283#true} is VALID [2022-04-15 12:32:42,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1283#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1283#true} is VALID [2022-04-15 12:32:42,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {1283#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1288#(= main_~i~0 0)} is VALID [2022-04-15 12:32:42,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {1288#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {1288#(= main_~i~0 0)} is VALID [2022-04-15 12:32:42,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {1288#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {1289#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:42,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {1289#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {1289#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:42,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {1289#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {1290#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:42,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {1290#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:42,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {1290#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {1291#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:42,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {1291#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {1291#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:42,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {1291#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {1292#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:42,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {1292#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {1292#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:42,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {1293#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:42,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {1293#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1294#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:42,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {1294#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:42,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:42,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1296#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:42,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {1296#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {1284#false} is VALID [2022-04-15 12:32:42,798 INFO L272 TraceCheckUtils]: 22: Hoare triple {1284#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1284#false} is VALID [2022-04-15 12:32:42,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2022-04-15 12:32:42,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {1284#false} assume 0 == ~cond; {1284#false} is VALID [2022-04-15 12:32:42,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2022-04-15 12:32:42,799 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:42,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205494517] [2022-04-15 12:32:42,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205494517] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:42,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359815822] [2022-04-15 12:32:42,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:42,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:42,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:42,804 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:42,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 12:32:42,842 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:42,842 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:42,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 12:32:42,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:42,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:43,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2022-04-15 12:32:43,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1283#true} is VALID [2022-04-15 12:32:43,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2022-04-15 12:32:43,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #55#return; {1283#true} is VALID [2022-04-15 12:32:43,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret2 := main(); {1283#true} is VALID [2022-04-15 12:32:43,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {1283#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1283#true} is VALID [2022-04-15 12:32:43,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {1283#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1319#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:43,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {1319#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:43,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {1289#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:43,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1289#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {1289#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:43,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {1289#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {1290#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:43,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {1290#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:43,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {1290#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {1291#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:43,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {1291#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {1291#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:43,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {1291#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {1292#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:43,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {1292#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {1292#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:43,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {1292#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {1293#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:43,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {1293#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1293#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:43,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {1293#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1356#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:43,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {1356#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {1360#(and (<= main_~i~0 (* main_~k~0 6)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:43,113 INFO L290 TraceCheckUtils]: 20: Hoare triple {1360#(and (<= main_~i~0 (* main_~k~0 6)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {1364#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 7 main_~k~0)))} is VALID [2022-04-15 12:32:43,114 INFO L290 TraceCheckUtils]: 21: Hoare triple {1364#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 7 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {1284#false} is VALID [2022-04-15 12:32:43,114 INFO L272 TraceCheckUtils]: 22: Hoare triple {1284#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1284#false} is VALID [2022-04-15 12:32:43,114 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2022-04-15 12:32:43,114 INFO L290 TraceCheckUtils]: 24: Hoare triple {1284#false} assume 0 == ~cond; {1284#false} is VALID [2022-04-15 12:32:43,114 INFO L290 TraceCheckUtils]: 25: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2022-04-15 12:32:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:43,114 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:43,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2022-04-15 12:32:43,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {1284#false} assume 0 == ~cond; {1284#false} is VALID [2022-04-15 12:32:43,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#false} ~cond := #in~cond; {1284#false} is VALID [2022-04-15 12:32:43,604 INFO L272 TraceCheckUtils]: 22: Hoare triple {1284#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1284#false} is VALID [2022-04-15 12:32:43,605 INFO L290 TraceCheckUtils]: 21: Hoare triple {1296#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {1284#false} is VALID [2022-04-15 12:32:43,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1296#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:43,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {1398#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {1295#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:43,606 INFO L290 TraceCheckUtils]: 18: Hoare triple {1402#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {1398#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:43,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {1402#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {1402#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:43,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {1409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {1402#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:43,608 INFO L290 TraceCheckUtils]: 15: Hoare triple {1409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {1409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:43,609 INFO L290 TraceCheckUtils]: 14: Hoare triple {1416#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {1409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:43,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {1416#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {1416#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:43,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {1423#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {1416#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:43,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {1423#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:43,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {1430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {1423#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:43,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {1430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {1430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:43,613 INFO L290 TraceCheckUtils]: 8: Hoare triple {1437#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999993)) 1)} ~i~0 := ~i~0 + ~k~0; {1430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:43,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {1437#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999993)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {1437#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999993)) 1)} is VALID [2022-04-15 12:32:43,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {1283#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1437#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999993)) 1)} is VALID [2022-04-15 12:32:43,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {1283#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {1283#true} call #t~ret2 := main(); {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1283#true} {1283#true} #55#return; {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {1283#true} assume true; {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {1283#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {1283#true} call ULTIMATE.init(); {1283#true} is VALID [2022-04-15 12:32:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:43,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359815822] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:43,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:43,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 23 [2022-04-15 12:32:43,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:43,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [791761326] [2022-04-15 12:32:43,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [791761326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:43,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:43,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 12:32:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034389790] [2022-04-15 12:32:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:32:43,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:43,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:43,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:43,638 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 12:32:43,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:43,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 12:32:43,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2022-04-15 12:32:43,639 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:44,168 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2022-04-15 12:32:44,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 12:32:44,168 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 12:32:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-15 12:32:44,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 37 transitions. [2022-04-15 12:32:44,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 37 transitions. [2022-04-15 12:32:44,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:44,205 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:32:44,205 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 12:32:44,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=738, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 12:32:44,206 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:44,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 59 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 12:32:44,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-04-15 12:32:44,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:44,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,249 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,249 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:44,250 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:32:44,250 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:32:44,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:44,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:44,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:32:44,251 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-15 12:32:44,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:44,252 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-04-15 12:32:44,252 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:32:44,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:44,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:44,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:44,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2022-04-15 12:32:44,254 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2022-04-15 12:32:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:44,254 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2022-04-15 12:32:44,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:44,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 31 transitions. [2022-04-15 12:32:44,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2022-04-15 12:32:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 12:32:44,296 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:44,296 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:44,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:44,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable9 [2022-04-15 12:32:44,497 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:44,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 11 times [2022-04-15 12:32:44,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:44,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1682275316] [2022-04-15 12:32:44,569 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:44,571 INFO L85 PathProgramCache]: Analyzing trace with hash 858177713, now seen corresponding path program 1 times [2022-04-15 12:32:44,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:44,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252837772] [2022-04-15 12:32:44,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:44,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:44,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:44,579 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:44,584 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:44,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1326665123, now seen corresponding path program 12 times [2022-04-15 12:32:44,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:44,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714720162] [2022-04-15 12:32:44,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:44,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:44,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:44,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1680#true} is VALID [2022-04-15 12:32:44,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-15 12:32:44,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1680#true} {1680#true} #55#return; {1680#true} is VALID [2022-04-15 12:32:44,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:44,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1680#true} is VALID [2022-04-15 12:32:44,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-15 12:32:44,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #55#return; {1680#true} is VALID [2022-04-15 12:32:44,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret2 := main(); {1680#true} is VALID [2022-04-15 12:32:44,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1680#true} is VALID [2022-04-15 12:32:44,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1685#(= main_~i~0 0)} is VALID [2022-04-15 12:32:44,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1685#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {1685#(= main_~i~0 0)} is VALID [2022-04-15 12:32:44,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {1685#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {1686#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:44,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {1686#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:44,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {1687#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:44,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {1687#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {1687#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:44,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {1687#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {1688#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:44,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {1688#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:44,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {1689#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:44,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {1689#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {1689#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:44,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1689#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {1690#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:44,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {1690#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1690#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:44,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1690#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1691#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:44,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1691#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {1691#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:44,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {1691#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {1692#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:44,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {1692#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1693#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:44,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {1693#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:44,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:44,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1695#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:44,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {1695#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {1681#false} is VALID [2022-04-15 12:32:44,766 INFO L272 TraceCheckUtils]: 26: Hoare triple {1681#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1681#false} is VALID [2022-04-15 12:32:44,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-15 12:32:44,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-15 12:32:44,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-15 12:32:44,766 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714720162] [2022-04-15 12:32:44,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714720162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076623103] [2022-04-15 12:32:44,767 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:44,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:44,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:44,772 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:44,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 12:32:44,809 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 12:32:44,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:44,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 12:32:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:44,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:45,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2022-04-15 12:32:45,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1680#true} is VALID [2022-04-15 12:32:45,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-15 12:32:45,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #55#return; {1680#true} is VALID [2022-04-15 12:32:45,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret2 := main(); {1680#true} is VALID [2022-04-15 12:32:45,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1680#true} is VALID [2022-04-15 12:32:45,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1718#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:45,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {1718#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {1718#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:45,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {1718#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {1686#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:45,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {1686#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {1686#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:45,078 INFO L290 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {1687#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:45,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {1687#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {1687#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:45,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {1687#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {1688#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:45,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {1688#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:45,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {1688#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {1689#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:45,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {1689#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {1689#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:45,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {1689#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {1690#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:45,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1690#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1690#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:45,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {1690#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1691#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:45,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {1691#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {1691#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:45,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {1691#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {1692#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:45,082 INFO L290 TraceCheckUtils]: 21: Hoare triple {1692#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {1692#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:45,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1767#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:45,083 INFO L290 TraceCheckUtils]: 23: Hoare triple {1767#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {1771#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:45,086 INFO L290 TraceCheckUtils]: 24: Hoare triple {1771#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {1775#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:32:45,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {1775#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {1681#false} is VALID [2022-04-15 12:32:45,089 INFO L272 TraceCheckUtils]: 26: Hoare triple {1681#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1681#false} is VALID [2022-04-15 12:32:45,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-15 12:32:45,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-15 12:32:45,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-15 12:32:45,089 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:45,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:45,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {1681#false} assume !false; {1681#false} is VALID [2022-04-15 12:32:45,705 INFO L290 TraceCheckUtils]: 28: Hoare triple {1681#false} assume 0 == ~cond; {1681#false} is VALID [2022-04-15 12:32:45,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {1681#false} ~cond := #in~cond; {1681#false} is VALID [2022-04-15 12:32:45,705 INFO L272 TraceCheckUtils]: 26: Hoare triple {1681#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {1681#false} is VALID [2022-04-15 12:32:45,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {1695#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {1681#false} is VALID [2022-04-15 12:32:45,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {1695#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:45,707 INFO L290 TraceCheckUtils]: 23: Hoare triple {1809#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {1694#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:45,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {1813#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {1809#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:45,708 INFO L290 TraceCheckUtils]: 21: Hoare triple {1813#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {1813#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:45,708 INFO L290 TraceCheckUtils]: 20: Hoare triple {1820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {1813#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:45,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {1820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {1820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:45,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {1827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {1820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:45,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {1827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {1827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:45,710 INFO L290 TraceCheckUtils]: 16: Hoare triple {1834#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {1827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:45,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {1834#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {1834#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:45,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {1841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {1834#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:45,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {1841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {1841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:45,712 INFO L290 TraceCheckUtils]: 12: Hoare triple {1848#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {1841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:45,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1848#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {1848#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:45,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {1855#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {1848#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:45,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {1855#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {1855#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:45,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {1862#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999991)) 1)} ~i~0 := ~i~0 + ~k~0; {1855#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:45,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {1862#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999991)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {1862#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999991)) 1)} is VALID [2022-04-15 12:32:45,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {1680#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {1862#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999991)) 1)} is VALID [2022-04-15 12:32:45,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {1680#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L272 TraceCheckUtils]: 4: Hoare triple {1680#true} call #t~ret2 := main(); {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1680#true} {1680#true} #55#return; {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L290 TraceCheckUtils]: 2: Hoare triple {1680#true} assume true; {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {1680#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L272 TraceCheckUtils]: 0: Hoare triple {1680#true} call ULTIMATE.init(); {1680#true} is VALID [2022-04-15 12:32:45,715 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:45,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076623103] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:45,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:45,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 27 [2022-04-15 12:32:45,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:45,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1682275316] [2022-04-15 12:32:45,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1682275316] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:45,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:45,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 12:32:45,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144249704] [2022-04-15 12:32:45,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:32:45,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:45,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:45,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:45,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 12:32:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 12:32:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=506, Unknown=0, NotChecked=0, Total=702 [2022-04-15 12:32:45,739 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,391 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2022-04-15 12:32:46,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 12:32:46,392 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-15 12:32:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:46,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 12:32:46,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 41 transitions. [2022-04-15 12:32:46,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 41 transitions. [2022-04-15 12:32:46,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:46,438 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:32:46,438 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 12:32:46,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=459, Invalid=1023, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:32:46,439 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:46,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 69 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:46,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 12:32:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 12:32:46,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:46,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,494 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,494 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,495 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:32:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:32:46,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:46,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:46,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:32:46,496 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 12:32:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:46,497 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-04-15 12:32:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:32:46,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:46,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:46,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:46,497 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:46,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 30 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2022-04-15 12:32:46,499 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2022-04-15 12:32:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:46,499 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2022-04-15 12:32:46,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 13 states have internal predecessors, (26), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:46,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 35 transitions. [2022-04-15 12:32:46,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:46,539 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2022-04-15 12:32:46,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 12:32:46,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:46,540 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:46,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:46,755 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:46,755 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 13 times [2022-04-15 12:32:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:46,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [158088306] [2022-04-15 12:32:46,836 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:46,837 INFO L85 PathProgramCache]: Analyzing trace with hash 917283057, now seen corresponding path program 1 times [2022-04-15 12:32:46,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:46,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740072090] [2022-04-15 12:32:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:46,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:46,851 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:46,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:46,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:46,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1481899937, now seen corresponding path program 14 times [2022-04-15 12:32:46,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:46,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380234417] [2022-04-15 12:32:46,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:46,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:47,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:47,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:47,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {2151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2133#true} is VALID [2022-04-15 12:32:47,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {2133#true} assume true; {2133#true} is VALID [2022-04-15 12:32:47,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2133#true} {2133#true} #55#return; {2133#true} is VALID [2022-04-15 12:32:47,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:47,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {2151#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2133#true} is VALID [2022-04-15 12:32:47,040 INFO L290 TraceCheckUtils]: 2: Hoare triple {2133#true} assume true; {2133#true} is VALID [2022-04-15 12:32:47,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2133#true} {2133#true} #55#return; {2133#true} is VALID [2022-04-15 12:32:47,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {2133#true} call #t~ret2 := main(); {2133#true} is VALID [2022-04-15 12:32:47,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {2133#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2133#true} is VALID [2022-04-15 12:32:47,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2138#(= main_~i~0 0)} is VALID [2022-04-15 12:32:47,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {2138#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {2138#(= main_~i~0 0)} is VALID [2022-04-15 12:32:47,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {2138#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {2139#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:47,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {2139#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {2139#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:47,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {2139#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {2140#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:47,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {2140#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {2140#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:47,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {2140#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {2141#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:47,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {2141#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {2141#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:47,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {2142#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:47,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {2142#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:47,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {2142#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {2143#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:47,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {2143#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2143#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:47,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {2143#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2144#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:47,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2144#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {2144#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:47,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2144#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {2145#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:47,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {2145#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2145#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:47,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {2145#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2146#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:47,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {2146#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {2146#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:47,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {2147#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:47,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {2147#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {2148#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:47,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {2148#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:47,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:47,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2150#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:47,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {2150#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {2134#false} is VALID [2022-04-15 12:32:47,049 INFO L272 TraceCheckUtils]: 30: Hoare triple {2134#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2134#false} is VALID [2022-04-15 12:32:47,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2022-04-15 12:32:47,049 INFO L290 TraceCheckUtils]: 32: Hoare triple {2134#false} assume 0 == ~cond; {2134#false} is VALID [2022-04-15 12:32:47,049 INFO L290 TraceCheckUtils]: 33: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2022-04-15 12:32:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:47,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:47,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380234417] [2022-04-15 12:32:47,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380234417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:47,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690516801] [2022-04-15 12:32:47,050 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:47,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:47,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:47,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:47,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 12:32:47,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:47,086 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:47,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 12:32:47,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:47,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:47,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2133#true} is VALID [2022-04-15 12:32:47,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {2133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2133#true} is VALID [2022-04-15 12:32:47,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {2133#true} assume true; {2133#true} is VALID [2022-04-15 12:32:47,431 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2133#true} {2133#true} #55#return; {2133#true} is VALID [2022-04-15 12:32:47,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {2133#true} call #t~ret2 := main(); {2133#true} is VALID [2022-04-15 12:32:47,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {2133#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2133#true} is VALID [2022-04-15 12:32:47,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2173#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:47,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {2173#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {2173#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:47,433 INFO L290 TraceCheckUtils]: 8: Hoare triple {2173#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {2139#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:47,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {2139#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {2139#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:47,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {2139#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {2140#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:47,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {2140#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {2140#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:47,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {2140#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {2141#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:47,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {2141#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {2141#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:47,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2141#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {2142#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:47,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {2142#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {2142#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:47,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {2142#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {2143#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:47,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {2143#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2143#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:47,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {2143#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2144#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:47,438 INFO L290 TraceCheckUtils]: 19: Hoare triple {2144#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {2144#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:47,439 INFO L290 TraceCheckUtils]: 20: Hoare triple {2144#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {2145#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:47,439 INFO L290 TraceCheckUtils]: 21: Hoare triple {2145#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2145#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:47,440 INFO L290 TraceCheckUtils]: 22: Hoare triple {2145#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2146#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:47,440 INFO L290 TraceCheckUtils]: 23: Hoare triple {2146#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {2146#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:47,441 INFO L290 TraceCheckUtils]: 24: Hoare triple {2146#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {2147#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:47,441 INFO L290 TraceCheckUtils]: 25: Hoare triple {2147#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {2147#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:47,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {2147#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {2234#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:47,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {2238#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:47,443 INFO L290 TraceCheckUtils]: 28: Hoare triple {2238#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {2242#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 11)))} is VALID [2022-04-15 12:32:47,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {2242#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 11)))} assume !(~i~0 < 1000000 * ~k~0); {2134#false} is VALID [2022-04-15 12:32:47,444 INFO L272 TraceCheckUtils]: 30: Hoare triple {2134#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2134#false} is VALID [2022-04-15 12:32:47,444 INFO L290 TraceCheckUtils]: 31: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2022-04-15 12:32:47,444 INFO L290 TraceCheckUtils]: 32: Hoare triple {2134#false} assume 0 == ~cond; {2134#false} is VALID [2022-04-15 12:32:47,444 INFO L290 TraceCheckUtils]: 33: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2022-04-15 12:32:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:47,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:48,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {2134#false} assume !false; {2134#false} is VALID [2022-04-15 12:32:48,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {2134#false} assume 0 == ~cond; {2134#false} is VALID [2022-04-15 12:32:48,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {2134#false} ~cond := #in~cond; {2134#false} is VALID [2022-04-15 12:32:48,132 INFO L272 TraceCheckUtils]: 30: Hoare triple {2134#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2134#false} is VALID [2022-04-15 12:32:48,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {2150#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {2134#false} is VALID [2022-04-15 12:32:48,134 INFO L290 TraceCheckUtils]: 28: Hoare triple {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2150#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:48,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {2276#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {2149#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:48,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {2280#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {2276#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:48,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {2280#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {2280#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:48,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {2287#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {2280#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:48,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {2287#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {2287#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:48,137 INFO L290 TraceCheckUtils]: 22: Hoare triple {2294#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {2287#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:48,137 INFO L290 TraceCheckUtils]: 21: Hoare triple {2294#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {2294#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:48,138 INFO L290 TraceCheckUtils]: 20: Hoare triple {2301#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {2294#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:48,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {2301#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {2301#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:48,139 INFO L290 TraceCheckUtils]: 18: Hoare triple {2308#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {2301#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:48,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {2308#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {2308#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:48,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {2315#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {2308#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:48,140 INFO L290 TraceCheckUtils]: 15: Hoare triple {2315#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {2315#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:48,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {2322#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {2315#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:48,141 INFO L290 TraceCheckUtils]: 13: Hoare triple {2322#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {2322#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:48,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {2329#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {2322#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:48,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {2329#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {2329#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:48,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {2336#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {2329#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:48,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {2336#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {2336#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:48,144 INFO L290 TraceCheckUtils]: 8: Hoare triple {2343#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999989)) 1)} ~i~0 := ~i~0 + ~k~0; {2336#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:48,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {2343#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999989)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {2343#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999989)) 1)} is VALID [2022-04-15 12:32:48,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {2133#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2343#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999989)) 1)} is VALID [2022-04-15 12:32:48,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {2133#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {2133#true} call #t~ret2 := main(); {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2133#true} {2133#true} #55#return; {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {2133#true} assume true; {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {2133#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {2133#true} call ULTIMATE.init(); {2133#true} is VALID [2022-04-15 12:32:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690516801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:48,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:48,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 31 [2022-04-15 12:32:48,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:48,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [158088306] [2022-04-15 12:32:48,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [158088306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:48,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:48,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 12:32:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38825460] [2022-04-15 12:32:48,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:48,148 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:32:48,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:48,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:48,172 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 12:32:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 12:32:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=663, Unknown=0, NotChecked=0, Total=930 [2022-04-15 12:32:48,173 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:48,996 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-04-15 12:32:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 12:32:48,997 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 12:32:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-15 12:32:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 45 transitions. [2022-04-15 12:32:48,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 45 transitions. [2022-04-15 12:32:49,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:49,061 INFO L225 Difference]: With dead ends: 44 [2022-04-15 12:32:49,061 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 12:32:49,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=628, Invalid=1352, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:32:49,063 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:49,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 79 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:49,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 12:32:49,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 12:32:49,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:49,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:49,119 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:49,119 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:49,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:49,121 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:32:49,121 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:32:49,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:49,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:49,121 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:32:49,121 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-15 12:32:49,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:49,123 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-04-15 12:32:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:32:49,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:49,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:49,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:49,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:49,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 34 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:49,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2022-04-15 12:32:49,124 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2022-04-15 12:32:49,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:49,124 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2022-04-15 12:32:49,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.875) internal successors, (30), 15 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:49,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 39 transitions. [2022-04-15 12:32:49,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2022-04-15 12:32:49,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 12:32:49,168 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:49,168 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:49,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:49,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:49,369 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:49,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 15 times [2022-04-15 12:32:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:49,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [355378788] [2022-04-15 12:32:49,429 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:49,430 INFO L85 PathProgramCache]: Analyzing trace with hash 976388401, now seen corresponding path program 1 times [2022-04-15 12:32:49,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:49,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482930065] [2022-04-15 12:32:49,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:49,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:49,437 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:49,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:49,444 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:49,445 INFO L85 PathProgramCache]: Analyzing trace with hash -889916133, now seen corresponding path program 16 times [2022-04-15 12:32:49,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:49,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837667948] [2022-04-15 12:32:49,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:49,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:49,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:49,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:49,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {2662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2642#true} is VALID [2022-04-15 12:32:49,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-15 12:32:49,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2642#true} {2642#true} #55#return; {2642#true} is VALID [2022-04-15 12:32:49,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} call ULTIMATE.init(); {2662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:49,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {2662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2642#true} is VALID [2022-04-15 12:32:49,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-15 12:32:49,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} #55#return; {2642#true} is VALID [2022-04-15 12:32:49,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} call #t~ret2 := main(); {2642#true} is VALID [2022-04-15 12:32:49,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2642#true} is VALID [2022-04-15 12:32:49,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {2642#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2647#(= main_~i~0 0)} is VALID [2022-04-15 12:32:49,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {2647#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {2647#(= main_~i~0 0)} is VALID [2022-04-15 12:32:49,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {2647#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {2648#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:49,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {2648#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {2648#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:49,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {2648#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {2649#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:49,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {2649#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {2649#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:49,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {2649#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {2650#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:49,704 INFO L290 TraceCheckUtils]: 13: Hoare triple {2650#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {2650#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:49,704 INFO L290 TraceCheckUtils]: 14: Hoare triple {2650#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {2651#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:49,705 INFO L290 TraceCheckUtils]: 15: Hoare triple {2651#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {2651#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:49,705 INFO L290 TraceCheckUtils]: 16: Hoare triple {2651#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {2652#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:49,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {2652#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2652#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:49,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {2652#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2653#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:49,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {2653#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {2653#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:49,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {2653#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {2654#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:49,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {2654#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2654#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:49,708 INFO L290 TraceCheckUtils]: 22: Hoare triple {2654#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2655#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:49,708 INFO L290 TraceCheckUtils]: 23: Hoare triple {2655#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {2655#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:49,709 INFO L290 TraceCheckUtils]: 24: Hoare triple {2655#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {2656#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:49,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {2656#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {2656#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:49,710 INFO L290 TraceCheckUtils]: 26: Hoare triple {2656#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {2657#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:49,710 INFO L290 TraceCheckUtils]: 27: Hoare triple {2657#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {2657#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:49,711 INFO L290 TraceCheckUtils]: 28: Hoare triple {2657#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {2658#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:49,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {2658#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:49,712 INFO L290 TraceCheckUtils]: 30: Hoare triple {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:49,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:49,713 INFO L290 TraceCheckUtils]: 32: Hoare triple {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2661#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:49,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {2661#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {2643#false} is VALID [2022-04-15 12:32:49,714 INFO L272 TraceCheckUtils]: 34: Hoare triple {2643#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2643#false} is VALID [2022-04-15 12:32:49,714 INFO L290 TraceCheckUtils]: 35: Hoare triple {2643#false} ~cond := #in~cond; {2643#false} is VALID [2022-04-15 12:32:49,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {2643#false} assume 0 == ~cond; {2643#false} is VALID [2022-04-15 12:32:49,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {2643#false} assume !false; {2643#false} is VALID [2022-04-15 12:32:49,715 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:49,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837667948] [2022-04-15 12:32:49,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837667948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:49,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052188086] [2022-04-15 12:32:49,715 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:32:49,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:49,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:49,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:49,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 12:32:49,768 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:32:49,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:49,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 12:32:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:49,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:50,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} call ULTIMATE.init(); {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} #55#return; {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} call #t~ret2 := main(); {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2642#true} is VALID [2022-04-15 12:32:50,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {2642#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2684#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:50,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {2684#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {2688#(and (<= main_~i~0 0) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:50,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {2688#(and (<= main_~i~0 0) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {2692#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} is VALID [2022-04-15 12:32:50,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {2692#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2692#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} is VALID [2022-04-15 12:32:50,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {2692#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2699#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-15 12:32:50,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {2699#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} assume !!(~i~0 < 1000000 * ~k~0); {2699#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} is VALID [2022-04-15 12:32:50,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {2699#(and (< main_~i~0 (* 1000002 main_~k~0)) (<= main_~i~0 (* main_~k~0 2)))} ~i~0 := ~i~0 + ~k~0; {2706#(and (< main_~i~0 (* 1000003 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} is VALID [2022-04-15 12:32:50,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {2706#(and (< main_~i~0 (* 1000003 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} assume !!(~i~0 < 1000000 * ~k~0); {2706#(and (< main_~i~0 (* 1000003 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} is VALID [2022-04-15 12:32:50,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {2706#(and (< main_~i~0 (* 1000003 main_~k~0)) (<= main_~i~0 (* main_~k~0 3)))} ~i~0 := ~i~0 + ~k~0; {2713#(and (< main_~i~0 (* 1000004 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} is VALID [2022-04-15 12:32:50,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {2713#(and (< main_~i~0 (* 1000004 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} assume !!(~i~0 < 1000000 * ~k~0); {2713#(and (< main_~i~0 (* 1000004 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} is VALID [2022-04-15 12:32:50,577 INFO L290 TraceCheckUtils]: 16: Hoare triple {2713#(and (< main_~i~0 (* 1000004 main_~k~0)) (<= main_~i~0 (* main_~k~0 4)))} ~i~0 := ~i~0 + ~k~0; {2720#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* main_~k~0 1000005)))} is VALID [2022-04-15 12:32:50,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* main_~k~0 1000005)))} assume !!(~i~0 < 1000000 * ~k~0); {2720#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* main_~k~0 1000005)))} is VALID [2022-04-15 12:32:50,578 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(and (<= main_~i~0 (* 5 main_~k~0)) (< main_~i~0 (* main_~k~0 1000005)))} ~i~0 := ~i~0 + ~k~0; {2727#(and (< main_~i~0 (* main_~k~0 1000006)) (<= main_~i~0 (* main_~k~0 6)))} is VALID [2022-04-15 12:32:50,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {2727#(and (< main_~i~0 (* main_~k~0 1000006)) (<= main_~i~0 (* main_~k~0 6)))} assume !!(~i~0 < 1000000 * ~k~0); {2727#(and (< main_~i~0 (* main_~k~0 1000006)) (<= main_~i~0 (* main_~k~0 6)))} is VALID [2022-04-15 12:32:50,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {2727#(and (< main_~i~0 (* main_~k~0 1000006)) (<= main_~i~0 (* main_~k~0 6)))} ~i~0 := ~i~0 + ~k~0; {2734#(and (<= main_~i~0 (* 7 main_~k~0)) (< main_~i~0 (* main_~k~0 1000007)))} is VALID [2022-04-15 12:32:50,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {2734#(and (<= main_~i~0 (* 7 main_~k~0)) (< main_~i~0 (* main_~k~0 1000007)))} assume !!(~i~0 < 1000000 * ~k~0); {2734#(and (<= main_~i~0 (* 7 main_~k~0)) (< main_~i~0 (* main_~k~0 1000007)))} is VALID [2022-04-15 12:32:50,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {2734#(and (<= main_~i~0 (* 7 main_~k~0)) (< main_~i~0 (* main_~k~0 1000007)))} ~i~0 := ~i~0 + ~k~0; {2741#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000008)))} is VALID [2022-04-15 12:32:50,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {2741#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000008)))} assume !!(~i~0 < 1000000 * ~k~0); {2741#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000008)))} is VALID [2022-04-15 12:32:50,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {2741#(and (<= main_~i~0 (* main_~k~0 8)) (< main_~i~0 (* main_~k~0 1000008)))} ~i~0 := ~i~0 + ~k~0; {2748#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* main_~k~0 1000009)))} is VALID [2022-04-15 12:32:50,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {2748#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* main_~k~0 1000009)))} assume !!(~i~0 < 1000000 * ~k~0); {2748#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* main_~k~0 1000009)))} is VALID [2022-04-15 12:32:50,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {2748#(and (<= main_~i~0 (* main_~k~0 9)) (< main_~i~0 (* main_~k~0 1000009)))} ~i~0 := ~i~0 + ~k~0; {2755#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000010)))} is VALID [2022-04-15 12:32:50,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {2755#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000010)))} assume !!(~i~0 < 1000000 * ~k~0); {2755#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000010)))} is VALID [2022-04-15 12:32:50,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {2755#(and (<= main_~i~0 (* main_~k~0 10)) (< main_~i~0 (* main_~k~0 1000010)))} ~i~0 := ~i~0 + ~k~0; {2762#(and (< main_~i~0 (* main_~k~0 1000011)) (<= main_~i~0 (* main_~k~0 11)))} is VALID [2022-04-15 12:32:50,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {2762#(and (< main_~i~0 (* main_~k~0 1000011)) (<= main_~i~0 (* main_~k~0 11)))} assume !!(~i~0 < 1000000 * ~k~0); {2762#(and (< main_~i~0 (* main_~k~0 1000011)) (<= main_~i~0 (* main_~k~0 11)))} is VALID [2022-04-15 12:32:50,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {2762#(and (< main_~i~0 (* main_~k~0 1000011)) (<= main_~i~0 (* main_~k~0 11)))} ~i~0 := ~i~0 + ~k~0; {2769#(and (<= main_~i~0 (* main_~k~0 12)) (< main_~i~0 (* 1000012 main_~k~0)))} is VALID [2022-04-15 12:32:50,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {2769#(and (<= main_~i~0 (* main_~k~0 12)) (< main_~i~0 (* 1000012 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {2769#(and (<= main_~i~0 (* main_~k~0 12)) (< main_~i~0 (* 1000012 main_~k~0)))} is VALID [2022-04-15 12:32:50,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {2769#(and (<= main_~i~0 (* main_~k~0 12)) (< main_~i~0 (* 1000012 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {2776#(and (< main_~i~0 (* main_~k~0 1000013)) (<= main_~i~0 (* main_~k~0 13)))} is VALID [2022-04-15 12:32:50,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {2776#(and (< main_~i~0 (* main_~k~0 1000013)) (<= main_~i~0 (* main_~k~0 13)))} assume !(~i~0 < 1000000 * ~k~0); {2643#false} is VALID [2022-04-15 12:32:50,585 INFO L272 TraceCheckUtils]: 34: Hoare triple {2643#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2643#false} is VALID [2022-04-15 12:32:50,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {2643#false} ~cond := #in~cond; {2643#false} is VALID [2022-04-15 12:32:50,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {2643#false} assume 0 == ~cond; {2643#false} is VALID [2022-04-15 12:32:50,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {2643#false} assume !false; {2643#false} is VALID [2022-04-15 12:32:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:50,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:52,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {2643#false} assume !false; {2643#false} is VALID [2022-04-15 12:32:52,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {2643#false} assume 0 == ~cond; {2643#false} is VALID [2022-04-15 12:32:52,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {2643#false} ~cond := #in~cond; {2643#false} is VALID [2022-04-15 12:32:52,304 INFO L272 TraceCheckUtils]: 34: Hoare triple {2643#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {2643#false} is VALID [2022-04-15 12:32:52,304 INFO L290 TraceCheckUtils]: 33: Hoare triple {2661#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {2643#false} is VALID [2022-04-15 12:32:52,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2661#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:52,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:52,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {2660#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:52,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} assume !!(~i~0 < 1000000 * ~k~0); {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:52,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {2819#(<= (+ main_~i~0 1) (* main_~k~0 999997))} ~i~0 := ~i~0 + ~k~0; {2659#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:52,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {2819#(<= (+ main_~i~0 1) (* main_~k~0 999997))} assume !!(~i~0 < 1000000 * ~k~0); {2819#(<= (+ main_~i~0 1) (* main_~k~0 999997))} is VALID [2022-04-15 12:32:52,307 INFO L290 TraceCheckUtils]: 26: Hoare triple {2826#(<= (+ main_~i~0 1) (* main_~k~0 999996))} ~i~0 := ~i~0 + ~k~0; {2819#(<= (+ main_~i~0 1) (* main_~k~0 999997))} is VALID [2022-04-15 12:32:52,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {2826#(<= (+ main_~i~0 1) (* main_~k~0 999996))} assume !!(~i~0 < 1000000 * ~k~0); {2826#(<= (+ main_~i~0 1) (* main_~k~0 999996))} is VALID [2022-04-15 12:32:52,308 INFO L290 TraceCheckUtils]: 24: Hoare triple {2833#(<= (+ main_~i~0 1) (* main_~k~0 999995))} ~i~0 := ~i~0 + ~k~0; {2826#(<= (+ main_~i~0 1) (* main_~k~0 999996))} is VALID [2022-04-15 12:32:52,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {2833#(<= (+ main_~i~0 1) (* main_~k~0 999995))} assume !!(~i~0 < 1000000 * ~k~0); {2833#(<= (+ main_~i~0 1) (* main_~k~0 999995))} is VALID [2022-04-15 12:32:52,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {2840#(<= (+ main_~i~0 1) (* main_~k~0 999994))} ~i~0 := ~i~0 + ~k~0; {2833#(<= (+ main_~i~0 1) (* main_~k~0 999995))} is VALID [2022-04-15 12:32:52,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {2840#(<= (+ main_~i~0 1) (* main_~k~0 999994))} assume !!(~i~0 < 1000000 * ~k~0); {2840#(<= (+ main_~i~0 1) (* main_~k~0 999994))} is VALID [2022-04-15 12:32:52,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {2847#(<= (+ main_~i~0 1) (* main_~k~0 999993))} ~i~0 := ~i~0 + ~k~0; {2840#(<= (+ main_~i~0 1) (* main_~k~0 999994))} is VALID [2022-04-15 12:32:52,310 INFO L290 TraceCheckUtils]: 19: Hoare triple {2847#(<= (+ main_~i~0 1) (* main_~k~0 999993))} assume !!(~i~0 < 1000000 * ~k~0); {2847#(<= (+ main_~i~0 1) (* main_~k~0 999993))} is VALID [2022-04-15 12:32:52,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {2854#(<= (+ main_~i~0 1) (* 999992 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {2847#(<= (+ main_~i~0 1) (* main_~k~0 999993))} is VALID [2022-04-15 12:32:52,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {2854#(<= (+ main_~i~0 1) (* 999992 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {2854#(<= (+ main_~i~0 1) (* 999992 main_~k~0))} is VALID [2022-04-15 12:32:52,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {2861#(<= (+ main_~i~0 1) (* main_~k~0 999991))} ~i~0 := ~i~0 + ~k~0; {2854#(<= (+ main_~i~0 1) (* 999992 main_~k~0))} is VALID [2022-04-15 12:32:52,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {2861#(<= (+ main_~i~0 1) (* main_~k~0 999991))} assume !!(~i~0 < 1000000 * ~k~0); {2861#(<= (+ main_~i~0 1) (* main_~k~0 999991))} is VALID [2022-04-15 12:32:52,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {2868#(<= (+ main_~i~0 1) (* main_~k~0 999990))} ~i~0 := ~i~0 + ~k~0; {2861#(<= (+ main_~i~0 1) (* main_~k~0 999991))} is VALID [2022-04-15 12:32:52,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {2868#(<= (+ main_~i~0 1) (* main_~k~0 999990))} assume !!(~i~0 < 1000000 * ~k~0); {2868#(<= (+ main_~i~0 1) (* main_~k~0 999990))} is VALID [2022-04-15 12:32:52,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {2875#(<= (+ main_~i~0 1) (* main_~k~0 999989))} ~i~0 := ~i~0 + ~k~0; {2868#(<= (+ main_~i~0 1) (* main_~k~0 999990))} is VALID [2022-04-15 12:32:52,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {2875#(<= (+ main_~i~0 1) (* main_~k~0 999989))} assume !!(~i~0 < 1000000 * ~k~0); {2875#(<= (+ main_~i~0 1) (* main_~k~0 999989))} is VALID [2022-04-15 12:32:52,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {2882#(<= (+ main_~i~0 1) (* main_~k~0 999988))} ~i~0 := ~i~0 + ~k~0; {2875#(<= (+ main_~i~0 1) (* main_~k~0 999989))} is VALID [2022-04-15 12:32:52,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {2882#(<= (+ main_~i~0 1) (* main_~k~0 999988))} assume !!(~i~0 < 1000000 * ~k~0); {2882#(<= (+ main_~i~0 1) (* main_~k~0 999988))} is VALID [2022-04-15 12:32:52,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {2889#(<= (+ main_~i~0 1) (* main_~k~0 999987))} ~i~0 := ~i~0 + ~k~0; {2882#(<= (+ main_~i~0 1) (* main_~k~0 999988))} is VALID [2022-04-15 12:32:52,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {2893#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999987)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 1000000)))} assume !!(~i~0 < 1000000 * ~k~0); {2889#(<= (+ main_~i~0 1) (* main_~k~0 999987))} is VALID [2022-04-15 12:32:52,316 INFO L290 TraceCheckUtils]: 6: Hoare triple {2642#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {2893#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999987)) (div (+ (- 1) (* (- 1) main_~i~0)) (- 1000000)))} is VALID [2022-04-15 12:32:52,316 INFO L290 TraceCheckUtils]: 5: Hoare triple {2642#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L272 TraceCheckUtils]: 4: Hoare triple {2642#true} call #t~ret2 := main(); {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2642#true} {2642#true} #55#return; {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {2642#true} assume true; {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {2642#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {2642#true} call ULTIMATE.init(); {2642#true} is VALID [2022-04-15 12:32:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:52,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052188086] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:52,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 45 [2022-04-15 12:32:52,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:52,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [355378788] [2022-04-15 12:32:52,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [355378788] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:52,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:52,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 12:32:52,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440157784] [2022-04-15 12:32:52,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:52,318 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:32:52,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:52,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:52,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:52,348 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 12:32:52,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:52,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 12:32:52,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=1615, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 12:32:52,350 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,552 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-04-15 12:32:53,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 12:32:53,552 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-15 12:32:53,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:53,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-15 12:32:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 49 transitions. [2022-04-15 12:32:53,562 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 49 transitions. [2022-04-15 12:32:53,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:53,605 INFO L225 Difference]: With dead ends: 48 [2022-04-15 12:32:53,605 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 12:32:53,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=801, Invalid=2859, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 12:32:53,607 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:53,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 89 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:53,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 12:32:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-15 12:32:53,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:53,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,668 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,669 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,670 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:32:53,670 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:32:53,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:53,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:53,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:32:53,671 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-15 12:32:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:53,672 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2022-04-15 12:32:53,672 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:32:53,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:53,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:53,672 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:53,672 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2022-04-15 12:32:53,673 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2022-04-15 12:32:53,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:53,674 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2022-04-15 12:32:53,674 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:53,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 43 transitions. [2022-04-15 12:32:53,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:53,725 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2022-04-15 12:32:53,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:32:53,725 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:53,726 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:53,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:53,931 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16 [2022-04-15 12:32:53,932 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:53,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:53,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 17 times [2022-04-15 12:32:53,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:53,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046403378] [2022-04-15 12:32:53,993 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:53,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1035493745, now seen corresponding path program 1 times [2022-04-15 12:32:53,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:53,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29512542] [2022-04-15 12:32:53,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:53,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:54,002 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:54,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:54,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2097337385, now seen corresponding path program 18 times [2022-04-15 12:32:54,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:54,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762882919] [2022-04-15 12:32:54,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:54,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:54,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:54,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3217#true} is VALID [2022-04-15 12:32:54,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {3217#true} assume true; {3217#true} is VALID [2022-04-15 12:32:54,294 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3217#true} {3217#true} #55#return; {3217#true} is VALID [2022-04-15 12:32:54,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {3217#true} call ULTIMATE.init(); {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:54,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3217#true} is VALID [2022-04-15 12:32:54,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {3217#true} assume true; {3217#true} is VALID [2022-04-15 12:32:54,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3217#true} {3217#true} #55#return; {3217#true} is VALID [2022-04-15 12:32:54,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {3217#true} call #t~ret2 := main(); {3217#true} is VALID [2022-04-15 12:32:54,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {3217#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3217#true} is VALID [2022-04-15 12:32:54,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {3217#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {3222#(= main_~i~0 0)} is VALID [2022-04-15 12:32:54,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {3222#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {3222#(= main_~i~0 0)} is VALID [2022-04-15 12:32:54,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {3222#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {3223#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:54,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {3223#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {3223#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:54,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {3223#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {3224#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:54,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {3224#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {3224#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:54,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {3224#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {3225#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:54,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {3225#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {3225#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:54,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {3225#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {3226#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:54,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {3226#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {3226#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:54,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {3226#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {3227#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:54,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3227#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:54,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {3227#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3228#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:54,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {3228#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {3228#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:54,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {3228#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {3229#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:54,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {3229#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3229#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:54,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {3229#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3230#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:54,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {3230#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {3230#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:54,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {3230#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {3231#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:54,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {3231#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {3231#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:54,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {3231#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {3232#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:54,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {3232#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {3232#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:54,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {3232#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {3233#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:54,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {3233#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {3233#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:54,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {3233#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {3234#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:54,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {3234#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {3234#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:54,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {3234#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {3235#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:54,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {3235#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {3236#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:54,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {3236#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:54,307 INFO L290 TraceCheckUtils]: 35: Hoare triple {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:54,307 INFO L290 TraceCheckUtils]: 36: Hoare triple {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3238#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:54,308 INFO L290 TraceCheckUtils]: 37: Hoare triple {3238#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {3218#false} is VALID [2022-04-15 12:32:54,308 INFO L272 TraceCheckUtils]: 38: Hoare triple {3218#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3218#false} is VALID [2022-04-15 12:32:54,308 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#false} ~cond := #in~cond; {3218#false} is VALID [2022-04-15 12:32:54,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {3218#false} assume 0 == ~cond; {3218#false} is VALID [2022-04-15 12:32:54,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {3218#false} assume !false; {3218#false} is VALID [2022-04-15 12:32:54,308 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:54,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:54,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762882919] [2022-04-15 12:32:54,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762882919] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:54,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [323200468] [2022-04-15 12:32:54,309 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:32:54,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:54,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:54,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:54,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 12:32:54,346 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 12:32:54,346 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:54,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 12:32:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:54,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:54,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {3217#true} call ULTIMATE.init(); {3217#true} is VALID [2022-04-15 12:32:54,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {3217#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3217#true} is VALID [2022-04-15 12:32:54,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {3217#true} assume true; {3217#true} is VALID [2022-04-15 12:32:54,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3217#true} {3217#true} #55#return; {3217#true} is VALID [2022-04-15 12:32:54,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {3217#true} call #t~ret2 := main(); {3217#true} is VALID [2022-04-15 12:32:54,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {3217#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3217#true} is VALID [2022-04-15 12:32:54,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {3217#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {3261#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:54,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {3261#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {3261#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:54,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {3261#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {3223#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:54,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {3223#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {3223#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:54,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {3223#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {3224#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:54,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {3224#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {3224#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:54,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {3224#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {3225#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:54,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {3225#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {3225#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:54,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {3225#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {3226#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:54,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {3226#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {3226#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:54,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {3226#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {3227#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:54,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {3227#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3227#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:54,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {3227#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3228#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:54,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {3228#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {3228#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:54,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {3228#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {3229#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:54,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {3229#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3229#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:54,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {3229#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3230#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:54,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {3230#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {3230#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:54,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {3230#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {3231#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:54,736 INFO L290 TraceCheckUtils]: 25: Hoare triple {3231#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {3231#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:54,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {3231#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {3232#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:54,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {3232#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {3232#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:54,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {3232#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {3233#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:54,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {3233#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {3233#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:54,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {3233#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {3234#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:54,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {3234#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {3234#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:54,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {3234#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {3235#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:54,740 INFO L290 TraceCheckUtils]: 33: Hoare triple {3235#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {3235#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:54,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {3235#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {3346#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:32:54,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {3346#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {3350#(and (<= main_~i~0 (* main_~k~0 14)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:54,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {3350#(and (<= main_~i~0 (* main_~k~0 14)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {3354#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 15)))} is VALID [2022-04-15 12:32:54,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {3354#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 15)))} assume !(~i~0 < 1000000 * ~k~0); {3218#false} is VALID [2022-04-15 12:32:54,742 INFO L272 TraceCheckUtils]: 38: Hoare triple {3218#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3218#false} is VALID [2022-04-15 12:32:54,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#false} ~cond := #in~cond; {3218#false} is VALID [2022-04-15 12:32:54,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {3218#false} assume 0 == ~cond; {3218#false} is VALID [2022-04-15 12:32:54,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {3218#false} assume !false; {3218#false} is VALID [2022-04-15 12:32:54,742 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:54,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:55,646 INFO L290 TraceCheckUtils]: 41: Hoare triple {3218#false} assume !false; {3218#false} is VALID [2022-04-15 12:32:55,647 INFO L290 TraceCheckUtils]: 40: Hoare triple {3218#false} assume 0 == ~cond; {3218#false} is VALID [2022-04-15 12:32:55,647 INFO L290 TraceCheckUtils]: 39: Hoare triple {3218#false} ~cond := #in~cond; {3218#false} is VALID [2022-04-15 12:32:55,647 INFO L272 TraceCheckUtils]: 38: Hoare triple {3218#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3218#false} is VALID [2022-04-15 12:32:55,648 INFO L290 TraceCheckUtils]: 37: Hoare triple {3238#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {3218#false} is VALID [2022-04-15 12:32:55,648 INFO L290 TraceCheckUtils]: 36: Hoare triple {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3238#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:55,649 INFO L290 TraceCheckUtils]: 35: Hoare triple {3388#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {3237#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:55,649 INFO L290 TraceCheckUtils]: 34: Hoare triple {3392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {3388#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:55,650 INFO L290 TraceCheckUtils]: 33: Hoare triple {3392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {3392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:55,650 INFO L290 TraceCheckUtils]: 32: Hoare triple {3399#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {3392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:55,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {3399#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {3399#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:55,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {3406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {3399#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:55,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {3406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {3406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:55,652 INFO L290 TraceCheckUtils]: 28: Hoare triple {3413#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {3406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:55,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {3413#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {3413#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {3420#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {3413#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,653 INFO L290 TraceCheckUtils]: 25: Hoare triple {3420#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {3420#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:55,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {3427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {3420#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:55,654 INFO L290 TraceCheckUtils]: 23: Hoare triple {3427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {3427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:55,655 INFO L290 TraceCheckUtils]: 22: Hoare triple {3434#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {3427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:55,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {3434#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {3434#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,656 INFO L290 TraceCheckUtils]: 20: Hoare triple {3441#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {3434#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,656 INFO L290 TraceCheckUtils]: 19: Hoare triple {3441#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {3441#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:55,656 INFO L290 TraceCheckUtils]: 18: Hoare triple {3448#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {3441#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:55,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {3448#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {3448#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:55,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {3455#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {3448#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:55,658 INFO L290 TraceCheckUtils]: 15: Hoare triple {3455#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {3455#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {3462#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {3455#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {3462#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {3462#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {3469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {3462#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {3469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {3469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:32:55,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {3476#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {3469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:32:55,660 INFO L290 TraceCheckUtils]: 9: Hoare triple {3476#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {3476#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3483#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999985)) 1)} ~i~0 := ~i~0 + ~k~0; {3476#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {3483#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999985)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {3483#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999985)) 1)} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {3217#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {3483#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999985)) 1)} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {3217#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3217#true} is VALID [2022-04-15 12:32:55,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {3217#true} call #t~ret2 := main(); {3217#true} is VALID [2022-04-15 12:32:55,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3217#true} {3217#true} #55#return; {3217#true} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {3217#true} assume true; {3217#true} is VALID [2022-04-15 12:32:55,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {3217#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3217#true} is VALID [2022-04-15 12:32:55,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {3217#true} call ULTIMATE.init(); {3217#true} is VALID [2022-04-15 12:32:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:55,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [323200468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:55,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:55,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 39 [2022-04-15 12:32:55,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:55,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046403378] [2022-04-15 12:32:55,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046403378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:55,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:55,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 12:32:55,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557327700] [2022-04-15 12:32:55,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:32:55,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:55,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:55,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:55,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 12:32:55,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:55,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 12:32:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=1037, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 12:32:55,695 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:56,956 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-04-15 12:32:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 12:32:56,956 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 12:32:56,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:32:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-15 12:32:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:56,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 53 transitions. [2022-04-15 12:32:56,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 53 transitions. [2022-04-15 12:32:57,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:57,022 INFO L225 Difference]: With dead ends: 52 [2022-04-15 12:32:57,022 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:32:57,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1050, Invalid=2142, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 12:32:57,024 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 55 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:32:57,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 99 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:32:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:32:57,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-15 12:32:57,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:32:57,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:57,090 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:57,091 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:57,092 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:32:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:32:57,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:57,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:57,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:32:57,093 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-15 12:32:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:32:57,094 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2022-04-15 12:32:57,094 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:32:57,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:32:57,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:32:57,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:32:57,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:32:57,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0238095238095237) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:57,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2022-04-15 12:32:57,096 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2022-04-15 12:32:57,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:32:57,096 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2022-04-15 12:32:57,096 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.9) internal successors, (38), 19 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:57,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2022-04-15 12:32:57,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2022-04-15 12:32:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 12:32:57,150 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:32:57,150 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:32:57,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 12:32:57,351 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 12:32:57,351 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:32:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:32:57,352 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 19 times [2022-04-15 12:32:57,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:57,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [494000579] [2022-04-15 12:32:57,412 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:32:57,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1094599089, now seen corresponding path program 1 times [2022-04-15 12:32:57,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:57,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651541043] [2022-04-15 12:32:57,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:57,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:57,419 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:32:57,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:32:57,423 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:32:57,423 INFO L85 PathProgramCache]: Analyzing trace with hash -95181677, now seen corresponding path program 20 times [2022-04-15 12:32:57,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:32:57,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236691306] [2022-04-15 12:32:57,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:32:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:32:57,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:57,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:32:57,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:57,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {3862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3838#true} is VALID [2022-04-15 12:32:57,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:32:57,708 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3838#true} {3838#true} #55#return; {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L272 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:32:57,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {3862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #55#return; {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret2 := main(); {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3838#true} is VALID [2022-04-15 12:32:57,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {3838#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {3843#(= main_~i~0 0)} is VALID [2022-04-15 12:32:57,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {3843#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {3843#(= main_~i~0 0)} is VALID [2022-04-15 12:32:57,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {3843#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {3844#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:57,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {3844#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {3844#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:57,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {3844#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {3845#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:57,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {3845#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:57,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {3845#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {3846#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:57,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {3846#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {3846#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:57,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {3846#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {3847#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:57,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {3847#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {3847#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:57,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {3848#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:57,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3848#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:57,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3849#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:57,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {3849#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:57,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {3849#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {3850#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:57,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3850#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:57,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3851#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:57,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {3851#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {3851#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:57,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {3851#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {3852#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:57,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {3852#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:57,722 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {3853#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:57,723 INFO L290 TraceCheckUtils]: 27: Hoare triple {3853#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {3853#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:57,723 INFO L290 TraceCheckUtils]: 28: Hoare triple {3853#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {3854#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:57,723 INFO L290 TraceCheckUtils]: 29: Hoare triple {3854#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {3854#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:57,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {3854#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {3855#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:57,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {3855#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {3855#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:57,725 INFO L290 TraceCheckUtils]: 32: Hoare triple {3855#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {3856#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:57,725 INFO L290 TraceCheckUtils]: 33: Hoare triple {3856#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {3856#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:57,725 INFO L290 TraceCheckUtils]: 34: Hoare triple {3856#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {3857#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:32:57,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {3857#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {3857#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:32:57,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {3857#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {3858#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:32:57,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {3858#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {3859#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:32:57,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {3859#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:57,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:57,729 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:57,729 INFO L290 TraceCheckUtils]: 41: Hoare triple {3861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {3839#false} is VALID [2022-04-15 12:32:57,729 INFO L272 TraceCheckUtils]: 42: Hoare triple {3839#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3839#false} is VALID [2022-04-15 12:32:57,729 INFO L290 TraceCheckUtils]: 43: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2022-04-15 12:32:57,730 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2022-04-15 12:32:57,730 INFO L290 TraceCheckUtils]: 45: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2022-04-15 12:32:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:57,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:32:57,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236691306] [2022-04-15 12:32:57,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236691306] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:32:57,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835787984] [2022-04-15 12:32:57,730 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:32:57,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:32:57,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:32:57,733 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:32:57,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 12:32:57,770 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:32:57,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:32:57,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 12:32:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:32:57,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:32:58,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2022-04-15 12:32:58,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3838#true} is VALID [2022-04-15 12:32:58,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:32:58,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #55#return; {3838#true} is VALID [2022-04-15 12:32:58,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret2 := main(); {3838#true} is VALID [2022-04-15 12:32:58,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3838#true} is VALID [2022-04-15 12:32:58,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {3838#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {3884#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:58,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {3884#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {3884#(<= main_~i~0 0)} is VALID [2022-04-15 12:32:58,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {3884#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {3844#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:58,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {3844#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {3844#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:32:58,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {3844#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {3845#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:58,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {3845#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {3845#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:32:58,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {3845#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {3846#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:58,205 INFO L290 TraceCheckUtils]: 13: Hoare triple {3846#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {3846#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:32:58,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {3846#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {3847#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:58,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {3847#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {3847#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:32:58,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {3847#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {3848#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:58,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {3848#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3848#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:32:58,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {3848#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3849#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:58,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {3849#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {3849#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:32:58,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {3849#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {3850#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:58,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {3850#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {3850#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:32:58,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3851#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:58,212 INFO L290 TraceCheckUtils]: 23: Hoare triple {3851#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {3851#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:32:58,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {3851#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {3852#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:58,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {3852#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:32:58,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {3853#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:58,215 INFO L290 TraceCheckUtils]: 27: Hoare triple {3853#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {3853#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:32:58,215 INFO L290 TraceCheckUtils]: 28: Hoare triple {3853#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {3854#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:58,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {3854#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {3854#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:32:58,216 INFO L290 TraceCheckUtils]: 30: Hoare triple {3854#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {3855#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:58,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {3855#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {3855#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:32:58,217 INFO L290 TraceCheckUtils]: 32: Hoare triple {3855#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {3856#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:58,218 INFO L290 TraceCheckUtils]: 33: Hoare triple {3856#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {3856#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:32:58,218 INFO L290 TraceCheckUtils]: 34: Hoare triple {3856#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {3857#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:32:58,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {3857#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {3857#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:32:58,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {3857#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {3858#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:32:58,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {3858#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {3858#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:32:58,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {3858#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {3981#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:32:58,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {3981#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {3985#(and (<= main_~i~0 (* main_~k~0 16)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:32:58,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {3985#(and (<= main_~i~0 (* main_~k~0 16)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {3989#(and (<= main_~i~0 (* main_~k~0 17)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:32:58,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {3989#(and (<= main_~i~0 (* main_~k~0 17)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {3839#false} is VALID [2022-04-15 12:32:58,223 INFO L272 TraceCheckUtils]: 42: Hoare triple {3839#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3839#false} is VALID [2022-04-15 12:32:58,223 INFO L290 TraceCheckUtils]: 43: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2022-04-15 12:32:58,223 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2022-04-15 12:32:58,223 INFO L290 TraceCheckUtils]: 45: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2022-04-15 12:32:58,224 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:58,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:32:59,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {3839#false} assume !false; {3839#false} is VALID [2022-04-15 12:32:59,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {3839#false} assume 0 == ~cond; {3839#false} is VALID [2022-04-15 12:32:59,340 INFO L290 TraceCheckUtils]: 43: Hoare triple {3839#false} ~cond := #in~cond; {3839#false} is VALID [2022-04-15 12:32:59,340 INFO L272 TraceCheckUtils]: 42: Hoare triple {3839#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {3839#false} is VALID [2022-04-15 12:32:59,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {3861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {3839#false} is VALID [2022-04-15 12:32:59,341 INFO L290 TraceCheckUtils]: 40: Hoare triple {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {3861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:32:59,342 INFO L290 TraceCheckUtils]: 39: Hoare triple {4023#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {3860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:32:59,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {4027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {4023#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:32:59,343 INFO L290 TraceCheckUtils]: 37: Hoare triple {4027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {4027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:59,343 INFO L290 TraceCheckUtils]: 36: Hoare triple {4034#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {4027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:32:59,344 INFO L290 TraceCheckUtils]: 35: Hoare triple {4034#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {4034#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:59,344 INFO L290 TraceCheckUtils]: 34: Hoare triple {4041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {4034#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:32:59,345 INFO L290 TraceCheckUtils]: 33: Hoare triple {4041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {4041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:59,345 INFO L290 TraceCheckUtils]: 32: Hoare triple {4048#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:32:59,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {4048#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4048#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,346 INFO L290 TraceCheckUtils]: 30: Hoare triple {4055#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {4048#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,347 INFO L290 TraceCheckUtils]: 29: Hoare triple {4055#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {4055#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:59,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {4062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {4055#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:32:59,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {4062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {4062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:59,352 INFO L290 TraceCheckUtils]: 26: Hoare triple {4069#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:32:59,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {4069#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4069#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {4076#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {4069#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {4076#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {4076#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:59,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {4083#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {4076#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:32:59,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {4083#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {4083#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:59,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {4090#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4083#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:32:59,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {4090#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4090#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {4097#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4090#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {4097#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4097#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {4104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {4097#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {4104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {4104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:32:59,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {4111#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:32:59,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {4111#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4111#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {4118#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {4111#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:32:59,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {4118#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {4118#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:32:59,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {4125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {4118#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:32:59,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {4125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {4125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:32:59,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {4132#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999983)) 1)} ~i~0 := ~i~0 + ~k~0; {4125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:32:59,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {4132#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999983)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {4132#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999983)) 1)} is VALID [2022-04-15 12:32:59,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {3838#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {4132#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999983)) 1)} is VALID [2022-04-15 12:32:59,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {3838#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {3838#true} is VALID [2022-04-15 12:32:59,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {3838#true} call #t~ret2 := main(); {3838#true} is VALID [2022-04-15 12:32:59,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3838#true} {3838#true} #55#return; {3838#true} is VALID [2022-04-15 12:32:59,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {3838#true} assume true; {3838#true} is VALID [2022-04-15 12:32:59,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {3838#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {3838#true} is VALID [2022-04-15 12:32:59,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {3838#true} call ULTIMATE.init(); {3838#true} is VALID [2022-04-15 12:32:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:32:59,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835787984] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:32:59,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:32:59,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 43 [2022-04-15 12:32:59,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:32:59,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [494000579] [2022-04-15 12:32:59,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [494000579] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:32:59,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:32:59,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 12:32:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967087595] [2022-04-15 12:32:59,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:32:59,363 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:32:59,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:32:59,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:32:59,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:32:59,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 12:32:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:32:59,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 12:32:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=552, Invalid=1254, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 12:32:59,402 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,012 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-04-15 12:33:01,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 12:33:01,012 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2022-04-15 12:33:01,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:01,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 57 transitions. [2022-04-15 12:33:01,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 57 transitions. [2022-04-15 12:33:01,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 57 transitions. [2022-04-15 12:33:01,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:01,074 INFO L225 Difference]: With dead ends: 56 [2022-04-15 12:33:01,074 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 12:33:01,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1303, Invalid=2603, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:33:01,076 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:01,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 109 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:01,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 12:33:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-15 12:33:01,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:01,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,148 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,148 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,150 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:33:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:33:01,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:01,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:01,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:33:01,151 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-15 12:33:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:01,152 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-04-15 12:33:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:33:01,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:01,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:01,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:01,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0217391304347827) internal successors, (47), 46 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-04-15 12:33:01,153 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2022-04-15 12:33:01,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:01,154 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-04-15 12:33:01,154 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.9090909090909092) internal successors, (42), 21 states have internal predecessors, (42), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:01,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 51 transitions. [2022-04-15 12:33:01,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-04-15 12:33:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 12:33:01,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:01,219 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:01,235 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:01,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-15 12:33:01,423 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:01,424 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 21 times [2022-04-15 12:33:01,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:01,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527715757] [2022-04-15 12:33:01,483 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:01,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1153704433, now seen corresponding path program 1 times [2022-04-15 12:33:01,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:01,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861310804] [2022-04-15 12:33:01,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:01,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:01,491 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:01,496 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:01,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2080857935, now seen corresponding path program 22 times [2022-04-15 12:33:01,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:01,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800130274] [2022-04-15 12:33:01,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:01,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:01,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4515#true} is VALID [2022-04-15 12:33:01,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-15 12:33:01,965 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4515#true} {4515#true} #55#return; {4515#true} is VALID [2022-04-15 12:33:01,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:01,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {4541#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4515#true} is VALID [2022-04-15 12:33:01,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-15 12:33:01,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #55#return; {4515#true} is VALID [2022-04-15 12:33:01,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret2 := main(); {4515#true} is VALID [2022-04-15 12:33:01,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {4515#true} is VALID [2022-04-15 12:33:01,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {4515#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {4520#(= main_~i~0 0)} is VALID [2022-04-15 12:33:01,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {4520#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {4520#(= main_~i~0 0)} is VALID [2022-04-15 12:33:01,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {4520#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {4521#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:01,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {4521#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {4521#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:01,968 INFO L290 TraceCheckUtils]: 10: Hoare triple {4521#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {4522#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:01,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {4522#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {4522#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:01,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {4523#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:01,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {4523#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {4523#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:01,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {4523#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {4524#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:01,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {4524#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {4524#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:01,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {4524#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {4525#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:01,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {4525#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {4525#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:01,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {4525#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4526#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:01,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {4526#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {4526#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:01,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {4526#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {4527#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:01,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {4527#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {4527#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:01,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {4527#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4528#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:01,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {4528#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {4528#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:01,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {4528#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {4529#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:01,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {4529#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {4529#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:01,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {4529#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {4530#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:01,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {4530#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {4530#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:01,978 INFO L290 TraceCheckUtils]: 28: Hoare triple {4530#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {4531#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:01,978 INFO L290 TraceCheckUtils]: 29: Hoare triple {4531#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {4531#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:01,979 INFO L290 TraceCheckUtils]: 30: Hoare triple {4531#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {4532#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:01,979 INFO L290 TraceCheckUtils]: 31: Hoare triple {4532#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {4532#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:01,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {4532#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {4533#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:01,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {4533#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {4533#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:01,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {4533#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {4534#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:01,981 INFO L290 TraceCheckUtils]: 35: Hoare triple {4534#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {4534#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:01,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {4534#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {4535#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:01,982 INFO L290 TraceCheckUtils]: 37: Hoare triple {4535#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {4535#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:01,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {4535#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {4536#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:01,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {4536#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {4536#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:01,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {4536#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {4537#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:01,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {4537#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {4538#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:01,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {4538#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:01,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:01,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4540#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:01,988 INFO L290 TraceCheckUtils]: 45: Hoare triple {4540#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {4516#false} is VALID [2022-04-15 12:33:01,988 INFO L272 TraceCheckUtils]: 46: Hoare triple {4516#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {4516#false} is VALID [2022-04-15 12:33:01,988 INFO L290 TraceCheckUtils]: 47: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-15 12:33:01,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-15 12:33:01,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-15 12:33:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800130274] [2022-04-15 12:33:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800130274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905796549] [2022-04-15 12:33:01,989 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:01,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:01,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:01,990 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:01,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 12:33:02,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:02,035 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:02,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 12:33:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:02,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:02,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4515#true} is VALID [2022-04-15 12:33:02,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4515#true} is VALID [2022-04-15 12:33:02,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-15 12:33:02,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #55#return; {4515#true} is VALID [2022-04-15 12:33:02,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret2 := main(); {4515#true} is VALID [2022-04-15 12:33:02,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {4515#true} is VALID [2022-04-15 12:33:02,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {4515#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {4563#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:02,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {4563#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {4563#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:02,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {4563#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {4521#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:02,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {4521#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {4521#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:02,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {4521#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {4522#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:02,593 INFO L290 TraceCheckUtils]: 11: Hoare triple {4522#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {4522#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:02,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {4522#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {4523#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:02,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {4523#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {4523#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:02,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {4523#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {4524#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:02,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {4524#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {4524#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:02,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {4524#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {4525#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:02,595 INFO L290 TraceCheckUtils]: 17: Hoare triple {4525#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {4525#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:02,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {4525#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4526#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:02,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {4526#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {4526#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:02,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {4526#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {4527#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:02,597 INFO L290 TraceCheckUtils]: 21: Hoare triple {4527#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {4527#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:02,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {4527#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4528#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:02,598 INFO L290 TraceCheckUtils]: 23: Hoare triple {4528#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {4528#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:02,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {4528#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {4529#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:02,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {4529#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {4529#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:02,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {4529#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {4530#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:02,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {4530#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {4530#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:02,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {4530#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {4531#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:02,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {4531#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {4531#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:02,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {4531#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {4532#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:02,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {4532#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {4532#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:02,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {4532#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {4533#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:02,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {4533#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {4533#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:02,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {4533#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {4534#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:02,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {4534#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {4534#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:02,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {4534#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {4535#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:02,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {4535#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {4535#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:02,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {4535#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {4536#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:02,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {4536#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {4536#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:02,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {4536#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {4537#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:02,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {4537#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {4537#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:02,606 INFO L290 TraceCheckUtils]: 42: Hoare triple {4537#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {4672#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:02,606 INFO L290 TraceCheckUtils]: 43: Hoare triple {4672#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {4676#(and (<= main_~i~0 (* main_~k~0 18)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:02,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {4676#(and (<= main_~i~0 (* main_~k~0 18)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {4680#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 19 main_~k~0)))} is VALID [2022-04-15 12:33:02,608 INFO L290 TraceCheckUtils]: 45: Hoare triple {4680#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 19 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {4516#false} is VALID [2022-04-15 12:33:02,608 INFO L272 TraceCheckUtils]: 46: Hoare triple {4516#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {4516#false} is VALID [2022-04-15 12:33:02,608 INFO L290 TraceCheckUtils]: 47: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-15 12:33:02,608 INFO L290 TraceCheckUtils]: 48: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-15 12:33:02,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-15 12:33:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:03,830 INFO L290 TraceCheckUtils]: 49: Hoare triple {4516#false} assume !false; {4516#false} is VALID [2022-04-15 12:33:03,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {4516#false} assume 0 == ~cond; {4516#false} is VALID [2022-04-15 12:33:03,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {4516#false} ~cond := #in~cond; {4516#false} is VALID [2022-04-15 12:33:03,831 INFO L272 TraceCheckUtils]: 46: Hoare triple {4516#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {4516#false} is VALID [2022-04-15 12:33:03,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {4540#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {4516#false} is VALID [2022-04-15 12:33:03,836 INFO L290 TraceCheckUtils]: 44: Hoare triple {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {4540#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:03,836 INFO L290 TraceCheckUtils]: 43: Hoare triple {4714#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {4539#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:03,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {4718#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {4714#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:03,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {4718#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {4718#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:03,838 INFO L290 TraceCheckUtils]: 40: Hoare triple {4725#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {4718#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:03,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {4725#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {4725#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:03,840 INFO L290 TraceCheckUtils]: 38: Hoare triple {4732#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {4725#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:03,840 INFO L290 TraceCheckUtils]: 37: Hoare triple {4732#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {4732#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:03,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {4739#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4732#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:03,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {4739#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4739#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {4746#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {4739#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {4746#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {4746#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:03,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {4753#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {4746#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:03,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {4753#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {4753#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:03,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {4760#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4753#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:03,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {4760#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4760#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {4767#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {4760#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {4767#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {4767#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:03,846 INFO L290 TraceCheckUtils]: 26: Hoare triple {4774#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {4767#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:03,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {4774#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {4774#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:03,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {4781#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4774#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:03,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {4781#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4781#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,848 INFO L290 TraceCheckUtils]: 22: Hoare triple {4788#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4781#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {4788#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4788#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,849 INFO L290 TraceCheckUtils]: 20: Hoare triple {4795#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {4788#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {4795#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {4795#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:03,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {4802#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4795#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:03,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {4802#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4802#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {4809#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {4802#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {4809#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {4809#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:03,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {4816#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {4809#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:03,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {4816#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {4816#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:03,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {4823#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {4816#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:03,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {4823#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {4823#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {4830#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {4823#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:03,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {4830#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {4830#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:03,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {4837#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999981)) 1)} ~i~0 := ~i~0 + ~k~0; {4830#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:03,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {4837#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999981)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {4837#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999981)) 1)} is VALID [2022-04-15 12:33:03,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {4515#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {4837#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999981)) 1)} is VALID [2022-04-15 12:33:03,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {4515#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {4515#true} is VALID [2022-04-15 12:33:03,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {4515#true} call #t~ret2 := main(); {4515#true} is VALID [2022-04-15 12:33:03,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4515#true} {4515#true} #55#return; {4515#true} is VALID [2022-04-15 12:33:03,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {4515#true} assume true; {4515#true} is VALID [2022-04-15 12:33:03,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {4515#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {4515#true} is VALID [2022-04-15 12:33:03,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {4515#true} call ULTIMATE.init(); {4515#true} is VALID [2022-04-15 12:33:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:03,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905796549] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:03,872 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:03,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 47 [2022-04-15 12:33:03,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:03,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527715757] [2022-04-15 12:33:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527715757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:03,873 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:03,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 12:33:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272868592] [2022-04-15 12:33:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:03,873 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:33:03,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:03,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:03,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:03,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 12:33:03,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:03,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 12:33:03,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=1491, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 12:33:03,924 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:05,933 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-04-15 12:33:05,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 12:33:05,933 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-04-15 12:33:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:05,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-15 12:33:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 61 transitions. [2022-04-15 12:33:05,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 61 transitions. [2022-04-15 12:33:06,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:06,004 INFO L225 Difference]: With dead ends: 60 [2022-04-15 12:33:06,004 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 12:33:06,005 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1584, Invalid=3108, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 12:33:06,005 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:06,005 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 119 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 12:33:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-04-15 12:33:06,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:06,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:06,099 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:06,099 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:06,100 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:33:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:33:06,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:06,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:06,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:33:06,101 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 55 states. [2022-04-15 12:33:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:06,102 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-04-15 12:33:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:33:06,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:06,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:06,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:06,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:06,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-04-15 12:33:06,103 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2022-04-15 12:33:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:06,103 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-04-15 12:33:06,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 23 states have internal predecessors, (46), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:06,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 55 transitions. [2022-04-15 12:33:06,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:06,184 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-04-15 12:33:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 12:33:06,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:06,185 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:06,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:06,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21,SelfDestructingSolverStorable22 [2022-04-15 12:33:06,385 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:06,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 23 times [2022-04-15 12:33:06,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:06,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [904334066] [2022-04-15 12:33:06,445 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:06,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1212809777, now seen corresponding path program 1 times [2022-04-15 12:33:06,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:06,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635112165] [2022-04-15 12:33:06,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:06,454 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:06,459 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:06,459 INFO L85 PathProgramCache]: Analyzing trace with hash 866606091, now seen corresponding path program 24 times [2022-04-15 12:33:06,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:06,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144641278] [2022-04-15 12:33:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:06,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {5276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5248#true} is VALID [2022-04-15 12:33:06,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#true} assume true; {5248#true} is VALID [2022-04-15 12:33:06,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5248#true} {5248#true} #55#return; {5248#true} is VALID [2022-04-15 12:33:06,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {5248#true} call ULTIMATE.init(); {5276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:06,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {5276#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5248#true} is VALID [2022-04-15 12:33:06,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {5248#true} assume true; {5248#true} is VALID [2022-04-15 12:33:06,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5248#true} {5248#true} #55#return; {5248#true} is VALID [2022-04-15 12:33:06,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {5248#true} call #t~ret2 := main(); {5248#true} is VALID [2022-04-15 12:33:06,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {5248#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {5248#true} is VALID [2022-04-15 12:33:06,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {5248#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {5253#(= main_~i~0 0)} is VALID [2022-04-15 12:33:06,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {5253#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {5253#(= main_~i~0 0)} is VALID [2022-04-15 12:33:06,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {5253#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {5254#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:06,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {5254#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {5254#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:06,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {5254#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {5255#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:06,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {5255#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {5255#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:06,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {5256#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:06,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {5256#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {5256#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:06,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {5256#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {5257#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:06,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {5257#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:06,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {5258#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:06,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {5258#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5258#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:06,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {5258#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5259#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:06,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {5259#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:06,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {5260#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:06,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {5260#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5260#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:06,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {5260#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5261#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:06,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {5261#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {5261#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:06,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {5261#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {5262#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:06,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {5262#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {5262#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:06,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {5262#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {5263#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:06,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {5263#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {5263#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:06,971 INFO L290 TraceCheckUtils]: 28: Hoare triple {5263#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {5264#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:06,971 INFO L290 TraceCheckUtils]: 29: Hoare triple {5264#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {5264#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:06,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {5264#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {5265#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:06,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {5265#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {5265#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:06,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {5265#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {5266#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:06,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {5266#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {5266#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:06,974 INFO L290 TraceCheckUtils]: 34: Hoare triple {5266#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {5267#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:06,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {5267#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {5267#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:06,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {5267#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {5268#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:06,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {5268#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {5268#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:06,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {5268#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {5269#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:06,976 INFO L290 TraceCheckUtils]: 39: Hoare triple {5269#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {5269#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:06,976 INFO L290 TraceCheckUtils]: 40: Hoare triple {5269#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {5270#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:06,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {5270#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {5270#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:06,977 INFO L290 TraceCheckUtils]: 42: Hoare triple {5270#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {5271#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:06,977 INFO L290 TraceCheckUtils]: 43: Hoare triple {5271#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {5271#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:06,978 INFO L290 TraceCheckUtils]: 44: Hoare triple {5271#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {5272#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:06,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {5272#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5273#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:06,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {5273#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:06,980 INFO L290 TraceCheckUtils]: 47: Hoare triple {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:06,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5275#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:06,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {5275#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {5249#false} is VALID [2022-04-15 12:33:06,982 INFO L272 TraceCheckUtils]: 50: Hoare triple {5249#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {5249#false} is VALID [2022-04-15 12:33:06,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {5249#false} ~cond := #in~cond; {5249#false} is VALID [2022-04-15 12:33:06,982 INFO L290 TraceCheckUtils]: 52: Hoare triple {5249#false} assume 0 == ~cond; {5249#false} is VALID [2022-04-15 12:33:06,982 INFO L290 TraceCheckUtils]: 53: Hoare triple {5249#false} assume !false; {5249#false} is VALID [2022-04-15 12:33:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:06,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144641278] [2022-04-15 12:33:06,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144641278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:06,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257060418] [2022-04-15 12:33:06,983 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:06,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:06,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:06,984 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:06,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 12:33:07,026 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 12:33:07,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:07,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 12:33:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:07,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:07,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {5248#true} call ULTIMATE.init(); {5248#true} is VALID [2022-04-15 12:33:07,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5248#true} is VALID [2022-04-15 12:33:07,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {5248#true} assume true; {5248#true} is VALID [2022-04-15 12:33:07,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5248#true} {5248#true} #55#return; {5248#true} is VALID [2022-04-15 12:33:07,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {5248#true} call #t~ret2 := main(); {5248#true} is VALID [2022-04-15 12:33:07,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {5248#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {5248#true} is VALID [2022-04-15 12:33:07,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {5248#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {5298#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:07,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {5298#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {5298#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:07,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {5298#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {5254#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:07,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {5254#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {5254#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:07,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {5254#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {5255#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:07,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {5255#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {5255#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:07,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {5255#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {5256#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:07,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {5256#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {5256#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:07,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5256#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {5257#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:07,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {5257#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {5257#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:07,608 INFO L290 TraceCheckUtils]: 16: Hoare triple {5257#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {5258#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:07,608 INFO L290 TraceCheckUtils]: 17: Hoare triple {5258#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5258#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:07,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {5258#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5259#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:07,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {5259#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {5259#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:07,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {5259#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {5260#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:07,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {5260#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5260#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:07,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {5260#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5261#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:07,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {5261#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {5261#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:07,612 INFO L290 TraceCheckUtils]: 24: Hoare triple {5261#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {5262#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:07,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {5262#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {5262#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:07,613 INFO L290 TraceCheckUtils]: 26: Hoare triple {5262#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {5263#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:07,613 INFO L290 TraceCheckUtils]: 27: Hoare triple {5263#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {5263#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:07,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {5263#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {5264#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:07,615 INFO L290 TraceCheckUtils]: 29: Hoare triple {5264#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {5264#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:07,615 INFO L290 TraceCheckUtils]: 30: Hoare triple {5264#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {5265#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:07,616 INFO L290 TraceCheckUtils]: 31: Hoare triple {5265#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {5265#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:07,616 INFO L290 TraceCheckUtils]: 32: Hoare triple {5265#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {5266#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:07,617 INFO L290 TraceCheckUtils]: 33: Hoare triple {5266#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {5266#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:07,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {5266#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {5267#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:07,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {5267#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {5267#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:07,618 INFO L290 TraceCheckUtils]: 36: Hoare triple {5267#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {5268#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:07,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {5268#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {5268#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:07,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {5268#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {5269#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:07,620 INFO L290 TraceCheckUtils]: 39: Hoare triple {5269#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {5269#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:07,620 INFO L290 TraceCheckUtils]: 40: Hoare triple {5269#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {5270#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:07,621 INFO L290 TraceCheckUtils]: 41: Hoare triple {5270#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {5270#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:07,621 INFO L290 TraceCheckUtils]: 42: Hoare triple {5270#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {5271#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:07,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {5271#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {5271#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:07,622 INFO L290 TraceCheckUtils]: 44: Hoare triple {5271#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {5272#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:07,623 INFO L290 TraceCheckUtils]: 45: Hoare triple {5272#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {5272#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:07,623 INFO L290 TraceCheckUtils]: 46: Hoare triple {5272#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5419#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:07,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {5419#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {5423#(and (<= main_~i~0 (* main_~k~0 20)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:07,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {5423#(and (<= main_~i~0 (* main_~k~0 20)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {5427#(and (<= main_~i~0 (* main_~k~0 21)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:33:07,626 INFO L290 TraceCheckUtils]: 49: Hoare triple {5427#(and (<= main_~i~0 (* main_~k~0 21)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {5249#false} is VALID [2022-04-15 12:33:07,626 INFO L272 TraceCheckUtils]: 50: Hoare triple {5249#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {5249#false} is VALID [2022-04-15 12:33:07,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {5249#false} ~cond := #in~cond; {5249#false} is VALID [2022-04-15 12:33:07,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {5249#false} assume 0 == ~cond; {5249#false} is VALID [2022-04-15 12:33:07,626 INFO L290 TraceCheckUtils]: 53: Hoare triple {5249#false} assume !false; {5249#false} is VALID [2022-04-15 12:33:07,627 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:07,627 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:09,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {5249#false} assume !false; {5249#false} is VALID [2022-04-15 12:33:09,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {5249#false} assume 0 == ~cond; {5249#false} is VALID [2022-04-15 12:33:09,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {5249#false} ~cond := #in~cond; {5249#false} is VALID [2022-04-15 12:33:09,092 INFO L272 TraceCheckUtils]: 50: Hoare triple {5249#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {5249#false} is VALID [2022-04-15 12:33:09,094 INFO L290 TraceCheckUtils]: 49: Hoare triple {5275#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {5249#false} is VALID [2022-04-15 12:33:09,095 INFO L290 TraceCheckUtils]: 48: Hoare triple {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {5275#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:09,095 INFO L290 TraceCheckUtils]: 47: Hoare triple {5461#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {5274#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:09,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {5465#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {5461#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:09,096 INFO L290 TraceCheckUtils]: 45: Hoare triple {5465#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {5465#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:09,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {5472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {5465#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:09,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {5472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {5472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:09,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {5479#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {5472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:09,098 INFO L290 TraceCheckUtils]: 41: Hoare triple {5479#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {5479#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:09,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {5486#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5479#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:09,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {5486#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5486#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {5493#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {5486#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,100 INFO L290 TraceCheckUtils]: 37: Hoare triple {5493#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {5493#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:09,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {5500#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {5493#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:09,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {5500#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {5500#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:09,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {5507#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5500#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:09,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {5507#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5507#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {5514#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {5507#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {5514#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {5514#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:09,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {5521#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {5514#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:09,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {5521#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {5521#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:09,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {5528#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5521#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:09,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {5528#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5528#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {5535#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5528#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {5535#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5535#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {5542#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {5535#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {5542#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {5542#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:09,112 INFO L290 TraceCheckUtils]: 22: Hoare triple {5549#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5542#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:09,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {5549#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5549#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {5556#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {5549#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,113 INFO L290 TraceCheckUtils]: 19: Hoare triple {5556#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {5556#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:09,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {5563#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {5556#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:09,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {5563#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {5563#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:09,114 INFO L290 TraceCheckUtils]: 16: Hoare triple {5570#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5563#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:09,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {5570#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5570#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,115 INFO L290 TraceCheckUtils]: 14: Hoare triple {5577#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {5570#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {5577#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {5577#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:09,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {5577#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:09,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {5584#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:09,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {5591#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {5584#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:09,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {5591#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {5591#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {5598#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999979)) 1)} ~i~0 := ~i~0 + ~k~0; {5591#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {5598#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999979)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {5598#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999979)) 1)} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {5248#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {5598#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999979)) 1)} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {5248#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {5248#true} is VALID [2022-04-15 12:33:09,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {5248#true} call #t~ret2 := main(); {5248#true} is VALID [2022-04-15 12:33:09,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5248#true} {5248#true} #55#return; {5248#true} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {5248#true} assume true; {5248#true} is VALID [2022-04-15 12:33:09,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {5248#true} is VALID [2022-04-15 12:33:09,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {5248#true} call ULTIMATE.init(); {5248#true} is VALID [2022-04-15 12:33:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:09,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257060418] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:09,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:09,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 51 [2022-04-15 12:33:09,119 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:09,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [904334066] [2022-04-15 12:33:09,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [904334066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:09,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:09,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 12:33:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152901076] [2022-04-15 12:33:09,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:33:09,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:09,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:09,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:09,169 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 12:33:09,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:09,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 12:33:09,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=802, Invalid=1748, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 12:33:09,170 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:11,842 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2022-04-15 12:33:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 12:33:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 12:33:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:11,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:11,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 65 transitions. [2022-04-15 12:33:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:11,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 65 transitions. [2022-04-15 12:33:11,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 65 transitions. [2022-04-15 12:33:11,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:11,925 INFO L225 Difference]: With dead ends: 64 [2022-04-15 12:33:11,926 INFO L226 Difference]: Without dead ends: 59 [2022-04-15 12:33:11,927 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1893, Invalid=3657, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:33:11,927 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:11,927 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 129 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 12:33:11,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-15 12:33:12,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-04-15 12:33:12,021 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:12,022 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,022 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,022 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,023 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 12:33:12,023 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:33:12,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:33:12,024 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 59 states. [2022-04-15 12:33:12,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:12,025 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-04-15 12:33:12,025 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:33:12,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:12,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:12,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:12,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2022-04-15 12:33:12,026 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2022-04-15 12:33:12,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:12,027 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2022-04-15 12:33:12,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.9230769230769231) internal successors, (50), 25 states have internal predecessors, (50), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:12,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 59 transitions. [2022-04-15 12:33:12,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:12,099 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2022-04-15 12:33:12,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 12:33:12,099 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:12,099 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:12,115 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:12,303 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23,SelfDestructingSolverStorable24 [2022-04-15 12:33:12,303 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:12,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 25 times [2022-04-15 12:33:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:12,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2078210476] [2022-04-15 12:33:12,364 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1271915121, now seen corresponding path program 1 times [2022-04-15 12:33:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:12,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247286227] [2022-04-15 12:33:12,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:12,371 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:12,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:12,374 INFO L85 PathProgramCache]: Analyzing trace with hash -314402105, now seen corresponding path program 26 times [2022-04-15 12:33:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:12,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759255893] [2022-04-15 12:33:12,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:12,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {6067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6037#true} is VALID [2022-04-15 12:33:12,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {6037#true} assume true; {6037#true} is VALID [2022-04-15 12:33:12,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6037#true} {6037#true} #55#return; {6037#true} is VALID [2022-04-15 12:33:12,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {6037#true} call ULTIMATE.init(); {6067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:12,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {6067#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6037#true} is VALID [2022-04-15 12:33:12,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {6037#true} assume true; {6037#true} is VALID [2022-04-15 12:33:12,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6037#true} {6037#true} #55#return; {6037#true} is VALID [2022-04-15 12:33:12,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {6037#true} call #t~ret2 := main(); {6037#true} is VALID [2022-04-15 12:33:12,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {6037#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6037#true} is VALID [2022-04-15 12:33:12,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {6037#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {6042#(= main_~i~0 0)} is VALID [2022-04-15 12:33:12,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {6042#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {6042#(= main_~i~0 0)} is VALID [2022-04-15 12:33:12,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {6042#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {6043#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:12,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {6043#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {6043#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:12,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {6043#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {6044#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:12,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {6044#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:12,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {6044#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {6045#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:12,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {6045#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {6045#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:12,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {6045#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {6046#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:12,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {6046#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {6046#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:12,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {6046#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {6047#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:12,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {6047#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6047#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:12,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {6047#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6048#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:12,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {6048#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {6048#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:12,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {6048#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {6049#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:12,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {6049#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6049#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:12,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {6049#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6050#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:12,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {6050#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {6050#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:12,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {6050#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {6051#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:12,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {6051#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {6051#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:12,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {6051#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {6052#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:12,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {6052#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {6052#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:12,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {6052#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {6053#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:12,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {6053#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {6053#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:12,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {6053#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {6054#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:12,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {6054#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {6054#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:12,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {6054#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {6055#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:12,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {6055#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {6055#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:12,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {6055#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {6056#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:12,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {6056#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {6056#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:12,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {6056#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {6057#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:12,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {6057#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {6057#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:12,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {6057#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {6058#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:12,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {6058#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {6058#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:12,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {6058#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {6059#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:12,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {6059#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:12,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {6059#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {6060#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:12,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {6060#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:12,918 INFO L290 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {6061#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:12,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {6061#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6061#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:12,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6062#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:12,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {6062#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {6062#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:12,920 INFO L290 TraceCheckUtils]: 48: Hoare triple {6062#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {6063#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:12,922 INFO L290 TraceCheckUtils]: 49: Hoare triple {6063#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {6064#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:12,922 INFO L290 TraceCheckUtils]: 50: Hoare triple {6064#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:12,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:12,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6066#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:12,924 INFO L290 TraceCheckUtils]: 53: Hoare triple {6066#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {6038#false} is VALID [2022-04-15 12:33:12,924 INFO L272 TraceCheckUtils]: 54: Hoare triple {6038#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6038#false} is VALID [2022-04-15 12:33:12,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {6038#false} ~cond := #in~cond; {6038#false} is VALID [2022-04-15 12:33:12,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {6038#false} assume 0 == ~cond; {6038#false} is VALID [2022-04-15 12:33:12,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {6038#false} assume !false; {6038#false} is VALID [2022-04-15 12:33:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:12,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759255893] [2022-04-15 12:33:12,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759255893] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:12,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925900441] [2022-04-15 12:33:12,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:12,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:12,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:12,926 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:12,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 12:33:12,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:12,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:12,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 12:33:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:12,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:13,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {6037#true} call ULTIMATE.init(); {6037#true} is VALID [2022-04-15 12:33:13,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {6037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6037#true} is VALID [2022-04-15 12:33:13,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {6037#true} assume true; {6037#true} is VALID [2022-04-15 12:33:13,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6037#true} {6037#true} #55#return; {6037#true} is VALID [2022-04-15 12:33:13,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {6037#true} call #t~ret2 := main(); {6037#true} is VALID [2022-04-15 12:33:13,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {6037#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6037#true} is VALID [2022-04-15 12:33:13,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {6037#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {6089#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {6089#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {6089#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:13,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {6089#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {6043#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:13,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {6043#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {6043#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:13,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {6043#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {6044#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:13,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {6044#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:13,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {6044#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {6045#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:13,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {6045#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {6045#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:13,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {6045#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {6046#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:13,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {6046#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {6046#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:13,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {6046#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {6047#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:13,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {6047#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6047#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:13,586 INFO L290 TraceCheckUtils]: 18: Hoare triple {6047#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6048#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:13,586 INFO L290 TraceCheckUtils]: 19: Hoare triple {6048#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {6048#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:13,587 INFO L290 TraceCheckUtils]: 20: Hoare triple {6048#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {6049#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:13,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {6049#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6049#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:13,587 INFO L290 TraceCheckUtils]: 22: Hoare triple {6049#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6050#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:13,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {6050#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {6050#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:13,588 INFO L290 TraceCheckUtils]: 24: Hoare triple {6050#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {6051#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:13,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {6051#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {6051#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:13,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {6051#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {6052#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:13,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {6052#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {6052#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:13,591 INFO L290 TraceCheckUtils]: 28: Hoare triple {6052#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {6053#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:13,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {6053#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {6053#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:13,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {6053#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {6054#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:13,592 INFO L290 TraceCheckUtils]: 31: Hoare triple {6054#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {6054#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:13,592 INFO L290 TraceCheckUtils]: 32: Hoare triple {6054#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {6055#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:13,593 INFO L290 TraceCheckUtils]: 33: Hoare triple {6055#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {6055#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:13,593 INFO L290 TraceCheckUtils]: 34: Hoare triple {6055#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {6056#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:13,593 INFO L290 TraceCheckUtils]: 35: Hoare triple {6056#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {6056#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:13,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {6056#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {6057#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:13,594 INFO L290 TraceCheckUtils]: 37: Hoare triple {6057#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {6057#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:13,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {6057#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {6058#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:13,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {6058#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {6058#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:13,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {6058#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {6059#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:13,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {6059#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {6059#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:13,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {6059#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {6060#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:13,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {6060#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {6060#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:13,597 INFO L290 TraceCheckUtils]: 44: Hoare triple {6060#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {6061#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:13,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {6061#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6061#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:13,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {6061#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6062#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:13,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {6062#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {6062#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:13,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {6062#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {6063#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:13,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {6063#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {6063#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:13,600 INFO L290 TraceCheckUtils]: 50: Hoare triple {6063#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {6222#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:13,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {6222#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {6226#(and (<= main_~i~0 (* main_~k~0 22)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:13,601 INFO L290 TraceCheckUtils]: 52: Hoare triple {6226#(and (<= main_~i~0 (* main_~k~0 22)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {6230#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 23 main_~k~0)))} is VALID [2022-04-15 12:33:13,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {6230#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 23 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {6038#false} is VALID [2022-04-15 12:33:13,602 INFO L272 TraceCheckUtils]: 54: Hoare triple {6038#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6038#false} is VALID [2022-04-15 12:33:13,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {6038#false} ~cond := #in~cond; {6038#false} is VALID [2022-04-15 12:33:13,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {6038#false} assume 0 == ~cond; {6038#false} is VALID [2022-04-15 12:33:13,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {6038#false} assume !false; {6038#false} is VALID [2022-04-15 12:33:13,603 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:13,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:15,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {6038#false} assume !false; {6038#false} is VALID [2022-04-15 12:33:15,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {6038#false} assume 0 == ~cond; {6038#false} is VALID [2022-04-15 12:33:15,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {6038#false} ~cond := #in~cond; {6038#false} is VALID [2022-04-15 12:33:15,263 INFO L272 TraceCheckUtils]: 54: Hoare triple {6038#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6038#false} is VALID [2022-04-15 12:33:15,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {6066#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {6038#false} is VALID [2022-04-15 12:33:15,265 INFO L290 TraceCheckUtils]: 52: Hoare triple {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6066#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:15,265 INFO L290 TraceCheckUtils]: 51: Hoare triple {6264#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {6065#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:15,266 INFO L290 TraceCheckUtils]: 50: Hoare triple {6268#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {6264#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:15,266 INFO L290 TraceCheckUtils]: 49: Hoare triple {6268#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {6268#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:15,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {6275#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {6268#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:15,268 INFO L290 TraceCheckUtils]: 47: Hoare triple {6275#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {6275#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:15,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {6282#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {6275#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:15,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {6282#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {6282#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:15,270 INFO L290 TraceCheckUtils]: 44: Hoare triple {6289#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6282#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:15,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {6289#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6289#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,271 INFO L290 TraceCheckUtils]: 42: Hoare triple {6296#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {6289#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {6296#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {6296#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:15,272 INFO L290 TraceCheckUtils]: 40: Hoare triple {6303#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {6296#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:15,272 INFO L290 TraceCheckUtils]: 39: Hoare triple {6303#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {6303#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:15,273 INFO L290 TraceCheckUtils]: 38: Hoare triple {6310#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6303#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:15,273 INFO L290 TraceCheckUtils]: 37: Hoare triple {6310#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6310#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,273 INFO L290 TraceCheckUtils]: 36: Hoare triple {6317#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {6310#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,274 INFO L290 TraceCheckUtils]: 35: Hoare triple {6317#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {6317#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:15,274 INFO L290 TraceCheckUtils]: 34: Hoare triple {6324#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {6317#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:15,275 INFO L290 TraceCheckUtils]: 33: Hoare triple {6324#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {6324#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:15,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {6331#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6324#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:15,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {6331#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6331#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {6338#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6331#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {6338#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6338#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {6345#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {6338#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {6345#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {6345#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:15,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {6352#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6345#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:15,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {6352#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6352#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {6359#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {6352#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {6359#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {6359#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:15,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {6366#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {6359#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:15,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {6366#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {6366#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:15,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {6373#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6366#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:15,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {6373#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6373#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,281 INFO L290 TraceCheckUtils]: 18: Hoare triple {6380#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {6373#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {6380#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {6380#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:15,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {6387#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {6380#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:15,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {6387#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {6387#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:15,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {6394#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6387#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:15,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {6394#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6394#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {6401#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {6394#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {6401#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {6401#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:15,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {6408#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {6401#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:15,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {6408#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {6408#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {6415#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999977)) 1)} ~i~0 := ~i~0 + ~k~0; {6408#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {6415#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999977)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {6415#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999977)) 1)} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {6037#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {6415#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999977)) 1)} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {6037#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6037#true} is VALID [2022-04-15 12:33:15,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {6037#true} call #t~ret2 := main(); {6037#true} is VALID [2022-04-15 12:33:15,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6037#true} {6037#true} #55#return; {6037#true} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {6037#true} assume true; {6037#true} is VALID [2022-04-15 12:33:15,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {6037#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6037#true} is VALID [2022-04-15 12:33:15,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {6037#true} call ULTIMATE.init(); {6037#true} is VALID [2022-04-15 12:33:15,287 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:15,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925900441] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:15,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:15,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 55 [2022-04-15 12:33:15,287 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:15,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2078210476] [2022-04-15 12:33:15,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2078210476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:15,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:15,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 12:33:15,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787952733] [2022-04-15 12:33:15,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:15,288 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:33:15,289 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:15,289 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:15,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:15,342 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 12:33:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:15,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 12:33:15,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=945, Invalid=2025, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 12:33:15,343 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:18,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:18,836 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2022-04-15 12:33:18,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 12:33:18,837 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-15 12:33:18,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:18,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-15 12:33:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 69 transitions. [2022-04-15 12:33:18,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 69 transitions. [2022-04-15 12:33:18,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:18,915 INFO L225 Difference]: With dead ends: 68 [2022-04-15 12:33:18,915 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 12:33:18,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=2230, Invalid=4250, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 12:33:18,917 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 79 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:18,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 139 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:33:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 12:33:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-04-15 12:33:19,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:19,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:19,012 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:19,012 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:19,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:19,013 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 12:33:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:33:19,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:19,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:19,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:33:19,013 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 63 states. [2022-04-15 12:33:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:19,014 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2022-04-15 12:33:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:33:19,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:19,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:19,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:19,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:19,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:19,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2022-04-15 12:33:19,015 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2022-04-15 12:33:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:19,016 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2022-04-15 12:33:19,016 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 27 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:19,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 63 transitions. [2022-04-15 12:33:19,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2022-04-15 12:33:19,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 12:33:19,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:19,098 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:19,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:19,298 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25,SelfDestructingSolverStorable26 [2022-04-15 12:33:19,298 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 27 times [2022-04-15 12:33:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [558122587] [2022-04-15 12:33:19,356 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1331020465, now seen corresponding path program 1 times [2022-04-15 12:33:19,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:19,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743764255] [2022-04-15 12:33:19,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:19,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:19,364 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:19,368 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:19,369 INFO L85 PathProgramCache]: Analyzing trace with hash -714597501, now seen corresponding path program 28 times [2022-04-15 12:33:19,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:19,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068053251] [2022-04-15 12:33:19,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:19,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:19,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:19,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {6914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6882#true} is VALID [2022-04-15 12:33:19,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {6882#true} assume true; {6882#true} is VALID [2022-04-15 12:33:19,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6882#true} {6882#true} #55#return; {6882#true} is VALID [2022-04-15 12:33:19,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {6882#true} call ULTIMATE.init(); {6914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:19,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {6914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6882#true} is VALID [2022-04-15 12:33:19,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {6882#true} assume true; {6882#true} is VALID [2022-04-15 12:33:19,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6882#true} {6882#true} #55#return; {6882#true} is VALID [2022-04-15 12:33:19,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {6882#true} call #t~ret2 := main(); {6882#true} is VALID [2022-04-15 12:33:19,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {6882#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6882#true} is VALID [2022-04-15 12:33:19,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {6882#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {6887#(= main_~i~0 0)} is VALID [2022-04-15 12:33:19,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {6887#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {6887#(= main_~i~0 0)} is VALID [2022-04-15 12:33:19,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {6887#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {6888#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:19,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {6888#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {6888#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:19,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {6888#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {6889#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:20,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {6889#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {6889#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:20,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {6889#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {6890#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:20,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {6890#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {6890#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:20,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {6890#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {6891#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:20,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {6891#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {6891#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:20,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {6891#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {6892#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:20,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {6892#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6892#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:20,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {6892#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6893#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:20,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {6893#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {6893#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:20,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {6893#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {6894#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:20,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6894#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:20,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {6894#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6895#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:20,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {6895#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {6895#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:20,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {6895#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {6896#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:20,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {6896#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:20,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {6896#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {6897#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:20,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {6897#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {6897#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:20,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {6897#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {6898#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:20,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {6898#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {6898#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:20,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {6898#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {6899#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:20,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {6899#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {6899#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:20,010 INFO L290 TraceCheckUtils]: 32: Hoare triple {6899#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {6900#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:20,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {6900#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {6900#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:20,011 INFO L290 TraceCheckUtils]: 34: Hoare triple {6900#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {6901#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:20,011 INFO L290 TraceCheckUtils]: 35: Hoare triple {6901#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {6901#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:20,012 INFO L290 TraceCheckUtils]: 36: Hoare triple {6901#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {6902#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:20,012 INFO L290 TraceCheckUtils]: 37: Hoare triple {6902#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {6902#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:20,013 INFO L290 TraceCheckUtils]: 38: Hoare triple {6902#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {6903#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:20,013 INFO L290 TraceCheckUtils]: 39: Hoare triple {6903#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {6903#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:20,013 INFO L290 TraceCheckUtils]: 40: Hoare triple {6903#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {6904#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:20,014 INFO L290 TraceCheckUtils]: 41: Hoare triple {6904#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {6904#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:20,014 INFO L290 TraceCheckUtils]: 42: Hoare triple {6904#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {6905#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:20,015 INFO L290 TraceCheckUtils]: 43: Hoare triple {6905#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {6905#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:20,015 INFO L290 TraceCheckUtils]: 44: Hoare triple {6905#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {6906#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:20,016 INFO L290 TraceCheckUtils]: 45: Hoare triple {6906#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6906#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:20,016 INFO L290 TraceCheckUtils]: 46: Hoare triple {6906#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6907#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:20,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {6907#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {6907#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:20,017 INFO L290 TraceCheckUtils]: 48: Hoare triple {6907#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {6908#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:20,017 INFO L290 TraceCheckUtils]: 49: Hoare triple {6908#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {6908#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:20,018 INFO L290 TraceCheckUtils]: 50: Hoare triple {6908#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {6909#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:20,018 INFO L290 TraceCheckUtils]: 51: Hoare triple {6909#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {6909#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:20,018 INFO L290 TraceCheckUtils]: 52: Hoare triple {6909#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {6910#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:20,021 INFO L290 TraceCheckUtils]: 53: Hoare triple {6910#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6911#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:20,022 INFO L290 TraceCheckUtils]: 54: Hoare triple {6911#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:20,022 INFO L290 TraceCheckUtils]: 55: Hoare triple {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:20,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6913#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:20,024 INFO L290 TraceCheckUtils]: 57: Hoare triple {6913#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {6883#false} is VALID [2022-04-15 12:33:20,024 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6883#false} is VALID [2022-04-15 12:33:20,024 INFO L290 TraceCheckUtils]: 59: Hoare triple {6883#false} ~cond := #in~cond; {6883#false} is VALID [2022-04-15 12:33:20,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {6883#false} assume 0 == ~cond; {6883#false} is VALID [2022-04-15 12:33:20,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {6883#false} assume !false; {6883#false} is VALID [2022-04-15 12:33:20,024 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:20,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:20,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068053251] [2022-04-15 12:33:20,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068053251] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:20,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171314227] [2022-04-15 12:33:20,025 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:20,026 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:20,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 12:33:20,074 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:20,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:20,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 12:33:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:20,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:20,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {6882#true} call ULTIMATE.init(); {6882#true} is VALID [2022-04-15 12:33:20,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {6882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6882#true} is VALID [2022-04-15 12:33:20,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {6882#true} assume true; {6882#true} is VALID [2022-04-15 12:33:20,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6882#true} {6882#true} #55#return; {6882#true} is VALID [2022-04-15 12:33:20,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {6882#true} call #t~ret2 := main(); {6882#true} is VALID [2022-04-15 12:33:20,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {6882#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6882#true} is VALID [2022-04-15 12:33:20,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {6882#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {6936#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:20,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {6936#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {6936#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:20,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {6936#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {6888#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:20,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {6888#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {6888#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:20,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {6888#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {6889#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:20,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {6889#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {6889#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:20,655 INFO L290 TraceCheckUtils]: 12: Hoare triple {6889#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {6890#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:20,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {6890#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {6890#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:20,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {6890#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {6891#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:20,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {6891#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {6891#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:20,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {6891#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {6892#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:20,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {6892#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6892#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:20,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {6892#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6893#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:20,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {6893#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {6893#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:20,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {6893#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {6894#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:20,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {6894#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6894#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:20,660 INFO L290 TraceCheckUtils]: 22: Hoare triple {6894#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6895#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:20,660 INFO L290 TraceCheckUtils]: 23: Hoare triple {6895#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {6895#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:20,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {6895#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {6896#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:20,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {6896#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:20,662 INFO L290 TraceCheckUtils]: 26: Hoare triple {6896#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {6897#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:20,662 INFO L290 TraceCheckUtils]: 27: Hoare triple {6897#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {6897#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:20,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {6897#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {6898#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:20,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {6898#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {6898#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:20,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {6898#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {6899#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:20,664 INFO L290 TraceCheckUtils]: 31: Hoare triple {6899#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {6899#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:20,665 INFO L290 TraceCheckUtils]: 32: Hoare triple {6899#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {6900#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:20,665 INFO L290 TraceCheckUtils]: 33: Hoare triple {6900#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {6900#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:20,665 INFO L290 TraceCheckUtils]: 34: Hoare triple {6900#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {6901#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:20,666 INFO L290 TraceCheckUtils]: 35: Hoare triple {6901#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {6901#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:20,666 INFO L290 TraceCheckUtils]: 36: Hoare triple {6901#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {6902#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:20,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {6902#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {6902#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:20,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {6902#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {6903#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:20,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {6903#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {6903#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:20,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {6903#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {6904#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:20,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {6904#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {6904#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:20,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {6904#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {6905#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:20,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {6905#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {6905#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:20,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {6905#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {6906#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:20,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {6906#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6906#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:20,671 INFO L290 TraceCheckUtils]: 46: Hoare triple {6906#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6907#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:20,671 INFO L290 TraceCheckUtils]: 47: Hoare triple {6907#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {6907#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:20,672 INFO L290 TraceCheckUtils]: 48: Hoare triple {6907#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {6908#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:20,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {6908#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {6908#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:20,672 INFO L290 TraceCheckUtils]: 50: Hoare triple {6908#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {6909#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:20,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {6909#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {6909#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:20,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {6909#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {6910#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:20,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {6910#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {6910#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:20,674 INFO L290 TraceCheckUtils]: 54: Hoare triple {6910#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7081#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:20,674 INFO L290 TraceCheckUtils]: 55: Hoare triple {7081#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {7085#(and (<= main_~i~0 (* main_~k~0 24)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:20,676 INFO L290 TraceCheckUtils]: 56: Hoare triple {7085#(and (<= main_~i~0 (* main_~k~0 24)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {7089#(and (<= main_~i~0 (* main_~k~0 25)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:33:20,677 INFO L290 TraceCheckUtils]: 57: Hoare triple {7089#(and (<= main_~i~0 (* main_~k~0 25)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {6883#false} is VALID [2022-04-15 12:33:20,677 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6883#false} is VALID [2022-04-15 12:33:20,677 INFO L290 TraceCheckUtils]: 59: Hoare triple {6883#false} ~cond := #in~cond; {6883#false} is VALID [2022-04-15 12:33:20,677 INFO L290 TraceCheckUtils]: 60: Hoare triple {6883#false} assume 0 == ~cond; {6883#false} is VALID [2022-04-15 12:33:20,677 INFO L290 TraceCheckUtils]: 61: Hoare triple {6883#false} assume !false; {6883#false} is VALID [2022-04-15 12:33:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:20,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:22,654 INFO L290 TraceCheckUtils]: 61: Hoare triple {6883#false} assume !false; {6883#false} is VALID [2022-04-15 12:33:22,655 INFO L290 TraceCheckUtils]: 60: Hoare triple {6883#false} assume 0 == ~cond; {6883#false} is VALID [2022-04-15 12:33:22,655 INFO L290 TraceCheckUtils]: 59: Hoare triple {6883#false} ~cond := #in~cond; {6883#false} is VALID [2022-04-15 12:33:22,655 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {6883#false} is VALID [2022-04-15 12:33:22,657 INFO L290 TraceCheckUtils]: 57: Hoare triple {6913#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {6883#false} is VALID [2022-04-15 12:33:22,658 INFO L290 TraceCheckUtils]: 56: Hoare triple {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {6913#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:22,658 INFO L290 TraceCheckUtils]: 55: Hoare triple {7123#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {6912#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:22,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {7127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {7123#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:22,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {7127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {7127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:22,661 INFO L290 TraceCheckUtils]: 52: Hoare triple {7134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {7127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:22,662 INFO L290 TraceCheckUtils]: 51: Hoare triple {7134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {7134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:22,662 INFO L290 TraceCheckUtils]: 50: Hoare triple {7141#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {7134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:22,663 INFO L290 TraceCheckUtils]: 49: Hoare triple {7141#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {7141#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:22,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {7148#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7141#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:22,664 INFO L290 TraceCheckUtils]: 47: Hoare triple {7148#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7148#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {7155#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {7148#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {7155#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {7155#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:22,666 INFO L290 TraceCheckUtils]: 44: Hoare triple {7162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {7155#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:22,666 INFO L290 TraceCheckUtils]: 43: Hoare triple {7162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {7162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:22,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {7169#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:22,667 INFO L290 TraceCheckUtils]: 41: Hoare triple {7169#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7169#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {7176#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {7169#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {7176#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {7176#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:22,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {7183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {7176#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:22,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {7183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {7183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:22,670 INFO L290 TraceCheckUtils]: 36: Hoare triple {7190#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:22,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {7190#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7190#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {7197#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7190#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {7197#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7197#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,672 INFO L290 TraceCheckUtils]: 32: Hoare triple {7204#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {7197#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,673 INFO L290 TraceCheckUtils]: 31: Hoare triple {7204#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {7204#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:22,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {7211#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7204#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:22,674 INFO L290 TraceCheckUtils]: 29: Hoare triple {7211#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7211#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {7218#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {7211#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {7218#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {7218#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:22,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {7225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {7218#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:22,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {7225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {7225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:22,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {7232#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:22,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {7232#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7232#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {7239#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {7232#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {7239#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {7239#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:22,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {7246#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {7239#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:22,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {7246#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {7246#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:22,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {7253#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7246#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:22,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {7253#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7253#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {7260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {7253#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {7260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {7260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:22,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {7267#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:22,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {7267#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7267#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {7274#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {7267#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {7274#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {7274#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:22,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {7281#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {7274#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:22,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {7281#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {7281#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {7288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999975)) 1)} ~i~0 := ~i~0 + ~k~0; {7281#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:22,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {7288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999975)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {7288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999975)) 1)} is VALID [2022-04-15 12:33:22,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {6882#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {7288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999975)) 1)} is VALID [2022-04-15 12:33:22,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {6882#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {6882#true} is VALID [2022-04-15 12:33:22,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {6882#true} call #t~ret2 := main(); {6882#true} is VALID [2022-04-15 12:33:22,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6882#true} {6882#true} #55#return; {6882#true} is VALID [2022-04-15 12:33:22,687 INFO L290 TraceCheckUtils]: 2: Hoare triple {6882#true} assume true; {6882#true} is VALID [2022-04-15 12:33:22,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {6882#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {6882#true} is VALID [2022-04-15 12:33:22,687 INFO L272 TraceCheckUtils]: 0: Hoare triple {6882#true} call ULTIMATE.init(); {6882#true} is VALID [2022-04-15 12:33:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:22,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171314227] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:22,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:22,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 59 [2022-04-15 12:33:22,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:22,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [558122587] [2022-04-15 12:33:22,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [558122587] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:22,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:22,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 12:33:22,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742740711] [2022-04-15 12:33:22,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:22,689 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:33:22,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:22,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:22,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:22,765 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 12:33:22,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:22,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 12:33:22,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1100, Invalid=2322, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 12:33:22,766 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:27,784 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-04-15 12:33:27,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 12:33:27,784 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-15 12:33:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-15 12:33:27,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 73 transitions. [2022-04-15 12:33:27,787 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 73 transitions. [2022-04-15 12:33:27,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:27,902 INFO L225 Difference]: With dead ends: 72 [2022-04-15 12:33:27,902 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 12:33:27,905 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2595, Invalid=4887, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:33:27,905 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 85 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:27,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 149 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 12:33:27,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 12:33:28,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 12:33:28,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:28,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:28,054 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:28,055 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:28,056 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 12:33:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 12:33:28,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:28,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:28,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 12:33:28,056 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-15 12:33:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:28,057 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2022-04-15 12:33:28,057 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 12:33:28,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:28,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:28,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:28,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:28,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0161290322580645) internal successors, (63), 62 states have internal predecessors, (63), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2022-04-15 12:33:28,059 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2022-04-15 12:33:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:28,059 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2022-04-15 12:33:28,059 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 29 states have internal predecessors, (58), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:28,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2022-04-15 12:33:28,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2022-04-15 12:33:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 12:33:28,194 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:28,194 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:28,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:28,394 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:28,394 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:28,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:28,395 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 29 times [2022-04-15 12:33:28,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:28,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751763952] [2022-04-15 12:33:28,469 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1390125809, now seen corresponding path program 1 times [2022-04-15 12:33:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:28,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829191726] [2022-04-15 12:33:28,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:28,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:28,478 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:28,482 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 958848575, now seen corresponding path program 30 times [2022-04-15 12:33:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:28,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537292459] [2022-04-15 12:33:28,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:28,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:29,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:29,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {7817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7783#true} is VALID [2022-04-15 12:33:29,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {7783#true} assume true; {7783#true} is VALID [2022-04-15 12:33:29,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7783#true} {7783#true} #55#return; {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {7783#true} call ULTIMATE.init(); {7817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:29,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {7817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {7783#true} assume true; {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7783#true} {7783#true} #55#return; {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {7783#true} call #t~ret2 := main(); {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {7783#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {7783#true} is VALID [2022-04-15 12:33:29,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {7783#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {7788#(= main_~i~0 0)} is VALID [2022-04-15 12:33:29,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {7788#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {7788#(= main_~i~0 0)} is VALID [2022-04-15 12:33:29,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {7788#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {7789#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:29,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {7789#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {7789#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:29,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {7789#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {7790#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:29,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {7790#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {7790#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:29,300 INFO L290 TraceCheckUtils]: 12: Hoare triple {7790#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {7791#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:29,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {7791#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {7791#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:29,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {7791#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {7792#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:29,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {7792#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {7792#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:29,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {7792#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {7793#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:29,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {7793#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7793#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:29,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {7793#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7794#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:29,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {7794#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {7794#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:29,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {7794#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {7795#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:29,303 INFO L290 TraceCheckUtils]: 21: Hoare triple {7795#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7795#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:29,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {7795#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7796#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:29,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {7796#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {7796#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:29,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {7796#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {7797#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:29,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {7797#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {7797#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:29,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {7797#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {7798#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:29,306 INFO L290 TraceCheckUtils]: 27: Hoare triple {7798#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {7798#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:29,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {7798#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {7799#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:29,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {7799#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {7799#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:29,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {7799#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {7800#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:29,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {7800#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {7800#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:29,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {7800#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {7801#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:29,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {7801#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {7801#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:29,310 INFO L290 TraceCheckUtils]: 34: Hoare triple {7801#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {7802#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:29,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {7802#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {7802#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:29,311 INFO L290 TraceCheckUtils]: 36: Hoare triple {7802#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {7803#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:29,311 INFO L290 TraceCheckUtils]: 37: Hoare triple {7803#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {7803#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:29,312 INFO L290 TraceCheckUtils]: 38: Hoare triple {7803#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {7804#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:29,312 INFO L290 TraceCheckUtils]: 39: Hoare triple {7804#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {7804#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:29,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {7804#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {7805#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:29,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {7805#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {7805#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:29,314 INFO L290 TraceCheckUtils]: 42: Hoare triple {7805#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {7806#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:29,314 INFO L290 TraceCheckUtils]: 43: Hoare triple {7806#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {7806#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:29,315 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {7807#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:29,315 INFO L290 TraceCheckUtils]: 45: Hoare triple {7807#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7807#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:29,316 INFO L290 TraceCheckUtils]: 46: Hoare triple {7807#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7808#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:29,316 INFO L290 TraceCheckUtils]: 47: Hoare triple {7808#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {7808#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:29,316 INFO L290 TraceCheckUtils]: 48: Hoare triple {7808#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {7809#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:29,317 INFO L290 TraceCheckUtils]: 49: Hoare triple {7809#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {7809#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:29,317 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {7810#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:29,317 INFO L290 TraceCheckUtils]: 51: Hoare triple {7810#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {7810#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:29,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {7810#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {7811#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:29,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {7811#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7811#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:29,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {7811#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7812#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:29,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {7812#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {7812#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:29,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {7812#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {7813#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:29,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {7813#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {7814#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:29,323 INFO L290 TraceCheckUtils]: 58: Hoare triple {7814#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:29,323 INFO L290 TraceCheckUtils]: 59: Hoare triple {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:29,324 INFO L290 TraceCheckUtils]: 60: Hoare triple {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7816#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:29,325 INFO L290 TraceCheckUtils]: 61: Hoare triple {7816#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {7784#false} is VALID [2022-04-15 12:33:29,325 INFO L272 TraceCheckUtils]: 62: Hoare triple {7784#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {7784#false} is VALID [2022-04-15 12:33:29,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {7784#false} ~cond := #in~cond; {7784#false} is VALID [2022-04-15 12:33:29,325 INFO L290 TraceCheckUtils]: 64: Hoare triple {7784#false} assume 0 == ~cond; {7784#false} is VALID [2022-04-15 12:33:29,325 INFO L290 TraceCheckUtils]: 65: Hoare triple {7784#false} assume !false; {7784#false} is VALID [2022-04-15 12:33:29,326 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:29,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:29,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537292459] [2022-04-15 12:33:29,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537292459] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:29,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627056665] [2022-04-15 12:33:29,326 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:33:29,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:29,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:29,327 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:29,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 12:33:29,371 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 12:33:29,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:29,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 12:33:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:29,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:30,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {7783#true} call ULTIMATE.init(); {7783#true} is VALID [2022-04-15 12:33:30,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {7783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7783#true} is VALID [2022-04-15 12:33:30,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {7783#true} assume true; {7783#true} is VALID [2022-04-15 12:33:30,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7783#true} {7783#true} #55#return; {7783#true} is VALID [2022-04-15 12:33:30,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {7783#true} call #t~ret2 := main(); {7783#true} is VALID [2022-04-15 12:33:30,003 INFO L290 TraceCheckUtils]: 5: Hoare triple {7783#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {7783#true} is VALID [2022-04-15 12:33:30,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {7783#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {7839#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:30,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {7839#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {7839#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:30,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {7839#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {7789#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:30,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {7789#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {7789#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:30,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {7789#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {7790#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:30,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {7790#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {7790#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:30,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {7790#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {7791#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:30,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {7791#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {7791#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:30,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {7791#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {7792#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:30,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {7792#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {7792#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:30,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {7792#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {7793#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:30,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {7793#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7793#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:30,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {7793#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7794#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:30,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {7794#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {7794#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:30,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {7794#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {7795#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:30,018 INFO L290 TraceCheckUtils]: 21: Hoare triple {7795#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7795#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:30,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {7795#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7796#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:30,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {7796#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {7796#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:30,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {7796#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {7797#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:30,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {7797#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {7797#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:30,021 INFO L290 TraceCheckUtils]: 26: Hoare triple {7797#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {7798#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:30,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {7798#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {7798#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:30,022 INFO L290 TraceCheckUtils]: 28: Hoare triple {7798#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {7799#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:30,022 INFO L290 TraceCheckUtils]: 29: Hoare triple {7799#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {7799#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:30,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {7799#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {7800#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:30,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {7800#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {7800#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:30,024 INFO L290 TraceCheckUtils]: 32: Hoare triple {7800#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {7801#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:30,024 INFO L290 TraceCheckUtils]: 33: Hoare triple {7801#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {7801#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:30,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {7801#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {7802#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:30,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {7802#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {7802#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:30,026 INFO L290 TraceCheckUtils]: 36: Hoare triple {7802#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {7803#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:30,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {7803#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {7803#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:30,027 INFO L290 TraceCheckUtils]: 38: Hoare triple {7803#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {7804#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:30,027 INFO L290 TraceCheckUtils]: 39: Hoare triple {7804#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {7804#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:30,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {7804#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {7805#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:30,028 INFO L290 TraceCheckUtils]: 41: Hoare triple {7805#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {7805#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:30,029 INFO L290 TraceCheckUtils]: 42: Hoare triple {7805#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {7806#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:30,029 INFO L290 TraceCheckUtils]: 43: Hoare triple {7806#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {7806#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:30,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {7806#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {7807#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:30,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {7807#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7807#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:30,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {7807#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7808#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:30,031 INFO L290 TraceCheckUtils]: 47: Hoare triple {7808#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {7808#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:30,031 INFO L290 TraceCheckUtils]: 48: Hoare triple {7808#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {7809#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:30,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {7809#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {7809#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:30,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {7810#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:30,032 INFO L290 TraceCheckUtils]: 51: Hoare triple {7810#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {7810#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:30,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {7810#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {7811#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:30,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {7811#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {7811#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:30,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {7811#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7812#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:30,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {7812#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {7812#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:30,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {7812#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {7813#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:30,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {7813#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {7813#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:30,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {7813#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {7996#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:30,036 INFO L290 TraceCheckUtils]: 59: Hoare triple {7996#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {8000#(and (<= main_~i~0 (* main_~k~0 26)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:30,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {8000#(and (<= main_~i~0 (* main_~k~0 26)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {8004#(and (<= main_~i~0 (* main_~k~0 27)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:33:30,039 INFO L290 TraceCheckUtils]: 61: Hoare triple {8004#(and (<= main_~i~0 (* main_~k~0 27)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {7784#false} is VALID [2022-04-15 12:33:30,040 INFO L272 TraceCheckUtils]: 62: Hoare triple {7784#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {7784#false} is VALID [2022-04-15 12:33:30,040 INFO L290 TraceCheckUtils]: 63: Hoare triple {7784#false} ~cond := #in~cond; {7784#false} is VALID [2022-04-15 12:33:30,040 INFO L290 TraceCheckUtils]: 64: Hoare triple {7784#false} assume 0 == ~cond; {7784#false} is VALID [2022-04-15 12:33:30,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {7784#false} assume !false; {7784#false} is VALID [2022-04-15 12:33:30,040 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:30,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:32,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {7784#false} assume !false; {7784#false} is VALID [2022-04-15 12:33:32,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {7784#false} assume 0 == ~cond; {7784#false} is VALID [2022-04-15 12:33:32,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {7784#false} ~cond := #in~cond; {7784#false} is VALID [2022-04-15 12:33:32,375 INFO L272 TraceCheckUtils]: 62: Hoare triple {7784#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {7784#false} is VALID [2022-04-15 12:33:32,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {7816#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {7784#false} is VALID [2022-04-15 12:33:32,379 INFO L290 TraceCheckUtils]: 60: Hoare triple {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {7816#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:32,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {8038#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {7815#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:32,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {8042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {8038#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:32,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {8042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {8042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:32,382 INFO L290 TraceCheckUtils]: 56: Hoare triple {8049#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {8042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:32,383 INFO L290 TraceCheckUtils]: 55: Hoare triple {8049#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {8049#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:32,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {8056#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {8049#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:32,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {8056#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {8056#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:32,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {8063#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8056#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:32,385 INFO L290 TraceCheckUtils]: 51: Hoare triple {8063#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8063#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {8070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {8063#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {8070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {8070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:32,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {8077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {8070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:32,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {8077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {8077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:32,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {8084#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:32,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {8084#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8084#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {8091#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {8084#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {8091#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {8091#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:32,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {8098#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {8091#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:32,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {8098#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {8098#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:32,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {8105#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8098#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:32,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {8105#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8105#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,393 INFO L290 TraceCheckUtils]: 38: Hoare triple {8112#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8105#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {8112#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8112#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {8119#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {8112#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {8119#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {8119#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:32,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {8126#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8119#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:32,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {8126#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8126#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {8133#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {8126#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {8133#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {8133#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:32,397 INFO L290 TraceCheckUtils]: 30: Hoare triple {8140#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {8133#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:32,398 INFO L290 TraceCheckUtils]: 29: Hoare triple {8140#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {8140#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:32,399 INFO L290 TraceCheckUtils]: 28: Hoare triple {8147#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8140#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:32,399 INFO L290 TraceCheckUtils]: 27: Hoare triple {8147#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8147#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,400 INFO L290 TraceCheckUtils]: 26: Hoare triple {8154#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {8147#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,400 INFO L290 TraceCheckUtils]: 25: Hoare triple {8154#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {8154#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:32,401 INFO L290 TraceCheckUtils]: 24: Hoare triple {8161#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {8154#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:32,401 INFO L290 TraceCheckUtils]: 23: Hoare triple {8161#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {8161#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:32,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {8168#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8161#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:32,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {8168#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8168#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {8175#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {8168#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {8175#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {8175#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:32,404 INFO L290 TraceCheckUtils]: 18: Hoare triple {8182#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8175#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:32,404 INFO L290 TraceCheckUtils]: 17: Hoare triple {8182#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8182#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {8189#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {8182#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {8189#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {8189#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:32,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {8196#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8189#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:32,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {8196#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8196#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {8203#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {8196#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {8203#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {8203#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,408 INFO L290 TraceCheckUtils]: 10: Hoare triple {8210#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {8203#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:32,409 INFO L290 TraceCheckUtils]: 9: Hoare triple {8210#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {8210#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:33:32,409 INFO L290 TraceCheckUtils]: 8: Hoare triple {8217#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999973)) 1)} ~i~0 := ~i~0 + ~k~0; {8210#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:33:32,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {8217#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999973)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {8217#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999973)) 1)} is VALID [2022-04-15 12:33:32,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {7783#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {8217#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999973)) 1)} is VALID [2022-04-15 12:33:32,410 INFO L290 TraceCheckUtils]: 5: Hoare triple {7783#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {7783#true} is VALID [2022-04-15 12:33:32,410 INFO L272 TraceCheckUtils]: 4: Hoare triple {7783#true} call #t~ret2 := main(); {7783#true} is VALID [2022-04-15 12:33:32,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7783#true} {7783#true} #55#return; {7783#true} is VALID [2022-04-15 12:33:32,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {7783#true} assume true; {7783#true} is VALID [2022-04-15 12:33:32,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {7783#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {7783#true} is VALID [2022-04-15 12:33:32,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {7783#true} call ULTIMATE.init(); {7783#true} is VALID [2022-04-15 12:33:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:32,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627056665] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:32,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:32,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 63 [2022-04-15 12:33:32,412 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:32,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751763952] [2022-04-15 12:33:32,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751763952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:32,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:32,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 12:33:32,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17456055] [2022-04-15 12:33:32,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:32,413 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 12:33:32,413 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:32,413 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:32,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:32,487 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 12:33:32,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:32,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 12:33:32,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1267, Invalid=2639, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 12:33:32,489 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:40,052 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-04-15 12:33:40,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 12:33:40,052 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-15 12:33:40,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 77 transitions. [2022-04-15 12:33:40,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 77 transitions. [2022-04-15 12:33:40,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 77 transitions. [2022-04-15 12:33:40,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:40,179 INFO L225 Difference]: With dead ends: 76 [2022-04-15 12:33:40,179 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 12:33:40,180 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2988, Invalid=5568, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 12:33:40,180 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:40,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 159 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:33:40,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 12:33:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 12:33:40,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:40,289 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,289 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,289 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:40,290 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 12:33:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 12:33:40,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:40,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:40,291 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:33:40,291 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 12:33:40,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:40,292 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2022-04-15 12:33:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 12:33:40,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:40,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:40,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:40,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:40,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-04-15 12:33:40,293 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2022-04-15 12:33:40,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:40,294 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-04-15 12:33:40,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 31 states have internal predecessors, (62), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:40,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 71 transitions. [2022-04-15 12:33:40,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:40,418 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-04-15 12:33:40,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 12:33:40,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:40,418 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:40,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:40,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:40,623 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:40,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:40,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 31 times [2022-04-15 12:33:40,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:40,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [170262043] [2022-04-15 12:33:40,681 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:40,683 INFO L85 PathProgramCache]: Analyzing trace with hash 1449231153, now seen corresponding path program 1 times [2022-04-15 12:33:40,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:40,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004037233] [2022-04-15 12:33:40,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:40,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:40,688 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:40,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:40,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1175315195, now seen corresponding path program 32 times [2022-04-15 12:33:40,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:40,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318036142] [2022-04-15 12:33:40,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:40,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:40,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:41,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:41,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:41,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {8776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {8740#true} assume true; {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8740#true} {8740#true} #55#return; {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L272 TraceCheckUtils]: 0: Hoare triple {8740#true} call ULTIMATE.init(); {8776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:41,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {8776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {8740#true} assume true; {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8740#true} {8740#true} #55#return; {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {8740#true} call #t~ret2 := main(); {8740#true} is VALID [2022-04-15 12:33:41,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {8740#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {8740#true} is VALID [2022-04-15 12:33:41,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {8740#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {8745#(= main_~i~0 0)} is VALID [2022-04-15 12:33:41,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {8745#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {8745#(= main_~i~0 0)} is VALID [2022-04-15 12:33:41,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {8745#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {8746#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:41,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {8746#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {8746#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:41,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {8746#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {8747#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:41,660 INFO L290 TraceCheckUtils]: 11: Hoare triple {8747#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {8747#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:41,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {8747#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {8748#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:41,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {8748#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {8748#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:41,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {8748#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {8749#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:41,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {8749#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {8749#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:41,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {8749#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {8750#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:41,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {8750#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8750#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:41,663 INFO L290 TraceCheckUtils]: 18: Hoare triple {8750#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8751#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:41,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {8751#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {8751#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:41,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {8751#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {8752#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:41,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {8752#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8752#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:41,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {8752#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8753#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:41,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {8753#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {8753#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:41,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {8753#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {8754#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:41,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {8754#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {8754#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:41,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {8754#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {8755#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:41,667 INFO L290 TraceCheckUtils]: 27: Hoare triple {8755#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {8755#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:41,668 INFO L290 TraceCheckUtils]: 28: Hoare triple {8755#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {8756#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:41,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {8756#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {8756#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:41,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {8756#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {8757#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:41,670 INFO L290 TraceCheckUtils]: 31: Hoare triple {8757#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {8757#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:41,684 INFO L290 TraceCheckUtils]: 32: Hoare triple {8757#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {8758#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:41,684 INFO L290 TraceCheckUtils]: 33: Hoare triple {8758#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {8758#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:41,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {8758#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {8759#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:41,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {8759#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {8759#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:41,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {8759#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {8760#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:41,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {8760#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {8760#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:41,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {8760#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {8761#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:41,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {8761#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {8761#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:41,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {8762#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:41,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {8762#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {8762#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:41,690 INFO L290 TraceCheckUtils]: 42: Hoare triple {8762#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {8763#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:41,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {8763#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {8763#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:41,691 INFO L290 TraceCheckUtils]: 44: Hoare triple {8763#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {8764#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:41,691 INFO L290 TraceCheckUtils]: 45: Hoare triple {8764#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8764#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:41,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {8764#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8765#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:41,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {8765#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {8765#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:41,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {8765#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {8766#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:41,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {8766#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {8766#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:41,694 INFO L290 TraceCheckUtils]: 50: Hoare triple {8766#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {8767#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:41,694 INFO L290 TraceCheckUtils]: 51: Hoare triple {8767#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {8767#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:41,694 INFO L290 TraceCheckUtils]: 52: Hoare triple {8767#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {8768#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:41,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {8768#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8768#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:41,695 INFO L290 TraceCheckUtils]: 54: Hoare triple {8768#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8769#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:41,696 INFO L290 TraceCheckUtils]: 55: Hoare triple {8769#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {8769#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:41,696 INFO L290 TraceCheckUtils]: 56: Hoare triple {8769#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {8770#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:41,696 INFO L290 TraceCheckUtils]: 57: Hoare triple {8770#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {8770#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:41,697 INFO L290 TraceCheckUtils]: 58: Hoare triple {8770#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {8771#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:41,697 INFO L290 TraceCheckUtils]: 59: Hoare triple {8771#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {8771#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:41,698 INFO L290 TraceCheckUtils]: 60: Hoare triple {8771#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {8772#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:41,701 INFO L290 TraceCheckUtils]: 61: Hoare triple {8772#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {8773#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:41,702 INFO L290 TraceCheckUtils]: 62: Hoare triple {8773#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:41,702 INFO L290 TraceCheckUtils]: 63: Hoare triple {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:41,704 INFO L290 TraceCheckUtils]: 64: Hoare triple {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8775#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:41,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {8775#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {8741#false} is VALID [2022-04-15 12:33:41,705 INFO L272 TraceCheckUtils]: 66: Hoare triple {8741#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {8741#false} is VALID [2022-04-15 12:33:41,705 INFO L290 TraceCheckUtils]: 67: Hoare triple {8741#false} ~cond := #in~cond; {8741#false} is VALID [2022-04-15 12:33:41,705 INFO L290 TraceCheckUtils]: 68: Hoare triple {8741#false} assume 0 == ~cond; {8741#false} is VALID [2022-04-15 12:33:41,705 INFO L290 TraceCheckUtils]: 69: Hoare triple {8741#false} assume !false; {8741#false} is VALID [2022-04-15 12:33:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:41,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:41,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318036142] [2022-04-15 12:33:41,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318036142] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:41,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153626040] [2022-04-15 12:33:41,706 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:33:41,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:41,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:41,707 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:41,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 12:33:41,772 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:33:41,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:41,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 12:33:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:41,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:42,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {8740#true} call ULTIMATE.init(); {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {8740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {8740#true} assume true; {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8740#true} {8740#true} #55#return; {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {8740#true} call #t~ret2 := main(); {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {8740#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {8740#true} is VALID [2022-04-15 12:33:42,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {8740#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {8798#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:42,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {8798#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {8798#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:42,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {8798#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {8746#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:42,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {8746#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {8746#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:42,464 INFO L290 TraceCheckUtils]: 10: Hoare triple {8746#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {8747#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:42,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {8747#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {8747#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:42,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {8747#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {8748#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:42,465 INFO L290 TraceCheckUtils]: 13: Hoare triple {8748#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {8748#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:42,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {8748#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {8749#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:42,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {8749#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {8749#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:42,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {8749#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {8750#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:42,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {8750#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8750#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:42,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {8750#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8751#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:42,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {8751#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {8751#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:42,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {8751#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {8752#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:42,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {8752#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8752#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:42,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {8752#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8753#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:42,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {8753#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {8753#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:42,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {8753#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {8754#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:42,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {8754#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {8754#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:42,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {8754#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {8755#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:42,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {8755#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {8755#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:42,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {8755#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {8756#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:42,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {8756#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {8756#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:42,474 INFO L290 TraceCheckUtils]: 30: Hoare triple {8756#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {8757#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:42,474 INFO L290 TraceCheckUtils]: 31: Hoare triple {8757#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {8757#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:42,475 INFO L290 TraceCheckUtils]: 32: Hoare triple {8757#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {8758#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:42,475 INFO L290 TraceCheckUtils]: 33: Hoare triple {8758#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {8758#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:42,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {8758#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {8759#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:42,476 INFO L290 TraceCheckUtils]: 35: Hoare triple {8759#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {8759#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:42,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {8759#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {8760#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:42,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {8760#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {8760#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:42,478 INFO L290 TraceCheckUtils]: 38: Hoare triple {8760#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {8761#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:42,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {8761#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {8761#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:42,479 INFO L290 TraceCheckUtils]: 40: Hoare triple {8761#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {8762#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:42,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {8762#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {8762#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:42,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {8762#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {8763#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:42,480 INFO L290 TraceCheckUtils]: 43: Hoare triple {8763#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {8763#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:42,481 INFO L290 TraceCheckUtils]: 44: Hoare triple {8763#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {8764#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:42,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {8764#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8764#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:42,482 INFO L290 TraceCheckUtils]: 46: Hoare triple {8764#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8765#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:42,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {8765#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {8765#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:42,483 INFO L290 TraceCheckUtils]: 48: Hoare triple {8765#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {8766#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:42,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {8766#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {8766#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:42,484 INFO L290 TraceCheckUtils]: 50: Hoare triple {8766#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {8767#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:42,484 INFO L290 TraceCheckUtils]: 51: Hoare triple {8767#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {8767#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:42,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {8767#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {8768#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:42,485 INFO L290 TraceCheckUtils]: 53: Hoare triple {8768#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {8768#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:42,485 INFO L290 TraceCheckUtils]: 54: Hoare triple {8768#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8769#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:42,486 INFO L290 TraceCheckUtils]: 55: Hoare triple {8769#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {8769#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:42,486 INFO L290 TraceCheckUtils]: 56: Hoare triple {8769#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {8770#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:42,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {8770#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {8770#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:42,487 INFO L290 TraceCheckUtils]: 58: Hoare triple {8770#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {8771#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:42,487 INFO L290 TraceCheckUtils]: 59: Hoare triple {8771#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {8771#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:42,488 INFO L290 TraceCheckUtils]: 60: Hoare triple {8771#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {8772#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:42,488 INFO L290 TraceCheckUtils]: 61: Hoare triple {8772#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {8772#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:42,488 INFO L290 TraceCheckUtils]: 62: Hoare triple {8772#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {8967#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:33:42,489 INFO L290 TraceCheckUtils]: 63: Hoare triple {8967#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {8971#(and (<= main_~i~0 (* main_~k~0 28)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:42,491 INFO L290 TraceCheckUtils]: 64: Hoare triple {8971#(and (<= main_~i~0 (* main_~k~0 28)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {8975#(and (<= main_~i~0 (* 29 main_~k~0)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:33:42,492 INFO L290 TraceCheckUtils]: 65: Hoare triple {8975#(and (<= main_~i~0 (* 29 main_~k~0)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {8741#false} is VALID [2022-04-15 12:33:42,492 INFO L272 TraceCheckUtils]: 66: Hoare triple {8741#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {8741#false} is VALID [2022-04-15 12:33:42,492 INFO L290 TraceCheckUtils]: 67: Hoare triple {8741#false} ~cond := #in~cond; {8741#false} is VALID [2022-04-15 12:33:42,492 INFO L290 TraceCheckUtils]: 68: Hoare triple {8741#false} assume 0 == ~cond; {8741#false} is VALID [2022-04-15 12:33:42,492 INFO L290 TraceCheckUtils]: 69: Hoare triple {8741#false} assume !false; {8741#false} is VALID [2022-04-15 12:33:42,493 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:42,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:33:45,205 INFO L290 TraceCheckUtils]: 69: Hoare triple {8741#false} assume !false; {8741#false} is VALID [2022-04-15 12:33:45,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {8741#false} assume 0 == ~cond; {8741#false} is VALID [2022-04-15 12:33:45,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {8741#false} ~cond := #in~cond; {8741#false} is VALID [2022-04-15 12:33:45,206 INFO L272 TraceCheckUtils]: 66: Hoare triple {8741#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {8741#false} is VALID [2022-04-15 12:33:45,208 INFO L290 TraceCheckUtils]: 65: Hoare triple {8775#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {8741#false} is VALID [2022-04-15 12:33:45,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {8775#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:45,210 INFO L290 TraceCheckUtils]: 63: Hoare triple {9009#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {8774#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:45,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {9013#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {9009#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:33:45,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {9013#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {9013#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:45,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {9020#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {9013#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:33:45,213 INFO L290 TraceCheckUtils]: 59: Hoare triple {9020#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {9020#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:45,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {9027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {9020#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:33:45,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {9027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {9027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:45,215 INFO L290 TraceCheckUtils]: 56: Hoare triple {9034#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9027#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:33:45,215 INFO L290 TraceCheckUtils]: 55: Hoare triple {9034#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9034#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {9041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {9034#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {9041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {9041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:45,217 INFO L290 TraceCheckUtils]: 52: Hoare triple {9048#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {9041#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:33:45,217 INFO L290 TraceCheckUtils]: 51: Hoare triple {9048#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {9048#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:45,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {9055#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9048#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:33:45,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {9055#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9055#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,219 INFO L290 TraceCheckUtils]: 48: Hoare triple {9062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {9055#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,219 INFO L290 TraceCheckUtils]: 47: Hoare triple {9062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {9062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:45,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {9069#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {9062#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:33:45,220 INFO L290 TraceCheckUtils]: 45: Hoare triple {9069#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {9069#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:45,220 INFO L290 TraceCheckUtils]: 44: Hoare triple {9076#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9069#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:33:45,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {9076#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9076#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {9083#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9076#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,222 INFO L290 TraceCheckUtils]: 41: Hoare triple {9083#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9083#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,222 INFO L290 TraceCheckUtils]: 40: Hoare triple {9090#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {9083#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {9090#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {9090#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:45,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {9097#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9090#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:33:45,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {9097#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9097#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,224 INFO L290 TraceCheckUtils]: 36: Hoare triple {9104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {9097#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {9104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {9104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:45,225 INFO L290 TraceCheckUtils]: 34: Hoare triple {9111#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {9104#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:33:45,225 INFO L290 TraceCheckUtils]: 33: Hoare triple {9111#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {9111#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:45,226 INFO L290 TraceCheckUtils]: 32: Hoare triple {9118#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9111#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:33:45,226 INFO L290 TraceCheckUtils]: 31: Hoare triple {9118#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9118#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,227 INFO L290 TraceCheckUtils]: 30: Hoare triple {9125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {9118#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {9125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {9125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:45,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {9132#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {9125#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:33:45,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {9132#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {9132#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:45,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {9139#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9132#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:33:45,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {9139#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9139#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {9146#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {9139#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {9146#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {9146#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:45,230 INFO L290 TraceCheckUtils]: 22: Hoare triple {9153#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9146#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:33:45,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {9153#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9153#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {9160#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {9153#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {9160#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {9160#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:45,232 INFO L290 TraceCheckUtils]: 18: Hoare triple {9167#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9160#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:33:45,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {9167#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9167#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {9174#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9167#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {9174#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9174#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {9181#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {9174#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {9181#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {9181#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:33:45,235 INFO L290 TraceCheckUtils]: 12: Hoare triple {9188#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9181#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:33:45,235 INFO L290 TraceCheckUtils]: 11: Hoare triple {9188#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9188#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {9195#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {9188#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,236 INFO L290 TraceCheckUtils]: 9: Hoare triple {9195#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {9195#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {9202#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999971)) 1)} ~i~0 := ~i~0 + ~k~0; {9195#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:33:45,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {9202#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999971)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {9202#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999971)) 1)} is VALID [2022-04-15 12:33:45,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {8740#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {9202#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999971)) 1)} is VALID [2022-04-15 12:33:45,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {8740#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {8740#true} is VALID [2022-04-15 12:33:45,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {8740#true} call #t~ret2 := main(); {8740#true} is VALID [2022-04-15 12:33:45,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8740#true} {8740#true} #55#return; {8740#true} is VALID [2022-04-15 12:33:45,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {8740#true} assume true; {8740#true} is VALID [2022-04-15 12:33:45,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {8740#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {8740#true} is VALID [2022-04-15 12:33:45,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {8740#true} call ULTIMATE.init(); {8740#true} is VALID [2022-04-15 12:33:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:45,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153626040] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:33:45,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:33:45,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 67 [2022-04-15 12:33:45,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:33:45,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [170262043] [2022-04-15 12:33:45,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [170262043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:33:45,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:33:45,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 12:33:45,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096688668] [2022-04-15 12:33:45,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:33:45,239 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:33:45,239 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:33:45,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:45,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:45,339 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 12:33:45,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:45,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 12:33:45,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1446, Invalid=2976, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 12:33:45,341 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:57,134 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-04-15 12:33:57,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 12:33:57,134 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 12:33:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:33:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 81 transitions. [2022-04-15 12:33:57,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 81 transitions. [2022-04-15 12:33:57,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 81 transitions. [2022-04-15 12:33:57,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:57,276 INFO L225 Difference]: With dead ends: 80 [2022-04-15 12:33:57,276 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 12:33:57,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=3409, Invalid=6293, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:33:57,278 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 97 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 12:33:57,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 169 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 12:33:57,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 12:33:57,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-04-15 12:33:57,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:33:57,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,391 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,391 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:57,392 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 12:33:57,392 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 12:33:57,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:57,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:57,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:33:57,393 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-15 12:33:57,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:33:57,394 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2022-04-15 12:33:57,394 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 12:33:57,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:33:57,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:33:57,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:33:57,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:33:57,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2022-04-15 12:33:57,396 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2022-04-15 12:33:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:33:57,396 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2022-04-15 12:33:57,397 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.9411764705882353) internal successors, (66), 33 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:33:57,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 75 transitions. [2022-04-15 12:33:57,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:33:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2022-04-15 12:33:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 12:33:57,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:33:57,542 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:33:57,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 12:33:57,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 12:33:57,742 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:33:57,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:33:57,743 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 33 times [2022-04-15 12:33:57,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:33:57,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866645950] [2022-04-15 12:33:57,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:33:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1508336497, now seen corresponding path program 1 times [2022-04-15 12:33:57,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:57,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134010336] [2022-04-15 12:33:57,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:57,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:57,827 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:33:57,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:33:57,830 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:33:57,831 INFO L85 PathProgramCache]: Analyzing trace with hash -903075401, now seen corresponding path program 34 times [2022-04-15 12:33:57,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:33:57,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432728063] [2022-04-15 12:33:57,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:33:57,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:33:57,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:58,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:33:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:58,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {9791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9753#true} is VALID [2022-04-15 12:33:58,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-15 12:33:58,960 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9753#true} {9753#true} #55#return; {9753#true} is VALID [2022-04-15 12:33:58,961 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:33:58,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {9791#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9753#true} is VALID [2022-04-15 12:33:58,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-15 12:33:58,961 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #55#return; {9753#true} is VALID [2022-04-15 12:33:58,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret2 := main(); {9753#true} is VALID [2022-04-15 12:33:58,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {9753#true} is VALID [2022-04-15 12:33:58,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {9758#(= main_~i~0 0)} is VALID [2022-04-15 12:33:58,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {9758#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {9758#(= main_~i~0 0)} is VALID [2022-04-15 12:33:58,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {9758#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {9759#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:58,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {9759#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {9759#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:58,964 INFO L290 TraceCheckUtils]: 10: Hoare triple {9759#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {9760#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:58,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {9760#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {9760#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:58,965 INFO L290 TraceCheckUtils]: 12: Hoare triple {9760#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {9761#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:58,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {9761#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {9761#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:58,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {9761#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {9762#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:58,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {9762#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {9762#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:58,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {9762#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {9763#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:58,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {9763#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9763#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:58,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {9763#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9764#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:58,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {9764#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:58,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {9764#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {9765#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:58,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {9765#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9765#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:58,970 INFO L290 TraceCheckUtils]: 22: Hoare triple {9765#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9766#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:58,971 INFO L290 TraceCheckUtils]: 23: Hoare triple {9766#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {9766#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:58,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {9766#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {9767#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:58,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {9767#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {9767#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:58,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {9767#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {9768#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:58,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {9768#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {9768#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:58,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {9768#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {9769#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:58,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {9769#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {9769#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:58,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {9769#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {9770#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:58,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {9770#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {9770#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:58,976 INFO L290 TraceCheckUtils]: 32: Hoare triple {9770#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {9771#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:58,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {9771#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {9771#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:58,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {9771#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {9772#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:58,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {9772#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {9772#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:58,978 INFO L290 TraceCheckUtils]: 36: Hoare triple {9772#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {9773#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:58,978 INFO L290 TraceCheckUtils]: 37: Hoare triple {9773#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {9773#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:58,979 INFO L290 TraceCheckUtils]: 38: Hoare triple {9773#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {9774#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:58,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {9774#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {9774#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:58,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {9774#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {9775#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:58,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {9775#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {9775#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:58,981 INFO L290 TraceCheckUtils]: 42: Hoare triple {9775#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {9776#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:58,982 INFO L290 TraceCheckUtils]: 43: Hoare triple {9776#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {9776#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:58,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {9776#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {9777#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:58,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {9777#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9777#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:58,984 INFO L290 TraceCheckUtils]: 46: Hoare triple {9777#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9778#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:58,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {9778#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {9778#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:58,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {9778#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {9779#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:58,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {9779#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {9779#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:58,986 INFO L290 TraceCheckUtils]: 50: Hoare triple {9779#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {9780#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:58,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {9780#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {9780#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:58,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {9780#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {9781#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:58,987 INFO L290 TraceCheckUtils]: 53: Hoare triple {9781#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9781#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:58,988 INFO L290 TraceCheckUtils]: 54: Hoare triple {9781#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9782#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:58,988 INFO L290 TraceCheckUtils]: 55: Hoare triple {9782#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {9782#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:58,989 INFO L290 TraceCheckUtils]: 56: Hoare triple {9782#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {9783#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:58,989 INFO L290 TraceCheckUtils]: 57: Hoare triple {9783#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {9783#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:58,990 INFO L290 TraceCheckUtils]: 58: Hoare triple {9783#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {9784#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:58,990 INFO L290 TraceCheckUtils]: 59: Hoare triple {9784#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {9784#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:58,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {9784#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {9785#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:58,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {9785#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {9785#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:58,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {9785#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {9786#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:33:58,992 INFO L290 TraceCheckUtils]: 63: Hoare triple {9786#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {9786#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:33:58,992 INFO L290 TraceCheckUtils]: 64: Hoare triple {9786#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {9787#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:33:58,996 INFO L290 TraceCheckUtils]: 65: Hoare triple {9787#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9788#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:33:58,997 INFO L290 TraceCheckUtils]: 66: Hoare triple {9788#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:58,997 INFO L290 TraceCheckUtils]: 67: Hoare triple {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:33:58,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9790#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:33:59,000 INFO L290 TraceCheckUtils]: 69: Hoare triple {9790#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {9754#false} is VALID [2022-04-15 12:33:59,000 INFO L272 TraceCheckUtils]: 70: Hoare triple {9754#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {9754#false} is VALID [2022-04-15 12:33:59,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {9754#false} ~cond := #in~cond; {9754#false} is VALID [2022-04-15 12:33:59,000 INFO L290 TraceCheckUtils]: 72: Hoare triple {9754#false} assume 0 == ~cond; {9754#false} is VALID [2022-04-15 12:33:59,000 INFO L290 TraceCheckUtils]: 73: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-15 12:33:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:59,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:33:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432728063] [2022-04-15 12:33:59,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432728063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:33:59,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207819993] [2022-04-15 12:33:59,001 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:33:59,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:33:59,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:33:59,002 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:33:59,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 12:33:59,049 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:33:59,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:33:59,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 12:33:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:33:59,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:33:59,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-15 12:33:59,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9753#true} is VALID [2022-04-15 12:33:59,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-15 12:33:59,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #55#return; {9753#true} is VALID [2022-04-15 12:33:59,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret2 := main(); {9753#true} is VALID [2022-04-15 12:33:59,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {9753#true} is VALID [2022-04-15 12:33:59,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {9813#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:59,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {9813#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {9813#(<= main_~i~0 0)} is VALID [2022-04-15 12:33:59,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {9813#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {9759#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:59,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {9759#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {9759#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:33:59,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {9759#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {9760#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:59,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {9760#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {9760#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:33:59,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {9760#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {9761#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:59,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {9761#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {9761#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:33:59,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {9761#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {9762#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:59,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {9762#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {9762#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:33:59,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {9762#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {9763#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:59,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {9763#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9763#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:33:59,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {9763#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9764#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:59,827 INFO L290 TraceCheckUtils]: 19: Hoare triple {9764#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {9764#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:33:59,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {9764#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {9765#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:59,828 INFO L290 TraceCheckUtils]: 21: Hoare triple {9765#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9765#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:33:59,828 INFO L290 TraceCheckUtils]: 22: Hoare triple {9765#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9766#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:59,829 INFO L290 TraceCheckUtils]: 23: Hoare triple {9766#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {9766#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:33:59,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {9766#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {9767#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:59,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {9767#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {9767#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:33:59,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {9767#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {9768#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:59,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {9768#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {9768#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:33:59,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {9768#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {9769#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:59,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {9769#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {9769#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:33:59,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {9769#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {9770#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:59,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {9770#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {9770#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:33:59,835 INFO L290 TraceCheckUtils]: 32: Hoare triple {9770#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {9771#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:59,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {9771#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {9771#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:33:59,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {9771#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {9772#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:59,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {9772#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {9772#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:33:59,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {9772#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {9773#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:59,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {9773#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {9773#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:33:59,838 INFO L290 TraceCheckUtils]: 38: Hoare triple {9773#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {9774#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:59,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {9774#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {9774#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:33:59,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {9774#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {9775#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:59,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {9775#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {9775#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:33:59,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {9775#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {9776#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:59,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {9776#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {9776#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:33:59,842 INFO L290 TraceCheckUtils]: 44: Hoare triple {9776#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {9777#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:59,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {9777#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9777#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:33:59,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {9777#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9778#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:59,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {9778#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {9778#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:33:59,844 INFO L290 TraceCheckUtils]: 48: Hoare triple {9778#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {9779#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:59,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {9779#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {9779#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:33:59,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {9779#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {9780#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:59,845 INFO L290 TraceCheckUtils]: 51: Hoare triple {9780#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {9780#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:33:59,845 INFO L290 TraceCheckUtils]: 52: Hoare triple {9780#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {9781#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:59,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {9781#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9781#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:33:59,846 INFO L290 TraceCheckUtils]: 54: Hoare triple {9781#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9782#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:59,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {9782#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {9782#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:33:59,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {9782#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {9783#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:59,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {9783#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {9783#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:33:59,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {9783#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {9784#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:59,848 INFO L290 TraceCheckUtils]: 59: Hoare triple {9784#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {9784#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:33:59,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {9784#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {9785#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:59,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {9785#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {9785#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:33:59,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {9785#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {9786#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:33:59,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {9786#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {9786#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:33:59,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {9786#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {9787#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:33:59,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {9787#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9787#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:33:59,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {9787#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9994#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:33:59,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {9994#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {9998#(and (<= main_~i~0 (* 30 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:33:59,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {9998#(and (<= main_~i~0 (* 30 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {10002#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 31)))} is VALID [2022-04-15 12:33:59,856 INFO L290 TraceCheckUtils]: 69: Hoare triple {10002#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 31)))} assume !(~i~0 < 1000000 * ~k~0); {9754#false} is VALID [2022-04-15 12:33:59,856 INFO L272 TraceCheckUtils]: 70: Hoare triple {9754#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {9754#false} is VALID [2022-04-15 12:33:59,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {9754#false} ~cond := #in~cond; {9754#false} is VALID [2022-04-15 12:33:59,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {9754#false} assume 0 == ~cond; {9754#false} is VALID [2022-04-15 12:33:59,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-15 12:33:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:33:59,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:03,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {9754#false} assume !false; {9754#false} is VALID [2022-04-15 12:34:03,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {9754#false} assume 0 == ~cond; {9754#false} is VALID [2022-04-15 12:34:03,152 INFO L290 TraceCheckUtils]: 71: Hoare triple {9754#false} ~cond := #in~cond; {9754#false} is VALID [2022-04-15 12:34:03,152 INFO L272 TraceCheckUtils]: 70: Hoare triple {9754#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {9754#false} is VALID [2022-04-15 12:34:03,154 INFO L290 TraceCheckUtils]: 69: Hoare triple {9790#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {9754#false} is VALID [2022-04-15 12:34:03,155 INFO L290 TraceCheckUtils]: 68: Hoare triple {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {9790#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:34:03,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {10036#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {9789#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:03,157 INFO L290 TraceCheckUtils]: 66: Hoare triple {10040#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {10036#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:34:03,157 INFO L290 TraceCheckUtils]: 65: Hoare triple {10040#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {10040#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:34:03,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {10047#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {10040#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:34:03,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {10047#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {10047#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:34:03,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {10054#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {10047#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:34:03,160 INFO L290 TraceCheckUtils]: 61: Hoare triple {10054#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {10054#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:34:03,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {10061#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10054#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:34:03,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {10061#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10061#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {10068#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {10061#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {10068#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {10068#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:34:03,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {10075#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {10068#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:34:03,163 INFO L290 TraceCheckUtils]: 55: Hoare triple {10075#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {10075#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:34:03,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {10082#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10075#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:34:03,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {10082#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10082#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {10089#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {10082#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {10089#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {10089#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:34:03,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {10096#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {10089#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:34:03,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {10096#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {10096#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:34:03,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {10103#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10096#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:34:03,167 INFO L290 TraceCheckUtils]: 47: Hoare triple {10103#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10103#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {10110#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10103#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {10110#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10110#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {10117#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {10110#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {10117#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {10117#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:34:03,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {10124#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10117#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:34:03,170 INFO L290 TraceCheckUtils]: 41: Hoare triple {10124#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10124#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,170 INFO L290 TraceCheckUtils]: 40: Hoare triple {10131#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {10124#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {10131#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {10131#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:34:03,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {10138#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {10131#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:34:03,171 INFO L290 TraceCheckUtils]: 37: Hoare triple {10138#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {10138#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:34:03,172 INFO L290 TraceCheckUtils]: 36: Hoare triple {10145#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10138#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:34:03,172 INFO L290 TraceCheckUtils]: 35: Hoare triple {10145#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10145#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,173 INFO L290 TraceCheckUtils]: 34: Hoare triple {10152#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {10145#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,173 INFO L290 TraceCheckUtils]: 33: Hoare triple {10152#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {10152#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:34:03,174 INFO L290 TraceCheckUtils]: 32: Hoare triple {10159#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {10152#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:34:03,174 INFO L290 TraceCheckUtils]: 31: Hoare triple {10159#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {10159#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:34:03,175 INFO L290 TraceCheckUtils]: 30: Hoare triple {10166#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10159#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:34:03,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {10166#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10166#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,176 INFO L290 TraceCheckUtils]: 28: Hoare triple {10173#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {10166#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,176 INFO L290 TraceCheckUtils]: 27: Hoare triple {10173#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {10173#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:34:03,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {10180#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10173#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:34:03,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {10180#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10180#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {10187#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {10180#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {10187#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {10187#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:34:03,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {10194#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10187#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:34:03,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {10194#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10194#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {10201#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10194#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,180 INFO L290 TraceCheckUtils]: 19: Hoare triple {10201#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10201#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {10208#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {10201#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {10208#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {10208#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:34:03,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {10215#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10208#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:34:03,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {10215#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10215#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {10222#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10215#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {10222#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10222#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {10229#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {10222#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {10229#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {10229#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {10236#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {10229#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:03,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {10236#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {10236#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:34:03,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {10243#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999969)) 1)} ~i~0 := ~i~0 + ~k~0; {10236#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:34:03,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {10243#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999969)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {10243#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999969)) 1)} is VALID [2022-04-15 12:34:03,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {9753#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {10243#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999969)) 1)} is VALID [2022-04-15 12:34:03,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {9753#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {9753#true} is VALID [2022-04-15 12:34:03,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {9753#true} call #t~ret2 := main(); {9753#true} is VALID [2022-04-15 12:34:03,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9753#true} {9753#true} #55#return; {9753#true} is VALID [2022-04-15 12:34:03,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {9753#true} assume true; {9753#true} is VALID [2022-04-15 12:34:03,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {9753#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {9753#true} is VALID [2022-04-15 12:34:03,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {9753#true} call ULTIMATE.init(); {9753#true} is VALID [2022-04-15 12:34:03,186 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:03,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207819993] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:03,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:34:03,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 71 [2022-04-15 12:34:03,186 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:03,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866645950] [2022-04-15 12:34:03,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866645950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:03,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:03,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 12:34:03,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394651216] [2022-04-15 12:34:03,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:03,187 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 12:34:03,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:03,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:03,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:03,286 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 12:34:03,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:03,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 12:34:03,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1637, Invalid=3333, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 12:34:03,287 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:20,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:20,921 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2022-04-15 12:34:20,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 12:34:20,921 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 74 [2022-04-15 12:34:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:20,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:20,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 85 transitions. [2022-04-15 12:34:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:20,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 85 transitions. [2022-04-15 12:34:20,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 85 transitions. [2022-04-15 12:34:21,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:21,069 INFO L225 Difference]: With dead ends: 84 [2022-04-15 12:34:21,069 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 12:34:21,070 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=3858, Invalid=7062, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 12:34:21,071 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 103 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:21,071 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 179 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 12:34:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 12:34:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-04-15 12:34:21,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:21,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,191 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,191 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:21,192 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-15 12:34:21,193 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-15 12:34:21,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:21,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:21,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:34:21,193 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 79 states. [2022-04-15 12:34:21,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:21,194 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-04-15 12:34:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-15 12:34:21,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:21,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:21,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:21,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:21,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.0135135135135136) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2022-04-15 12:34:21,196 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2022-04-15 12:34:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:21,196 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2022-04-15 12:34:21,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 35 states have internal predecessors, (70), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:21,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 79 transitions. [2022-04-15 12:34:21,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2022-04-15 12:34:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 12:34:21,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:21,393 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:21,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 12:34:21,599 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:21,599 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:21,599 INFO L85 PathProgramCache]: Analyzing trace with hash -200232333, now seen corresponding path program 35 times [2022-04-15 12:34:21,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:21,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1243023441] [2022-04-15 12:34:21,659 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:34:21,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1567441841, now seen corresponding path program 1 times [2022-04-15 12:34:21,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:21,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195520143] [2022-04-15 12:34:21,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:21,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:34:21,671 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:34:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:34:21,674 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:34:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash -200232333, now seen corresponding path program 36 times [2022-04-15 12:34:21,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:21,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278429659] [2022-04-15 12:34:21,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:21,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:23,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:34:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:23,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {10862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {10822#true} assume true; {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10822#true} {10822#true} #55#return; {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L272 TraceCheckUtils]: 0: Hoare triple {10822#true} call ULTIMATE.init(); {10862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:34:23,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {10862#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {10822#true} assume true; {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10822#true} {10822#true} #55#return; {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {10822#true} call #t~ret2 := main(); {10822#true} is VALID [2022-04-15 12:34:23,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {10822#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {10822#true} is VALID [2022-04-15 12:34:23,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {10822#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {10827#(= main_~i~0 0)} is VALID [2022-04-15 12:34:23,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {10827#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {10827#(= main_~i~0 0)} is VALID [2022-04-15 12:34:23,039 INFO L290 TraceCheckUtils]: 8: Hoare triple {10827#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {10828#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:23,040 INFO L290 TraceCheckUtils]: 9: Hoare triple {10828#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {10828#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:23,040 INFO L290 TraceCheckUtils]: 10: Hoare triple {10828#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {10829#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:23,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {10829#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {10829#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:23,041 INFO L290 TraceCheckUtils]: 12: Hoare triple {10829#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {10830#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:23,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {10830#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {10830#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:23,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {10830#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {10831#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:23,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {10831#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {10831#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:23,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {10831#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {10832#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:23,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {10832#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10832#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:23,044 INFO L290 TraceCheckUtils]: 18: Hoare triple {10832#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10833#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:23,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {10833#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {10833#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:23,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {10833#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {10834#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:23,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {10834#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10834#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:23,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {10834#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10835#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:23,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {10835#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {10835#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:23,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {10835#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {10836#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:23,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {10836#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {10836#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:23,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {10836#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {10837#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:23,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {10837#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {10837#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:23,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {10837#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {10838#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:23,051 INFO L290 TraceCheckUtils]: 29: Hoare triple {10838#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {10838#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:23,051 INFO L290 TraceCheckUtils]: 30: Hoare triple {10838#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {10839#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:23,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {10839#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {10839#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:23,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {10839#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {10840#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:23,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {10840#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {10840#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:23,054 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {10841#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:23,054 INFO L290 TraceCheckUtils]: 35: Hoare triple {10841#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {10841#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:23,054 INFO L290 TraceCheckUtils]: 36: Hoare triple {10841#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {10842#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:23,055 INFO L290 TraceCheckUtils]: 37: Hoare triple {10842#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {10842#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:23,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {10842#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {10843#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:23,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {10843#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {10843#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:23,057 INFO L290 TraceCheckUtils]: 40: Hoare triple {10843#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {10844#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:23,057 INFO L290 TraceCheckUtils]: 41: Hoare triple {10844#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {10844#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:23,058 INFO L290 TraceCheckUtils]: 42: Hoare triple {10844#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {10845#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:23,059 INFO L290 TraceCheckUtils]: 43: Hoare triple {10845#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {10845#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:23,059 INFO L290 TraceCheckUtils]: 44: Hoare triple {10845#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {10846#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:23,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10846#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:23,061 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10847#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:23,061 INFO L290 TraceCheckUtils]: 47: Hoare triple {10847#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {10847#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:23,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {10847#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {10848#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:23,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {10848#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {10848#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:23,063 INFO L290 TraceCheckUtils]: 50: Hoare triple {10848#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {10849#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:23,063 INFO L290 TraceCheckUtils]: 51: Hoare triple {10849#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {10849#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:23,064 INFO L290 TraceCheckUtils]: 52: Hoare triple {10849#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {10850#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:23,064 INFO L290 TraceCheckUtils]: 53: Hoare triple {10850#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10850#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:23,065 INFO L290 TraceCheckUtils]: 54: Hoare triple {10850#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10851#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:23,065 INFO L290 TraceCheckUtils]: 55: Hoare triple {10851#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {10851#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:23,066 INFO L290 TraceCheckUtils]: 56: Hoare triple {10851#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {10852#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:23,066 INFO L290 TraceCheckUtils]: 57: Hoare triple {10852#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {10852#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:23,067 INFO L290 TraceCheckUtils]: 58: Hoare triple {10852#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {10853#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:23,067 INFO L290 TraceCheckUtils]: 59: Hoare triple {10853#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {10853#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:23,068 INFO L290 TraceCheckUtils]: 60: Hoare triple {10853#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {10854#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:23,068 INFO L290 TraceCheckUtils]: 61: Hoare triple {10854#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {10854#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:23,069 INFO L290 TraceCheckUtils]: 62: Hoare triple {10854#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {10855#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:23,069 INFO L290 TraceCheckUtils]: 63: Hoare triple {10855#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {10855#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:23,070 INFO L290 TraceCheckUtils]: 64: Hoare triple {10855#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {10856#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:23,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {10856#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10856#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:23,071 INFO L290 TraceCheckUtils]: 66: Hoare triple {10856#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10857#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:23,071 INFO L290 TraceCheckUtils]: 67: Hoare triple {10857#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10857#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:23,071 INFO L290 TraceCheckUtils]: 68: Hoare triple {10857#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10858#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:23,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {10858#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {10859#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:34:23,078 INFO L290 TraceCheckUtils]: 70: Hoare triple {10859#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:23,079 INFO L290 TraceCheckUtils]: 71: Hoare triple {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:23,080 INFO L290 TraceCheckUtils]: 72: Hoare triple {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:34:23,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {10861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {10823#false} is VALID [2022-04-15 12:34:23,083 INFO L272 TraceCheckUtils]: 74: Hoare triple {10823#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {10823#false} is VALID [2022-04-15 12:34:23,083 INFO L290 TraceCheckUtils]: 75: Hoare triple {10823#false} ~cond := #in~cond; {10823#false} is VALID [2022-04-15 12:34:23,083 INFO L290 TraceCheckUtils]: 76: Hoare triple {10823#false} assume 0 == ~cond; {10823#false} is VALID [2022-04-15 12:34:23,083 INFO L290 TraceCheckUtils]: 77: Hoare triple {10823#false} assume !false; {10823#false} is VALID [2022-04-15 12:34:23,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:23,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278429659] [2022-04-15 12:34:23,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278429659] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:34:23,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752810526] [2022-04-15 12:34:23,084 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:34:23,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:23,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:23,085 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:34:23,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 12:34:23,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2022-04-15 12:34:23,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:23,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 12:34:23,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:23,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:23,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {10822#true} call ULTIMATE.init(); {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {10822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {10822#true} assume true; {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10822#true} {10822#true} #55#return; {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {10822#true} call #t~ret2 := main(); {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {10822#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {10822#true} is VALID [2022-04-15 12:34:23,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {10822#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {10884#(<= main_~i~0 0)} is VALID [2022-04-15 12:34:23,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {10884#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {10884#(<= main_~i~0 0)} is VALID [2022-04-15 12:34:23,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {10884#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {10828#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:23,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {10828#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {10828#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:23,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {10828#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {10829#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:23,991 INFO L290 TraceCheckUtils]: 11: Hoare triple {10829#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {10829#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:23,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {10829#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {10830#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:23,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {10830#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {10830#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:23,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {10830#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {10831#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:23,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {10831#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {10831#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:23,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {10831#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {10832#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:23,994 INFO L290 TraceCheckUtils]: 17: Hoare triple {10832#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10832#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:23,995 INFO L290 TraceCheckUtils]: 18: Hoare triple {10832#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10833#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:23,995 INFO L290 TraceCheckUtils]: 19: Hoare triple {10833#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {10833#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:23,996 INFO L290 TraceCheckUtils]: 20: Hoare triple {10833#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {10834#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:23,996 INFO L290 TraceCheckUtils]: 21: Hoare triple {10834#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10834#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:23,996 INFO L290 TraceCheckUtils]: 22: Hoare triple {10834#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10835#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:23,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {10835#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {10835#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:23,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {10835#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {10836#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:23,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {10836#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {10836#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:23,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {10836#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {10837#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:24,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {10837#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {10837#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:24,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {10837#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {10838#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:24,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {10838#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {10838#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:24,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {10838#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {10839#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:24,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {10839#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {10839#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:24,003 INFO L290 TraceCheckUtils]: 32: Hoare triple {10839#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {10840#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:24,003 INFO L290 TraceCheckUtils]: 33: Hoare triple {10840#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {10840#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:24,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {10840#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {10841#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:24,004 INFO L290 TraceCheckUtils]: 35: Hoare triple {10841#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {10841#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:24,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {10841#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {10842#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:24,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {10842#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {10842#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:24,006 INFO L290 TraceCheckUtils]: 38: Hoare triple {10842#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {10843#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:24,007 INFO L290 TraceCheckUtils]: 39: Hoare triple {10843#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {10843#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:24,007 INFO L290 TraceCheckUtils]: 40: Hoare triple {10843#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {10844#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:24,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {10844#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {10844#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:24,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {10844#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {10845#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:24,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {10845#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {10845#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:24,010 INFO L290 TraceCheckUtils]: 44: Hoare triple {10845#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {10846#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:24,010 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10846#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:24,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10847#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:24,011 INFO L290 TraceCheckUtils]: 47: Hoare triple {10847#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {10847#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:24,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {10847#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {10848#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:24,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {10848#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {10848#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:24,013 INFO L290 TraceCheckUtils]: 50: Hoare triple {10848#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {10849#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:24,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {10849#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {10849#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:24,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {10849#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {10850#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:24,014 INFO L290 TraceCheckUtils]: 53: Hoare triple {10850#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10850#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:24,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {10850#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10851#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:24,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {10851#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {10851#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:24,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {10851#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {10852#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:24,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {10852#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {10852#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:24,017 INFO L290 TraceCheckUtils]: 58: Hoare triple {10852#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {10853#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:24,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {10853#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {10853#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:24,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {10853#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {10854#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:24,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {10854#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {10854#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:24,019 INFO L290 TraceCheckUtils]: 62: Hoare triple {10854#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {10855#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:24,019 INFO L290 TraceCheckUtils]: 63: Hoare triple {10855#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {10855#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:24,020 INFO L290 TraceCheckUtils]: 64: Hoare triple {10855#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {10856#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:24,020 INFO L290 TraceCheckUtils]: 65: Hoare triple {10856#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10856#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:24,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {10856#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10857#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:24,021 INFO L290 TraceCheckUtils]: 67: Hoare triple {10857#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {10857#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:24,021 INFO L290 TraceCheckUtils]: 68: Hoare triple {10857#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10858#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:24,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {10858#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {10858#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:24,022 INFO L290 TraceCheckUtils]: 70: Hoare triple {10858#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {11077#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:34:24,023 INFO L290 TraceCheckUtils]: 71: Hoare triple {11077#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11081#(and (<= main_~i~0 (* 32 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:34:24,026 INFO L290 TraceCheckUtils]: 72: Hoare triple {11081#(and (<= main_~i~0 (* 32 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {11085#(and (<= main_~i~0 (* main_~k~0 33)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:34:24,028 INFO L290 TraceCheckUtils]: 73: Hoare triple {11085#(and (<= main_~i~0 (* main_~k~0 33)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {10823#false} is VALID [2022-04-15 12:34:24,028 INFO L272 TraceCheckUtils]: 74: Hoare triple {10823#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {10823#false} is VALID [2022-04-15 12:34:24,028 INFO L290 TraceCheckUtils]: 75: Hoare triple {10823#false} ~cond := #in~cond; {10823#false} is VALID [2022-04-15 12:34:24,028 INFO L290 TraceCheckUtils]: 76: Hoare triple {10823#false} assume 0 == ~cond; {10823#false} is VALID [2022-04-15 12:34:24,028 INFO L290 TraceCheckUtils]: 77: Hoare triple {10823#false} assume !false; {10823#false} is VALID [2022-04-15 12:34:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:24,029 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:34:27,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {10823#false} assume !false; {10823#false} is VALID [2022-04-15 12:34:27,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {10823#false} assume 0 == ~cond; {10823#false} is VALID [2022-04-15 12:34:27,755 INFO L290 TraceCheckUtils]: 75: Hoare triple {10823#false} ~cond := #in~cond; {10823#false} is VALID [2022-04-15 12:34:27,755 INFO L272 TraceCheckUtils]: 74: Hoare triple {10823#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {10823#false} is VALID [2022-04-15 12:34:27,758 INFO L290 TraceCheckUtils]: 73: Hoare triple {10861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {10823#false} is VALID [2022-04-15 12:34:27,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {10861#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:34:27,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {11119#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {10860#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:27,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {11123#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {11119#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:34:27,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {11123#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {11123#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:34:27,763 INFO L290 TraceCheckUtils]: 68: Hoare triple {11130#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {11123#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:34:27,763 INFO L290 TraceCheckUtils]: 67: Hoare triple {11130#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {11130#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:34:27,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {11137#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {11130#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:34:27,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {11137#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {11137#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:34:27,765 INFO L290 TraceCheckUtils]: 64: Hoare triple {11144#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11137#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:34:27,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {11144#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11144#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {11151#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {11144#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,766 INFO L290 TraceCheckUtils]: 61: Hoare triple {11151#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {11151#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:34:27,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {11158#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {11151#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:34:27,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {11158#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {11158#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:34:27,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {11165#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11158#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:34:27,768 INFO L290 TraceCheckUtils]: 57: Hoare triple {11165#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11165#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,769 INFO L290 TraceCheckUtils]: 56: Hoare triple {11172#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {11165#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {11172#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {11172#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:34:27,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {11179#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {11172#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:34:27,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {11179#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {11179#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:34:27,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {11186#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11179#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:34:27,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {11186#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11186#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {11193#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11186#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {11193#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11193#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {11200#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {11193#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {11200#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {11200#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:34:27,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {11207#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11200#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:34:27,774 INFO L290 TraceCheckUtils]: 45: Hoare triple {11207#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11207#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {11214#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {11207#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,775 INFO L290 TraceCheckUtils]: 43: Hoare triple {11214#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {11214#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:34:27,775 INFO L290 TraceCheckUtils]: 42: Hoare triple {11221#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {11214#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:34:27,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {11221#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {11221#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:34:27,776 INFO L290 TraceCheckUtils]: 40: Hoare triple {11228#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11221#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:34:27,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {11228#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11228#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {11235#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {11228#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,778 INFO L290 TraceCheckUtils]: 37: Hoare triple {11235#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {11235#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:34:27,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {11242#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {11235#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:34:27,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {11242#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {11242#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:34:27,779 INFO L290 TraceCheckUtils]: 34: Hoare triple {11249#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11242#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:34:27,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {11249#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11249#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,780 INFO L290 TraceCheckUtils]: 32: Hoare triple {11256#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {11249#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {11256#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {11256#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:34:27,781 INFO L290 TraceCheckUtils]: 30: Hoare triple {11263#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11256#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:34:27,781 INFO L290 TraceCheckUtils]: 29: Hoare triple {11263#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11263#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {11270#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {11263#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {11270#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {11270#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:34:27,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {11277#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11270#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:34:27,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {11277#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11277#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {11284#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11277#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {11284#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11284#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {11291#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {11284#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {11291#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {11291#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:34:27,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {11298#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11291#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:34:27,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {11298#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11298#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,786 INFO L290 TraceCheckUtils]: 18: Hoare triple {11305#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11298#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {11305#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11305#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,787 INFO L290 TraceCheckUtils]: 16: Hoare triple {11312#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11305#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,787 INFO L290 TraceCheckUtils]: 15: Hoare triple {11312#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11312#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {11319#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {11312#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,788 INFO L290 TraceCheckUtils]: 13: Hoare triple {11319#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {11319#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:34:27,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {11326#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {11319#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:34:27,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {11326#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {11326#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {11333#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {11326#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:34:27,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {11333#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {11333#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:34:27,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {11340#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999967)) 1)} ~i~0 := ~i~0 + ~k~0; {11333#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:34:27,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {11340#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999967)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {11340#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999967)) 1)} is VALID [2022-04-15 12:34:27,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {10822#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {11340#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999967)) 1)} is VALID [2022-04-15 12:34:27,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {10822#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {10822#true} is VALID [2022-04-15 12:34:27,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {10822#true} call #t~ret2 := main(); {10822#true} is VALID [2022-04-15 12:34:27,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10822#true} {10822#true} #55#return; {10822#true} is VALID [2022-04-15 12:34:27,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {10822#true} assume true; {10822#true} is VALID [2022-04-15 12:34:27,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {10822#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {10822#true} is VALID [2022-04-15 12:34:27,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {10822#true} call ULTIMATE.init(); {10822#true} is VALID [2022-04-15 12:34:27,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:27,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752810526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:34:27,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:34:27,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 75 [2022-04-15 12:34:27,792 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:34:27,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1243023441] [2022-04-15 12:34:27,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1243023441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:34:27,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:34:27,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 12:34:27,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322702230] [2022-04-15 12:34:27,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:34:27,793 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 12:34:27,793 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:34:27,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:27,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:27,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 12:34:27,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:27,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 12:34:27,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1840, Invalid=3710, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 12:34:27,908 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:53,421 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-04-15 12:34:53,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 12:34:53,421 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 12:34:53,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:34:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 89 transitions. [2022-04-15 12:34:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 89 transitions. [2022-04-15 12:34:53,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 89 transitions. [2022-04-15 12:34:53,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:53,618 INFO L225 Difference]: With dead ends: 88 [2022-04-15 12:34:53,618 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 12:34:53,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=4335, Invalid=7875, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 12:34:53,620 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 109 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 12:34:53,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 189 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 12:34:53,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 12:34:53,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-15 12:34:53,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:34:53,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,745 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,745 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:53,746 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-15 12:34:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-15 12:34:53,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:53,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:53,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:34:53,747 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 83 states. [2022-04-15 12:34:53,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:34:53,748 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-04-15 12:34:53,748 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-15 12:34:53,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:34:53,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:34:53,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:34:53,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:34:53,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0128205128205128) internal successors, (79), 78 states have internal predecessors, (79), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2022-04-15 12:34:53,750 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2022-04-15 12:34:53,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:34:53,750 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2022-04-15 12:34:53,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9473684210526316) internal successors, (74), 37 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:34:53,750 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 83 transitions. [2022-04-15 12:34:53,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:34:53,986 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2022-04-15 12:34:53,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 12:34:53,987 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:34:53,987 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:34:54,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 12:34:54,187 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:54,188 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:34:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:34:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 315260207, now seen corresponding path program 37 times [2022-04-15 12:34:54,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:34:54,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1759116586] [2022-04-15 12:34:54,248 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:34:54,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1626547185, now seen corresponding path program 1 times [2022-04-15 12:34:54,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:54,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406658325] [2022-04-15 12:34:54,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:54,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:34:54,257 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:34:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:34:54,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:34:54,260 INFO L85 PathProgramCache]: Analyzing trace with hash 315260207, now seen corresponding path program 38 times [2022-04-15 12:34:54,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:34:54,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944158909] [2022-04-15 12:34:54,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:34:54,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:34:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:34:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:56,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {11989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11947#true} is VALID [2022-04-15 12:34:56,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {11947#true} assume true; {11947#true} is VALID [2022-04-15 12:34:56,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11947#true} {11947#true} #55#return; {11947#true} is VALID [2022-04-15 12:34:56,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {11947#true} call ULTIMATE.init(); {11989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:34:56,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {11989#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11947#true} is VALID [2022-04-15 12:34:56,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {11947#true} assume true; {11947#true} is VALID [2022-04-15 12:34:56,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11947#true} {11947#true} #55#return; {11947#true} is VALID [2022-04-15 12:34:56,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {11947#true} call #t~ret2 := main(); {11947#true} is VALID [2022-04-15 12:34:56,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {11947#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {11947#true} is VALID [2022-04-15 12:34:56,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {11947#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {11952#(= main_~i~0 0)} is VALID [2022-04-15 12:34:56,004 INFO L290 TraceCheckUtils]: 7: Hoare triple {11952#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {11952#(= main_~i~0 0)} is VALID [2022-04-15 12:34:56,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {11952#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {11953#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:56,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {11953#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {11953#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:56,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {11953#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {11954#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:56,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {11954#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:56,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {11955#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:56,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {11955#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {11955#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:56,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {11955#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {11956#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:56,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {11956#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:56,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {11957#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:56,009 INFO L290 TraceCheckUtils]: 17: Hoare triple {11957#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11957#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:56,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {11957#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11958#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:56,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {11958#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {11958#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:56,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {11958#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {11959#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:56,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {11959#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11959#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:56,011 INFO L290 TraceCheckUtils]: 22: Hoare triple {11959#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11960#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:56,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {11960#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {11960#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:56,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {11960#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {11961#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:56,013 INFO L290 TraceCheckUtils]: 25: Hoare triple {11961#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {11961#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:56,014 INFO L290 TraceCheckUtils]: 26: Hoare triple {11961#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {11962#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:56,014 INFO L290 TraceCheckUtils]: 27: Hoare triple {11962#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {11962#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:56,016 INFO L290 TraceCheckUtils]: 28: Hoare triple {11962#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {11963#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:56,016 INFO L290 TraceCheckUtils]: 29: Hoare triple {11963#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {11963#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:56,017 INFO L290 TraceCheckUtils]: 30: Hoare triple {11963#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {11964#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:56,017 INFO L290 TraceCheckUtils]: 31: Hoare triple {11964#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {11964#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:56,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {11964#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {11965#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:56,019 INFO L290 TraceCheckUtils]: 33: Hoare triple {11965#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {11965#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:56,019 INFO L290 TraceCheckUtils]: 34: Hoare triple {11965#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {11966#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:56,020 INFO L290 TraceCheckUtils]: 35: Hoare triple {11966#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {11966#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:56,021 INFO L290 TraceCheckUtils]: 36: Hoare triple {11966#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {11967#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:56,021 INFO L290 TraceCheckUtils]: 37: Hoare triple {11967#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {11967#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:56,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {11967#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {11968#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:56,023 INFO L290 TraceCheckUtils]: 39: Hoare triple {11968#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {11968#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:56,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {11968#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {11969#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:56,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {11969#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {11969#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:56,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {11969#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {11970#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:56,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {11970#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {11970#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:56,027 INFO L290 TraceCheckUtils]: 44: Hoare triple {11970#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {11971#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:56,027 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11971#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:56,028 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11972#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:56,029 INFO L290 TraceCheckUtils]: 47: Hoare triple {11972#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {11972#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:56,029 INFO L290 TraceCheckUtils]: 48: Hoare triple {11972#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {11973#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:56,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {11973#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {11973#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:56,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {11973#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {11974#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:56,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {11974#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {11974#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:56,031 INFO L290 TraceCheckUtils]: 52: Hoare triple {11974#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {11975#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:56,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {11975#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11975#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:56,033 INFO L290 TraceCheckUtils]: 54: Hoare triple {11975#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11976#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:56,033 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {11976#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:56,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {11977#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:56,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {11977#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {11977#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:56,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {11977#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {11978#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:56,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {11978#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {11978#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:56,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {11978#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {11979#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:56,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {11979#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {11979#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:56,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {11979#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {11980#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:56,039 INFO L290 TraceCheckUtils]: 63: Hoare triple {11980#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {11980#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:56,039 INFO L290 TraceCheckUtils]: 64: Hoare triple {11980#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {11981#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:56,040 INFO L290 TraceCheckUtils]: 65: Hoare triple {11981#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11981#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:56,040 INFO L290 TraceCheckUtils]: 66: Hoare triple {11981#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11982#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:56,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {11982#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11982#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:56,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {11982#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11983#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:56,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {11983#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {11983#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:56,042 INFO L290 TraceCheckUtils]: 70: Hoare triple {11983#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {11984#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:34:56,043 INFO L290 TraceCheckUtils]: 71: Hoare triple {11984#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11984#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:34:56,043 INFO L290 TraceCheckUtils]: 72: Hoare triple {11984#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11985#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:34:56,051 INFO L290 TraceCheckUtils]: 73: Hoare triple {11985#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {11986#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:34:56,053 INFO L290 TraceCheckUtils]: 74: Hoare triple {11986#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:56,054 INFO L290 TraceCheckUtils]: 75: Hoare triple {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:34:56,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11988#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:34:56,060 INFO L290 TraceCheckUtils]: 77: Hoare triple {11988#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {11948#false} is VALID [2022-04-15 12:34:56,061 INFO L272 TraceCheckUtils]: 78: Hoare triple {11948#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {11948#false} is VALID [2022-04-15 12:34:56,061 INFO L290 TraceCheckUtils]: 79: Hoare triple {11948#false} ~cond := #in~cond; {11948#false} is VALID [2022-04-15 12:34:56,061 INFO L290 TraceCheckUtils]: 80: Hoare triple {11948#false} assume 0 == ~cond; {11948#false} is VALID [2022-04-15 12:34:56,061 INFO L290 TraceCheckUtils]: 81: Hoare triple {11948#false} assume !false; {11948#false} is VALID [2022-04-15 12:34:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:34:56,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944158909] [2022-04-15 12:34:56,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944158909] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:34:56,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593655753] [2022-04-15 12:34:56,062 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:34:56,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:34:56,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:34:56,063 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:34:56,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 12:34:56,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:34:56,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:34:56,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 12:34:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:34:56,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:34:57,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {11947#true} call ULTIMATE.init(); {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {11947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {11947#true} assume true; {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11947#true} {11947#true} #55#return; {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {11947#true} call #t~ret2 := main(); {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {11947#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {11947#true} is VALID [2022-04-15 12:34:57,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {11947#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {12011#(<= main_~i~0 0)} is VALID [2022-04-15 12:34:57,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {12011#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {12011#(<= main_~i~0 0)} is VALID [2022-04-15 12:34:57,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {12011#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {11953#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:57,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {11953#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {11953#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:34:57,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {11953#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {11954#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:57,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {11954#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {11954#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:34:57,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {11954#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {11955#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:57,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {11955#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {11955#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:34:57,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {11955#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {11956#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:57,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {11956#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {11956#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {11956#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {11957#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:57,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {11957#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11957#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:34:57,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {11957#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11958#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:57,187 INFO L290 TraceCheckUtils]: 19: Hoare triple {11958#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {11958#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:34:57,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {11958#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {11959#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:57,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {11959#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11959#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:34:57,189 INFO L290 TraceCheckUtils]: 22: Hoare triple {11959#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11960#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:57,189 INFO L290 TraceCheckUtils]: 23: Hoare triple {11960#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {11960#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:34:57,190 INFO L290 TraceCheckUtils]: 24: Hoare triple {11960#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {11961#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:57,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {11961#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {11961#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:34:57,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {11961#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {11962#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:57,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {11962#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {11962#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:34:57,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {11962#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {11963#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:57,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {11963#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {11963#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:34:57,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {11963#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {11964#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:57,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {11964#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {11964#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:34:57,196 INFO L290 TraceCheckUtils]: 32: Hoare triple {11964#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {11965#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:57,196 INFO L290 TraceCheckUtils]: 33: Hoare triple {11965#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {11965#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:34:57,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {11965#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {11966#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:57,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {11966#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {11966#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:34:57,198 INFO L290 TraceCheckUtils]: 36: Hoare triple {11966#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {11967#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:57,198 INFO L290 TraceCheckUtils]: 37: Hoare triple {11967#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {11967#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:34:57,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {11967#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {11968#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:57,200 INFO L290 TraceCheckUtils]: 39: Hoare triple {11968#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {11968#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:34:57,200 INFO L290 TraceCheckUtils]: 40: Hoare triple {11968#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {11969#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:57,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {11969#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {11969#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:34:57,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {11969#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {11970#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:57,202 INFO L290 TraceCheckUtils]: 43: Hoare triple {11970#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {11970#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:34:57,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {11970#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {11971#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:57,203 INFO L290 TraceCheckUtils]: 45: Hoare triple {11971#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11971#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:34:57,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {11971#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11972#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:57,205 INFO L290 TraceCheckUtils]: 47: Hoare triple {11972#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {11972#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:34:57,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {11972#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {11973#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:57,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {11973#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {11973#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:34:57,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {11973#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {11974#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:57,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {11974#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {11974#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:34:57,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {11974#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {11975#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:57,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {11975#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11975#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:34:57,209 INFO L290 TraceCheckUtils]: 54: Hoare triple {11975#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11976#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:57,209 INFO L290 TraceCheckUtils]: 55: Hoare triple {11976#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {11976#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:34:57,210 INFO L290 TraceCheckUtils]: 56: Hoare triple {11976#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {11977#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:57,210 INFO L290 TraceCheckUtils]: 57: Hoare triple {11977#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {11977#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:34:57,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {11977#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {11978#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:57,211 INFO L290 TraceCheckUtils]: 59: Hoare triple {11978#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {11978#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:34:57,212 INFO L290 TraceCheckUtils]: 60: Hoare triple {11978#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {11979#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:57,213 INFO L290 TraceCheckUtils]: 61: Hoare triple {11979#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {11979#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:34:57,214 INFO L290 TraceCheckUtils]: 62: Hoare triple {11979#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {11980#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:57,214 INFO L290 TraceCheckUtils]: 63: Hoare triple {11980#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {11980#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:34:57,215 INFO L290 TraceCheckUtils]: 64: Hoare triple {11980#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {11981#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:57,215 INFO L290 TraceCheckUtils]: 65: Hoare triple {11981#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11981#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:34:57,215 INFO L290 TraceCheckUtils]: 66: Hoare triple {11981#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11982#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:57,216 INFO L290 TraceCheckUtils]: 67: Hoare triple {11982#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11982#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:34:57,216 INFO L290 TraceCheckUtils]: 68: Hoare triple {11982#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11983#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:57,216 INFO L290 TraceCheckUtils]: 69: Hoare triple {11983#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {11983#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:34:57,217 INFO L290 TraceCheckUtils]: 70: Hoare triple {11983#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {11984#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:34:57,217 INFO L290 TraceCheckUtils]: 71: Hoare triple {11984#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {11984#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:34:57,218 INFO L290 TraceCheckUtils]: 72: Hoare triple {11984#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11985#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:34:57,218 INFO L290 TraceCheckUtils]: 73: Hoare triple {11985#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {11985#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:34:57,219 INFO L290 TraceCheckUtils]: 74: Hoare triple {11985#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {12216#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:34:57,219 INFO L290 TraceCheckUtils]: 75: Hoare triple {12216#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {12220#(and (<= main_~i~0 (* main_~k~0 34)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:34:57,219 INFO L290 TraceCheckUtils]: 76: Hoare triple {12220#(and (<= main_~i~0 (* main_~k~0 34)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {12224#(and (<= main_~i~0 (* 35 main_~k~0)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:34:57,223 INFO L290 TraceCheckUtils]: 77: Hoare triple {12224#(and (<= main_~i~0 (* 35 main_~k~0)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {11948#false} is VALID [2022-04-15 12:34:57,223 INFO L272 TraceCheckUtils]: 78: Hoare triple {11948#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {11948#false} is VALID [2022-04-15 12:34:57,223 INFO L290 TraceCheckUtils]: 79: Hoare triple {11948#false} ~cond := #in~cond; {11948#false} is VALID [2022-04-15 12:34:57,223 INFO L290 TraceCheckUtils]: 80: Hoare triple {11948#false} assume 0 == ~cond; {11948#false} is VALID [2022-04-15 12:34:57,223 INFO L290 TraceCheckUtils]: 81: Hoare triple {11948#false} assume !false; {11948#false} is VALID [2022-04-15 12:34:57,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:34:57,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:01,585 INFO L290 TraceCheckUtils]: 81: Hoare triple {11948#false} assume !false; {11948#false} is VALID [2022-04-15 12:35:01,586 INFO L290 TraceCheckUtils]: 80: Hoare triple {11948#false} assume 0 == ~cond; {11948#false} is VALID [2022-04-15 12:35:01,586 INFO L290 TraceCheckUtils]: 79: Hoare triple {11948#false} ~cond := #in~cond; {11948#false} is VALID [2022-04-15 12:35:01,586 INFO L272 TraceCheckUtils]: 78: Hoare triple {11948#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {11948#false} is VALID [2022-04-15 12:35:01,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {11988#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {11948#false} is VALID [2022-04-15 12:35:01,592 INFO L290 TraceCheckUtils]: 76: Hoare triple {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {11988#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:35:01,593 INFO L290 TraceCheckUtils]: 75: Hoare triple {12258#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {11987#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:35:01,594 INFO L290 TraceCheckUtils]: 74: Hoare triple {12262#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {12258#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:35:01,594 INFO L290 TraceCheckUtils]: 73: Hoare triple {12262#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {12262#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:35:01,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {12269#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {12262#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:35:01,597 INFO L290 TraceCheckUtils]: 71: Hoare triple {12269#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {12269#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:35:01,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {12276#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {12269#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:35:01,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {12276#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {12276#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:35:01,599 INFO L290 TraceCheckUtils]: 68: Hoare triple {12283#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12276#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:35:01,600 INFO L290 TraceCheckUtils]: 67: Hoare triple {12283#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12283#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,600 INFO L290 TraceCheckUtils]: 66: Hoare triple {12290#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {12283#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,600 INFO L290 TraceCheckUtils]: 65: Hoare triple {12290#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {12290#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:35:01,601 INFO L290 TraceCheckUtils]: 64: Hoare triple {12297#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {12290#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:35:01,601 INFO L290 TraceCheckUtils]: 63: Hoare triple {12297#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {12297#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:35:01,602 INFO L290 TraceCheckUtils]: 62: Hoare triple {12304#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12297#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:35:01,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {12304#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12304#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {12311#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {12304#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,604 INFO L290 TraceCheckUtils]: 59: Hoare triple {12311#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {12311#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:35:01,604 INFO L290 TraceCheckUtils]: 58: Hoare triple {12318#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {12311#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:35:01,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {12318#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {12318#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:35:01,605 INFO L290 TraceCheckUtils]: 56: Hoare triple {12325#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12318#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:35:01,606 INFO L290 TraceCheckUtils]: 55: Hoare triple {12325#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12325#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,606 INFO L290 TraceCheckUtils]: 54: Hoare triple {12332#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12325#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,607 INFO L290 TraceCheckUtils]: 53: Hoare triple {12332#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12332#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,607 INFO L290 TraceCheckUtils]: 52: Hoare triple {12339#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {12332#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {12339#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {12339#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:35:01,608 INFO L290 TraceCheckUtils]: 50: Hoare triple {12346#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12339#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:35:01,609 INFO L290 TraceCheckUtils]: 49: Hoare triple {12346#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12346#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,609 INFO L290 TraceCheckUtils]: 48: Hoare triple {12353#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {12346#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,610 INFO L290 TraceCheckUtils]: 47: Hoare triple {12353#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {12353#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:35:01,610 INFO L290 TraceCheckUtils]: 46: Hoare triple {12360#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {12353#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:35:01,611 INFO L290 TraceCheckUtils]: 45: Hoare triple {12360#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {12360#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:35:01,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {12367#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12360#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:35:01,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {12367#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12367#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {12374#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {12367#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {12374#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {12374#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:35:01,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {12381#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {12374#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:35:01,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {12381#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {12381#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:35:01,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {12388#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12381#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:35:01,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {12388#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12388#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,620 INFO L290 TraceCheckUtils]: 36: Hoare triple {12395#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {12388#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,620 INFO L290 TraceCheckUtils]: 35: Hoare triple {12395#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {12395#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:35:01,621 INFO L290 TraceCheckUtils]: 34: Hoare triple {12402#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12395#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:35:01,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {12402#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12402#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {12409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {12402#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {12409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {12409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:35:01,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {12416#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12409#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:35:01,624 INFO L290 TraceCheckUtils]: 29: Hoare triple {12416#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12416#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {12423#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12416#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {12423#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12423#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,625 INFO L290 TraceCheckUtils]: 26: Hoare triple {12430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {12423#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {12430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {12430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:35:01,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {12437#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12430#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:35:01,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {12437#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12437#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,627 INFO L290 TraceCheckUtils]: 22: Hoare triple {12444#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12437#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,628 INFO L290 TraceCheckUtils]: 21: Hoare triple {12444#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12444#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,628 INFO L290 TraceCheckUtils]: 20: Hoare triple {12451#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12444#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,629 INFO L290 TraceCheckUtils]: 19: Hoare triple {12451#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12451#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {12458#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {12451#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {12458#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {12458#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:35:01,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {12465#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12458#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:35:01,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {12465#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12465#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {12472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {12465#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {12472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {12472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:35:01,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {12479#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12472#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:35:01,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {12479#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12479#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {12486#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {12479#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {12486#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {12486#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {12493#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999965)) 1)} ~i~0 := ~i~0 + ~k~0; {12486#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:01,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {12493#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999965)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {12493#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999965)) 1)} is VALID [2022-04-15 12:35:01,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {11947#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {12493#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999965)) 1)} is VALID [2022-04-15 12:35:01,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {11947#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {11947#true} is VALID [2022-04-15 12:35:01,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {11947#true} call #t~ret2 := main(); {11947#true} is VALID [2022-04-15 12:35:01,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11947#true} {11947#true} #55#return; {11947#true} is VALID [2022-04-15 12:35:01,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {11947#true} assume true; {11947#true} is VALID [2022-04-15 12:35:01,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {11947#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {11947#true} is VALID [2022-04-15 12:35:01,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {11947#true} call ULTIMATE.init(); {11947#true} is VALID [2022-04-15 12:35:01,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:35:01,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593655753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:01,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:35:01,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 79 [2022-04-15 12:35:01,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:01,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1759116586] [2022-04-15 12:35:01,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1759116586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:01,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:01,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 12:35:01,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447578579] [2022-04-15 12:35:01,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:01,637 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 12:35:01,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:01,637 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:01,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:01,792 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 12:35:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:01,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 12:35:01,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=4107, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 12:35:01,794 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:37,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:37,992 INFO L93 Difference]: Finished difference Result 92 states and 93 transitions. [2022-04-15 12:35:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 12:35:37,993 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-15 12:35:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:35:37,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 93 transitions. [2022-04-15 12:35:37,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 93 transitions. [2022-04-15 12:35:37,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 93 transitions. [2022-04-15 12:35:38,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:38,226 INFO L225 Difference]: With dead ends: 92 [2022-04-15 12:35:38,226 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 12:35:38,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1022 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=4840, Invalid=8732, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 12:35:38,229 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:35:38,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 199 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:35:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 12:35:38,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 12:35:38,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:35:38,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:38,365 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:38,365 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:38,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:38,366 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-04-15 12:35:38,366 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-15 12:35:38,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:38,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:38,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 12:35:38,367 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 87 states. [2022-04-15 12:35:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:35:38,368 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2022-04-15 12:35:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-15 12:35:38,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:35:38,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:35:38,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:35:38,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:35:38,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0121951219512195) internal successors, (83), 82 states have internal predecessors, (83), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:38,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2022-04-15 12:35:38,372 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2022-04-15 12:35:38,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:35:38,372 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2022-04-15 12:35:38,373 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.95) internal successors, (78), 39 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:38,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 87 transitions. [2022-04-15 12:35:38,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:38,739 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2022-04-15 12:35:38,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 12:35:38,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:35:38,740 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:35:38,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 12:35:38,940 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,SelfDestructingSolverStorable38,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:38,941 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:35:38,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:35:38,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1441303019, now seen corresponding path program 39 times [2022-04-15 12:35:38,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:38,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1048190062] [2022-04-15 12:35:39,003 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:35:39,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1685652529, now seen corresponding path program 1 times [2022-04-15 12:35:39,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:39,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350966251] [2022-04-15 12:35:39,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:39,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:35:39,009 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:35:39,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:35:39,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:35:39,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1441303019, now seen corresponding path program 40 times [2022-04-15 12:35:39,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:35:39,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135409558] [2022-04-15 12:35:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:35:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:35:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:41,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:35:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:41,040 INFO L290 TraceCheckUtils]: 0: Hoare triple {13172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13128#true} is VALID [2022-04-15 12:35:41,040 INFO L290 TraceCheckUtils]: 1: Hoare triple {13128#true} assume true; {13128#true} is VALID [2022-04-15 12:35:41,040 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13128#true} {13128#true} #55#return; {13128#true} is VALID [2022-04-15 12:35:41,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {13128#true} call ULTIMATE.init(); {13172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:35:41,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {13172#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13128#true} is VALID [2022-04-15 12:35:41,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {13128#true} assume true; {13128#true} is VALID [2022-04-15 12:35:41,056 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13128#true} {13128#true} #55#return; {13128#true} is VALID [2022-04-15 12:35:41,056 INFO L272 TraceCheckUtils]: 4: Hoare triple {13128#true} call #t~ret2 := main(); {13128#true} is VALID [2022-04-15 12:35:41,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {13128#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {13128#true} is VALID [2022-04-15 12:35:41,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {13128#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {13133#(= main_~i~0 0)} is VALID [2022-04-15 12:35:41,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {13133#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {13133#(= main_~i~0 0)} is VALID [2022-04-15 12:35:41,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {13133#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {13134#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:35:41,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {13134#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {13134#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:35:41,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {13134#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {13135#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:35:41,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {13135#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {13135#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:35:41,059 INFO L290 TraceCheckUtils]: 12: Hoare triple {13135#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {13136#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:35:41,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {13136#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {13136#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:35:41,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {13136#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {13137#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:35:41,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {13137#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {13137#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:35:41,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {13137#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {13138#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:35:41,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {13138#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13138#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:35:41,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {13138#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13139#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:35:41,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {13139#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {13139#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:35:41,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {13139#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {13140#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:35:41,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {13140#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13140#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:35:41,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {13140#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13141#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:35:41,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {13141#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {13141#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:35:41,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {13141#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {13142#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:35:41,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {13142#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {13142#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:35:41,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {13142#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {13143#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:35:41,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {13143#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {13143#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:35:41,071 INFO L290 TraceCheckUtils]: 28: Hoare triple {13143#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {13144#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:35:41,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {13144#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {13144#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:35:41,072 INFO L290 TraceCheckUtils]: 30: Hoare triple {13144#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {13145#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:35:41,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {13145#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {13145#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:35:41,073 INFO L290 TraceCheckUtils]: 32: Hoare triple {13145#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {13146#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:35:41,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {13146#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {13146#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:35:41,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {13146#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {13147#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:35:41,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {13147#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {13147#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:35:41,075 INFO L290 TraceCheckUtils]: 36: Hoare triple {13147#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {13148#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:35:41,075 INFO L290 TraceCheckUtils]: 37: Hoare triple {13148#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {13148#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:35:41,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {13148#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {13149#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:35:41,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {13149#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {13149#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:35:41,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {13149#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {13150#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:35:41,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {13150#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {13150#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:35:41,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {13150#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {13151#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:35:41,080 INFO L290 TraceCheckUtils]: 43: Hoare triple {13151#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {13151#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:35:41,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {13151#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {13152#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:35:41,081 INFO L290 TraceCheckUtils]: 45: Hoare triple {13152#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13152#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:35:41,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {13152#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13153#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:35:41,083 INFO L290 TraceCheckUtils]: 47: Hoare triple {13153#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {13153#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:35:41,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {13154#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:35:41,084 INFO L290 TraceCheckUtils]: 49: Hoare triple {13154#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {13154#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:35:41,085 INFO L290 TraceCheckUtils]: 50: Hoare triple {13154#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {13155#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:35:41,085 INFO L290 TraceCheckUtils]: 51: Hoare triple {13155#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {13155#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:35:41,086 INFO L290 TraceCheckUtils]: 52: Hoare triple {13155#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {13156#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:35:41,086 INFO L290 TraceCheckUtils]: 53: Hoare triple {13156#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13156#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:35:41,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {13156#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13157#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:35:41,088 INFO L290 TraceCheckUtils]: 55: Hoare triple {13157#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {13157#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:35:41,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {13157#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {13158#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:35:41,089 INFO L290 TraceCheckUtils]: 57: Hoare triple {13158#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {13158#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:35:41,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {13158#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {13159#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:35:41,091 INFO L290 TraceCheckUtils]: 59: Hoare triple {13159#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {13159#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:35:41,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {13159#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {13160#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:35:41,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {13160#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {13160#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:35:41,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {13160#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {13161#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:35:41,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {13161#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {13161#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:35:41,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {13161#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {13162#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:35:41,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {13162#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13162#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:35:41,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {13162#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13163#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:35:41,096 INFO L290 TraceCheckUtils]: 67: Hoare triple {13163#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13163#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:35:41,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {13163#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13164#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:35:41,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {13164#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {13164#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:35:41,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {13164#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {13165#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:35:41,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {13165#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13165#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:35:41,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {13165#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13166#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:35:41,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {13166#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {13166#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:35:41,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {13166#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {13167#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:35:41,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {13167#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {13167#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:35:41,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {13167#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {13168#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:35:41,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {13168#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13169#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:35:41,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {13169#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:35:41,108 INFO L290 TraceCheckUtils]: 79: Hoare triple {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:35:41,110 INFO L290 TraceCheckUtils]: 80: Hoare triple {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13171#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:35:41,112 INFO L290 TraceCheckUtils]: 81: Hoare triple {13171#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {13129#false} is VALID [2022-04-15 12:35:41,112 INFO L272 TraceCheckUtils]: 82: Hoare triple {13129#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {13129#false} is VALID [2022-04-15 12:35:41,112 INFO L290 TraceCheckUtils]: 83: Hoare triple {13129#false} ~cond := #in~cond; {13129#false} is VALID [2022-04-15 12:35:41,112 INFO L290 TraceCheckUtils]: 84: Hoare triple {13129#false} assume 0 == ~cond; {13129#false} is VALID [2022-04-15 12:35:41,112 INFO L290 TraceCheckUtils]: 85: Hoare triple {13129#false} assume !false; {13129#false} is VALID [2022-04-15 12:35:41,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:35:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:35:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135409558] [2022-04-15 12:35:41,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135409558] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:35:41,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088185701] [2022-04-15 12:35:41,113 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:35:41,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:35:41,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:35:41,114 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:35:41,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 12:35:41,169 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:35:41,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:35:41,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 12:35:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:35:41,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:35:42,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {13128#true} call ULTIMATE.init(); {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {13128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {13128#true} assume true; {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13128#true} {13128#true} #55#return; {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L272 TraceCheckUtils]: 4: Hoare triple {13128#true} call #t~ret2 := main(); {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L290 TraceCheckUtils]: 5: Hoare triple {13128#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {13128#true} is VALID [2022-04-15 12:35:42,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {13128#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {13194#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:42,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {13194#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {13194#(<= main_~i~0 0)} is VALID [2022-04-15 12:35:42,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {13194#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {13134#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:35:42,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {13134#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {13134#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:35:42,134 INFO L290 TraceCheckUtils]: 10: Hoare triple {13134#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {13135#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:35:42,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {13135#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {13135#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:35:42,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {13135#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {13136#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:35:42,135 INFO L290 TraceCheckUtils]: 13: Hoare triple {13136#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {13136#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:35:42,136 INFO L290 TraceCheckUtils]: 14: Hoare triple {13136#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {13137#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:35:42,136 INFO L290 TraceCheckUtils]: 15: Hoare triple {13137#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {13137#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:35:42,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {13137#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {13138#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:35:42,137 INFO L290 TraceCheckUtils]: 17: Hoare triple {13138#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13138#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:35:42,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {13138#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13139#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:35:42,138 INFO L290 TraceCheckUtils]: 19: Hoare triple {13139#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {13139#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:35:42,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {13139#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {13140#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:35:42,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {13140#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13140#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:35:42,139 INFO L290 TraceCheckUtils]: 22: Hoare triple {13140#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13141#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:35:42,140 INFO L290 TraceCheckUtils]: 23: Hoare triple {13141#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {13141#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:35:42,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {13141#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {13142#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:35:42,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {13142#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {13142#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:35:42,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {13142#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {13143#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:35:42,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {13143#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {13143#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:35:42,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {13143#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {13144#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:35:42,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {13144#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {13144#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:35:42,145 INFO L290 TraceCheckUtils]: 30: Hoare triple {13144#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {13145#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:35:42,145 INFO L290 TraceCheckUtils]: 31: Hoare triple {13145#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {13145#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:35:42,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {13145#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {13146#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:35:42,147 INFO L290 TraceCheckUtils]: 33: Hoare triple {13146#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {13146#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:35:42,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {13146#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {13147#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:35:42,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {13147#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {13147#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:35:42,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {13147#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {13148#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:35:42,148 INFO L290 TraceCheckUtils]: 37: Hoare triple {13148#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {13148#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:35:42,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {13148#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {13149#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:35:42,150 INFO L290 TraceCheckUtils]: 39: Hoare triple {13149#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {13149#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:35:42,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {13149#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {13150#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:35:42,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {13150#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {13150#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:35:42,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {13150#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {13151#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:35:42,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {13151#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {13151#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:35:42,153 INFO L290 TraceCheckUtils]: 44: Hoare triple {13151#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {13152#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:35:42,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {13152#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13152#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:35:42,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {13152#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13153#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:35:42,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {13153#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {13153#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:35:42,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {13153#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {13154#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:35:42,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {13154#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {13154#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:35:42,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {13154#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {13155#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:35:42,157 INFO L290 TraceCheckUtils]: 51: Hoare triple {13155#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {13155#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:35:42,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {13155#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {13156#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:35:42,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {13156#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13156#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:35:42,159 INFO L290 TraceCheckUtils]: 54: Hoare triple {13156#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13157#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:35:42,159 INFO L290 TraceCheckUtils]: 55: Hoare triple {13157#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {13157#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:35:42,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {13157#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {13158#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:35:42,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {13158#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {13158#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:35:42,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {13158#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {13159#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:35:42,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {13159#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {13159#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:35:42,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {13159#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {13160#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:35:42,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {13160#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {13160#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:35:42,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {13160#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {13161#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:35:42,164 INFO L290 TraceCheckUtils]: 63: Hoare triple {13161#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {13161#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:35:42,164 INFO L290 TraceCheckUtils]: 64: Hoare triple {13161#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {13162#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:35:42,165 INFO L290 TraceCheckUtils]: 65: Hoare triple {13162#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13162#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:35:42,165 INFO L290 TraceCheckUtils]: 66: Hoare triple {13162#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13163#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:35:42,165 INFO L290 TraceCheckUtils]: 67: Hoare triple {13163#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13163#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:35:42,166 INFO L290 TraceCheckUtils]: 68: Hoare triple {13163#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13164#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:35:42,166 INFO L290 TraceCheckUtils]: 69: Hoare triple {13164#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {13164#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:35:42,167 INFO L290 TraceCheckUtils]: 70: Hoare triple {13164#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {13165#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:35:42,167 INFO L290 TraceCheckUtils]: 71: Hoare triple {13165#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13165#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:35:42,168 INFO L290 TraceCheckUtils]: 72: Hoare triple {13165#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13166#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:35:42,168 INFO L290 TraceCheckUtils]: 73: Hoare triple {13166#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {13166#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:35:42,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {13166#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {13167#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:35:42,181 INFO L290 TraceCheckUtils]: 75: Hoare triple {13167#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {13167#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:35:42,181 INFO L290 TraceCheckUtils]: 76: Hoare triple {13167#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {13168#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:35:42,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {13168#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {13168#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:35:42,182 INFO L290 TraceCheckUtils]: 78: Hoare triple {13168#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13411#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:35:42,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {13411#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {13415#(and (< main_~i~0 (* main_~k~0 1000000)) (<= main_~i~0 (* main_~k~0 36)))} is VALID [2022-04-15 12:35:42,187 INFO L290 TraceCheckUtils]: 80: Hoare triple {13415#(and (< main_~i~0 (* main_~k~0 1000000)) (<= main_~i~0 (* main_~k~0 36)))} ~i~0 := ~i~0 + ~k~0; {13419#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 37)))} is VALID [2022-04-15 12:35:42,189 INFO L290 TraceCheckUtils]: 81: Hoare triple {13419#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 37)))} assume !(~i~0 < 1000000 * ~k~0); {13129#false} is VALID [2022-04-15 12:35:42,189 INFO L272 TraceCheckUtils]: 82: Hoare triple {13129#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {13129#false} is VALID [2022-04-15 12:35:42,189 INFO L290 TraceCheckUtils]: 83: Hoare triple {13129#false} ~cond := #in~cond; {13129#false} is VALID [2022-04-15 12:35:42,189 INFO L290 TraceCheckUtils]: 84: Hoare triple {13129#false} assume 0 == ~cond; {13129#false} is VALID [2022-04-15 12:35:42,189 INFO L290 TraceCheckUtils]: 85: Hoare triple {13129#false} assume !false; {13129#false} is VALID [2022-04-15 12:35:42,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:35:42,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:35:47,531 INFO L290 TraceCheckUtils]: 85: Hoare triple {13129#false} assume !false; {13129#false} is VALID [2022-04-15 12:35:47,532 INFO L290 TraceCheckUtils]: 84: Hoare triple {13129#false} assume 0 == ~cond; {13129#false} is VALID [2022-04-15 12:35:47,532 INFO L290 TraceCheckUtils]: 83: Hoare triple {13129#false} ~cond := #in~cond; {13129#false} is VALID [2022-04-15 12:35:47,532 INFO L272 TraceCheckUtils]: 82: Hoare triple {13129#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {13129#false} is VALID [2022-04-15 12:35:47,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {13171#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {13129#false} is VALID [2022-04-15 12:35:47,540 INFO L290 TraceCheckUtils]: 80: Hoare triple {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {13171#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:35:47,540 INFO L290 TraceCheckUtils]: 79: Hoare triple {13453#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {13170#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:35:47,541 INFO L290 TraceCheckUtils]: 78: Hoare triple {13457#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {13453#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:35:47,542 INFO L290 TraceCheckUtils]: 77: Hoare triple {13457#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {13457#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:35:47,544 INFO L290 TraceCheckUtils]: 76: Hoare triple {13464#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {13457#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:35:47,545 INFO L290 TraceCheckUtils]: 75: Hoare triple {13464#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {13464#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:35:47,546 INFO L290 TraceCheckUtils]: 74: Hoare triple {13471#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {13464#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:35:47,546 INFO L290 TraceCheckUtils]: 73: Hoare triple {13471#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {13471#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:35:47,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {13478#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13471#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:35:47,547 INFO L290 TraceCheckUtils]: 71: Hoare triple {13478#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13478#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,548 INFO L290 TraceCheckUtils]: 70: Hoare triple {13485#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {13478#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,548 INFO L290 TraceCheckUtils]: 69: Hoare triple {13485#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {13485#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:35:47,549 INFO L290 TraceCheckUtils]: 68: Hoare triple {13492#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {13485#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:35:47,549 INFO L290 TraceCheckUtils]: 67: Hoare triple {13492#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {13492#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:35:47,550 INFO L290 TraceCheckUtils]: 66: Hoare triple {13499#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13492#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:35:47,550 INFO L290 TraceCheckUtils]: 65: Hoare triple {13499#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13499#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {13506#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {13499#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,551 INFO L290 TraceCheckUtils]: 63: Hoare triple {13506#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {13506#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:35:47,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {13513#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {13506#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:35:47,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {13513#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {13513#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:35:47,553 INFO L290 TraceCheckUtils]: 60: Hoare triple {13520#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13513#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:35:47,554 INFO L290 TraceCheckUtils]: 59: Hoare triple {13520#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13520#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,554 INFO L290 TraceCheckUtils]: 58: Hoare triple {13527#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13520#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,555 INFO L290 TraceCheckUtils]: 57: Hoare triple {13527#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13527#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,555 INFO L290 TraceCheckUtils]: 56: Hoare triple {13534#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {13527#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {13534#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {13534#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:35:47,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {13541#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13534#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:35:47,557 INFO L290 TraceCheckUtils]: 53: Hoare triple {13541#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13541#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,557 INFO L290 TraceCheckUtils]: 52: Hoare triple {13548#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {13541#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {13548#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {13548#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:35:47,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {13555#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {13548#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:35:47,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {13555#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {13555#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:35:47,560 INFO L290 TraceCheckUtils]: 48: Hoare triple {13562#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13555#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:35:47,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {13562#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13562#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {13569#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {13562#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {13569#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {13569#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:35:47,562 INFO L290 TraceCheckUtils]: 44: Hoare triple {13576#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {13569#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:35:47,562 INFO L290 TraceCheckUtils]: 43: Hoare triple {13576#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {13576#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:35:47,563 INFO L290 TraceCheckUtils]: 42: Hoare triple {13583#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13576#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:35:47,563 INFO L290 TraceCheckUtils]: 41: Hoare triple {13583#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13583#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {13590#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {13583#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {13590#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {13590#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:35:47,565 INFO L290 TraceCheckUtils]: 38: Hoare triple {13597#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13590#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:35:47,565 INFO L290 TraceCheckUtils]: 37: Hoare triple {13597#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13597#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {13604#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {13597#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {13604#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {13604#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:35:47,567 INFO L290 TraceCheckUtils]: 34: Hoare triple {13611#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13604#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:35:47,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {13611#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13611#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {13618#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13611#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {13618#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13618#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,569 INFO L290 TraceCheckUtils]: 30: Hoare triple {13625#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {13618#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {13625#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {13625#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:35:47,570 INFO L290 TraceCheckUtils]: 28: Hoare triple {13632#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13625#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:35:47,570 INFO L290 TraceCheckUtils]: 27: Hoare triple {13632#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13632#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,570 INFO L290 TraceCheckUtils]: 26: Hoare triple {13639#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13632#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {13639#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13639#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {13646#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13639#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {13646#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13646#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {13653#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {13646#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {13653#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {13653#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:35:47,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {13660#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13653#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:35:47,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {13660#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13660#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {13667#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {13660#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {13667#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {13667#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:35:47,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {13674#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13667#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:35:47,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {13674#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13674#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,576 INFO L290 TraceCheckUtils]: 14: Hoare triple {13681#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13674#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {13681#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13681#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,577 INFO L290 TraceCheckUtils]: 12: Hoare triple {13688#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {13681#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {13688#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {13688#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {13695#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {13688#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:35:47,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {13695#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {13695#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:35:47,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {13702#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999963)) 1)} ~i~0 := ~i~0 + ~k~0; {13695#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:35:47,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {13702#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999963)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {13702#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999963)) 1)} is VALID [2022-04-15 12:35:47,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {13128#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {13702#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999963)) 1)} is VALID [2022-04-15 12:35:47,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {13128#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {13128#true} is VALID [2022-04-15 12:35:47,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {13128#true} call #t~ret2 := main(); {13128#true} is VALID [2022-04-15 12:35:47,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13128#true} {13128#true} #55#return; {13128#true} is VALID [2022-04-15 12:35:47,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {13128#true} assume true; {13128#true} is VALID [2022-04-15 12:35:47,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {13128#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {13128#true} is VALID [2022-04-15 12:35:47,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {13128#true} call ULTIMATE.init(); {13128#true} is VALID [2022-04-15 12:35:47,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:35:47,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088185701] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:35:47,581 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:35:47,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 83 [2022-04-15 12:35:47,581 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:35:47,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1048190062] [2022-04-15 12:35:47,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1048190062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:35:47,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:35:47,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 12:35:47,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875325021] [2022-04-15 12:35:47,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:35:47,582 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 12:35:47,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:35:47,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:35:47,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:35:47,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 12:35:47,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:35:47,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 12:35:47,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2282, Invalid=4524, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 12:35:47,732 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:36,310 INFO L93 Difference]: Finished difference Result 96 states and 97 transitions. [2022-04-15 12:36:36,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 12:36:36,310 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2022-04-15 12:36:36,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:36:36,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2022-04-15 12:36:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 97 transitions. [2022-04-15 12:36:36,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 97 transitions. [2022-04-15 12:36:36,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:36:36,569 INFO L225 Difference]: With dead ends: 96 [2022-04-15 12:36:36,569 INFO L226 Difference]: Without dead ends: 91 [2022-04-15 12:36:36,570 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 132 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1117 ImplicationChecksByTransitivity, 52.5s TimeCoverageRelationStatistics Valid=5373, Invalid=9633, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 12:36:36,571 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 121 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 12:36:36,571 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 209 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 12:36:36,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-15 12:36:36,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-15 12:36:36,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:36:36,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,710 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,710 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:36,711 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2022-04-15 12:36:36,711 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-15 12:36:36,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:36,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:36,711 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 12:36:36,711 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 91 states. [2022-04-15 12:36:36,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:36:36,712 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2022-04-15 12:36:36,712 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-15 12:36:36,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:36:36,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:36:36,713 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:36:36,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:36:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0116279069767442) internal successors, (87), 86 states have internal predecessors, (87), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2022-04-15 12:36:36,714 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2022-04-15 12:36:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:36:36,714 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2022-04-15 12:36:36,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 41 states have internal predecessors, (82), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:36,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 91 transitions. [2022-04-15 12:36:37,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:36:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2022-04-15 12:36:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 12:36:37,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:36:37,094 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:36:37,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 12:36:37,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40,SelfDestructingSolverStorable39 [2022-04-15 12:36:37,295 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:36:37,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:36:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1921394521, now seen corresponding path program 41 times [2022-04-15 12:36:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:36:37,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1159119043] [2022-04-15 12:36:37,363 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:36:37,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1744757873, now seen corresponding path program 1 times [2022-04-15 12:36:37,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:36:37,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214026258] [2022-04-15 12:36:37,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:36:37,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:36:37,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:36:37,372 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:36:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:36:37,376 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:36:37,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1921394521, now seen corresponding path program 42 times [2022-04-15 12:36:37,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:36:37,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164714483] [2022-04-15 12:36:37,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:36:37,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:36:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:36:39,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:36:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:36:39,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {14411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14365#true} is VALID [2022-04-15 12:36:39,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {14365#true} assume true; {14365#true} is VALID [2022-04-15 12:36:39,719 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14365#true} {14365#true} #55#return; {14365#true} is VALID [2022-04-15 12:36:39,719 INFO L272 TraceCheckUtils]: 0: Hoare triple {14365#true} call ULTIMATE.init(); {14411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:36:39,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {14411#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14365#true} is VALID [2022-04-15 12:36:39,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {14365#true} assume true; {14365#true} is VALID [2022-04-15 12:36:39,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14365#true} {14365#true} #55#return; {14365#true} is VALID [2022-04-15 12:36:39,720 INFO L272 TraceCheckUtils]: 4: Hoare triple {14365#true} call #t~ret2 := main(); {14365#true} is VALID [2022-04-15 12:36:39,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {14365#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {14365#true} is VALID [2022-04-15 12:36:39,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {14365#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {14370#(= main_~i~0 0)} is VALID [2022-04-15 12:36:39,728 INFO L290 TraceCheckUtils]: 7: Hoare triple {14370#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {14370#(= main_~i~0 0)} is VALID [2022-04-15 12:36:39,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {14370#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {14371#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:36:39,729 INFO L290 TraceCheckUtils]: 9: Hoare triple {14371#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {14371#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:36:39,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {14371#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {14372#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:36:39,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {14372#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {14372#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:36:39,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {14372#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {14373#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:36:39,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {14373#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {14373#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:36:39,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {14373#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {14374#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:36:39,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {14374#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {14374#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:36:39,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {14374#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {14375#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:36:39,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {14375#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14375#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:36:39,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {14375#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14376#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:36:39,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {14376#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {14376#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:36:39,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {14376#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {14377#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:36:39,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {14377#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14377#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:36:39,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {14377#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14378#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:36:39,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {14378#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {14378#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:36:39,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {14378#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {14379#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:36:39,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {14379#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {14379#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:36:39,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {14379#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {14380#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:36:39,740 INFO L290 TraceCheckUtils]: 27: Hoare triple {14380#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {14380#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:36:39,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {14380#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {14381#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:36:39,741 INFO L290 TraceCheckUtils]: 29: Hoare triple {14381#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {14381#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:36:39,742 INFO L290 TraceCheckUtils]: 30: Hoare triple {14381#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {14382#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:36:39,742 INFO L290 TraceCheckUtils]: 31: Hoare triple {14382#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {14382#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:36:39,744 INFO L290 TraceCheckUtils]: 32: Hoare triple {14382#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {14383#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:36:39,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {14383#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:36:39,745 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {14384#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:36:39,745 INFO L290 TraceCheckUtils]: 35: Hoare triple {14384#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {14384#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:36:39,745 INFO L290 TraceCheckUtils]: 36: Hoare triple {14384#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {14385#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:36:39,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {14385#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {14385#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:36:39,747 INFO L290 TraceCheckUtils]: 38: Hoare triple {14385#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {14386#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:36:39,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {14386#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {14386#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:36:39,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {14386#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {14387#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:36:39,749 INFO L290 TraceCheckUtils]: 41: Hoare triple {14387#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {14387#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:36:39,750 INFO L290 TraceCheckUtils]: 42: Hoare triple {14387#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {14388#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:36:39,751 INFO L290 TraceCheckUtils]: 43: Hoare triple {14388#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {14388#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:36:39,751 INFO L290 TraceCheckUtils]: 44: Hoare triple {14388#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {14389#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:36:39,752 INFO L290 TraceCheckUtils]: 45: Hoare triple {14389#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14389#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:36:39,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {14389#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14390#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:36:39,754 INFO L290 TraceCheckUtils]: 47: Hoare triple {14390#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {14390#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:36:39,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {14390#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {14391#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:36:39,755 INFO L290 TraceCheckUtils]: 49: Hoare triple {14391#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {14391#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:36:39,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {14391#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {14392#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:36:39,756 INFO L290 TraceCheckUtils]: 51: Hoare triple {14392#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {14392#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:36:39,756 INFO L290 TraceCheckUtils]: 52: Hoare triple {14392#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {14393#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:36:39,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {14393#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14393#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:36:39,758 INFO L290 TraceCheckUtils]: 54: Hoare triple {14393#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14394#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:36:39,758 INFO L290 TraceCheckUtils]: 55: Hoare triple {14394#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {14394#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:36:39,759 INFO L290 TraceCheckUtils]: 56: Hoare triple {14394#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {14395#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:36:39,759 INFO L290 TraceCheckUtils]: 57: Hoare triple {14395#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {14395#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:36:39,760 INFO L290 TraceCheckUtils]: 58: Hoare triple {14395#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {14396#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:36:39,760 INFO L290 TraceCheckUtils]: 59: Hoare triple {14396#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {14396#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:36:39,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {14396#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {14397#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:36:39,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {14397#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {14397#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:36:39,764 INFO L290 TraceCheckUtils]: 62: Hoare triple {14397#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {14398#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:36:39,765 INFO L290 TraceCheckUtils]: 63: Hoare triple {14398#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {14398#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:36:39,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {14398#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {14399#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:36:39,766 INFO L290 TraceCheckUtils]: 65: Hoare triple {14399#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14399#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:36:39,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {14399#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14400#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:36:39,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {14400#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14400#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:36:39,768 INFO L290 TraceCheckUtils]: 68: Hoare triple {14400#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14401#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:36:39,768 INFO L290 TraceCheckUtils]: 69: Hoare triple {14401#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {14401#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:36:39,769 INFO L290 TraceCheckUtils]: 70: Hoare triple {14401#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {14402#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:36:39,769 INFO L290 TraceCheckUtils]: 71: Hoare triple {14402#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14402#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:36:39,770 INFO L290 TraceCheckUtils]: 72: Hoare triple {14402#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14403#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:36:39,770 INFO L290 TraceCheckUtils]: 73: Hoare triple {14403#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {14403#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:36:39,771 INFO L290 TraceCheckUtils]: 74: Hoare triple {14403#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {14404#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:36:39,772 INFO L290 TraceCheckUtils]: 75: Hoare triple {14404#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {14404#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:36:39,772 INFO L290 TraceCheckUtils]: 76: Hoare triple {14404#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {14405#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:36:39,772 INFO L290 TraceCheckUtils]: 77: Hoare triple {14405#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14405#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:36:39,773 INFO L290 TraceCheckUtils]: 78: Hoare triple {14405#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14406#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:36:39,773 INFO L290 TraceCheckUtils]: 79: Hoare triple {14406#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {14406#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:36:39,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {14406#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {14407#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:36:39,784 INFO L290 TraceCheckUtils]: 81: Hoare triple {14407#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {14408#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:36:39,786 INFO L290 TraceCheckUtils]: 82: Hoare triple {14408#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:36:39,787 INFO L290 TraceCheckUtils]: 83: Hoare triple {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:36:39,789 INFO L290 TraceCheckUtils]: 84: Hoare triple {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14410#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:36:39,794 INFO L290 TraceCheckUtils]: 85: Hoare triple {14410#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {14366#false} is VALID [2022-04-15 12:36:39,794 INFO L272 TraceCheckUtils]: 86: Hoare triple {14366#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {14366#false} is VALID [2022-04-15 12:36:39,794 INFO L290 TraceCheckUtils]: 87: Hoare triple {14366#false} ~cond := #in~cond; {14366#false} is VALID [2022-04-15 12:36:39,794 INFO L290 TraceCheckUtils]: 88: Hoare triple {14366#false} assume 0 == ~cond; {14366#false} is VALID [2022-04-15 12:36:39,794 INFO L290 TraceCheckUtils]: 89: Hoare triple {14366#false} assume !false; {14366#false} is VALID [2022-04-15 12:36:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:36:39,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:36:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164714483] [2022-04-15 12:36:39,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164714483] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:36:39,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533016292] [2022-04-15 12:36:39,795 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:36:39,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:36:39,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:36:39,797 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:36:39,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 12:36:39,858 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 40 check-sat command(s) [2022-04-15 12:36:39,858 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:36:39,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 12:36:39,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:36:39,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:36:40,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {14365#true} call ULTIMATE.init(); {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {14365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {14365#true} assume true; {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14365#true} {14365#true} #55#return; {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L272 TraceCheckUtils]: 4: Hoare triple {14365#true} call #t~ret2 := main(); {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {14365#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {14365#true} is VALID [2022-04-15 12:36:40,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {14365#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {14433#(<= main_~i~0 0)} is VALID [2022-04-15 12:36:40,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {14433#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {14433#(<= main_~i~0 0)} is VALID [2022-04-15 12:36:40,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {14433#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {14371#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:36:40,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {14371#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {14371#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:36:40,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {14371#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {14372#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:36:40,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {14372#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {14372#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:36:40,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {14372#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {14373#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:36:40,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {14373#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {14373#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:36:40,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {14373#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {14374#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:36:40,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {14374#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {14374#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:36:40,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {14374#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {14375#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:36:40,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {14375#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14375#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:36:40,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {14375#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14376#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:36:40,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {14376#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {14376#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:36:40,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {14376#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {14377#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:36:40,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {14377#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14377#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:36:40,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {14377#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14378#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:36:40,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {14378#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {14378#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:36:40,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {14378#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {14379#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:36:40,962 INFO L290 TraceCheckUtils]: 25: Hoare triple {14379#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {14379#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:36:40,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {14379#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {14380#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:36:40,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {14380#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {14380#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:36:40,965 INFO L290 TraceCheckUtils]: 28: Hoare triple {14380#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {14381#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:36:40,965 INFO L290 TraceCheckUtils]: 29: Hoare triple {14381#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {14381#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:36:40,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {14381#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {14382#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:36:40,966 INFO L290 TraceCheckUtils]: 31: Hoare triple {14382#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {14382#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:36:40,968 INFO L290 TraceCheckUtils]: 32: Hoare triple {14382#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {14383#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:36:40,968 INFO L290 TraceCheckUtils]: 33: Hoare triple {14383#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {14383#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:36:40,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {14383#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {14384#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:36:40,974 INFO L290 TraceCheckUtils]: 35: Hoare triple {14384#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {14384#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:36:40,974 INFO L290 TraceCheckUtils]: 36: Hoare triple {14384#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {14385#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:36:40,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {14385#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {14385#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:36:40,976 INFO L290 TraceCheckUtils]: 38: Hoare triple {14385#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {14386#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:36:40,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {14386#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {14386#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:36:40,977 INFO L290 TraceCheckUtils]: 40: Hoare triple {14386#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {14387#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:36:40,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {14387#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {14387#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:36:40,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {14387#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {14388#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:36:40,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {14388#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {14388#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:36:40,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {14388#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {14389#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:36:40,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {14389#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14389#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:36:40,982 INFO L290 TraceCheckUtils]: 46: Hoare triple {14389#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14390#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:36:40,983 INFO L290 TraceCheckUtils]: 47: Hoare triple {14390#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {14390#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:36:40,983 INFO L290 TraceCheckUtils]: 48: Hoare triple {14390#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {14391#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:36:40,984 INFO L290 TraceCheckUtils]: 49: Hoare triple {14391#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {14391#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:36:40,984 INFO L290 TraceCheckUtils]: 50: Hoare triple {14391#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {14392#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:36:40,984 INFO L290 TraceCheckUtils]: 51: Hoare triple {14392#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {14392#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:36:40,985 INFO L290 TraceCheckUtils]: 52: Hoare triple {14392#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {14393#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:36:40,985 INFO L290 TraceCheckUtils]: 53: Hoare triple {14393#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14393#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:36:40,987 INFO L290 TraceCheckUtils]: 54: Hoare triple {14393#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14394#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:36:40,987 INFO L290 TraceCheckUtils]: 55: Hoare triple {14394#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {14394#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:36:40,988 INFO L290 TraceCheckUtils]: 56: Hoare triple {14394#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {14395#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:36:40,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {14395#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {14395#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:36:40,989 INFO L290 TraceCheckUtils]: 58: Hoare triple {14395#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {14396#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:36:40,989 INFO L290 TraceCheckUtils]: 59: Hoare triple {14396#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {14396#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:36:40,991 INFO L290 TraceCheckUtils]: 60: Hoare triple {14396#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {14397#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:36:40,991 INFO L290 TraceCheckUtils]: 61: Hoare triple {14397#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {14397#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:36:40,992 INFO L290 TraceCheckUtils]: 62: Hoare triple {14397#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {14398#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:36:40,993 INFO L290 TraceCheckUtils]: 63: Hoare triple {14398#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {14398#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:36:40,993 INFO L290 TraceCheckUtils]: 64: Hoare triple {14398#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {14399#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:36:40,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {14399#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14399#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:36:40,994 INFO L290 TraceCheckUtils]: 66: Hoare triple {14399#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14400#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:36:40,994 INFO L290 TraceCheckUtils]: 67: Hoare triple {14400#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14400#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:36:40,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {14400#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14401#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:36:40,995 INFO L290 TraceCheckUtils]: 69: Hoare triple {14401#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {14401#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:36:40,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {14401#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {14402#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:36:40,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {14402#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14402#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:36:40,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {14402#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14403#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:36:40,997 INFO L290 TraceCheckUtils]: 73: Hoare triple {14403#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {14403#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:36:40,998 INFO L290 TraceCheckUtils]: 74: Hoare triple {14403#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {14404#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:36:40,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {14404#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {14404#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:36:40,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {14404#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {14405#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:36:40,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {14405#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {14405#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:36:41,000 INFO L290 TraceCheckUtils]: 78: Hoare triple {14405#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14406#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:36:41,000 INFO L290 TraceCheckUtils]: 79: Hoare triple {14406#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {14406#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:36:41,001 INFO L290 TraceCheckUtils]: 80: Hoare triple {14406#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {14407#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:36:41,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {14407#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {14407#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:36:41,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {14407#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {14662#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:36:41,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {14662#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {14666#(and (<= main_~i~0 (* main_~k~0 38)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:36:41,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {14666#(and (<= main_~i~0 (* main_~k~0 38)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {14670#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 39)))} is VALID [2022-04-15 12:36:41,007 INFO L290 TraceCheckUtils]: 85: Hoare triple {14670#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 39)))} assume !(~i~0 < 1000000 * ~k~0); {14366#false} is VALID [2022-04-15 12:36:41,007 INFO L272 TraceCheckUtils]: 86: Hoare triple {14366#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {14366#false} is VALID [2022-04-15 12:36:41,007 INFO L290 TraceCheckUtils]: 87: Hoare triple {14366#false} ~cond := #in~cond; {14366#false} is VALID [2022-04-15 12:36:41,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {14366#false} assume 0 == ~cond; {14366#false} is VALID [2022-04-15 12:36:41,007 INFO L290 TraceCheckUtils]: 89: Hoare triple {14366#false} assume !false; {14366#false} is VALID [2022-04-15 12:36:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:36:41,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:36:46,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {14366#false} assume !false; {14366#false} is VALID [2022-04-15 12:36:46,947 INFO L290 TraceCheckUtils]: 88: Hoare triple {14366#false} assume 0 == ~cond; {14366#false} is VALID [2022-04-15 12:36:46,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {14366#false} ~cond := #in~cond; {14366#false} is VALID [2022-04-15 12:36:46,947 INFO L272 TraceCheckUtils]: 86: Hoare triple {14366#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {14366#false} is VALID [2022-04-15 12:36:46,954 INFO L290 TraceCheckUtils]: 85: Hoare triple {14410#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {14366#false} is VALID [2022-04-15 12:36:46,957 INFO L290 TraceCheckUtils]: 84: Hoare triple {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {14410#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:36:46,957 INFO L290 TraceCheckUtils]: 83: Hoare triple {14704#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {14409#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:36:46,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {14708#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {14704#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:36:46,959 INFO L290 TraceCheckUtils]: 81: Hoare triple {14708#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {14708#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:36:46,962 INFO L290 TraceCheckUtils]: 80: Hoare triple {14715#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {14708#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:36:46,963 INFO L290 TraceCheckUtils]: 79: Hoare triple {14715#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {14715#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:36:46,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {14722#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {14715#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:36:46,965 INFO L290 TraceCheckUtils]: 77: Hoare triple {14722#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {14722#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:36:46,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {14729#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14722#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:36:46,966 INFO L290 TraceCheckUtils]: 75: Hoare triple {14729#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14729#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,967 INFO L290 TraceCheckUtils]: 74: Hoare triple {14736#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {14729#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,967 INFO L290 TraceCheckUtils]: 73: Hoare triple {14736#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {14736#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:36:46,968 INFO L290 TraceCheckUtils]: 72: Hoare triple {14743#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {14736#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:36:46,968 INFO L290 TraceCheckUtils]: 71: Hoare triple {14743#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {14743#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:36:46,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {14750#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14743#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:36:46,970 INFO L290 TraceCheckUtils]: 69: Hoare triple {14750#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14750#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {14757#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {14750#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {14757#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {14757#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:36:46,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {14764#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {14757#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:36:46,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {14764#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {14764#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:36:46,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {14771#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14764#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:36:46,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {14771#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14771#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,975 INFO L290 TraceCheckUtils]: 62: Hoare triple {14778#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14771#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,975 INFO L290 TraceCheckUtils]: 61: Hoare triple {14778#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14778#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {14785#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {14778#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {14785#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {14785#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:36:46,977 INFO L290 TraceCheckUtils]: 58: Hoare triple {14792#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14785#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:36:46,978 INFO L290 TraceCheckUtils]: 57: Hoare triple {14792#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14792#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,978 INFO L290 TraceCheckUtils]: 56: Hoare triple {14799#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {14792#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {14799#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {14799#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:36:46,980 INFO L290 TraceCheckUtils]: 54: Hoare triple {14806#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {14799#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:36:46,980 INFO L290 TraceCheckUtils]: 53: Hoare triple {14806#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {14806#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:36:46,981 INFO L290 TraceCheckUtils]: 52: Hoare triple {14813#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14806#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:36:46,982 INFO L290 TraceCheckUtils]: 51: Hoare triple {14813#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14813#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,983 INFO L290 TraceCheckUtils]: 50: Hoare triple {14820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {14813#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,983 INFO L290 TraceCheckUtils]: 49: Hoare triple {14820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {14820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:36:46,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {14827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {14820#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:36:46,984 INFO L290 TraceCheckUtils]: 47: Hoare triple {14827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {14827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:36:46,985 INFO L290 TraceCheckUtils]: 46: Hoare triple {14834#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14827#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:36:46,985 INFO L290 TraceCheckUtils]: 45: Hoare triple {14834#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14834#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {14841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {14834#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {14841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {14841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:36:46,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {14848#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14841#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:36:46,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {14848#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14848#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,989 INFO L290 TraceCheckUtils]: 40: Hoare triple {14855#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {14848#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,989 INFO L290 TraceCheckUtils]: 39: Hoare triple {14855#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {14855#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:36:46,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {14862#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14855#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:36:46,990 INFO L290 TraceCheckUtils]: 37: Hoare triple {14862#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14862#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,991 INFO L290 TraceCheckUtils]: 36: Hoare triple {14869#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14862#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {14869#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14869#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {14876#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {14869#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,993 INFO L290 TraceCheckUtils]: 33: Hoare triple {14876#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {14876#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:36:46,993 INFO L290 TraceCheckUtils]: 32: Hoare triple {14883#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14876#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:36:46,994 INFO L290 TraceCheckUtils]: 31: Hoare triple {14883#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14883#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {14890#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14883#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {14890#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14890#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,996 INFO L290 TraceCheckUtils]: 28: Hoare triple {14897#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14890#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,996 INFO L290 TraceCheckUtils]: 27: Hoare triple {14897#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14897#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,997 INFO L290 TraceCheckUtils]: 26: Hoare triple {14904#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {14897#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {14904#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {14904#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:36:46,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {14911#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14904#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:36:46,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {14911#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14911#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,999 INFO L290 TraceCheckUtils]: 22: Hoare triple {14918#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {14911#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:46,999 INFO L290 TraceCheckUtils]: 21: Hoare triple {14918#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {14918#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:36:47,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {14925#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14918#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:36:47,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {14925#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14925#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {14932#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14925#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {14932#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14932#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14932#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {14939#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14939#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {14946#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {14939#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {14946#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {14946#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:36:47,005 INFO L290 TraceCheckUtils]: 12: Hoare triple {14953#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} ~i~0 := ~i~0 + ~k~0; {14946#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:36:47,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {14953#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} assume !!(~i~0 < 1000000 * ~k~0); {14953#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:36:47,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {14960#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {14953#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:36:47,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {14960#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {14960#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {14967#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999961)) 1)} ~i~0 := ~i~0 + ~k~0; {14960#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:36:47,008 INFO L290 TraceCheckUtils]: 7: Hoare triple {14967#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999961)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {14967#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999961)) 1)} is VALID [2022-04-15 12:36:47,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {14365#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {14967#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999961)) 1)} is VALID [2022-04-15 12:36:47,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {14365#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {14365#true} is VALID [2022-04-15 12:36:47,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {14365#true} call #t~ret2 := main(); {14365#true} is VALID [2022-04-15 12:36:47,009 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14365#true} {14365#true} #55#return; {14365#true} is VALID [2022-04-15 12:36:47,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {14365#true} assume true; {14365#true} is VALID [2022-04-15 12:36:47,009 INFO L290 TraceCheckUtils]: 1: Hoare triple {14365#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {14365#true} is VALID [2022-04-15 12:36:47,009 INFO L272 TraceCheckUtils]: 0: Hoare triple {14365#true} call ULTIMATE.init(); {14365#true} is VALID [2022-04-15 12:36:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:36:47,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533016292] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:36:47,010 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:36:47,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 87 [2022-04-15 12:36:47,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:36:47,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1159119043] [2022-04-15 12:36:47,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1159119043] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:36:47,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:36:47,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 12:36:47,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924062783] [2022-04-15 12:36:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:36:47,011 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:36:47,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:36:47,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:36:47,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:36:47,240 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 12:36:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:36:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 12:36:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2521, Invalid=4961, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 12:36:47,242 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:52,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:52,638 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-04-15 12:37:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 12:37:52,638 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-15 12:37:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:37:52,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:52,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 101 transitions. [2022-04-15 12:37:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 101 transitions. [2022-04-15 12:37:52,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 101 transitions. [2022-04-15 12:37:53,101 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:37:53,102 INFO L225 Difference]: With dead ends: 100 [2022-04-15 12:37:53,102 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 12:37:53,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 70.0s TimeCoverageRelationStatistics Valid=5934, Invalid=10578, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 12:37:53,103 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 127 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 12:37:53,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 219 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 12:37:53,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 12:37:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-15 12:37:53,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:37:53,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:53,249 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:53,249 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:53,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:53,251 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2022-04-15 12:37:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-15 12:37:53,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:37:53,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:37:53,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:37:53,252 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 95 states. [2022-04-15 12:37:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:37:53,253 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2022-04-15 12:37:53,253 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-15 12:37:53,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:37:53,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:37:53,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:37:53,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:37:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.011111111111111) internal successors, (91), 90 states have internal predecessors, (91), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2022-04-15 12:37:53,255 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2022-04-15 12:37:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:37:53,255 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2022-04-15 12:37:53,256 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.9545454545454546) internal successors, (86), 43 states have internal predecessors, (86), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:37:53,256 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 95 transitions. [2022-04-15 12:37:53,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:37:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2022-04-15 12:37:53,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 12:37:53,695 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:37:53,695 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:37:53,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 12:37:53,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,SelfDestructingSolverStorable42,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:37:53,919 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:37:53,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:37:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash -368219805, now seen corresponding path program 43 times [2022-04-15 12:37:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:37:53,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1874870847] [2022-04-15 12:37:53,980 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:37:53,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1803863217, now seen corresponding path program 1 times [2022-04-15 12:37:53,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:37:53,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932210746] [2022-04-15 12:37:53,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:37:53,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:37:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:37:53,986 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:37:53,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:37:53,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:37:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash -368219805, now seen corresponding path program 44 times [2022-04-15 12:37:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:37:53,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789902482] [2022-04-15 12:37:53,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:37:53,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:37:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:37:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:37:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:37:56,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {15706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15658#true} is VALID [2022-04-15 12:37:56,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {15658#true} assume true; {15658#true} is VALID [2022-04-15 12:37:56,836 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15658#true} {15658#true} #55#return; {15658#true} is VALID [2022-04-15 12:37:56,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {15658#true} call ULTIMATE.init(); {15706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:37:56,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {15706#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15658#true} is VALID [2022-04-15 12:37:56,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {15658#true} assume true; {15658#true} is VALID [2022-04-15 12:37:56,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15658#true} {15658#true} #55#return; {15658#true} is VALID [2022-04-15 12:37:56,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {15658#true} call #t~ret2 := main(); {15658#true} is VALID [2022-04-15 12:37:56,837 INFO L290 TraceCheckUtils]: 5: Hoare triple {15658#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {15658#true} is VALID [2022-04-15 12:37:56,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {15658#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {15663#(= main_~i~0 0)} is VALID [2022-04-15 12:37:56,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {15663#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {15663#(= main_~i~0 0)} is VALID [2022-04-15 12:37:56,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {15663#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {15664#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:37:56,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {15664#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {15664#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:37:56,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {15664#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {15665#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:37:56,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {15665#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {15665#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:37:56,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {15665#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {15666#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:37:56,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {15666#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {15666#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:37:56,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {15666#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {15667#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:37:56,844 INFO L290 TraceCheckUtils]: 15: Hoare triple {15667#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {15667#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:37:56,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {15667#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {15668#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:37:56,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {15668#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15668#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:37:56,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {15668#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15669#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:37:56,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {15669#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {15669#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:37:56,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {15669#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {15670#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:37:56,847 INFO L290 TraceCheckUtils]: 21: Hoare triple {15670#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15670#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:37:56,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {15670#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15671#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:37:56,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {15671#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {15671#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:37:56,849 INFO L290 TraceCheckUtils]: 24: Hoare triple {15671#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {15672#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:37:56,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {15672#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {15672#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:37:56,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {15672#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {15673#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:37:56,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {15673#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {15673#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:37:56,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {15673#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {15674#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:37:56,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {15674#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {15674#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:37:56,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {15674#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {15675#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:37:56,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {15675#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {15675#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:37:56,857 INFO L290 TraceCheckUtils]: 32: Hoare triple {15675#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {15676#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:37:56,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {15676#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {15676#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:37:56,858 INFO L290 TraceCheckUtils]: 34: Hoare triple {15676#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {15677#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:37:56,858 INFO L290 TraceCheckUtils]: 35: Hoare triple {15677#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {15677#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:37:56,859 INFO L290 TraceCheckUtils]: 36: Hoare triple {15677#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {15678#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:37:56,859 INFO L290 TraceCheckUtils]: 37: Hoare triple {15678#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {15678#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:37:56,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {15678#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {15679#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:37:56,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {15679#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {15679#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:37:56,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {15679#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {15680#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:37:56,863 INFO L290 TraceCheckUtils]: 41: Hoare triple {15680#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {15680#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:37:56,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {15680#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {15681#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:37:56,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {15681#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {15681#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:37:56,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {15681#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {15682#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:37:56,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {15682#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15682#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:37:56,868 INFO L290 TraceCheckUtils]: 46: Hoare triple {15682#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15683#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:37:56,869 INFO L290 TraceCheckUtils]: 47: Hoare triple {15683#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {15683#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:37:56,869 INFO L290 TraceCheckUtils]: 48: Hoare triple {15683#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {15684#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:37:56,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {15684#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {15684#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:37:56,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {15684#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {15685#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:37:56,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {15685#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {15685#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:37:56,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {15685#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {15686#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:37:56,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {15686#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15686#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:37:56,874 INFO L290 TraceCheckUtils]: 54: Hoare triple {15686#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15687#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:37:56,875 INFO L290 TraceCheckUtils]: 55: Hoare triple {15687#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {15687#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:37:56,875 INFO L290 TraceCheckUtils]: 56: Hoare triple {15687#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {15688#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:37:56,876 INFO L290 TraceCheckUtils]: 57: Hoare triple {15688#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {15688#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:37:56,877 INFO L290 TraceCheckUtils]: 58: Hoare triple {15688#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {15689#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:37:56,877 INFO L290 TraceCheckUtils]: 59: Hoare triple {15689#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {15689#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:37:56,879 INFO L290 TraceCheckUtils]: 60: Hoare triple {15689#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {15690#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:37:56,879 INFO L290 TraceCheckUtils]: 61: Hoare triple {15690#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {15690#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:37:56,881 INFO L290 TraceCheckUtils]: 62: Hoare triple {15690#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {15691#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:37:56,882 INFO L290 TraceCheckUtils]: 63: Hoare triple {15691#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {15691#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:37:56,883 INFO L290 TraceCheckUtils]: 64: Hoare triple {15691#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {15692#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:37:56,883 INFO L290 TraceCheckUtils]: 65: Hoare triple {15692#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15692#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:37:56,884 INFO L290 TraceCheckUtils]: 66: Hoare triple {15692#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15693#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:37:56,884 INFO L290 TraceCheckUtils]: 67: Hoare triple {15693#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15693#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:37:56,885 INFO L290 TraceCheckUtils]: 68: Hoare triple {15693#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15694#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:37:56,885 INFO L290 TraceCheckUtils]: 69: Hoare triple {15694#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {15694#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:37:56,886 INFO L290 TraceCheckUtils]: 70: Hoare triple {15694#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {15695#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:37:56,886 INFO L290 TraceCheckUtils]: 71: Hoare triple {15695#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15695#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:37:56,888 INFO L290 TraceCheckUtils]: 72: Hoare triple {15695#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15696#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:37:56,888 INFO L290 TraceCheckUtils]: 73: Hoare triple {15696#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {15696#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:37:56,890 INFO L290 TraceCheckUtils]: 74: Hoare triple {15696#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {15697#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:37:56,890 INFO L290 TraceCheckUtils]: 75: Hoare triple {15697#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {15697#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:37:56,891 INFO L290 TraceCheckUtils]: 76: Hoare triple {15697#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {15698#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:37:56,891 INFO L290 TraceCheckUtils]: 77: Hoare triple {15698#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15698#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:37:56,892 INFO L290 TraceCheckUtils]: 78: Hoare triple {15698#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15699#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:37:56,892 INFO L290 TraceCheckUtils]: 79: Hoare triple {15699#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {15699#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:37:56,892 INFO L290 TraceCheckUtils]: 80: Hoare triple {15699#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {15700#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:37:56,893 INFO L290 TraceCheckUtils]: 81: Hoare triple {15700#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {15700#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:37:56,894 INFO L290 TraceCheckUtils]: 82: Hoare triple {15700#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {15701#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:37:56,894 INFO L290 TraceCheckUtils]: 83: Hoare triple {15701#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {15701#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:37:56,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {15701#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {15702#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:37:56,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {15702#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {15703#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:37:56,910 INFO L290 TraceCheckUtils]: 86: Hoare triple {15703#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:37:56,911 INFO L290 TraceCheckUtils]: 87: Hoare triple {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:37:56,913 INFO L290 TraceCheckUtils]: 88: Hoare triple {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15705#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:37:56,920 INFO L290 TraceCheckUtils]: 89: Hoare triple {15705#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {15659#false} is VALID [2022-04-15 12:37:56,920 INFO L272 TraceCheckUtils]: 90: Hoare triple {15659#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {15659#false} is VALID [2022-04-15 12:37:56,920 INFO L290 TraceCheckUtils]: 91: Hoare triple {15659#false} ~cond := #in~cond; {15659#false} is VALID [2022-04-15 12:37:56,920 INFO L290 TraceCheckUtils]: 92: Hoare triple {15659#false} assume 0 == ~cond; {15659#false} is VALID [2022-04-15 12:37:56,920 INFO L290 TraceCheckUtils]: 93: Hoare triple {15659#false} assume !false; {15659#false} is VALID [2022-04-15 12:37:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:37:56,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:37:56,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789902482] [2022-04-15 12:37:56,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789902482] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:37:56,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747508827] [2022-04-15 12:37:56,922 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:37:56,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:37:56,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:37:56,924 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:37:56,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 12:37:57,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:37:57,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:37:57,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 12:37:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:37:57,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:37:58,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {15658#true} call ULTIMATE.init(); {15658#true} is VALID [2022-04-15 12:37:58,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {15658#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15658#true} is VALID [2022-04-15 12:37:58,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {15658#true} assume true; {15658#true} is VALID [2022-04-15 12:37:58,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15658#true} {15658#true} #55#return; {15658#true} is VALID [2022-04-15 12:37:58,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {15658#true} call #t~ret2 := main(); {15658#true} is VALID [2022-04-15 12:37:58,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {15658#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {15658#true} is VALID [2022-04-15 12:37:58,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {15658#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {15728#(<= main_~i~0 0)} is VALID [2022-04-15 12:37:58,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {15728#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {15728#(<= main_~i~0 0)} is VALID [2022-04-15 12:37:58,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {15728#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {15664#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:37:58,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {15664#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {15664#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:37:58,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {15664#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {15665#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:37:58,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {15665#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {15665#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:37:58,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {15665#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {15666#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:37:58,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {15666#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {15666#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:37:58,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {15666#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {15667#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:37:58,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {15667#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {15667#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:37:58,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {15667#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {15668#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:37:58,294 INFO L290 TraceCheckUtils]: 17: Hoare triple {15668#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15668#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:37:58,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {15668#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15669#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:37:58,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {15669#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {15669#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:37:58,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {15669#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {15670#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:37:58,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {15670#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15670#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:37:58,297 INFO L290 TraceCheckUtils]: 22: Hoare triple {15670#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15671#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:37:58,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {15671#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {15671#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:37:58,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {15671#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {15672#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:37:58,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {15672#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {15672#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:37:58,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {15672#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {15673#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:37:58,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {15673#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {15673#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:37:58,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {15673#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {15674#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:37:58,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {15674#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {15674#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:37:58,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {15674#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {15675#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:37:58,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {15675#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {15675#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:37:58,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {15675#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {15676#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:37:58,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {15676#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {15676#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:37:58,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {15676#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {15677#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:37:58,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {15677#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {15677#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:37:58,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {15677#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {15678#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:37:58,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {15678#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {15678#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:37:58,308 INFO L290 TraceCheckUtils]: 38: Hoare triple {15678#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {15679#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:37:58,309 INFO L290 TraceCheckUtils]: 39: Hoare triple {15679#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {15679#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:37:58,309 INFO L290 TraceCheckUtils]: 40: Hoare triple {15679#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {15680#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:37:58,309 INFO L290 TraceCheckUtils]: 41: Hoare triple {15680#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {15680#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:37:58,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {15680#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {15681#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:37:58,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {15681#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {15681#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:37:58,312 INFO L290 TraceCheckUtils]: 44: Hoare triple {15681#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {15682#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:37:58,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {15682#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15682#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:37:58,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {15682#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15683#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:37:58,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {15683#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {15683#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:37:58,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {15683#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {15684#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:37:58,315 INFO L290 TraceCheckUtils]: 49: Hoare triple {15684#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {15684#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:37:58,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {15684#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {15685#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:37:58,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {15685#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {15685#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:37:58,317 INFO L290 TraceCheckUtils]: 52: Hoare triple {15685#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {15686#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:37:58,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {15686#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15686#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:37:58,319 INFO L290 TraceCheckUtils]: 54: Hoare triple {15686#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15687#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:37:58,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {15687#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {15687#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:37:58,320 INFO L290 TraceCheckUtils]: 56: Hoare triple {15687#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {15688#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:37:58,320 INFO L290 TraceCheckUtils]: 57: Hoare triple {15688#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {15688#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:37:58,321 INFO L290 TraceCheckUtils]: 58: Hoare triple {15688#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {15689#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:37:58,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {15689#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {15689#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:37:58,323 INFO L290 TraceCheckUtils]: 60: Hoare triple {15689#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {15690#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:37:58,323 INFO L290 TraceCheckUtils]: 61: Hoare triple {15690#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {15690#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:37:58,325 INFO L290 TraceCheckUtils]: 62: Hoare triple {15690#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {15691#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:37:58,325 INFO L290 TraceCheckUtils]: 63: Hoare triple {15691#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {15691#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:37:58,326 INFO L290 TraceCheckUtils]: 64: Hoare triple {15691#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {15692#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:37:58,326 INFO L290 TraceCheckUtils]: 65: Hoare triple {15692#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15692#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:37:58,327 INFO L290 TraceCheckUtils]: 66: Hoare triple {15692#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15693#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:37:58,327 INFO L290 TraceCheckUtils]: 67: Hoare triple {15693#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15693#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:37:58,327 INFO L290 TraceCheckUtils]: 68: Hoare triple {15693#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15694#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:37:58,328 INFO L290 TraceCheckUtils]: 69: Hoare triple {15694#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {15694#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:37:58,328 INFO L290 TraceCheckUtils]: 70: Hoare triple {15694#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {15695#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:37:58,328 INFO L290 TraceCheckUtils]: 71: Hoare triple {15695#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15695#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:37:58,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {15695#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15696#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:37:58,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {15696#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {15696#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:37:58,331 INFO L290 TraceCheckUtils]: 74: Hoare triple {15696#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {15697#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:37:58,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {15697#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {15697#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:37:58,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {15697#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {15698#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:37:58,332 INFO L290 TraceCheckUtils]: 77: Hoare triple {15698#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15698#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:37:58,333 INFO L290 TraceCheckUtils]: 78: Hoare triple {15698#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15699#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:37:58,333 INFO L290 TraceCheckUtils]: 79: Hoare triple {15699#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {15699#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:37:58,334 INFO L290 TraceCheckUtils]: 80: Hoare triple {15699#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {15700#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:37:58,334 INFO L290 TraceCheckUtils]: 81: Hoare triple {15700#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {15700#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:37:58,335 INFO L290 TraceCheckUtils]: 82: Hoare triple {15700#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {15701#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:37:58,335 INFO L290 TraceCheckUtils]: 83: Hoare triple {15701#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {15701#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:37:58,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {15701#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {15702#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:37:58,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {15702#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {15702#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:37:58,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {15702#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {15969#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:37:58,337 INFO L290 TraceCheckUtils]: 87: Hoare triple {15969#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {15973#(and (<= main_~i~0 (* 40 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:37:58,339 INFO L290 TraceCheckUtils]: 88: Hoare triple {15973#(and (<= main_~i~0 (* 40 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {15977#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 41 main_~k~0)))} is VALID [2022-04-15 12:37:58,345 INFO L290 TraceCheckUtils]: 89: Hoare triple {15977#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* 41 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {15659#false} is VALID [2022-04-15 12:37:58,345 INFO L272 TraceCheckUtils]: 90: Hoare triple {15659#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {15659#false} is VALID [2022-04-15 12:37:58,345 INFO L290 TraceCheckUtils]: 91: Hoare triple {15659#false} ~cond := #in~cond; {15659#false} is VALID [2022-04-15 12:37:58,345 INFO L290 TraceCheckUtils]: 92: Hoare triple {15659#false} assume 0 == ~cond; {15659#false} is VALID [2022-04-15 12:37:58,345 INFO L290 TraceCheckUtils]: 93: Hoare triple {15659#false} assume !false; {15659#false} is VALID [2022-04-15 12:37:58,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:37:58,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:38:05,703 INFO L290 TraceCheckUtils]: 93: Hoare triple {15659#false} assume !false; {15659#false} is VALID [2022-04-15 12:38:05,703 INFO L290 TraceCheckUtils]: 92: Hoare triple {15659#false} assume 0 == ~cond; {15659#false} is VALID [2022-04-15 12:38:05,703 INFO L290 TraceCheckUtils]: 91: Hoare triple {15659#false} ~cond := #in~cond; {15659#false} is VALID [2022-04-15 12:38:05,704 INFO L272 TraceCheckUtils]: 90: Hoare triple {15659#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {15659#false} is VALID [2022-04-15 12:38:05,708 INFO L290 TraceCheckUtils]: 89: Hoare triple {15705#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {15659#false} is VALID [2022-04-15 12:38:05,711 INFO L290 TraceCheckUtils]: 88: Hoare triple {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {15705#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:38:05,711 INFO L290 TraceCheckUtils]: 87: Hoare triple {16011#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {15704#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:38:05,712 INFO L290 TraceCheckUtils]: 86: Hoare triple {16015#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {16011#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:38:05,712 INFO L290 TraceCheckUtils]: 85: Hoare triple {16015#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {16015#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:38:05,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {16022#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {16015#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:38:05,716 INFO L290 TraceCheckUtils]: 83: Hoare triple {16022#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {16022#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:38:05,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {16029#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {16022#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:38:05,717 INFO L290 TraceCheckUtils]: 81: Hoare triple {16029#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {16029#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:38:05,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {16036#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16029#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:38:05,718 INFO L290 TraceCheckUtils]: 79: Hoare triple {16036#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16036#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,719 INFO L290 TraceCheckUtils]: 78: Hoare triple {16043#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {16036#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,719 INFO L290 TraceCheckUtils]: 77: Hoare triple {16043#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {16043#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:38:05,720 INFO L290 TraceCheckUtils]: 76: Hoare triple {16050#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {16043#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:38:05,720 INFO L290 TraceCheckUtils]: 75: Hoare triple {16050#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {16050#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:38:05,721 INFO L290 TraceCheckUtils]: 74: Hoare triple {16057#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16050#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:38:05,721 INFO L290 TraceCheckUtils]: 73: Hoare triple {16057#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16057#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,722 INFO L290 TraceCheckUtils]: 72: Hoare triple {16064#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {16057#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,722 INFO L290 TraceCheckUtils]: 71: Hoare triple {16064#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {16064#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:38:05,723 INFO L290 TraceCheckUtils]: 70: Hoare triple {16071#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {16064#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:38:05,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {16071#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {16071#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:38:05,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {16078#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16071#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:38:05,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {16078#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16078#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,728 INFO L290 TraceCheckUtils]: 66: Hoare triple {16085#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16078#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,728 INFO L290 TraceCheckUtils]: 65: Hoare triple {16085#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16085#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {16092#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {16085#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,729 INFO L290 TraceCheckUtils]: 63: Hoare triple {16092#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {16092#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:38:05,730 INFO L290 TraceCheckUtils]: 62: Hoare triple {16099#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16092#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:38:05,730 INFO L290 TraceCheckUtils]: 61: Hoare triple {16099#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16099#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,731 INFO L290 TraceCheckUtils]: 60: Hoare triple {16106#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {16099#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,731 INFO L290 TraceCheckUtils]: 59: Hoare triple {16106#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {16106#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:38:05,732 INFO L290 TraceCheckUtils]: 58: Hoare triple {16113#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {16106#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:38:05,733 INFO L290 TraceCheckUtils]: 57: Hoare triple {16113#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {16113#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:38:05,733 INFO L290 TraceCheckUtils]: 56: Hoare triple {16120#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16113#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:38:05,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {16120#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16120#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {16127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {16120#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,735 INFO L290 TraceCheckUtils]: 53: Hoare triple {16127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {16127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:38:05,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {16134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {16127#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:38:05,736 INFO L290 TraceCheckUtils]: 51: Hoare triple {16134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {16134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:38:05,736 INFO L290 TraceCheckUtils]: 50: Hoare triple {16141#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16134#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:38:05,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {16141#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16141#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {16148#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {16141#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {16148#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {16148#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:38:05,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {16155#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16148#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:38:05,739 INFO L290 TraceCheckUtils]: 45: Hoare triple {16155#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16155#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {16162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {16155#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,740 INFO L290 TraceCheckUtils]: 43: Hoare triple {16162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {16162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:38:05,740 INFO L290 TraceCheckUtils]: 42: Hoare triple {16169#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16162#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:38:05,741 INFO L290 TraceCheckUtils]: 41: Hoare triple {16169#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16169#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,741 INFO L290 TraceCheckUtils]: 40: Hoare triple {16176#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16169#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {16176#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16176#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,742 INFO L290 TraceCheckUtils]: 38: Hoare triple {16183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {16176#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,743 INFO L290 TraceCheckUtils]: 37: Hoare triple {16183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {16183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:38:05,743 INFO L290 TraceCheckUtils]: 36: Hoare triple {16190#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16183#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:38:05,744 INFO L290 TraceCheckUtils]: 35: Hoare triple {16190#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16190#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,744 INFO L290 TraceCheckUtils]: 34: Hoare triple {16197#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16190#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,744 INFO L290 TraceCheckUtils]: 33: Hoare triple {16197#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16197#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,745 INFO L290 TraceCheckUtils]: 32: Hoare triple {16204#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16197#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {16204#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16204#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,746 INFO L290 TraceCheckUtils]: 30: Hoare triple {16211#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {16204#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,746 INFO L290 TraceCheckUtils]: 29: Hoare triple {16211#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {16211#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:38:05,747 INFO L290 TraceCheckUtils]: 28: Hoare triple {16218#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16211#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:38:05,747 INFO L290 TraceCheckUtils]: 27: Hoare triple {16218#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16218#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,748 INFO L290 TraceCheckUtils]: 26: Hoare triple {16225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {16218#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,748 INFO L290 TraceCheckUtils]: 25: Hoare triple {16225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {16225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:38:05,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {16232#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16225#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:38:05,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {16232#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16232#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {16239#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16232#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {16239#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16239#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {16246#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16239#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,751 INFO L290 TraceCheckUtils]: 19: Hoare triple {16246#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16246#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {16253#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {16246#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {16253#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {16253#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:38:05,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {16260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} ~i~0 := ~i~0 + ~k~0; {16253#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:38:05,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {16260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} assume !!(~i~0 < 1000000 * ~k~0); {16260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:38:05,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {16267#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16260#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:38:05,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {16267#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16267#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {16274#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {16267#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {16274#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {16274#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {16281#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} ~i~0 := ~i~0 + ~k~0; {16274#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:38:05,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {16281#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} assume !!(~i~0 < 1000000 * ~k~0); {16281#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:38:05,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {16288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999959)) 1)} ~i~0 := ~i~0 + ~k~0; {16281#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:38:05,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {16288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999959)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {16288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999959)) 1)} is VALID [2022-04-15 12:38:05,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {15658#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {16288#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999959)) 1)} is VALID [2022-04-15 12:38:05,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {15658#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {15658#true} is VALID [2022-04-15 12:38:05,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {15658#true} call #t~ret2 := main(); {15658#true} is VALID [2022-04-15 12:38:05,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15658#true} {15658#true} #55#return; {15658#true} is VALID [2022-04-15 12:38:05,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {15658#true} assume true; {15658#true} is VALID [2022-04-15 12:38:05,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {15658#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {15658#true} is VALID [2022-04-15 12:38:05,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {15658#true} call ULTIMATE.init(); {15658#true} is VALID [2022-04-15 12:38:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:38:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747508827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:38:05,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:38:05,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 91 [2022-04-15 12:38:05,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:38:05,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1874870847] [2022-04-15 12:38:05,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1874870847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:38:05,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:38:05,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 12:38:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823874131] [2022-04-15 12:38:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:38:05,760 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 12:38:05,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:38:05,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:38:05,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:38:05,964 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 12:38:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:38:05,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 12:38:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2772, Invalid=5418, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 12:38:05,965 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:30,118 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-04-15 12:39:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 12:39:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-15 12:39:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 105 transitions. [2022-04-15 12:39:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 105 transitions. [2022-04-15 12:39:30,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 105 transitions. [2022-04-15 12:39:30,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:30,460 INFO L225 Difference]: With dead ends: 104 [2022-04-15 12:39:30,460 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 12:39:30,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=6523, Invalid=11567, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 12:39:30,462 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 133 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:30,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 229 Invalid, 477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 12:39:30,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 12:39:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-04-15 12:39:30,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:30,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,620 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,620 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:30,628 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-04-15 12:39:30,628 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-15 12:39:30,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:30,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:30,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 12:39:30,629 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-15 12:39:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:30,630 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-04-15 12:39:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-15 12:39:30,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:30,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:30,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:30,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0106382978723405) internal successors, (95), 94 states have internal predecessors, (95), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-04-15 12:39:30,632 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2022-04-15 12:39:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:30,633 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-04-15 12:39:30,633 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.9565217391304348) internal successors, (90), 45 states have internal predecessors, (90), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:30,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 99 transitions. [2022-04-15 12:39:31,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:31,105 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-04-15 12:39:31,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 12:39:31,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:31,107 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:31,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 12:39:31,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:31,319 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:31,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1129169889, now seen corresponding path program 45 times [2022-04-15 12:39:31,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:31,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576216337] [2022-04-15 12:39:31,382 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:31,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1862968561, now seen corresponding path program 1 times [2022-04-15 12:39:31,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:31,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767511993] [2022-04-15 12:39:31,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:31,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:39:31,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:39:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:39:31,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:39:31,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1129169889, now seen corresponding path program 46 times [2022-04-15 12:39:31,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:31,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354177779] [2022-04-15 12:39:31,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:31,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:34,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:34,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {17057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17007#true} is VALID [2022-04-15 12:39:34,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {17007#true} assume true; {17007#true} is VALID [2022-04-15 12:39:34,710 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17007#true} {17007#true} #55#return; {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L272 TraceCheckUtils]: 0: Hoare triple {17007#true} call ULTIMATE.init(); {17057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:34,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {17057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {17007#true} assume true; {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17007#true} {17007#true} #55#return; {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {17007#true} call #t~ret2 := main(); {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {17007#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {17007#true} is VALID [2022-04-15 12:39:34,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {17007#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {17012#(= main_~i~0 0)} is VALID [2022-04-15 12:39:34,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {17012#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {17012#(= main_~i~0 0)} is VALID [2022-04-15 12:39:34,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {17012#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {17013#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:39:34,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {17013#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {17013#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:39:34,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {17013#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {17014#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:39:34,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {17014#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {17014#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:39:34,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {17014#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {17015#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:39:34,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {17015#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {17015#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:39:34,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {17015#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {17016#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:39:34,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {17016#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {17016#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:39:34,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {17016#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {17017#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:39:34,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {17017#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17017#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:39:34,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {17017#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17018#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:39:34,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {17018#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {17018#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:39:34,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {17018#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {17019#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:39:34,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {17019#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17019#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:39:34,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {17019#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17020#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:39:34,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {17020#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {17020#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:39:34,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {17020#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {17021#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:39:34,722 INFO L290 TraceCheckUtils]: 25: Hoare triple {17021#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {17021#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:39:34,723 INFO L290 TraceCheckUtils]: 26: Hoare triple {17021#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {17022#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:39:34,724 INFO L290 TraceCheckUtils]: 27: Hoare triple {17022#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {17022#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:39:34,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {17022#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {17023#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:39:34,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {17023#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {17023#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:39:34,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {17023#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {17024#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:39:34,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {17024#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {17024#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:39:34,728 INFO L290 TraceCheckUtils]: 32: Hoare triple {17024#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {17025#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:39:34,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {17025#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {17025#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:39:34,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {17025#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {17026#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:39:34,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {17026#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {17026#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:39:34,730 INFO L290 TraceCheckUtils]: 36: Hoare triple {17026#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {17027#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:39:34,730 INFO L290 TraceCheckUtils]: 37: Hoare triple {17027#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {17027#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:39:34,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {17027#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {17028#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:39:34,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {17028#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {17028#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:39:34,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {17028#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {17029#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:39:34,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {17029#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {17029#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:39:34,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {17029#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {17030#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:39:34,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {17030#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {17030#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:39:34,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {17030#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {17031#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:39:34,736 INFO L290 TraceCheckUtils]: 45: Hoare triple {17031#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17031#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:39:34,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {17031#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17032#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:39:34,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {17032#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {17032#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:39:34,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {17032#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {17033#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:39:34,740 INFO L290 TraceCheckUtils]: 49: Hoare triple {17033#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {17033#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:39:34,740 INFO L290 TraceCheckUtils]: 50: Hoare triple {17033#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {17034#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:39:34,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {17034#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {17034#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:39:34,741 INFO L290 TraceCheckUtils]: 52: Hoare triple {17034#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {17035#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:39:34,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {17035#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17035#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:39:34,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {17035#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17036#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:39:34,744 INFO L290 TraceCheckUtils]: 55: Hoare triple {17036#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {17036#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:39:34,744 INFO L290 TraceCheckUtils]: 56: Hoare triple {17036#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {17037#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:39:34,745 INFO L290 TraceCheckUtils]: 57: Hoare triple {17037#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {17037#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:39:34,745 INFO L290 TraceCheckUtils]: 58: Hoare triple {17037#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {17038#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:39:34,746 INFO L290 TraceCheckUtils]: 59: Hoare triple {17038#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {17038#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:39:34,748 INFO L290 TraceCheckUtils]: 60: Hoare triple {17038#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {17039#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:39:34,748 INFO L290 TraceCheckUtils]: 61: Hoare triple {17039#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {17039#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:39:34,750 INFO L290 TraceCheckUtils]: 62: Hoare triple {17039#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {17040#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:39:34,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {17040#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {17040#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:39:34,751 INFO L290 TraceCheckUtils]: 64: Hoare triple {17040#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {17041#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:39:34,751 INFO L290 TraceCheckUtils]: 65: Hoare triple {17041#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17041#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:39:34,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {17041#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17042#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:39:34,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {17042#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17042#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:39:34,753 INFO L290 TraceCheckUtils]: 68: Hoare triple {17042#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17043#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:39:34,753 INFO L290 TraceCheckUtils]: 69: Hoare triple {17043#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {17043#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:39:34,754 INFO L290 TraceCheckUtils]: 70: Hoare triple {17043#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {17044#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:39:34,754 INFO L290 TraceCheckUtils]: 71: Hoare triple {17044#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17044#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:39:34,756 INFO L290 TraceCheckUtils]: 72: Hoare triple {17044#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17045#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:39:34,756 INFO L290 TraceCheckUtils]: 73: Hoare triple {17045#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {17045#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:39:34,757 INFO L290 TraceCheckUtils]: 74: Hoare triple {17045#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {17046#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:39:34,758 INFO L290 TraceCheckUtils]: 75: Hoare triple {17046#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {17046#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:39:34,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {17046#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {17047#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:39:34,759 INFO L290 TraceCheckUtils]: 77: Hoare triple {17047#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17047#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:39:34,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {17047#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17048#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:39:34,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {17048#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {17048#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:39:34,760 INFO L290 TraceCheckUtils]: 80: Hoare triple {17048#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {17049#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:39:34,760 INFO L290 TraceCheckUtils]: 81: Hoare triple {17049#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {17049#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:39:34,761 INFO L290 TraceCheckUtils]: 82: Hoare triple {17049#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {17050#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:39:34,762 INFO L290 TraceCheckUtils]: 83: Hoare triple {17050#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {17050#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:39:34,762 INFO L290 TraceCheckUtils]: 84: Hoare triple {17050#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {17051#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:39:34,762 INFO L290 TraceCheckUtils]: 85: Hoare triple {17051#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {17051#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:39:34,763 INFO L290 TraceCheckUtils]: 86: Hoare triple {17051#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {17052#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:39:34,763 INFO L290 TraceCheckUtils]: 87: Hoare triple {17052#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17052#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:39:34,764 INFO L290 TraceCheckUtils]: 88: Hoare triple {17052#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17053#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:39:34,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {17053#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17054#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:39:34,778 INFO L290 TraceCheckUtils]: 90: Hoare triple {17054#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:39:34,779 INFO L290 TraceCheckUtils]: 91: Hoare triple {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:39:34,781 INFO L290 TraceCheckUtils]: 92: Hoare triple {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17056#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:39:34,787 INFO L290 TraceCheckUtils]: 93: Hoare triple {17056#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {17008#false} is VALID [2022-04-15 12:39:34,787 INFO L272 TraceCheckUtils]: 94: Hoare triple {17008#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {17008#false} is VALID [2022-04-15 12:39:34,787 INFO L290 TraceCheckUtils]: 95: Hoare triple {17008#false} ~cond := #in~cond; {17008#false} is VALID [2022-04-15 12:39:34,787 INFO L290 TraceCheckUtils]: 96: Hoare triple {17008#false} assume 0 == ~cond; {17008#false} is VALID [2022-04-15 12:39:34,787 INFO L290 TraceCheckUtils]: 97: Hoare triple {17008#false} assume !false; {17008#false} is VALID [2022-04-15 12:39:34,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:39:34,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354177779] [2022-04-15 12:39:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354177779] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:39:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370069235] [2022-04-15 12:39:34,789 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:39:34,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:39:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:34,790 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:39:34,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 12:39:34,862 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:39:34,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:39:34,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-15 12:39:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:34,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:39:36,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {17007#true} call ULTIMATE.init(); {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {17007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {17007#true} assume true; {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17007#true} {17007#true} #55#return; {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {17007#true} call #t~ret2 := main(); {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {17007#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {17007#true} is VALID [2022-04-15 12:39:36,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {17007#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {17079#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:36,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {17079#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {17079#(<= main_~i~0 0)} is VALID [2022-04-15 12:39:36,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {17079#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {17013#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:39:36,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {17013#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {17013#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:39:36,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {17013#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {17014#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:39:36,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {17014#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {17014#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:39:36,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {17014#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {17015#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:39:36,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {17015#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {17015#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:39:36,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {17015#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {17016#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:39:36,252 INFO L290 TraceCheckUtils]: 15: Hoare triple {17016#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {17016#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:39:36,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {17016#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {17017#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:39:36,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {17017#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17017#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:39:36,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {17017#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17018#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:39:36,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {17018#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {17018#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:39:36,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {17018#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {17019#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:39:36,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {17019#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17019#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:39:36,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {17019#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17020#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:39:36,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {17020#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {17020#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:39:36,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {17020#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {17021#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:39:36,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {17021#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {17021#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:39:36,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {17021#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {17022#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:39:36,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {17022#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {17022#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:39:36,261 INFO L290 TraceCheckUtils]: 28: Hoare triple {17022#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {17023#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:39:36,261 INFO L290 TraceCheckUtils]: 29: Hoare triple {17023#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {17023#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:39:36,262 INFO L290 TraceCheckUtils]: 30: Hoare triple {17023#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {17024#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:39:36,262 INFO L290 TraceCheckUtils]: 31: Hoare triple {17024#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {17024#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:39:36,263 INFO L290 TraceCheckUtils]: 32: Hoare triple {17024#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {17025#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:39:36,264 INFO L290 TraceCheckUtils]: 33: Hoare triple {17025#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {17025#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:39:36,264 INFO L290 TraceCheckUtils]: 34: Hoare triple {17025#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {17026#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:39:36,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {17026#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {17026#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:39:36,265 INFO L290 TraceCheckUtils]: 36: Hoare triple {17026#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {17027#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:39:36,266 INFO L290 TraceCheckUtils]: 37: Hoare triple {17027#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {17027#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:39:36,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {17027#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {17028#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:39:36,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {17028#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {17028#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:39:36,268 INFO L290 TraceCheckUtils]: 40: Hoare triple {17028#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {17029#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:39:36,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {17029#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {17029#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:39:36,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {17029#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {17030#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:39:36,270 INFO L290 TraceCheckUtils]: 43: Hoare triple {17030#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {17030#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:39:36,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {17030#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {17031#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:39:36,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {17031#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17031#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:39:36,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {17031#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17032#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:39:36,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {17032#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {17032#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:39:36,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {17032#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {17033#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:39:36,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {17033#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {17033#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:39:36,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {17033#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {17034#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:39:36,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {17034#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {17034#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:39:36,276 INFO L290 TraceCheckUtils]: 52: Hoare triple {17034#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {17035#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:39:36,276 INFO L290 TraceCheckUtils]: 53: Hoare triple {17035#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17035#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:39:36,278 INFO L290 TraceCheckUtils]: 54: Hoare triple {17035#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17036#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:39:36,278 INFO L290 TraceCheckUtils]: 55: Hoare triple {17036#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {17036#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:39:36,279 INFO L290 TraceCheckUtils]: 56: Hoare triple {17036#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {17037#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:39:36,279 INFO L290 TraceCheckUtils]: 57: Hoare triple {17037#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {17037#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:39:36,280 INFO L290 TraceCheckUtils]: 58: Hoare triple {17037#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {17038#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:39:36,280 INFO L290 TraceCheckUtils]: 59: Hoare triple {17038#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {17038#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:39:36,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {17038#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {17039#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:39:36,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {17039#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {17039#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:39:36,284 INFO L290 TraceCheckUtils]: 62: Hoare triple {17039#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {17040#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:39:36,284 INFO L290 TraceCheckUtils]: 63: Hoare triple {17040#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {17040#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:39:36,285 INFO L290 TraceCheckUtils]: 64: Hoare triple {17040#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {17041#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:39:36,285 INFO L290 TraceCheckUtils]: 65: Hoare triple {17041#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17041#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:39:36,286 INFO L290 TraceCheckUtils]: 66: Hoare triple {17041#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17042#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:39:36,286 INFO L290 TraceCheckUtils]: 67: Hoare triple {17042#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17042#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:39:36,287 INFO L290 TraceCheckUtils]: 68: Hoare triple {17042#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17043#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:39:36,287 INFO L290 TraceCheckUtils]: 69: Hoare triple {17043#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {17043#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:39:36,288 INFO L290 TraceCheckUtils]: 70: Hoare triple {17043#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {17044#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:39:36,288 INFO L290 TraceCheckUtils]: 71: Hoare triple {17044#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17044#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:39:36,289 INFO L290 TraceCheckUtils]: 72: Hoare triple {17044#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17045#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:39:36,290 INFO L290 TraceCheckUtils]: 73: Hoare triple {17045#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {17045#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:39:36,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {17045#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {17046#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:39:36,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {17046#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {17046#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:39:36,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {17046#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {17047#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:39:36,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {17047#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17047#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:39:36,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {17047#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17048#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:39:36,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {17048#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {17048#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:39:36,294 INFO L290 TraceCheckUtils]: 80: Hoare triple {17048#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {17049#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:39:36,294 INFO L290 TraceCheckUtils]: 81: Hoare triple {17049#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {17049#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:39:36,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {17049#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {17050#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:39:36,295 INFO L290 TraceCheckUtils]: 83: Hoare triple {17050#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {17050#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:39:36,296 INFO L290 TraceCheckUtils]: 84: Hoare triple {17050#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {17051#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:39:36,296 INFO L290 TraceCheckUtils]: 85: Hoare triple {17051#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {17051#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:39:36,297 INFO L290 TraceCheckUtils]: 86: Hoare triple {17051#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {17052#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:39:36,297 INFO L290 TraceCheckUtils]: 87: Hoare triple {17052#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17052#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:39:36,298 INFO L290 TraceCheckUtils]: 88: Hoare triple {17052#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17053#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:39:36,298 INFO L290 TraceCheckUtils]: 89: Hoare triple {17053#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17053#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:39:36,298 INFO L290 TraceCheckUtils]: 90: Hoare triple {17053#(<= main_~i~0 (* 41 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17332#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:39:36,299 INFO L290 TraceCheckUtils]: 91: Hoare triple {17332#(<= main_~i~0 (* 42 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {17336#(and (<= main_~i~0 (* 42 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:39:36,299 INFO L290 TraceCheckUtils]: 92: Hoare triple {17336#(and (<= main_~i~0 (* 42 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {17340#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 43)))} is VALID [2022-04-15 12:39:36,305 INFO L290 TraceCheckUtils]: 93: Hoare triple {17340#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 43)))} assume !(~i~0 < 1000000 * ~k~0); {17008#false} is VALID [2022-04-15 12:39:36,305 INFO L272 TraceCheckUtils]: 94: Hoare triple {17008#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {17008#false} is VALID [2022-04-15 12:39:36,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {17008#false} ~cond := #in~cond; {17008#false} is VALID [2022-04-15 12:39:36,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {17008#false} assume 0 == ~cond; {17008#false} is VALID [2022-04-15 12:39:36,305 INFO L290 TraceCheckUtils]: 97: Hoare triple {17008#false} assume !false; {17008#false} is VALID [2022-04-15 12:39:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:39:36,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:39:45,082 INFO L290 TraceCheckUtils]: 97: Hoare triple {17008#false} assume !false; {17008#false} is VALID [2022-04-15 12:39:45,082 INFO L290 TraceCheckUtils]: 96: Hoare triple {17008#false} assume 0 == ~cond; {17008#false} is VALID [2022-04-15 12:39:45,082 INFO L290 TraceCheckUtils]: 95: Hoare triple {17008#false} ~cond := #in~cond; {17008#false} is VALID [2022-04-15 12:39:45,082 INFO L272 TraceCheckUtils]: 94: Hoare triple {17008#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {17008#false} is VALID [2022-04-15 12:39:45,091 INFO L290 TraceCheckUtils]: 93: Hoare triple {17056#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {17008#false} is VALID [2022-04-15 12:39:45,093 INFO L290 TraceCheckUtils]: 92: Hoare triple {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {17056#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:39:45,094 INFO L290 TraceCheckUtils]: 91: Hoare triple {17374#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17055#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:39:45,095 INFO L290 TraceCheckUtils]: 90: Hoare triple {17378#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {17374#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:39:45,096 INFO L290 TraceCheckUtils]: 89: Hoare triple {17378#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {17378#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:39:45,100 INFO L290 TraceCheckUtils]: 88: Hoare triple {17385#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {17378#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:39:45,100 INFO L290 TraceCheckUtils]: 87: Hoare triple {17385#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {17385#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:39:45,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {17392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {17385#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:39:45,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {17392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {17392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:39:45,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {17399#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17392#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:39:45,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {17399#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17399#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {17406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {17399#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,104 INFO L290 TraceCheckUtils]: 81: Hoare triple {17406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {17406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:39:45,105 INFO L290 TraceCheckUtils]: 80: Hoare triple {17413#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {17406#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:39:45,105 INFO L290 TraceCheckUtils]: 79: Hoare triple {17413#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {17413#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:39:45,106 INFO L290 TraceCheckUtils]: 78: Hoare triple {17420#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17413#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:39:45,106 INFO L290 TraceCheckUtils]: 77: Hoare triple {17420#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17420#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,107 INFO L290 TraceCheckUtils]: 76: Hoare triple {17427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {17420#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {17427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {17427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:39:45,108 INFO L290 TraceCheckUtils]: 74: Hoare triple {17434#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {17427#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:39:45,109 INFO L290 TraceCheckUtils]: 73: Hoare triple {17434#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {17434#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:39:45,109 INFO L290 TraceCheckUtils]: 72: Hoare triple {17441#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17434#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:39:45,110 INFO L290 TraceCheckUtils]: 71: Hoare triple {17441#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17441#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {17448#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17441#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {17448#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17448#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,111 INFO L290 TraceCheckUtils]: 68: Hoare triple {17455#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {17448#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,112 INFO L290 TraceCheckUtils]: 67: Hoare triple {17455#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {17455#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:39:45,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {17462#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17455#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:39:45,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {17462#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17462#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,114 INFO L290 TraceCheckUtils]: 64: Hoare triple {17469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17462#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,114 INFO L290 TraceCheckUtils]: 63: Hoare triple {17469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:39:45,115 INFO L290 TraceCheckUtils]: 62: Hoare triple {17476#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {17469#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:39:45,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {17476#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {17476#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:39:45,116 INFO L290 TraceCheckUtils]: 60: Hoare triple {17483#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17476#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:39:45,116 INFO L290 TraceCheckUtils]: 59: Hoare triple {17483#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17483#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {17490#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {17483#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,118 INFO L290 TraceCheckUtils]: 57: Hoare triple {17490#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {17490#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:39:45,118 INFO L290 TraceCheckUtils]: 56: Hoare triple {17497#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17490#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:39:45,119 INFO L290 TraceCheckUtils]: 55: Hoare triple {17497#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17497#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:39:45,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {17504#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17497#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:39:45,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {17504#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17504#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {17511#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {17504#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,121 INFO L290 TraceCheckUtils]: 51: Hoare triple {17511#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {17511#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:39:45,122 INFO L290 TraceCheckUtils]: 50: Hoare triple {17518#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17511#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:39:45,122 INFO L290 TraceCheckUtils]: 49: Hoare triple {17518#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17518#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,123 INFO L290 TraceCheckUtils]: 48: Hoare triple {17525#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {17518#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,123 INFO L290 TraceCheckUtils]: 47: Hoare triple {17525#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {17525#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:39:45,124 INFO L290 TraceCheckUtils]: 46: Hoare triple {17532#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17525#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:39:45,124 INFO L290 TraceCheckUtils]: 45: Hoare triple {17532#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17532#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {17539#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17532#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {17539#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17539#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {17546#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {17539#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {17546#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {17546#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:39:45,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {17553#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17546#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:39:45,127 INFO L290 TraceCheckUtils]: 39: Hoare triple {17553#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17553#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {17560#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17553#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {17560#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17560#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {17567#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17560#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {17567#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17567#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,130 INFO L290 TraceCheckUtils]: 34: Hoare triple {17574#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17567#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {17574#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17574#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:39:45,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {17581#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17574#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:39:45,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {17581#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17581#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {17588#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17581#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {17588#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17588#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:39:45,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {17595#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17588#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:39:45,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {17595#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17595#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {17602#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17595#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {17602#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17602#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {17609#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17602#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {17609#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17609#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {17616#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {17609#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,136 INFO L290 TraceCheckUtils]: 21: Hoare triple {17616#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {17616#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:39:45,137 INFO L290 TraceCheckUtils]: 20: Hoare triple {17623#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} ~i~0 := ~i~0 + ~k~0; {17616#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:39:45,137 INFO L290 TraceCheckUtils]: 19: Hoare triple {17623#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} assume !!(~i~0 < 1000000 * ~k~0); {17623#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:39:45,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {17630#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17623#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:39:45,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {17630#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17630#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,139 INFO L290 TraceCheckUtils]: 16: Hoare triple {17637#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {17630#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,139 INFO L290 TraceCheckUtils]: 15: Hoare triple {17637#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {17637#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,139 INFO L290 TraceCheckUtils]: 14: Hoare triple {17644#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} ~i~0 := ~i~0 + ~k~0; {17637#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:39:45,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {17644#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} assume !!(~i~0 < 1000000 * ~k~0); {17644#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:39:45,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {17651#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17644#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:39:45,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {17651#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17651#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:39:45,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {17658#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {17651#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:39:45,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {17658#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {17658#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:39:45,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {17665#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999957)) 1)} ~i~0 := ~i~0 + ~k~0; {17658#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:39:45,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {17665#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999957)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {17665#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999957)) 1)} is VALID [2022-04-15 12:39:45,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {17007#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {17665#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999957)) 1)} is VALID [2022-04-15 12:39:45,143 INFO L290 TraceCheckUtils]: 5: Hoare triple {17007#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {17007#true} is VALID [2022-04-15 12:39:45,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {17007#true} call #t~ret2 := main(); {17007#true} is VALID [2022-04-15 12:39:45,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17007#true} {17007#true} #55#return; {17007#true} is VALID [2022-04-15 12:39:45,143 INFO L290 TraceCheckUtils]: 2: Hoare triple {17007#true} assume true; {17007#true} is VALID [2022-04-15 12:39:45,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {17007#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {17007#true} is VALID [2022-04-15 12:39:45,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {17007#true} call ULTIMATE.init(); {17007#true} is VALID [2022-04-15 12:39:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:39:45,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370069235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:39:45,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:39:45,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 95 [2022-04-15 12:39:45,145 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:45,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576216337] [2022-04-15 12:39:45,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576216337] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:45,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:45,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 12:39:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646745435] [2022-04-15 12:39:45,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 12:39:45,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:45,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:39:45,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:45,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 12:39:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:45,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 12:39:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3035, Invalid=5895, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 12:39:45,381 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:31,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:41:31,776 INFO L93 Difference]: Finished difference Result 108 states and 109 transitions. [2022-04-15 12:41:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 12:41:31,776 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-15 12:41:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:41:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:31,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 109 transitions. [2022-04-15 12:41:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 109 transitions. [2022-04-15 12:41:31,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 109 transitions. [2022-04-15 12:41:32,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:41:32,186 INFO L225 Difference]: With dead ends: 108 [2022-04-15 12:41:32,186 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 12:41:32,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1426 ImplicationChecksByTransitivity, 113.9s TimeCoverageRelationStatistics Valid=7140, Invalid=12600, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 12:41:32,188 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 139 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 12:41:32,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 239 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 12:41:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 12:41:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-04-15 12:41:32,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:41:32,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:32,350 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:32,351 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:32,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:41:32,352 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2022-04-15 12:41:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-15 12:41:32,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:41:32,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:41:32,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 12:41:32,352 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-15 12:41:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:41:32,353 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2022-04-15 12:41:32,353 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-15 12:41:32,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:41:32,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:41:32,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:41:32,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:41:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:32,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2022-04-15 12:41:32,355 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2022-04-15 12:41:32,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:41:32,355 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2022-04-15 12:41:32,355 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.9583333333333333) internal successors, (94), 47 states have internal predecessors, (94), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:32,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 103 transitions. [2022-04-15 12:41:32,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:41:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2022-04-15 12:41:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 12:41:32,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:41:32,943 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:41:32,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-15 12:41:33,143 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,SelfDestructingSolverStorable46,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:41:33,144 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:41:33,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:41:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash 922177755, now seen corresponding path program 47 times [2022-04-15 12:41:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:41:33,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176110747] [2022-04-15 12:41:33,208 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:41:33,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1922073905, now seen corresponding path program 1 times [2022-04-15 12:41:33,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:41:33,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475691084] [2022-04-15 12:41:33,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:41:33,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:41:33,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:41:33,215 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:41:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:41:33,218 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:41:33,218 INFO L85 PathProgramCache]: Analyzing trace with hash 922177755, now seen corresponding path program 48 times [2022-04-15 12:41:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:41:33,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146152568] [2022-04-15 12:41:33,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:41:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:41:33,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:41:37,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:41:37,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:41:37,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {18464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18412#true} is VALID [2022-04-15 12:41:37,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {18412#true} assume true; {18412#true} is VALID [2022-04-15 12:41:37,199 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18412#true} {18412#true} #55#return; {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {18412#true} call ULTIMATE.init(); {18464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:41:37,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {18464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {18412#true} assume true; {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18412#true} {18412#true} #55#return; {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {18412#true} call #t~ret2 := main(); {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {18412#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {18412#true} is VALID [2022-04-15 12:41:37,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {18412#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {18417#(= main_~i~0 0)} is VALID [2022-04-15 12:41:37,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {18417#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {18417#(= main_~i~0 0)} is VALID [2022-04-15 12:41:37,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {18417#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {18418#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:41:37,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {18418#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {18418#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:41:37,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {18418#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {18419#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:41:37,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {18419#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {18419#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:41:37,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {18419#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {18420#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:41:37,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {18420#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {18420#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:41:37,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {18420#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {18421#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:41:37,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {18421#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {18421#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:41:37,207 INFO L290 TraceCheckUtils]: 16: Hoare triple {18421#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {18422#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:41:37,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {18422#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18422#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:41:37,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {18422#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18423#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:41:37,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {18423#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {18423#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:41:37,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {18423#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {18424#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:41:37,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {18424#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18424#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:41:37,210 INFO L290 TraceCheckUtils]: 22: Hoare triple {18424#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18425#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:41:37,210 INFO L290 TraceCheckUtils]: 23: Hoare triple {18425#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {18425#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:41:37,212 INFO L290 TraceCheckUtils]: 24: Hoare triple {18425#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {18426#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:41:37,212 INFO L290 TraceCheckUtils]: 25: Hoare triple {18426#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {18426#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:41:37,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {18426#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {18427#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:41:37,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {18427#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {18427#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:41:37,216 INFO L290 TraceCheckUtils]: 28: Hoare triple {18427#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {18428#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:41:37,216 INFO L290 TraceCheckUtils]: 29: Hoare triple {18428#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {18428#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:41:37,217 INFO L290 TraceCheckUtils]: 30: Hoare triple {18428#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {18429#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:41:37,217 INFO L290 TraceCheckUtils]: 31: Hoare triple {18429#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {18429#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:41:37,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {18429#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {18430#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:41:37,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {18430#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {18430#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:41:37,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {18430#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {18431#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:41:37,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {18431#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {18431#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:41:37,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {18431#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {18432#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:41:37,221 INFO L290 TraceCheckUtils]: 37: Hoare triple {18432#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {18432#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:41:37,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {18432#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {18433#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:41:37,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {18433#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {18433#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:41:37,224 INFO L290 TraceCheckUtils]: 40: Hoare triple {18433#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {18434#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:41:37,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {18434#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {18434#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:41:37,226 INFO L290 TraceCheckUtils]: 42: Hoare triple {18434#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {18435#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:41:37,226 INFO L290 TraceCheckUtils]: 43: Hoare triple {18435#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {18435#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:41:37,227 INFO L290 TraceCheckUtils]: 44: Hoare triple {18435#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {18436#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:41:37,228 INFO L290 TraceCheckUtils]: 45: Hoare triple {18436#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18436#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:41:37,230 INFO L290 TraceCheckUtils]: 46: Hoare triple {18436#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18437#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:41:37,230 INFO L290 TraceCheckUtils]: 47: Hoare triple {18437#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {18437#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:41:37,231 INFO L290 TraceCheckUtils]: 48: Hoare triple {18437#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {18438#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:41:37,231 INFO L290 TraceCheckUtils]: 49: Hoare triple {18438#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {18438#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:41:37,232 INFO L290 TraceCheckUtils]: 50: Hoare triple {18438#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {18439#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:41:37,232 INFO L290 TraceCheckUtils]: 51: Hoare triple {18439#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {18439#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:41:37,233 INFO L290 TraceCheckUtils]: 52: Hoare triple {18439#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {18440#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:41:37,233 INFO L290 TraceCheckUtils]: 53: Hoare triple {18440#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18440#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:41:37,235 INFO L290 TraceCheckUtils]: 54: Hoare triple {18440#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18441#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:41:37,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {18441#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {18441#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:41:37,236 INFO L290 TraceCheckUtils]: 56: Hoare triple {18441#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {18442#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:41:37,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {18442#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {18442#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:41:37,237 INFO L290 TraceCheckUtils]: 58: Hoare triple {18442#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {18443#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:41:37,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {18443#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {18443#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:41:37,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {18443#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {18444#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:41:37,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {18444#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {18444#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:41:37,242 INFO L290 TraceCheckUtils]: 62: Hoare triple {18444#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {18445#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:41:37,242 INFO L290 TraceCheckUtils]: 63: Hoare triple {18445#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {18445#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:41:37,243 INFO L290 TraceCheckUtils]: 64: Hoare triple {18445#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {18446#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:41:37,243 INFO L290 TraceCheckUtils]: 65: Hoare triple {18446#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18446#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:41:37,244 INFO L290 TraceCheckUtils]: 66: Hoare triple {18446#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18447#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:41:37,244 INFO L290 TraceCheckUtils]: 67: Hoare triple {18447#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18447#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:41:37,245 INFO L290 TraceCheckUtils]: 68: Hoare triple {18447#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18448#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:41:37,245 INFO L290 TraceCheckUtils]: 69: Hoare triple {18448#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {18448#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:41:37,246 INFO L290 TraceCheckUtils]: 70: Hoare triple {18448#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {18449#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:41:37,246 INFO L290 TraceCheckUtils]: 71: Hoare triple {18449#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18449#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:41:37,248 INFO L290 TraceCheckUtils]: 72: Hoare triple {18449#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18450#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:41:37,248 INFO L290 TraceCheckUtils]: 73: Hoare triple {18450#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {18450#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:41:37,250 INFO L290 TraceCheckUtils]: 74: Hoare triple {18450#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {18451#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:41:37,251 INFO L290 TraceCheckUtils]: 75: Hoare triple {18451#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {18451#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:41:37,251 INFO L290 TraceCheckUtils]: 76: Hoare triple {18451#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {18452#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:41:37,251 INFO L290 TraceCheckUtils]: 77: Hoare triple {18452#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18452#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:41:37,252 INFO L290 TraceCheckUtils]: 78: Hoare triple {18452#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18453#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:41:37,252 INFO L290 TraceCheckUtils]: 79: Hoare triple {18453#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {18453#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:41:37,253 INFO L290 TraceCheckUtils]: 80: Hoare triple {18453#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {18454#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:41:37,253 INFO L290 TraceCheckUtils]: 81: Hoare triple {18454#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {18454#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:41:37,255 INFO L290 TraceCheckUtils]: 82: Hoare triple {18454#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {18455#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:41:37,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {18455#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {18455#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:41:37,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {18455#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {18456#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:41:37,256 INFO L290 TraceCheckUtils]: 85: Hoare triple {18456#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {18456#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:41:37,257 INFO L290 TraceCheckUtils]: 86: Hoare triple {18456#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {18457#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:41:37,257 INFO L290 TraceCheckUtils]: 87: Hoare triple {18457#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18457#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:41:37,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {18457#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18458#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:41:37,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {18458#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18458#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:41:37,259 INFO L290 TraceCheckUtils]: 90: Hoare triple {18458#(<= main_~i~0 (* 41 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18459#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:41:37,259 INFO L290 TraceCheckUtils]: 91: Hoare triple {18459#(<= main_~i~0 (* 42 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18459#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:41:37,260 INFO L290 TraceCheckUtils]: 92: Hoare triple {18459#(<= main_~i~0 (* 42 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18460#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:41:37,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {18460#(<= main_~i~0 (* main_~k~0 43))} assume !!(~i~0 < 1000000 * ~k~0); {18461#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:41:37,278 INFO L290 TraceCheckUtils]: 94: Hoare triple {18461#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:41:37,278 INFO L290 TraceCheckUtils]: 95: Hoare triple {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:41:37,281 INFO L290 TraceCheckUtils]: 96: Hoare triple {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18463#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:41:37,287 INFO L290 TraceCheckUtils]: 97: Hoare triple {18463#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {18413#false} is VALID [2022-04-15 12:41:37,287 INFO L272 TraceCheckUtils]: 98: Hoare triple {18413#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {18413#false} is VALID [2022-04-15 12:41:37,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {18413#false} ~cond := #in~cond; {18413#false} is VALID [2022-04-15 12:41:37,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {18413#false} assume 0 == ~cond; {18413#false} is VALID [2022-04-15 12:41:37,287 INFO L290 TraceCheckUtils]: 101: Hoare triple {18413#false} assume !false; {18413#false} is VALID [2022-04-15 12:41:37,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:41:37,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:41:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146152568] [2022-04-15 12:41:37,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146152568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:41:37,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301908926] [2022-04-15 12:41:37,289 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 12:41:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:41:37,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:41:37,290 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:41:37,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 12:41:37,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 46 check-sat command(s) [2022-04-15 12:41:37,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:41:37,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 12:41:37,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:41:37,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:41:38,772 INFO L272 TraceCheckUtils]: 0: Hoare triple {18412#true} call ULTIMATE.init(); {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {18412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {18412#true} assume true; {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18412#true} {18412#true} #55#return; {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {18412#true} call #t~ret2 := main(); {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {18412#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {18412#true} is VALID [2022-04-15 12:41:38,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {18412#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {18486#(<= main_~i~0 0)} is VALID [2022-04-15 12:41:38,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {18486#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {18486#(<= main_~i~0 0)} is VALID [2022-04-15 12:41:38,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {18486#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {18418#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:41:38,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {18418#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {18418#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:41:38,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {18418#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {18419#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:41:38,775 INFO L290 TraceCheckUtils]: 11: Hoare triple {18419#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {18419#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:41:38,776 INFO L290 TraceCheckUtils]: 12: Hoare triple {18419#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {18420#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:41:38,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {18420#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {18420#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:41:38,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {18420#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {18421#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:41:38,779 INFO L290 TraceCheckUtils]: 15: Hoare triple {18421#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {18421#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:41:38,779 INFO L290 TraceCheckUtils]: 16: Hoare triple {18421#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {18422#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:41:38,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {18422#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18422#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:41:38,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {18422#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18423#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:41:38,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {18423#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {18423#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:41:38,781 INFO L290 TraceCheckUtils]: 20: Hoare triple {18423#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {18424#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:41:38,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {18424#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18424#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:41:38,782 INFO L290 TraceCheckUtils]: 22: Hoare triple {18424#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18425#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:41:38,782 INFO L290 TraceCheckUtils]: 23: Hoare triple {18425#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {18425#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:41:38,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {18425#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {18426#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:41:38,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {18426#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {18426#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:41:38,786 INFO L290 TraceCheckUtils]: 26: Hoare triple {18426#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {18427#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:41:38,786 INFO L290 TraceCheckUtils]: 27: Hoare triple {18427#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {18427#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:41:38,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {18427#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {18428#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:41:38,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {18428#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {18428#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:41:38,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {18428#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {18429#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:41:38,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {18429#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {18429#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:41:38,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {18429#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {18430#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:41:38,791 INFO L290 TraceCheckUtils]: 33: Hoare triple {18430#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {18430#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:41:38,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {18430#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {18431#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:41:38,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {18431#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {18431#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:41:38,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {18431#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {18432#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:41:38,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {18432#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {18432#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:41:38,795 INFO L290 TraceCheckUtils]: 38: Hoare triple {18432#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {18433#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:41:38,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {18433#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {18433#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:41:38,796 INFO L290 TraceCheckUtils]: 40: Hoare triple {18433#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {18434#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:41:38,796 INFO L290 TraceCheckUtils]: 41: Hoare triple {18434#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {18434#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:41:38,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {18434#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {18435#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:41:38,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {18435#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {18435#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:41:38,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {18435#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {18436#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:41:38,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {18436#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18436#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:41:38,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {18436#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18437#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:41:38,802 INFO L290 TraceCheckUtils]: 47: Hoare triple {18437#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {18437#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:41:38,802 INFO L290 TraceCheckUtils]: 48: Hoare triple {18437#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {18438#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:41:38,803 INFO L290 TraceCheckUtils]: 49: Hoare triple {18438#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {18438#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:41:38,803 INFO L290 TraceCheckUtils]: 50: Hoare triple {18438#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {18439#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:41:38,804 INFO L290 TraceCheckUtils]: 51: Hoare triple {18439#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {18439#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:41:38,804 INFO L290 TraceCheckUtils]: 52: Hoare triple {18439#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {18440#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:41:38,805 INFO L290 TraceCheckUtils]: 53: Hoare triple {18440#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18440#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:41:38,807 INFO L290 TraceCheckUtils]: 54: Hoare triple {18440#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18441#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:41:38,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {18441#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {18441#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:41:38,808 INFO L290 TraceCheckUtils]: 56: Hoare triple {18441#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {18442#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:41:38,808 INFO L290 TraceCheckUtils]: 57: Hoare triple {18442#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {18442#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:41:38,809 INFO L290 TraceCheckUtils]: 58: Hoare triple {18442#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {18443#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:41:38,809 INFO L290 TraceCheckUtils]: 59: Hoare triple {18443#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {18443#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:41:38,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {18443#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {18444#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:41:38,812 INFO L290 TraceCheckUtils]: 61: Hoare triple {18444#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {18444#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:41:38,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {18444#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {18445#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:41:38,814 INFO L290 TraceCheckUtils]: 63: Hoare triple {18445#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {18445#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:41:38,815 INFO L290 TraceCheckUtils]: 64: Hoare triple {18445#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {18446#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:41:38,815 INFO L290 TraceCheckUtils]: 65: Hoare triple {18446#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18446#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:41:38,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {18446#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18447#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:41:38,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {18447#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18447#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:41:38,817 INFO L290 TraceCheckUtils]: 68: Hoare triple {18447#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18448#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:41:38,817 INFO L290 TraceCheckUtils]: 69: Hoare triple {18448#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {18448#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:41:38,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {18448#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {18449#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:41:38,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {18449#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18449#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:41:38,820 INFO L290 TraceCheckUtils]: 72: Hoare triple {18449#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18450#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:41:38,820 INFO L290 TraceCheckUtils]: 73: Hoare triple {18450#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {18450#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:41:38,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {18450#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {18451#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:41:38,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {18451#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {18451#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:41:38,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {18451#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {18452#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:41:38,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {18452#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18452#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:41:38,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {18452#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18453#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:41:38,824 INFO L290 TraceCheckUtils]: 79: Hoare triple {18453#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {18453#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:41:38,824 INFO L290 TraceCheckUtils]: 80: Hoare triple {18453#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {18454#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:41:38,825 INFO L290 TraceCheckUtils]: 81: Hoare triple {18454#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {18454#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:41:38,826 INFO L290 TraceCheckUtils]: 82: Hoare triple {18454#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {18455#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:41:38,826 INFO L290 TraceCheckUtils]: 83: Hoare triple {18455#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {18455#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:41:38,827 INFO L290 TraceCheckUtils]: 84: Hoare triple {18455#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {18456#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:41:38,827 INFO L290 TraceCheckUtils]: 85: Hoare triple {18456#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {18456#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:41:38,828 INFO L290 TraceCheckUtils]: 86: Hoare triple {18456#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {18457#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:41:38,829 INFO L290 TraceCheckUtils]: 87: Hoare triple {18457#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18457#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:41:38,829 INFO L290 TraceCheckUtils]: 88: Hoare triple {18457#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18458#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:41:38,829 INFO L290 TraceCheckUtils]: 89: Hoare triple {18458#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18458#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:41:38,830 INFO L290 TraceCheckUtils]: 90: Hoare triple {18458#(<= main_~i~0 (* 41 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18459#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:41:38,831 INFO L290 TraceCheckUtils]: 91: Hoare triple {18459#(<= main_~i~0 (* 42 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18459#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:41:38,831 INFO L290 TraceCheckUtils]: 92: Hoare triple {18459#(<= main_~i~0 (* 42 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18460#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:41:38,831 INFO L290 TraceCheckUtils]: 93: Hoare triple {18460#(<= main_~i~0 (* main_~k~0 43))} assume !!(~i~0 < 1000000 * ~k~0); {18460#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:41:38,832 INFO L290 TraceCheckUtils]: 94: Hoare triple {18460#(<= main_~i~0 (* main_~k~0 43))} ~i~0 := ~i~0 + ~k~0; {18751#(<= main_~i~0 (* 44 main_~k~0))} is VALID [2022-04-15 12:41:38,832 INFO L290 TraceCheckUtils]: 95: Hoare triple {18751#(<= main_~i~0 (* 44 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {18755#(and (<= main_~i~0 (* 44 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:41:38,840 INFO L290 TraceCheckUtils]: 96: Hoare triple {18755#(and (<= main_~i~0 (* 44 main_~k~0)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {18759#(and (<= main_~i~0 (* main_~k~0 45)) (< main_~i~0 (* 1000001 main_~k~0)))} is VALID [2022-04-15 12:41:38,842 INFO L290 TraceCheckUtils]: 97: Hoare triple {18759#(and (<= main_~i~0 (* main_~k~0 45)) (< main_~i~0 (* 1000001 main_~k~0)))} assume !(~i~0 < 1000000 * ~k~0); {18413#false} is VALID [2022-04-15 12:41:38,842 INFO L272 TraceCheckUtils]: 98: Hoare triple {18413#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {18413#false} is VALID [2022-04-15 12:41:38,842 INFO L290 TraceCheckUtils]: 99: Hoare triple {18413#false} ~cond := #in~cond; {18413#false} is VALID [2022-04-15 12:41:38,843 INFO L290 TraceCheckUtils]: 100: Hoare triple {18413#false} assume 0 == ~cond; {18413#false} is VALID [2022-04-15 12:41:38,843 INFO L290 TraceCheckUtils]: 101: Hoare triple {18413#false} assume !false; {18413#false} is VALID [2022-04-15 12:41:38,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:41:38,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:41:49,158 INFO L290 TraceCheckUtils]: 101: Hoare triple {18413#false} assume !false; {18413#false} is VALID [2022-04-15 12:41:49,159 INFO L290 TraceCheckUtils]: 100: Hoare triple {18413#false} assume 0 == ~cond; {18413#false} is VALID [2022-04-15 12:41:49,159 INFO L290 TraceCheckUtils]: 99: Hoare triple {18413#false} ~cond := #in~cond; {18413#false} is VALID [2022-04-15 12:41:49,159 INFO L272 TraceCheckUtils]: 98: Hoare triple {18413#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {18413#false} is VALID [2022-04-15 12:41:49,167 INFO L290 TraceCheckUtils]: 97: Hoare triple {18463#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {18413#false} is VALID [2022-04-15 12:41:49,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {18463#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:41:49,171 INFO L290 TraceCheckUtils]: 95: Hoare triple {18793#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {18462#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:41:49,172 INFO L290 TraceCheckUtils]: 94: Hoare triple {18797#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {18793#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:41:49,172 INFO L290 TraceCheckUtils]: 93: Hoare triple {18797#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {18797#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:41:49,177 INFO L290 TraceCheckUtils]: 92: Hoare triple {18804#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {18797#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:41:49,177 INFO L290 TraceCheckUtils]: 91: Hoare triple {18804#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {18804#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:41:49,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {18811#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {18804#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:41:49,179 INFO L290 TraceCheckUtils]: 89: Hoare triple {18811#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {18811#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:41:49,180 INFO L290 TraceCheckUtils]: 88: Hoare triple {18818#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18811#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:41:49,180 INFO L290 TraceCheckUtils]: 87: Hoare triple {18818#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18818#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,181 INFO L290 TraceCheckUtils]: 86: Hoare triple {18825#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {18818#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,181 INFO L290 TraceCheckUtils]: 85: Hoare triple {18825#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {18825#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:41:49,182 INFO L290 TraceCheckUtils]: 84: Hoare triple {18832#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {18825#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:41:49,182 INFO L290 TraceCheckUtils]: 83: Hoare triple {18832#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {18832#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:41:49,183 INFO L290 TraceCheckUtils]: 82: Hoare triple {18839#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18832#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:41:49,183 INFO L290 TraceCheckUtils]: 81: Hoare triple {18839#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18839#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {18846#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {18839#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {18846#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {18846#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:41:49,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {18853#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {18846#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:41:49,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {18853#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {18853#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:41:49,186 INFO L290 TraceCheckUtils]: 76: Hoare triple {18860#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18853#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:41:49,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {18860#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18860#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,188 INFO L290 TraceCheckUtils]: 74: Hoare triple {18867#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18860#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,188 INFO L290 TraceCheckUtils]: 73: Hoare triple {18867#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18867#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,189 INFO L290 TraceCheckUtils]: 72: Hoare triple {18874#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {18867#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,189 INFO L290 TraceCheckUtils]: 71: Hoare triple {18874#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {18874#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:41:49,190 INFO L290 TraceCheckUtils]: 70: Hoare triple {18881#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18874#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:41:49,190 INFO L290 TraceCheckUtils]: 69: Hoare triple {18881#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18881#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,191 INFO L290 TraceCheckUtils]: 68: Hoare triple {18888#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {18881#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,191 INFO L290 TraceCheckUtils]: 67: Hoare triple {18888#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {18888#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:41:49,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {18895#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {18888#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:41:49,192 INFO L290 TraceCheckUtils]: 65: Hoare triple {18895#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {18895#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:41:49,193 INFO L290 TraceCheckUtils]: 64: Hoare triple {18902#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18895#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:41:49,194 INFO L290 TraceCheckUtils]: 63: Hoare triple {18902#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18902#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {18909#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {18902#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {18909#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {18909#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:41:49,196 INFO L290 TraceCheckUtils]: 60: Hoare triple {18916#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {18909#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:41:49,196 INFO L290 TraceCheckUtils]: 59: Hoare triple {18916#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {18916#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:41:49,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {18923#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18916#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:41:49,197 INFO L290 TraceCheckUtils]: 57: Hoare triple {18923#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18923#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,198 INFO L290 TraceCheckUtils]: 56: Hoare triple {18930#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {18923#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,198 INFO L290 TraceCheckUtils]: 55: Hoare triple {18930#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {18930#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:41:49,199 INFO L290 TraceCheckUtils]: 54: Hoare triple {18937#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18930#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:41:49,199 INFO L290 TraceCheckUtils]: 53: Hoare triple {18937#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18937#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,200 INFO L290 TraceCheckUtils]: 52: Hoare triple {18944#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {18937#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,200 INFO L290 TraceCheckUtils]: 51: Hoare triple {18944#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {18944#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:41:49,201 INFO L290 TraceCheckUtils]: 50: Hoare triple {18951#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18944#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:41:49,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {18951#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18951#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,202 INFO L290 TraceCheckUtils]: 48: Hoare triple {18958#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18951#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {18958#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18958#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {18965#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {18958#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {18965#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {18965#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:41:49,204 INFO L290 TraceCheckUtils]: 44: Hoare triple {18972#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18965#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:41:49,205 INFO L290 TraceCheckUtils]: 43: Hoare triple {18972#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18972#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,205 INFO L290 TraceCheckUtils]: 42: Hoare triple {18979#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18972#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {18979#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18979#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,206 INFO L290 TraceCheckUtils]: 40: Hoare triple {18986#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18979#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {18986#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {18986#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {18993#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {18986#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {18993#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {18993#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:41:49,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {19000#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {18993#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:41:49,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {19000#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19000#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {19007#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {19000#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {19007#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {19007#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:41:49,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {19014#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19007#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:41:49,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {19014#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19014#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,211 INFO L290 TraceCheckUtils]: 30: Hoare triple {19021#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19014#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {19021#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19021#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,213 INFO L290 TraceCheckUtils]: 28: Hoare triple {19028#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19021#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {19028#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19028#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {19035#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {19028#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,214 INFO L290 TraceCheckUtils]: 25: Hoare triple {19035#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {19035#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:41:49,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {19042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} ~i~0 := ~i~0 + ~k~0; {19035#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:41:49,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {19042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} assume !!(~i~0 < 1000000 * ~k~0); {19042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:41:49,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {19049#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19042#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:41:49,216 INFO L290 TraceCheckUtils]: 21: Hoare triple {19049#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19049#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,216 INFO L290 TraceCheckUtils]: 20: Hoare triple {19056#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19049#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {19056#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19056#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {19063#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} ~i~0 := ~i~0 + ~k~0; {19056#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {19063#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} assume !!(~i~0 < 1000000 * ~k~0); {19063#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:41:49,218 INFO L290 TraceCheckUtils]: 16: Hoare triple {19070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {19063#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:41:49,218 INFO L290 TraceCheckUtils]: 15: Hoare triple {19070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {19070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:41:49,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {19077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {19070#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:41:49,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {19077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {19077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:41:49,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {19084#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {19077#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:41:49,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {19084#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {19084#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} is VALID [2022-04-15 12:41:49,221 INFO L290 TraceCheckUtils]: 10: Hoare triple {19091#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {19084#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} is VALID [2022-04-15 12:41:49,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {19091#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {19091#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {19098#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999955)) 1)} ~i~0 := ~i~0 + ~k~0; {19091#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} is VALID [2022-04-15 12:41:49,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {19098#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999955)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {19098#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999955)) 1)} is VALID [2022-04-15 12:41:49,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {18412#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {19098#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999955)) 1)} is VALID [2022-04-15 12:41:49,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {18412#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {18412#true} is VALID [2022-04-15 12:41:49,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {18412#true} call #t~ret2 := main(); {18412#true} is VALID [2022-04-15 12:41:49,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18412#true} {18412#true} #55#return; {18412#true} is VALID [2022-04-15 12:41:49,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {18412#true} assume true; {18412#true} is VALID [2022-04-15 12:41:49,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {18412#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {18412#true} is VALID [2022-04-15 12:41:49,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {18412#true} call ULTIMATE.init(); {18412#true} is VALID [2022-04-15 12:41:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:41:49,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301908926] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:41:49,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:41:49,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 99 [2022-04-15 12:41:49,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:41:49,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176110747] [2022-04-15 12:41:49,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176110747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:41:49,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:41:49,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 12:41:49,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177816543] [2022-04-15 12:41:49,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:41:49,227 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 12:41:49,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:41:49,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:41:49,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:41:49,513 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 12:41:49,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:41:49,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 12:41:49,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3310, Invalid=6392, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 12:41:49,515 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:05,753 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-04-15 12:44:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 12:44:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-15 12:44:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:44:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 113 transitions. [2022-04-15 12:44:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 113 transitions. [2022-04-15 12:44:05,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 113 transitions. [2022-04-15 12:44:06,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:44:06,492 INFO L225 Difference]: With dead ends: 112 [2022-04-15 12:44:06,492 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 12:44:06,494 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 144.3s TimeCoverageRelationStatistics Valid=7785, Invalid=13677, Unknown=0, NotChecked=0, Total=21462 [2022-04-15 12:44:06,494 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 145 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 12:44:06,494 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 249 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 12:44:06,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 12:44:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-04-15 12:44:06,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:44:06,665 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:06,665 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:06,665 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:06,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:06,666 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2022-04-15 12:44:06,666 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-15 12:44:06,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:44:06,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:44:06,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:44:06,667 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-15 12:44:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:44:06,668 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2022-04-15 12:44:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-15 12:44:06,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:44:06,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:44:06,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:44:06,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:44:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0098039215686274) internal successors, (103), 102 states have internal predecessors, (103), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2022-04-15 12:44:06,670 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2022-04-15 12:44:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:44:06,671 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2022-04-15 12:44:06,671 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.96) internal successors, (98), 49 states have internal predecessors, (98), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:06,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 107 transitions. [2022-04-15 12:44:07,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:44:07,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2022-04-15 12:44:07,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 12:44:07,505 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:44:07,505 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:44:07,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 12:44:07,705 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47,SelfDestructingSolverStorable48 [2022-04-15 12:44:07,705 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:44:07,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:44:07,706 INFO L85 PathProgramCache]: Analyzing trace with hash 720086935, now seen corresponding path program 49 times [2022-04-15 12:44:07,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:44:07,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1525375420] [2022-04-15 12:44:07,770 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:44:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1981179249, now seen corresponding path program 1 times [2022-04-15 12:44:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:44:07,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584945079] [2022-04-15 12:44:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:44:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:44:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:44:07,776 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 12:44:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 12:44:07,779 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 12:44:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 720086935, now seen corresponding path program 50 times [2022-04-15 12:44:07,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:44:07,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052193777] [2022-04-15 12:44:07,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:44:07,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:44:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:44:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:12,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {19927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19873#true} is VALID [2022-04-15 12:44:12,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {19873#true} assume true; {19873#true} is VALID [2022-04-15 12:44:12,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19873#true} {19873#true} #55#return; {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {19873#true} call ULTIMATE.init(); {19927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:44:12,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {19927#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {19873#true} assume true; {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19873#true} {19873#true} #55#return; {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {19873#true} call #t~ret2 := main(); {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {19873#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {19873#true} is VALID [2022-04-15 12:44:12,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {19878#(= main_~i~0 0)} is VALID [2022-04-15 12:44:12,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {19878#(= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {19878#(= main_~i~0 0)} is VALID [2022-04-15 12:44:12,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {19878#(= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {19879#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:44:12,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {19879#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {19879#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:44:12,871 INFO L290 TraceCheckUtils]: 10: Hoare triple {19879#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {19880#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:44:12,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {19880#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {19880#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:44:12,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {19880#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {19881#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:44:12,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {19881#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {19881#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:44:12,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {19881#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {19882#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:44:12,875 INFO L290 TraceCheckUtils]: 15: Hoare triple {19882#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {19882#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:44:12,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {19882#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {19883#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:44:12,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {19883#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19883#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:44:12,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {19883#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19884#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:44:12,876 INFO L290 TraceCheckUtils]: 19: Hoare triple {19884#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {19884#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:44:12,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {19884#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {19885#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:44:12,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {19885#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19885#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:44:12,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {19885#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19886#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:44:12,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {19886#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {19886#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:44:12,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {19886#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {19887#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:44:12,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {19887#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {19887#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:44:12,882 INFO L290 TraceCheckUtils]: 26: Hoare triple {19887#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {19888#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:44:12,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {19888#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {19888#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:44:12,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {19888#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {19889#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:44:12,884 INFO L290 TraceCheckUtils]: 29: Hoare triple {19889#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {19889#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:44:12,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {19889#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {19890#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:44:12,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {19890#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {19890#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:44:12,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {19890#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {19891#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:44:12,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {19891#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {19891#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:44:12,894 INFO L290 TraceCheckUtils]: 34: Hoare triple {19891#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {19892#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:44:12,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {19892#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {19892#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:44:12,894 INFO L290 TraceCheckUtils]: 36: Hoare triple {19892#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {19893#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:44:12,895 INFO L290 TraceCheckUtils]: 37: Hoare triple {19893#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {19893#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:44:12,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {19893#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {19894#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:44:12,897 INFO L290 TraceCheckUtils]: 39: Hoare triple {19894#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {19894#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:44:12,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {19894#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {19895#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:44:12,898 INFO L290 TraceCheckUtils]: 41: Hoare triple {19895#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {19895#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:44:12,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {19895#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {19896#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:44:12,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {19896#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {19896#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:44:12,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {19896#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {19897#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:44:12,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {19897#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19897#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:44:12,904 INFO L290 TraceCheckUtils]: 46: Hoare triple {19897#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19898#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:44:12,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {19898#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {19898#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:44:12,905 INFO L290 TraceCheckUtils]: 48: Hoare triple {19898#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {19899#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:44:12,905 INFO L290 TraceCheckUtils]: 49: Hoare triple {19899#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {19899#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:44:12,905 INFO L290 TraceCheckUtils]: 50: Hoare triple {19899#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {19900#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:44:12,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {19900#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {19900#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:44:12,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {19900#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {19901#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:44:12,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {19901#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19901#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:44:12,909 INFO L290 TraceCheckUtils]: 54: Hoare triple {19901#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19902#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:44:12,909 INFO L290 TraceCheckUtils]: 55: Hoare triple {19902#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {19902#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:44:12,910 INFO L290 TraceCheckUtils]: 56: Hoare triple {19902#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {19903#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:44:12,910 INFO L290 TraceCheckUtils]: 57: Hoare triple {19903#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {19903#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:44:12,911 INFO L290 TraceCheckUtils]: 58: Hoare triple {19903#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {19904#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:44:12,911 INFO L290 TraceCheckUtils]: 59: Hoare triple {19904#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {19904#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:44:12,913 INFO L290 TraceCheckUtils]: 60: Hoare triple {19904#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {19905#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:44:12,914 INFO L290 TraceCheckUtils]: 61: Hoare triple {19905#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {19905#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:44:12,916 INFO L290 TraceCheckUtils]: 62: Hoare triple {19905#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {19906#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:44:12,916 INFO L290 TraceCheckUtils]: 63: Hoare triple {19906#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {19906#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:44:12,917 INFO L290 TraceCheckUtils]: 64: Hoare triple {19906#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {19907#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:44:12,917 INFO L290 TraceCheckUtils]: 65: Hoare triple {19907#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19907#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:44:12,918 INFO L290 TraceCheckUtils]: 66: Hoare triple {19907#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19908#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:44:12,918 INFO L290 TraceCheckUtils]: 67: Hoare triple {19908#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19908#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:44:12,919 INFO L290 TraceCheckUtils]: 68: Hoare triple {19908#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19909#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:44:12,919 INFO L290 TraceCheckUtils]: 69: Hoare triple {19909#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {19909#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:44:12,919 INFO L290 TraceCheckUtils]: 70: Hoare triple {19909#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {19910#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:44:12,920 INFO L290 TraceCheckUtils]: 71: Hoare triple {19910#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19910#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:44:12,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {19910#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19911#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:44:12,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {19911#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {19911#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:44:12,924 INFO L290 TraceCheckUtils]: 74: Hoare triple {19911#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {19912#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:44:12,924 INFO L290 TraceCheckUtils]: 75: Hoare triple {19912#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {19912#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:44:12,925 INFO L290 TraceCheckUtils]: 76: Hoare triple {19912#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {19913#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:44:12,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {19913#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19913#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:44:12,926 INFO L290 TraceCheckUtils]: 78: Hoare triple {19913#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19914#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:44:12,926 INFO L290 TraceCheckUtils]: 79: Hoare triple {19914#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {19914#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:44:12,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {19914#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {19915#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:44:12,927 INFO L290 TraceCheckUtils]: 81: Hoare triple {19915#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {19915#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:44:12,929 INFO L290 TraceCheckUtils]: 82: Hoare triple {19915#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {19916#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:44:12,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {19916#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {19916#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:44:12,930 INFO L290 TraceCheckUtils]: 84: Hoare triple {19916#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {19917#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:44:12,930 INFO L290 TraceCheckUtils]: 85: Hoare triple {19917#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {19917#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:44:12,931 INFO L290 TraceCheckUtils]: 86: Hoare triple {19917#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {19918#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:44:12,932 INFO L290 TraceCheckUtils]: 87: Hoare triple {19918#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19918#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:44:12,936 INFO L290 TraceCheckUtils]: 88: Hoare triple {19918#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19919#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:44:12,936 INFO L290 TraceCheckUtils]: 89: Hoare triple {19919#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19919#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:44:12,937 INFO L290 TraceCheckUtils]: 90: Hoare triple {19919#(<= main_~i~0 (* 41 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19920#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:44:12,938 INFO L290 TraceCheckUtils]: 91: Hoare triple {19920#(<= main_~i~0 (* 42 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19920#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:44:12,939 INFO L290 TraceCheckUtils]: 92: Hoare triple {19920#(<= main_~i~0 (* 42 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19921#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:44:12,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {19921#(<= main_~i~0 (* main_~k~0 43))} assume !!(~i~0 < 1000000 * ~k~0); {19921#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:44:12,939 INFO L290 TraceCheckUtils]: 94: Hoare triple {19921#(<= main_~i~0 (* main_~k~0 43))} ~i~0 := ~i~0 + ~k~0; {19922#(<= main_~i~0 (* 44 main_~k~0))} is VALID [2022-04-15 12:44:12,940 INFO L290 TraceCheckUtils]: 95: Hoare triple {19922#(<= main_~i~0 (* 44 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19922#(<= main_~i~0 (* 44 main_~k~0))} is VALID [2022-04-15 12:44:12,940 INFO L290 TraceCheckUtils]: 96: Hoare triple {19922#(<= main_~i~0 (* 44 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19923#(<= main_~i~0 (* main_~k~0 45))} is VALID [2022-04-15 12:44:12,959 INFO L290 TraceCheckUtils]: 97: Hoare triple {19923#(<= main_~i~0 (* main_~k~0 45))} assume !!(~i~0 < 1000000 * ~k~0); {19924#(<= (+ main_~i~0 1) (* main_~k~0 999998))} is VALID [2022-04-15 12:44:12,962 INFO L290 TraceCheckUtils]: 98: Hoare triple {19924#(<= (+ main_~i~0 1) (* main_~k~0 999998))} ~i~0 := ~i~0 + ~k~0; {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:44:12,963 INFO L290 TraceCheckUtils]: 99: Hoare triple {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:44:12,966 INFO L290 TraceCheckUtils]: 100: Hoare triple {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19926#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:44:12,975 INFO L290 TraceCheckUtils]: 101: Hoare triple {19926#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {19874#false} is VALID [2022-04-15 12:44:12,976 INFO L272 TraceCheckUtils]: 102: Hoare triple {19874#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {19874#false} is VALID [2022-04-15 12:44:12,976 INFO L290 TraceCheckUtils]: 103: Hoare triple {19874#false} ~cond := #in~cond; {19874#false} is VALID [2022-04-15 12:44:12,976 INFO L290 TraceCheckUtils]: 104: Hoare triple {19874#false} assume 0 == ~cond; {19874#false} is VALID [2022-04-15 12:44:12,976 INFO L290 TraceCheckUtils]: 105: Hoare triple {19874#false} assume !false; {19874#false} is VALID [2022-04-15 12:44:12,977 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:44:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:44:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052193777] [2022-04-15 12:44:12,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052193777] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:44:12,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729107172] [2022-04-15 12:44:12,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:44:12,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:44:12,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:44:12,978 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 12:44:12,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 12:44:13,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 12:44:13,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:44:13,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 12:44:13,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:44:13,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:44:15,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {19873#true} call ULTIMATE.init(); {19873#true} is VALID [2022-04-15 12:44:15,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {19873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19873#true} is VALID [2022-04-15 12:44:15,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {19873#true} assume true; {19873#true} is VALID [2022-04-15 12:44:15,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19873#true} {19873#true} #55#return; {19873#true} is VALID [2022-04-15 12:44:15,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {19873#true} call #t~ret2 := main(); {19873#true} is VALID [2022-04-15 12:44:15,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {19873#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {19873#true} is VALID [2022-04-15 12:44:15,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {19949#(<= main_~i~0 0)} is VALID [2022-04-15 12:44:15,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {19949#(<= main_~i~0 0)} assume !!(~i~0 < 1000000 * ~k~0); {19949#(<= main_~i~0 0)} is VALID [2022-04-15 12:44:15,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {19949#(<= main_~i~0 0)} ~i~0 := ~i~0 + ~k~0; {19879#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:44:15,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {19879#(<= main_~i~0 main_~k~0)} assume !!(~i~0 < 1000000 * ~k~0); {19879#(<= main_~i~0 main_~k~0)} is VALID [2022-04-15 12:44:15,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {19879#(<= main_~i~0 main_~k~0)} ~i~0 := ~i~0 + ~k~0; {19880#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:44:15,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {19880#(<= main_~i~0 (* main_~k~0 2))} assume !!(~i~0 < 1000000 * ~k~0); {19880#(<= main_~i~0 (* main_~k~0 2))} is VALID [2022-04-15 12:44:15,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {19880#(<= main_~i~0 (* main_~k~0 2))} ~i~0 := ~i~0 + ~k~0; {19881#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:44:15,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {19881#(<= main_~i~0 (* main_~k~0 3))} assume !!(~i~0 < 1000000 * ~k~0); {19881#(<= main_~i~0 (* main_~k~0 3))} is VALID [2022-04-15 12:44:15,342 INFO L290 TraceCheckUtils]: 14: Hoare triple {19881#(<= main_~i~0 (* main_~k~0 3))} ~i~0 := ~i~0 + ~k~0; {19882#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:44:15,342 INFO L290 TraceCheckUtils]: 15: Hoare triple {19882#(<= main_~i~0 (* main_~k~0 4))} assume !!(~i~0 < 1000000 * ~k~0); {19882#(<= main_~i~0 (* main_~k~0 4))} is VALID [2022-04-15 12:44:15,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {19882#(<= main_~i~0 (* main_~k~0 4))} ~i~0 := ~i~0 + ~k~0; {19883#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:44:15,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {19883#(<= main_~i~0 (* 5 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19883#(<= main_~i~0 (* 5 main_~k~0))} is VALID [2022-04-15 12:44:15,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {19883#(<= main_~i~0 (* 5 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19884#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:44:15,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {19884#(<= main_~i~0 (* main_~k~0 6))} assume !!(~i~0 < 1000000 * ~k~0); {19884#(<= main_~i~0 (* main_~k~0 6))} is VALID [2022-04-15 12:44:15,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {19884#(<= main_~i~0 (* main_~k~0 6))} ~i~0 := ~i~0 + ~k~0; {19885#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:44:15,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {19885#(<= main_~i~0 (* 7 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19885#(<= main_~i~0 (* 7 main_~k~0))} is VALID [2022-04-15 12:44:15,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {19885#(<= main_~i~0 (* 7 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19886#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:44:15,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {19886#(<= main_~i~0 (* main_~k~0 8))} assume !!(~i~0 < 1000000 * ~k~0); {19886#(<= main_~i~0 (* main_~k~0 8))} is VALID [2022-04-15 12:44:15,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {19886#(<= main_~i~0 (* main_~k~0 8))} ~i~0 := ~i~0 + ~k~0; {19887#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:44:15,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {19887#(<= main_~i~0 (* main_~k~0 9))} assume !!(~i~0 < 1000000 * ~k~0); {19887#(<= main_~i~0 (* main_~k~0 9))} is VALID [2022-04-15 12:44:15,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {19887#(<= main_~i~0 (* main_~k~0 9))} ~i~0 := ~i~0 + ~k~0; {19888#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:44:15,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {19888#(<= main_~i~0 (* main_~k~0 10))} assume !!(~i~0 < 1000000 * ~k~0); {19888#(<= main_~i~0 (* main_~k~0 10))} is VALID [2022-04-15 12:44:15,352 INFO L290 TraceCheckUtils]: 28: Hoare triple {19888#(<= main_~i~0 (* main_~k~0 10))} ~i~0 := ~i~0 + ~k~0; {19889#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:44:15,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {19889#(<= main_~i~0 (* main_~k~0 11))} assume !!(~i~0 < 1000000 * ~k~0); {19889#(<= main_~i~0 (* main_~k~0 11))} is VALID [2022-04-15 12:44:15,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {19889#(<= main_~i~0 (* main_~k~0 11))} ~i~0 := ~i~0 + ~k~0; {19890#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:44:15,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {19890#(<= main_~i~0 (* main_~k~0 12))} assume !!(~i~0 < 1000000 * ~k~0); {19890#(<= main_~i~0 (* main_~k~0 12))} is VALID [2022-04-15 12:44:15,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {19890#(<= main_~i~0 (* main_~k~0 12))} ~i~0 := ~i~0 + ~k~0; {19891#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:44:15,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {19891#(<= main_~i~0 (* main_~k~0 13))} assume !!(~i~0 < 1000000 * ~k~0); {19891#(<= main_~i~0 (* main_~k~0 13))} is VALID [2022-04-15 12:44:15,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {19891#(<= main_~i~0 (* main_~k~0 13))} ~i~0 := ~i~0 + ~k~0; {19892#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:44:15,356 INFO L290 TraceCheckUtils]: 35: Hoare triple {19892#(<= main_~i~0 (* main_~k~0 14))} assume !!(~i~0 < 1000000 * ~k~0); {19892#(<= main_~i~0 (* main_~k~0 14))} is VALID [2022-04-15 12:44:15,357 INFO L290 TraceCheckUtils]: 36: Hoare triple {19892#(<= main_~i~0 (* main_~k~0 14))} ~i~0 := ~i~0 + ~k~0; {19893#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:44:15,357 INFO L290 TraceCheckUtils]: 37: Hoare triple {19893#(<= main_~i~0 (* main_~k~0 15))} assume !!(~i~0 < 1000000 * ~k~0); {19893#(<= main_~i~0 (* main_~k~0 15))} is VALID [2022-04-15 12:44:15,359 INFO L290 TraceCheckUtils]: 38: Hoare triple {19893#(<= main_~i~0 (* main_~k~0 15))} ~i~0 := ~i~0 + ~k~0; {19894#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:44:15,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {19894#(<= main_~i~0 (* main_~k~0 16))} assume !!(~i~0 < 1000000 * ~k~0); {19894#(<= main_~i~0 (* main_~k~0 16))} is VALID [2022-04-15 12:44:15,360 INFO L290 TraceCheckUtils]: 40: Hoare triple {19894#(<= main_~i~0 (* main_~k~0 16))} ~i~0 := ~i~0 + ~k~0; {19895#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:44:15,360 INFO L290 TraceCheckUtils]: 41: Hoare triple {19895#(<= main_~i~0 (* main_~k~0 17))} assume !!(~i~0 < 1000000 * ~k~0); {19895#(<= main_~i~0 (* main_~k~0 17))} is VALID [2022-04-15 12:44:15,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {19895#(<= main_~i~0 (* main_~k~0 17))} ~i~0 := ~i~0 + ~k~0; {19896#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:44:15,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {19896#(<= main_~i~0 (* main_~k~0 18))} assume !!(~i~0 < 1000000 * ~k~0); {19896#(<= main_~i~0 (* main_~k~0 18))} is VALID [2022-04-15 12:44:15,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {19896#(<= main_~i~0 (* main_~k~0 18))} ~i~0 := ~i~0 + ~k~0; {19897#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:44:15,364 INFO L290 TraceCheckUtils]: 45: Hoare triple {19897#(<= main_~i~0 (* 19 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19897#(<= main_~i~0 (* 19 main_~k~0))} is VALID [2022-04-15 12:44:15,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {19897#(<= main_~i~0 (* 19 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19898#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:44:15,366 INFO L290 TraceCheckUtils]: 47: Hoare triple {19898#(<= main_~i~0 (* main_~k~0 20))} assume !!(~i~0 < 1000000 * ~k~0); {19898#(<= main_~i~0 (* main_~k~0 20))} is VALID [2022-04-15 12:44:15,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {19898#(<= main_~i~0 (* main_~k~0 20))} ~i~0 := ~i~0 + ~k~0; {19899#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:44:15,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {19899#(<= main_~i~0 (* main_~k~0 21))} assume !!(~i~0 < 1000000 * ~k~0); {19899#(<= main_~i~0 (* main_~k~0 21))} is VALID [2022-04-15 12:44:15,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {19899#(<= main_~i~0 (* main_~k~0 21))} ~i~0 := ~i~0 + ~k~0; {19900#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:44:15,368 INFO L290 TraceCheckUtils]: 51: Hoare triple {19900#(<= main_~i~0 (* main_~k~0 22))} assume !!(~i~0 < 1000000 * ~k~0); {19900#(<= main_~i~0 (* main_~k~0 22))} is VALID [2022-04-15 12:44:15,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {19900#(<= main_~i~0 (* main_~k~0 22))} ~i~0 := ~i~0 + ~k~0; {19901#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:44:15,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {19901#(<= main_~i~0 (* 23 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19901#(<= main_~i~0 (* 23 main_~k~0))} is VALID [2022-04-15 12:44:15,371 INFO L290 TraceCheckUtils]: 54: Hoare triple {19901#(<= main_~i~0 (* 23 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19902#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:44:15,371 INFO L290 TraceCheckUtils]: 55: Hoare triple {19902#(<= main_~i~0 (* main_~k~0 24))} assume !!(~i~0 < 1000000 * ~k~0); {19902#(<= main_~i~0 (* main_~k~0 24))} is VALID [2022-04-15 12:44:15,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {19902#(<= main_~i~0 (* main_~k~0 24))} ~i~0 := ~i~0 + ~k~0; {19903#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:44:15,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {19903#(<= main_~i~0 (* main_~k~0 25))} assume !!(~i~0 < 1000000 * ~k~0); {19903#(<= main_~i~0 (* main_~k~0 25))} is VALID [2022-04-15 12:44:15,373 INFO L290 TraceCheckUtils]: 58: Hoare triple {19903#(<= main_~i~0 (* main_~k~0 25))} ~i~0 := ~i~0 + ~k~0; {19904#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:44:15,373 INFO L290 TraceCheckUtils]: 59: Hoare triple {19904#(<= main_~i~0 (* main_~k~0 26))} assume !!(~i~0 < 1000000 * ~k~0); {19904#(<= main_~i~0 (* main_~k~0 26))} is VALID [2022-04-15 12:44:15,375 INFO L290 TraceCheckUtils]: 60: Hoare triple {19904#(<= main_~i~0 (* main_~k~0 26))} ~i~0 := ~i~0 + ~k~0; {19905#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:44:15,376 INFO L290 TraceCheckUtils]: 61: Hoare triple {19905#(<= main_~i~0 (* main_~k~0 27))} assume !!(~i~0 < 1000000 * ~k~0); {19905#(<= main_~i~0 (* main_~k~0 27))} is VALID [2022-04-15 12:44:15,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {19905#(<= main_~i~0 (* main_~k~0 27))} ~i~0 := ~i~0 + ~k~0; {19906#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:44:15,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {19906#(<= main_~i~0 (* main_~k~0 28))} assume !!(~i~0 < 1000000 * ~k~0); {19906#(<= main_~i~0 (* main_~k~0 28))} is VALID [2022-04-15 12:44:15,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {19906#(<= main_~i~0 (* main_~k~0 28))} ~i~0 := ~i~0 + ~k~0; {19907#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:44:15,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {19907#(<= main_~i~0 (* 29 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19907#(<= main_~i~0 (* 29 main_~k~0))} is VALID [2022-04-15 12:44:15,380 INFO L290 TraceCheckUtils]: 66: Hoare triple {19907#(<= main_~i~0 (* 29 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19908#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:44:15,380 INFO L290 TraceCheckUtils]: 67: Hoare triple {19908#(<= main_~i~0 (* 30 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19908#(<= main_~i~0 (* 30 main_~k~0))} is VALID [2022-04-15 12:44:15,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {19908#(<= main_~i~0 (* 30 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19909#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:44:15,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {19909#(<= main_~i~0 (* main_~k~0 31))} assume !!(~i~0 < 1000000 * ~k~0); {19909#(<= main_~i~0 (* main_~k~0 31))} is VALID [2022-04-15 12:44:15,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {19909#(<= main_~i~0 (* main_~k~0 31))} ~i~0 := ~i~0 + ~k~0; {19910#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:44:15,382 INFO L290 TraceCheckUtils]: 71: Hoare triple {19910#(<= main_~i~0 (* 32 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19910#(<= main_~i~0 (* 32 main_~k~0))} is VALID [2022-04-15 12:44:15,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {19910#(<= main_~i~0 (* 32 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19911#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:44:15,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {19911#(<= main_~i~0 (* main_~k~0 33))} assume !!(~i~0 < 1000000 * ~k~0); {19911#(<= main_~i~0 (* main_~k~0 33))} is VALID [2022-04-15 12:44:15,386 INFO L290 TraceCheckUtils]: 74: Hoare triple {19911#(<= main_~i~0 (* main_~k~0 33))} ~i~0 := ~i~0 + ~k~0; {19912#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:44:15,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {19912#(<= main_~i~0 (* main_~k~0 34))} assume !!(~i~0 < 1000000 * ~k~0); {19912#(<= main_~i~0 (* main_~k~0 34))} is VALID [2022-04-15 12:44:15,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {19912#(<= main_~i~0 (* main_~k~0 34))} ~i~0 := ~i~0 + ~k~0; {19913#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:44:15,387 INFO L290 TraceCheckUtils]: 77: Hoare triple {19913#(<= main_~i~0 (* 35 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19913#(<= main_~i~0 (* 35 main_~k~0))} is VALID [2022-04-15 12:44:15,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {19913#(<= main_~i~0 (* 35 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19914#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:44:15,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {19914#(<= main_~i~0 (* main_~k~0 36))} assume !!(~i~0 < 1000000 * ~k~0); {19914#(<= main_~i~0 (* main_~k~0 36))} is VALID [2022-04-15 12:44:15,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {19914#(<= main_~i~0 (* main_~k~0 36))} ~i~0 := ~i~0 + ~k~0; {19915#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:44:15,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {19915#(<= main_~i~0 (* main_~k~0 37))} assume !!(~i~0 < 1000000 * ~k~0); {19915#(<= main_~i~0 (* main_~k~0 37))} is VALID [2022-04-15 12:44:15,391 INFO L290 TraceCheckUtils]: 82: Hoare triple {19915#(<= main_~i~0 (* main_~k~0 37))} ~i~0 := ~i~0 + ~k~0; {19916#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:44:15,391 INFO L290 TraceCheckUtils]: 83: Hoare triple {19916#(<= main_~i~0 (* main_~k~0 38))} assume !!(~i~0 < 1000000 * ~k~0); {19916#(<= main_~i~0 (* main_~k~0 38))} is VALID [2022-04-15 12:44:15,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {19916#(<= main_~i~0 (* main_~k~0 38))} ~i~0 := ~i~0 + ~k~0; {19917#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:44:15,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {19917#(<= main_~i~0 (* main_~k~0 39))} assume !!(~i~0 < 1000000 * ~k~0); {19917#(<= main_~i~0 (* main_~k~0 39))} is VALID [2022-04-15 12:44:15,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {19917#(<= main_~i~0 (* main_~k~0 39))} ~i~0 := ~i~0 + ~k~0; {19918#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:44:15,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {19918#(<= main_~i~0 (* 40 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19918#(<= main_~i~0 (* 40 main_~k~0))} is VALID [2022-04-15 12:44:15,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {19918#(<= main_~i~0 (* 40 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19919#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:44:15,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {19919#(<= main_~i~0 (* 41 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19919#(<= main_~i~0 (* 41 main_~k~0))} is VALID [2022-04-15 12:44:15,396 INFO L290 TraceCheckUtils]: 90: Hoare triple {19919#(<= main_~i~0 (* 41 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19920#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:44:15,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {19920#(<= main_~i~0 (* 42 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19920#(<= main_~i~0 (* 42 main_~k~0))} is VALID [2022-04-15 12:44:15,397 INFO L290 TraceCheckUtils]: 92: Hoare triple {19920#(<= main_~i~0 (* 42 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19921#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:44:15,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {19921#(<= main_~i~0 (* main_~k~0 43))} assume !!(~i~0 < 1000000 * ~k~0); {19921#(<= main_~i~0 (* main_~k~0 43))} is VALID [2022-04-15 12:44:15,398 INFO L290 TraceCheckUtils]: 94: Hoare triple {19921#(<= main_~i~0 (* main_~k~0 43))} ~i~0 := ~i~0 + ~k~0; {19922#(<= main_~i~0 (* 44 main_~k~0))} is VALID [2022-04-15 12:44:15,398 INFO L290 TraceCheckUtils]: 95: Hoare triple {19922#(<= main_~i~0 (* 44 main_~k~0))} assume !!(~i~0 < 1000000 * ~k~0); {19922#(<= main_~i~0 (* 44 main_~k~0))} is VALID [2022-04-15 12:44:15,398 INFO L290 TraceCheckUtils]: 96: Hoare triple {19922#(<= main_~i~0 (* 44 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19923#(<= main_~i~0 (* main_~k~0 45))} is VALID [2022-04-15 12:44:15,399 INFO L290 TraceCheckUtils]: 97: Hoare triple {19923#(<= main_~i~0 (* main_~k~0 45))} assume !!(~i~0 < 1000000 * ~k~0); {19923#(<= main_~i~0 (* main_~k~0 45))} is VALID [2022-04-15 12:44:15,400 INFO L290 TraceCheckUtils]: 98: Hoare triple {19923#(<= main_~i~0 (* main_~k~0 45))} ~i~0 := ~i~0 + ~k~0; {20226#(<= main_~i~0 (* main_~k~0 46))} is VALID [2022-04-15 12:44:15,400 INFO L290 TraceCheckUtils]: 99: Hoare triple {20226#(<= main_~i~0 (* main_~k~0 46))} assume !!(~i~0 < 1000000 * ~k~0); {20230#(and (<= main_~i~0 (* main_~k~0 46)) (< main_~i~0 (* main_~k~0 1000000)))} is VALID [2022-04-15 12:44:15,411 INFO L290 TraceCheckUtils]: 100: Hoare triple {20230#(and (<= main_~i~0 (* main_~k~0 46)) (< main_~i~0 (* main_~k~0 1000000)))} ~i~0 := ~i~0 + ~k~0; {20234#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 47)))} is VALID [2022-04-15 12:44:15,418 INFO L290 TraceCheckUtils]: 101: Hoare triple {20234#(and (< main_~i~0 (* 1000001 main_~k~0)) (<= main_~i~0 (* main_~k~0 47)))} assume !(~i~0 < 1000000 * ~k~0); {19874#false} is VALID [2022-04-15 12:44:15,418 INFO L272 TraceCheckUtils]: 102: Hoare triple {19874#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {19874#false} is VALID [2022-04-15 12:44:15,418 INFO L290 TraceCheckUtils]: 103: Hoare triple {19874#false} ~cond := #in~cond; {19874#false} is VALID [2022-04-15 12:44:15,418 INFO L290 TraceCheckUtils]: 104: Hoare triple {19874#false} assume 0 == ~cond; {19874#false} is VALID [2022-04-15 12:44:15,418 INFO L290 TraceCheckUtils]: 105: Hoare triple {19874#false} assume !false; {19874#false} is VALID [2022-04-15 12:44:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:44:15,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:44:28,980 INFO L290 TraceCheckUtils]: 105: Hoare triple {19874#false} assume !false; {19874#false} is VALID [2022-04-15 12:44:28,981 INFO L290 TraceCheckUtils]: 104: Hoare triple {19874#false} assume 0 == ~cond; {19874#false} is VALID [2022-04-15 12:44:28,981 INFO L290 TraceCheckUtils]: 103: Hoare triple {19874#false} ~cond := #in~cond; {19874#false} is VALID [2022-04-15 12:44:28,981 INFO L272 TraceCheckUtils]: 102: Hoare triple {19874#false} call __VERIFIER_assert((if ~i~0 == 1000000 * ~k~0 then 1 else 0)); {19874#false} is VALID [2022-04-15 12:44:28,992 INFO L290 TraceCheckUtils]: 101: Hoare triple {19926#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} assume !(~i~0 < 1000000 * ~k~0); {19874#false} is VALID [2022-04-15 12:44:28,995 INFO L290 TraceCheckUtils]: 100: Hoare triple {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} ~i~0 := ~i~0 + ~k~0; {19926#(<= (+ main_~i~0 1) (* main_~k~0 1000000))} is VALID [2022-04-15 12:44:28,995 INFO L290 TraceCheckUtils]: 99: Hoare triple {20268#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {19925#(<= (+ main_~i~0 1) (* 999999 main_~k~0))} is VALID [2022-04-15 12:44:28,997 INFO L290 TraceCheckUtils]: 98: Hoare triple {20272#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} ~i~0 := ~i~0 + ~k~0; {20268#(or (not (< main_~i~0 (* main_~k~0 1000000))) (<= (+ main_~i~0 1) (* 999999 main_~k~0)))} is VALID [2022-04-15 12:44:28,997 INFO L290 TraceCheckUtils]: 97: Hoare triple {20272#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} assume !!(~i~0 < 1000000 * ~k~0); {20272#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:44:29,002 INFO L290 TraceCheckUtils]: 96: Hoare triple {20279#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} ~i~0 := ~i~0 + ~k~0; {20272#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999998)))} is VALID [2022-04-15 12:44:29,003 INFO L290 TraceCheckUtils]: 95: Hoare triple {20279#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} assume !!(~i~0 < 1000000 * ~k~0); {20279#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:44:29,004 INFO L290 TraceCheckUtils]: 94: Hoare triple {20286#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} ~i~0 := ~i~0 + ~k~0; {20279#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999997)))} is VALID [2022-04-15 12:44:29,004 INFO L290 TraceCheckUtils]: 93: Hoare triple {20286#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} assume !!(~i~0 < 1000000 * ~k~0); {20286#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:44:29,005 INFO L290 TraceCheckUtils]: 92: Hoare triple {20293#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20286#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999996)))} is VALID [2022-04-15 12:44:29,006 INFO L290 TraceCheckUtils]: 91: Hoare triple {20293#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20293#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {20300#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} ~i~0 := ~i~0 + ~k~0; {20293#(or (<= (+ main_~i~0 1) (* main_~k~0 999995)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {20300#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} assume !!(~i~0 < 1000000 * ~k~0); {20300#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:44:29,007 INFO L290 TraceCheckUtils]: 88: Hoare triple {20307#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} ~i~0 := ~i~0 + ~k~0; {20300#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999994)))} is VALID [2022-04-15 12:44:29,008 INFO L290 TraceCheckUtils]: 87: Hoare triple {20307#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} assume !!(~i~0 < 1000000 * ~k~0); {20307#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:44:29,008 INFO L290 TraceCheckUtils]: 86: Hoare triple {20314#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20307#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999993)))} is VALID [2022-04-15 12:44:29,009 INFO L290 TraceCheckUtils]: 85: Hoare triple {20314#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20314#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,010 INFO L290 TraceCheckUtils]: 84: Hoare triple {20321#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} ~i~0 := ~i~0 + ~k~0; {20314#(or (<= (+ main_~i~0 1) (* 999992 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,010 INFO L290 TraceCheckUtils]: 83: Hoare triple {20321#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} assume !!(~i~0 < 1000000 * ~k~0); {20321#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:44:29,011 INFO L290 TraceCheckUtils]: 82: Hoare triple {20328#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} ~i~0 := ~i~0 + ~k~0; {20321#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999991)))} is VALID [2022-04-15 12:44:29,011 INFO L290 TraceCheckUtils]: 81: Hoare triple {20328#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} assume !!(~i~0 < 1000000 * ~k~0); {20328#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:44:29,012 INFO L290 TraceCheckUtils]: 80: Hoare triple {20335#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20328#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999990)))} is VALID [2022-04-15 12:44:29,012 INFO L290 TraceCheckUtils]: 79: Hoare triple {20335#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20335#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {20342#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20335#(or (<= (+ main_~i~0 1) (* main_~k~0 999989)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {20342#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20342#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {20349#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} ~i~0 := ~i~0 + ~k~0; {20342#(or (<= (+ main_~i~0 1) (* main_~k~0 999988)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,015 INFO L290 TraceCheckUtils]: 75: Hoare triple {20349#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} assume !!(~i~0 < 1000000 * ~k~0); {20349#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:44:29,016 INFO L290 TraceCheckUtils]: 74: Hoare triple {20356#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20349#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999987)))} is VALID [2022-04-15 12:44:29,016 INFO L290 TraceCheckUtils]: 73: Hoare triple {20356#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20356#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {20363#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20356#(or (<= (+ main_~i~0 1) (* 999986 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {20363#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20363#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:44:29,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {20370#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} ~i~0 := ~i~0 + ~k~0; {20363#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999985 main_~k~0)))} is VALID [2022-04-15 12:44:29,018 INFO L290 TraceCheckUtils]: 69: Hoare triple {20370#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} assume !!(~i~0 < 1000000 * ~k~0); {20370#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:44:29,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {20377#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20370#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999984)))} is VALID [2022-04-15 12:44:29,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {20377#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20377#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,021 INFO L290 TraceCheckUtils]: 66: Hoare triple {20384#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} ~i~0 := ~i~0 + ~k~0; {20377#(or (<= (+ main_~i~0 1) (* main_~k~0 999983)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {20384#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} assume !!(~i~0 < 1000000 * ~k~0); {20384#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:44:29,022 INFO L290 TraceCheckUtils]: 64: Hoare triple {20391#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20384#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999982)))} is VALID [2022-04-15 12:44:29,022 INFO L290 TraceCheckUtils]: 63: Hoare triple {20391#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20391#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:44:29,025 INFO L290 TraceCheckUtils]: 62: Hoare triple {20398#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20391#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999981 main_~k~0)))} is VALID [2022-04-15 12:44:29,025 INFO L290 TraceCheckUtils]: 61: Hoare triple {20398#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20398#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {20405#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} ~i~0 := ~i~0 + ~k~0; {20398#(or (<= (+ main_~i~0 1) (* 999980 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {20405#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} assume !!(~i~0 < 1000000 * ~k~0); {20405#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:44:29,027 INFO L290 TraceCheckUtils]: 58: Hoare triple {20412#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20405#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999979)))} is VALID [2022-04-15 12:44:29,028 INFO L290 TraceCheckUtils]: 57: Hoare triple {20412#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20412#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,028 INFO L290 TraceCheckUtils]: 56: Hoare triple {20419#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} ~i~0 := ~i~0 + ~k~0; {20412#(or (<= (+ main_~i~0 1) (* 999978 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,029 INFO L290 TraceCheckUtils]: 55: Hoare triple {20419#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} assume !!(~i~0 < 1000000 * ~k~0); {20419#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:44:29,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {20426#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20419#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999977)))} is VALID [2022-04-15 12:44:29,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {20426#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20426#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {20433#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20426#(or (<= (+ main_~i~0 1) (* main_~k~0 999976)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,031 INFO L290 TraceCheckUtils]: 51: Hoare triple {20433#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20433#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,031 INFO L290 TraceCheckUtils]: 50: Hoare triple {20440#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} ~i~0 := ~i~0 + ~k~0; {20433#(or (<= (+ main_~i~0 1) (* main_~k~0 999975)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {20440#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} assume !!(~i~0 < 1000000 * ~k~0); {20440#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:44:29,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {20447#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20440#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999974)))} is VALID [2022-04-15 12:44:29,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {20447#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20447#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,034 INFO L290 TraceCheckUtils]: 46: Hoare triple {20454#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20447#(or (<= (+ main_~i~0 1) (* main_~k~0 999973)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,034 INFO L290 TraceCheckUtils]: 45: Hoare triple {20454#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20454#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,035 INFO L290 TraceCheckUtils]: 44: Hoare triple {20461#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20454#(or (<= (+ main_~i~0 1) (* 999972 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,035 INFO L290 TraceCheckUtils]: 43: Hoare triple {20461#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20461#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,035 INFO L290 TraceCheckUtils]: 42: Hoare triple {20468#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20461#(or (<= (+ main_~i~0 1) (* main_~k~0 999971)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,036 INFO L290 TraceCheckUtils]: 41: Hoare triple {20468#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20468#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:44:29,036 INFO L290 TraceCheckUtils]: 40: Hoare triple {20475#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20468#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999970 main_~k~0)))} is VALID [2022-04-15 12:44:29,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {20475#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20475#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,037 INFO L290 TraceCheckUtils]: 38: Hoare triple {20482#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20475#(or (<= (+ main_~i~0 1) (* main_~k~0 999969)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {20482#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20482#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:44:29,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {20489#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20482#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999968 main_~k~0)))} is VALID [2022-04-15 12:44:29,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {20489#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20489#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {20496#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20489#(or (<= (+ main_~i~0 1) (* 999967 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,040 INFO L290 TraceCheckUtils]: 33: Hoare triple {20496#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20496#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,041 INFO L290 TraceCheckUtils]: 32: Hoare triple {20503#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20496#(or (<= (+ main_~i~0 1) (* main_~k~0 999966)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,041 INFO L290 TraceCheckUtils]: 31: Hoare triple {20503#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20503#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {20510#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} ~i~0 := ~i~0 + ~k~0; {20503#(or (<= (+ main_~i~0 1) (* main_~k~0 999965)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {20510#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} assume !!(~i~0 < 1000000 * ~k~0); {20510#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:44:29,043 INFO L290 TraceCheckUtils]: 28: Hoare triple {20517#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} ~i~0 := ~i~0 + ~k~0; {20510#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999964)))} is VALID [2022-04-15 12:44:29,043 INFO L290 TraceCheckUtils]: 27: Hoare triple {20517#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} assume !!(~i~0 < 1000000 * ~k~0); {20517#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:44:29,044 INFO L290 TraceCheckUtils]: 26: Hoare triple {20524#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20517#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999963)))} is VALID [2022-04-15 12:44:29,044 INFO L290 TraceCheckUtils]: 25: Hoare triple {20524#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20524#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,045 INFO L290 TraceCheckUtils]: 24: Hoare triple {20531#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20524#(or (<= (+ main_~i~0 1) (* main_~k~0 999962)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {20531#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20531#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {20538#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} ~i~0 := ~i~0 + ~k~0; {20531#(or (<= (+ main_~i~0 1) (* main_~k~0 999961)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {20538#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} assume !!(~i~0 < 1000000 * ~k~0); {20538#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:44:29,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {20545#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20538#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999960)))} is VALID [2022-04-15 12:44:29,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {20545#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20545#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:44:29,047 INFO L290 TraceCheckUtils]: 18: Hoare triple {20552#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20545#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999959 main_~k~0)))} is VALID [2022-04-15 12:44:29,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {20552#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20552#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:44:29,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {20559#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} ~i~0 := ~i~0 + ~k~0; {20552#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999958 main_~k~0)))} is VALID [2022-04-15 12:44:29,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {20559#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} assume !!(~i~0 < 1000000 * ~k~0); {20559#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} is VALID [2022-04-15 12:44:29,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {20566#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20559#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* 999957 main_~k~0)))} is VALID [2022-04-15 12:44:29,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {20566#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20566#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {20573#(or (<= (+ main_~i~0 1) (* 999955 main_~k~0)) (<= main_~k~0 0))} ~i~0 := ~i~0 + ~k~0; {20566#(or (<= (+ main_~i~0 1) (* main_~k~0 999956)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {20573#(or (<= (+ main_~i~0 1) (* 999955 main_~k~0)) (<= main_~k~0 0))} assume !!(~i~0 < 1000000 * ~k~0); {20573#(or (<= (+ main_~i~0 1) (* 999955 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {20580#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999954)))} ~i~0 := ~i~0 + ~k~0; {20573#(or (<= (+ main_~i~0 1) (* 999955 main_~k~0)) (<= main_~k~0 0))} is VALID [2022-04-15 12:44:29,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {20580#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999954)))} assume !!(~i~0 < 1000000 * ~k~0); {20580#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999954)))} is VALID [2022-04-15 12:44:29,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {20587#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999953)) 1)} ~i~0 := ~i~0 + ~k~0; {20580#(or (<= main_~k~0 0) (<= (+ main_~i~0 1) (* main_~k~0 999954)))} is VALID [2022-04-15 12:44:29,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {20587#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999953)) 1)} assume !!(~i~0 < 1000000 * ~k~0); {20587#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999953)) 1)} is VALID [2022-04-15 12:44:29,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#true} assume !!(0 <= ~k~0 && ~k~0 <= 10);~i~0 := 0; {20587#(<= (div (+ (- 1) (* (- 1) main_~i~0)) (- 999953)) 1)} is VALID [2022-04-15 12:44:29,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {19873#true} havoc ~i~0;havoc ~k~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {19873#true} is VALID [2022-04-15 12:44:29,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {19873#true} call #t~ret2 := main(); {19873#true} is VALID [2022-04-15 12:44:29,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19873#true} {19873#true} #55#return; {19873#true} is VALID [2022-04-15 12:44:29,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {19873#true} assume true; {19873#true} is VALID [2022-04-15 12:44:29,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {19873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {19873#true} is VALID [2022-04-15 12:44:29,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {19873#true} call ULTIMATE.init(); {19873#true} is VALID [2022-04-15 12:44:29,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 12:44:29,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729107172] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:44:29,054 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:44:29,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 103 [2022-04-15 12:44:29,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:44:29,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1525375420] [2022-04-15 12:44:29,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1525375420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:44:29,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:44:29,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 12:44:29,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065902028] [2022-04-15 12:44:29,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:44:29,055 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 51 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 106 [2022-04-15 12:44:29,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:44:29,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 51 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:44:29,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:44:29,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 12:44:29,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:44:29,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 12:44:29,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3597, Invalid=6909, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 12:44:29,596 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 52 states, 52 states have (on average 1.9615384615384615) internal successors, (102), 51 states have internal predecessors, (102), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)