/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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:48:22,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:48:22,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:48:22,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:48:22,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:48:22,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:48:22,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:48:22,766 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:48:22,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:48:22,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:48:22,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:48:22,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:48:22,774 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:48:22,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:48:22,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:48:22,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:48:22,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:48:22,779 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:48:22,783 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:48:22,789 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:48:22,791 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:48:22,792 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:48:22,792 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:48:22,793 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:48:22,794 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:48:22,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:48:22,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:48:22,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:48:22,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:48:22,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:48:22,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:48:22,803 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:48:22,804 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:48:22,805 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:48:22,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:48:22,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:48:22,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:48:22,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:48:22,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:48:22,807 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:48:22,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:48:22,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:48:22,810 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:48:22,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:48:22,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:48:22,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:48:22,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:48:22,822 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:48:22,822 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:48:22,822 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:48:22,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:48:22,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:22,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:48:22,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:48:22,824 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:48:22,824 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:48:22,824 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:48:22,824 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:48:22,824 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 06:48:23,018 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:48:23,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:48:23,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:48:23,039 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:48:23,040 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:48:23,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c [2022-04-15 06:48:23,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5034620/baf3b692f8fc43169a9121841a39b03b/FLAGfb1457d0e [2022-04-15 06:48:23,475 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:48:23,475 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c [2022-04-15 06:48:23,480 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5034620/baf3b692f8fc43169a9121841a39b03b/FLAGfb1457d0e [2022-04-15 06:48:23,908 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff5034620/baf3b692f8fc43169a9121841a39b03b [2022-04-15 06:48:23,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:48:23,911 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:48:23,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:23,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:48:23,918 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:48:23,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:23" (1/1) ... [2022-04-15 06:48:23,920 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30ef7a9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:23, skipping insertion in model container [2022-04-15 06:48:23,920 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:48:23" (1/1) ... [2022-04-15 06:48:23,925 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:48:23,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:48:24,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c[318,331] [2022-04-15 06:48:24,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:24,117 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:48:24,127 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_3.c[318,331] [2022-04-15 06:48:24,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:48:24,143 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:48:24,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24 WrapperNode [2022-04-15 06:48:24,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:48:24,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:48:24,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:48:24,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:48:24,154 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:48:24,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:48:24,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:48:24,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:48:24,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (1/1) ... [2022-04-15 06:48:24,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:48:24,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:24,220 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 06:48:24,246 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 06:48:24,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:48:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:48:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:48:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:48:24,266 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:48:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:48:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:48:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:48:24,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:48:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:48:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:48:24,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:48:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:48:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:48:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:48:24,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:48:24,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:48:24,324 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:48:24,326 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:48:24,484 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:48:24,490 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:48:24,490 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:48:24,491 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:24 BoogieIcfgContainer [2022-04-15 06:48:24,491 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:48:24,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:48:24,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:48:24,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:48:24,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:48:23" (1/3) ... [2022-04-15 06:48:24,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ec57a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:24, skipping insertion in model container [2022-04-15 06:48:24,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:48:24" (2/3) ... [2022-04-15 06:48:24,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ec57a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:48:24, skipping insertion in model container [2022-04-15 06:48:24,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:48:24" (3/3) ... [2022-04-15 06:48:24,503 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_3.c [2022-04-15 06:48:24,507 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:48:24,507 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:48:24,576 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:48:24,581 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 06:48:24,581 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:48:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 06:48:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:48:24,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:24,608 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:24,609 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:24,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:24,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-15 06:48:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:24,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1650499692] [2022-04-15 06:48:24,632 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:48:24,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-15 06:48:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:24,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812399833] [2022-04-15 06:48:24,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:24,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:24,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:24,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(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(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:48:24,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:48:24,821 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:48:24,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:24,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(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(17, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 06:48:24,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:48:24,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 06:48:24,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-15 06:48:24,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-15 06:48:24,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 06:48:24,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-15 06:48:24,827 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {25#false} is VALID [2022-04-15 06:48:24,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 06:48:24,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:48:24,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:48:24,829 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 06:48:24,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:24,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812399833] [2022-04-15 06:48:24,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812399833] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:24,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:24,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:48:24,835 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:24,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1650499692] [2022-04-15 06:48:24,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1650499692] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:24,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:24,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:48:24,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43511127] [2022-04-15 06:48:24,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:24,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:24,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:24,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:24,865 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 06:48:24,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:48:24,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:24,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:48:24,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:48:24,896 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:24,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:24,988 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 06:48:24,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:48:24,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:24,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:24,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:48:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:25,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 06:48:25,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 06:48:25,058 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 06:48:25,065 INFO L225 Difference]: With dead ends: 34 [2022-04-15 06:48:25,065 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 06:48:25,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:48:25,072 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:25,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:25,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 06:48:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 06:48:25,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:25,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:48:25,106 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:48:25,107 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:48:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:25,112 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:48:25,112 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:25,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:25,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:25,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 14 states. [2022-04-15 06:48:25,114 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 14 states. [2022-04-15 06:48:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:25,116 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 06:48:25,116 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:25,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:25,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:25,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:25,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 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 06:48:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-15 06:48:25,124 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-15 06:48:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:25,124 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-15 06:48:25,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 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 06:48:25,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-15 06:48:25,149 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 06:48:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 06:48:25,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 06:48:25,153 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:25,155 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:25,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:48:25,156 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-15 06:48:25,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:25,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436652786] [2022-04-15 06:48:25,159 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:48:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-15 06:48:25,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:25,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109897652] [2022-04-15 06:48:25,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:25,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:25,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(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(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 06:48:25,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:48:25,250 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:48:25,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:25,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(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(17, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 06:48:25,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 06:48:25,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 06:48:25,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret9 := main(); {156#true} is VALID [2022-04-15 06:48:25,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-15 06:48:25,258 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-15 06:48:25,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > 0); {157#false} is VALID [2022-04-15 06:48:25,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {157#false} is VALID [2022-04-15 06:48:25,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 06:48:25,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 06:48:25,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 06:48:25,259 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 06:48:25,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:25,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109897652] [2022-04-15 06:48:25,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109897652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:25,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:25,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:25,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:25,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436652786] [2022-04-15 06:48:25,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436652786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:25,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:25,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:25,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548869989] [2022-04-15 06:48:25,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:25,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,292 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 06:48:25,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:48:25,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:25,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:48:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:48:25,295 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:25,361 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 06:48:25,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:48:25,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:25,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:48:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 06:48:25,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-15 06:48:25,389 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 06:48:25,390 INFO L225 Difference]: With dead ends: 24 [2022-04-15 06:48:25,390 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 06:48:25,390 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:48:25,392 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:25,392 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 06:48:25,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 06:48:25,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:25,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,396 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,397 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:25,398 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:48:25,398 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:25,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:25,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:25,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,399 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:25,400 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 06:48:25,400 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:25,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:25,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:25,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:25,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:25,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 06:48:25,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 06:48:25,402 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 06:48:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:25,402 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 06:48:25,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 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 06:48:25,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 06:48:25,418 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 06:48:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 06:48:25,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:48:25,419 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:25,419 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:25,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:48:25,419 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:25,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:25,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-15 06:48:25,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:25,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [793788807] [2022-04-15 06:48:29,572 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:29,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:29,677 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:29,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-15 06:48:29,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:29,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261792956] [2022-04-15 06:48:29,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:29,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:29,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:29,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:29,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(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(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 06:48:29,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:48:29,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:48:29,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:29,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(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(17, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 06:48:29,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 06:48:29,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 06:48:29,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret9 := main(); {279#true} is VALID [2022-04-15 06:48:29,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {284#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:29,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(<= 500000 main_~y~0)} [58] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_14 v_main_~x~0_13)) (.cse1 (= |v_main_#t~post4_4| |v_main_#t~post4_3|))) (or (and (< v_main_~x~0_14 v_main_~x~0_13) (< v_main_~x~0_13 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_14) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_14, main_#t~post4=|v_main_#t~post4_4|} OutVars{main_~x~0=v_main_~x~0_13, main_#t~post4=|v_main_#t~post4_3|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {284#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:29,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(<= 500000 main_~y~0)} [57] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {284#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:29,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(<= 500000 main_~y~0)} assume !(~y~0 > 0); {280#false} is VALID [2022-04-15 06:48:29,736 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {280#false} is VALID [2022-04-15 06:48:29,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-15 06:48:29,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-15 06:48:29,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-15 06:48:29,736 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 06:48:29,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:29,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261792956] [2022-04-15 06:48:29,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261792956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:29,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:29,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:48:29,780 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:29,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [793788807] [2022-04-15 06:48:29,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [793788807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:29,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:29,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:48:29,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461091375] [2022-04-15 06:48:29,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:29,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,782 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:29,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,794 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 06:48:29,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:48:29,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:29,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:48:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:48:29,795 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:29,912 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 06:48:29,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:48:29,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:29,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:48:29,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 06:48:29,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-15 06:48:29,942 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 06:48:29,943 INFO L225 Difference]: With dead ends: 26 [2022-04-15 06:48:29,943 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 06:48:29,943 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:48:29,944 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:29,945 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:48:29,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 06:48:29,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 06:48:29,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:29,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 06:48:29,960 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 06:48:29,961 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 06:48:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:29,962 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:29,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:29,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:29,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 20 states. [2022-04-15 06:48:29,963 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 20 states. [2022-04-15 06:48:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:29,964 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 06:48:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:29,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:29,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:29,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:29,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:29,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 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 06:48:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 06:48:29,966 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-15 06:48:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:29,966 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 06:48:29,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 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 06:48:29,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 06:48:29,987 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 06:48:29,988 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 06:48:29,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:48:29,988 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:29,988 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:29,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:48:29,989 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:29,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:29,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-15 06:48:29,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:29,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [706035162] [2022-04-15 06:48:33,245 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:33,339 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:37,570 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:37,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:37,767 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:37,770 INFO L85 PathProgramCache]: Analyzing trace with hash -538275198, now seen corresponding path program 1 times [2022-04-15 06:48:37,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:37,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000214929] [2022-04-15 06:48:37,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:37,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:37,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {438#(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(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:37,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:37,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:37,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:37,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#(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(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:37,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:37,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:37,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:48:37,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {433#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:48:37,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (< v_main_~x~0_20 500001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_21)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {434#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:37,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {434#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:37,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [62] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse0 (<= 500000 v_main_~x~0_23)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_23 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {435#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:37,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {435#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:37,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {437#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:37,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 499998 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-15 06:48:37,896 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-15 06:48:37,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:48:37,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:48:37,896 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:48:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:37,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:37,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000214929] [2022-04-15 06:48:37,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000214929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:37,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479788225] [2022-04-15 06:48:37,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:37,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:37,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:37,898 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 06:48:37,899 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 06:48:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:48:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:37,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:38,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:48:38,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#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(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:38,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:38,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:38,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:48:38,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:38,169 INFO L290 TraceCheckUtils]: 6: Hoare triple {436#(<= 500000 main_~y~0)} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (< v_main_~x~0_20 500001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_21)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:38,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {436#(<= 500000 main_~y~0)} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:38,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {436#(<= 500000 main_~y~0)} [62] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse0 (<= 500000 v_main_~x~0_23)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_23 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:38,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(<= 500000 main_~y~0)} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {436#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:38,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {436#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {437#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:38,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {437#(<= 499998 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-15 06:48:38,173 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-15 06:48:38,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:48:38,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:48:38,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:48:38,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:38,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:38,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 06:48:38,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 06:48:38,347 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 06:48:38,347 INFO L272 TraceCheckUtils]: 12: Hoare triple {429#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {429#false} is VALID [2022-04-15 06:48:38,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {499#(< 0 main_~y~0)} assume !(~y~0 > 0); {429#false} is VALID [2022-04-15 06:48:38,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {499#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:38,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(< 2 main_~y~0)} [59] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {503#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:38,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(< 2 main_~y~0)} [62] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse3 (= v_main_~y~0_8 v_main_~y~0_7)) (.cse0 (<= 500000 v_main_~x~0_23)) (.cse4 (= v_main_~x~0_23 v_main_~x~0_22))) (or (and (< v_main_~x~0_22 1000001) .cse0 (< v_main_~x~0_23 v_main_~x~0_22) (= (+ v_main_~x~0_22 v_main_~y~0_8) (+ v_main_~x~0_23 v_main_~y~0_7))) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_23 1000000))) .cse4))) InVars {main_~y~0=v_main_~y~0_8, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_7, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {503#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:38,350 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(< 2 main_~y~0)} [61] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {503#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:38,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {503#(< 2 main_~y~0)} [60] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_9| |v_main_#t~post4_8|)) (.cse1 (= v_main_~x~0_21 v_main_~x~0_20))) (or (and (< v_main_~x~0_20 500001) (< v_main_~x~0_21 v_main_~x~0_20)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_21)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_21, main_#t~post4=|v_main_#t~post4_9|} OutVars{main_~x~0=v_main_~x~0_20, main_#t~post4=|v_main_#t~post4_8|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {503#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:38,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {503#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:38,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret9 := main(); {428#true} is VALID [2022-04-15 06:48:38,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 06:48:38,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 06:48:38,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#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(17, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 06:48:38,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 06:48:38,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:38,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479788225] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:38,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:38,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-15 06:48:38,551 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:38,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [706035162] [2022-04-15 06:48:38,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [706035162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:38,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:38,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:48:38,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43881037] [2022-04-15 06:48:38,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2022-04-15 06:48:38,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:38,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 06:48:38,578 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 06:48:38,578 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:48:38,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:38,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:48:38,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-15 06:48:38,580 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 06:48:38,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:38,889 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-15 06:48:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 06:48:38,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 19 [2022-04-15 06:48:38,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:38,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 06:48:38,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 06:48:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 06:48:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2022-04-15 06:48:38,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2022-04-15 06:48:38,938 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 06:48:38,939 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:48:38,939 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:48:38,939 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:48:38,940 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:38,940 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 29 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:48:38,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:48:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 06:48:38,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:38,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 06:48:38,975 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 06:48:38,976 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 06:48:38,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:38,979 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:48:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:48:38,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:38,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:38,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 27 states. [2022-04-15 06:48:38,980 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 27 states. [2022-04-15 06:48:38,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:38,984 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 06:48:38,985 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:48:38,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:38,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:38,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:38,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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 06:48:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-15 06:48:38,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 19 [2022-04-15 06:48:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:38,992 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-15 06:48:38,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 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 06:48:38,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-15 06:48:39,026 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 06:48:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-15 06:48:39,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 06:48:39,027 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:39,027 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:39,047 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 06:48:39,235 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:39,236 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:39,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:39,236 INFO L85 PathProgramCache]: Analyzing trace with hash -510493847, now seen corresponding path program 2 times [2022-04-15 06:48:39,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:39,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1526964002] [2022-04-15 06:48:43,318 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:43,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:43,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:43,769 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash 886374433, now seen corresponding path program 1 times [2022-04-15 06:48:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:43,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218428914] [2022-04-15 06:48:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:43,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:43,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:43,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {749#(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(17, 2);call #Ultimate.allocInit(12, 3); {738#true} is VALID [2022-04-15 06:48:43,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 06:48:43,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {738#true} {738#true} #52#return; {738#true} is VALID [2022-04-15 06:48:43,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:43,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {749#(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(17, 2);call #Ultimate.allocInit(12, 3); {738#true} is VALID [2022-04-15 06:48:43,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 06:48:43,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #52#return; {738#true} is VALID [2022-04-15 06:48:43,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret9 := main(); {738#true} is VALID [2022-04-15 06:48:43,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {743#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:48:43,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {743#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_41) .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {744#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:43,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {744#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {744#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:43,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {744#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= |v_main_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {745#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:43,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {746#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:43,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {746#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {747#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:43,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {747#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {748#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:43,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {748#(<= 499996 main_~y~0)} assume !(~y~0 > 0); {739#false} is VALID [2022-04-15 06:48:43,925 INFO L272 TraceCheckUtils]: 13: Hoare triple {739#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {739#false} is VALID [2022-04-15 06:48:43,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} ~cond := #in~cond; {739#false} is VALID [2022-04-15 06:48:43,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 == ~cond; {739#false} is VALID [2022-04-15 06:48:43,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 06:48:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:43,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218428914] [2022-04-15 06:48:43,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218428914] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:43,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496582474] [2022-04-15 06:48:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:43,928 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 06:48:43,929 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 06:48:43,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:43,959 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:48:43,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:43,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:44,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-15 06:48:44,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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(17, 2);call #Ultimate.allocInit(12, 3); {738#true} is VALID [2022-04-15 06:48:44,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 06:48:44,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #52#return; {738#true} is VALID [2022-04-15 06:48:44,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret9 := main(); {738#true} is VALID [2022-04-15 06:48:44,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {768#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:48:44,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {768#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_41) .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {772#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:48:44,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {772#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:48:44,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {772#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= |v_main_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {779#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:48:44,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {779#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {783#(< 999999 main_~y~0)} is VALID [2022-04-15 06:48:44,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {783#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {787#(< 999997 main_~y~0)} is VALID [2022-04-15 06:48:44,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {787#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {791#(< 999995 main_~y~0)} is VALID [2022-04-15 06:48:44,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {791#(< 999995 main_~y~0)} assume !(~y~0 > 0); {739#false} is VALID [2022-04-15 06:48:44,358 INFO L272 TraceCheckUtils]: 13: Hoare triple {739#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {739#false} is VALID [2022-04-15 06:48:44,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} ~cond := #in~cond; {739#false} is VALID [2022-04-15 06:48:44,358 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 == ~cond; {739#false} is VALID [2022-04-15 06:48:44,358 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 06:48:44,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:44,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:44,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {739#false} assume !false; {739#false} is VALID [2022-04-15 06:48:44,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {739#false} assume 0 == ~cond; {739#false} is VALID [2022-04-15 06:48:44,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {739#false} ~cond := #in~cond; {739#false} is VALID [2022-04-15 06:48:44,827 INFO L272 TraceCheckUtils]: 13: Hoare triple {739#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {739#false} is VALID [2022-04-15 06:48:44,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {819#(< 0 main_~y~0)} assume !(~y~0 > 0); {739#false} is VALID [2022-04-15 06:48:44,828 INFO L290 TraceCheckUtils]: 11: Hoare triple {823#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {819#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:44,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {827#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {823#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:44,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {831#(or (< main_~x~0 1000000) (< 4 main_~y~0))} [63] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {827#(< 4 main_~y~0)} is VALID [2022-04-15 06:48:44,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (not (<= 500000 main_~x~0)) (<= 4 main_~y~0)))} [66] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_43)) (.cse1 (= v_main_~y~0_21 v_main_~y~0_20)) (.cse2 (= |v_main_#t~post5_11| |v_main_#t~post5_10|)) (.cse3 (= |v_main_#t~post6_11| |v_main_#t~post6_10|)) (.cse4 (= v_main_~x~0_43 v_main_~x~0_42))) (or (and .cse0 (< v_main_~x~0_42 1000001) (= (+ v_main_~x~0_43 v_main_~y~0_20) (+ v_main_~x~0_42 v_main_~y~0_21)) (< v_main_~x~0_43 v_main_~x~0_42)) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_43 1000000))) .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_21, main_#t~post5=|v_main_#t~post5_11|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_11|} OutVars{main_~y~0=v_main_~y~0_20, main_#t~post5=|v_main_#t~post5_10|, main_~x~0=v_main_~x~0_42, main_#t~post6=|v_main_#t~post6_10|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {831#(or (< main_~x~0 1000000) (< 4 main_~y~0))} is VALID [2022-04-15 06:48:44,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (not (<= 500000 main_~x~0)) (<= 4 main_~y~0)))} [65] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (not (<= 500000 main_~x~0)) (<= 4 main_~y~0)))} is VALID [2022-04-15 06:48:44,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {842#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (<= 4 main_~y~0)) (<= 0 (+ main_~y~0 499995)))} [64] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_41 v_main_~x~0_40)) (.cse1 (= |v_main_#t~post4_15| |v_main_#t~post4_14|))) (or (and (< v_main_~x~0_41 v_main_~x~0_40) (< v_main_~x~0_40 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_41) .cse1))) InVars {main_~x~0=v_main_~x~0_41, main_#t~post4=|v_main_#t~post4_15|} OutVars{main_~x~0=v_main_~x~0_40, main_#t~post4=|v_main_#t~post4_14|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {835#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (not (<= 500000 main_~x~0)) (<= 4 main_~y~0)))} is VALID [2022-04-15 06:48:44,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {738#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {842#(and (or (< main_~x~0 1000000) (< 4 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999996)) (<= 4 main_~y~0)) (<= 0 (+ main_~y~0 499995)))} is VALID [2022-04-15 06:48:44,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {738#true} call #t~ret9 := main(); {738#true} is VALID [2022-04-15 06:48:44,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {738#true} {738#true} #52#return; {738#true} is VALID [2022-04-15 06:48:44,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {738#true} assume true; {738#true} is VALID [2022-04-15 06:48:44,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {738#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(17, 2);call #Ultimate.allocInit(12, 3); {738#true} is VALID [2022-04-15 06:48:44,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {738#true} call ULTIMATE.init(); {738#true} is VALID [2022-04-15 06:48:44,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:44,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496582474] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:44,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:44,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-15 06:48:45,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:45,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1526964002] [2022-04-15 06:48:45,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1526964002] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:45,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:45,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:48:45,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678757513] [2022-04-15 06:48:45,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:45,041 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:45,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,063 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 06:48:45,063 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:48:45,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:45,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:48:45,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=411, Unknown=0, NotChecked=0, Total=650 [2022-04-15 06:48:45,064 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:45,445 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-15 06:48:45,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:48:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-15 06:48:45,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 43 transitions. [2022-04-15 06:48:45,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 43 transitions. [2022-04-15 06:48:45,482 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 06:48:45,483 INFO L225 Difference]: With dead ends: 43 [2022-04-15 06:48:45,483 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 06:48:45,484 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=747, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 06:48:45,485 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 26 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:45,486 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 29 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:48:45,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 06:48:45,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 06:48:45,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:45,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 06:48:45,519 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 06:48:45,519 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 06:48:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:45,520 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 06:48:45,520 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 06:48:45,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:45,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:45,520 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 30 states. [2022-04-15 06:48:45,521 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 30 states. [2022-04-15 06:48:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:45,522 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 06:48:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 06:48:45,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:45,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:45,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:45,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:45,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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 06:48:45,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 06:48:45,524 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-04-15 06:48:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:45,524 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 06:48:45,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 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 06:48:45,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 06:48:45,561 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 06:48:45,561 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 06:48:45,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 06:48:45,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:45,563 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:45,587 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 06:48:45,781 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 [2022-04-15 06:48:45,781 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:45,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:45,782 INFO L85 PathProgramCache]: Analyzing trace with hash 32415221, now seen corresponding path program 3 times [2022-04-15 06:48:45,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:45,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [733715798] [2022-04-15 06:48:45,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:46,212 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:46,214 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:46,216 INFO L85 PathProgramCache]: Analyzing trace with hash -59103134, now seen corresponding path program 1 times [2022-04-15 06:48:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:46,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078184175] [2022-04-15 06:48:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:46,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:46,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:46,359 INFO L290 TraceCheckUtils]: 0: Hoare triple {1102#(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(17, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-15 06:48:46,359 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:48:46,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1090#true} {1090#true} #52#return; {1090#true} is VALID [2022-04-15 06:48:46,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:46,360 INFO L290 TraceCheckUtils]: 1: Hoare triple {1102#(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(17, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-15 06:48:46,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:48:46,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #52#return; {1090#true} is VALID [2022-04-15 06:48:46,360 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret9 := main(); {1090#true} is VALID [2022-04-15 06:48:46,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1095#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:48:46,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {1095#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_64 v_main_~x~0_63))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_64) .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1096#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:46,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {1096#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1096#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:46,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {1096#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [70] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_66)) (.cse0 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse3 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_66 1000000))) .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_65 1000001) (< v_main_~x~0_66 v_main_~x~0_65) (= (+ v_main_~x~0_65 v_main_~y~0_37) (+ v_main_~x~0_66 v_main_~y~0_36))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1097#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:48:46,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1099#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:46,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1100#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:46,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {1100#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1101#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:46,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(<= 499994 main_~y~0)} assume !(~y~0 > 0); {1091#false} is VALID [2022-04-15 06:48:46,365 INFO L272 TraceCheckUtils]: 14: Hoare triple {1091#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1091#false} is VALID [2022-04-15 06:48:46,365 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2022-04-15 06:48:46,365 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2022-04-15 06:48:46,365 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-04-15 06:48:46,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:46,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:46,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078184175] [2022-04-15 06:48:46,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078184175] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:46,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292956059] [2022-04-15 06:48:46,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:46,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:46,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:46,367 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 06:48:46,368 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 06:48:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:46,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:48:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:46,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:46,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1090#true} is VALID [2022-04-15 06:48:46,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#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(17, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-15 06:48:46,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:48:46,566 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #52#return; {1090#true} is VALID [2022-04-15 06:48:46,566 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret9 := main(); {1090#true} is VALID [2022-04-15 06:48:46,567 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {1098#(<= 500000 main_~y~0)} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_64 v_main_~x~0_63))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_64) .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1098#(<= 500000 main_~y~0)} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {1098#(<= 500000 main_~y~0)} [70] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_66)) (.cse0 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse3 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_66 1000000))) .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_65 1000001) (< v_main_~x~0_66 v_main_~x~0_65) (= (+ v_main_~x~0_65 v_main_~y~0_37) (+ v_main_~x~0_66 v_main_~y~0_36))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {1098#(<= 500000 main_~y~0)} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1098#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:46,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1099#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:46,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {1099#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1100#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:46,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {1100#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1101#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:46,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {1101#(<= 499994 main_~y~0)} assume !(~y~0 > 0); {1091#false} is VALID [2022-04-15 06:48:46,576 INFO L272 TraceCheckUtils]: 14: Hoare triple {1091#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1091#false} is VALID [2022-04-15 06:48:46,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2022-04-15 06:48:46,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2022-04-15 06:48:46,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-04-15 06:48:46,576 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:46,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:46,780 INFO L290 TraceCheckUtils]: 17: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2022-04-15 06:48:46,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2022-04-15 06:48:46,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2022-04-15 06:48:46,781 INFO L272 TraceCheckUtils]: 14: Hoare triple {1091#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1091#false} is VALID [2022-04-15 06:48:46,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {1169#(< 0 main_~y~0)} assume !(~y~0 > 0); {1091#false} is VALID [2022-04-15 06:48:46,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {1173#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1169#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:46,783 INFO L290 TraceCheckUtils]: 11: Hoare triple {1177#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1173#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:46,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {1181#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1177#(< 4 main_~y~0)} is VALID [2022-04-15 06:48:46,783 INFO L290 TraceCheckUtils]: 9: Hoare triple {1181#(< 6 main_~y~0)} [67] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1181#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:46,784 INFO L290 TraceCheckUtils]: 8: Hoare triple {1181#(< 6 main_~y~0)} [70] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_66)) (.cse0 (= |v_main_#t~post5_18| |v_main_#t~post5_17|)) (.cse2 (= v_main_~y~0_37 v_main_~y~0_36)) (.cse3 (= v_main_~x~0_66 v_main_~x~0_65)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_66 1000000))) .cse2 .cse3 .cse4) (and .cse1 (< v_main_~x~0_65 1000001) (< v_main_~x~0_66 v_main_~x~0_65) (= (+ v_main_~x~0_65 v_main_~y~0_37) (+ v_main_~x~0_66 v_main_~y~0_36))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_37, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_66, main_#t~post6=|v_main_#t~post6_18|} OutVars{main_~y~0=v_main_~y~0_36, main_#t~post5=|v_main_#t~post5_17|, main_~x~0=v_main_~x~0_65, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1181#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:46,784 INFO L290 TraceCheckUtils]: 7: Hoare triple {1181#(< 6 main_~y~0)} [69] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1181#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:46,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1181#(< 6 main_~y~0)} [68] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_22| |v_main_#t~post4_21|)) (.cse1 (= v_main_~x~0_64 v_main_~x~0_63))) (or (and (< v_main_~x~0_64 v_main_~x~0_63) (< v_main_~x~0_63 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_64) .cse1))) InVars {main_~x~0=v_main_~x~0_64, main_#t~post4=|v_main_#t~post4_22|} OutVars{main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1181#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:46,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1181#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:46,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret9 := main(); {1090#true} is VALID [2022-04-15 06:48:46,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #52#return; {1090#true} is VALID [2022-04-15 06:48:46,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2022-04-15 06:48:46,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {1090#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(17, 2);call #Ultimate.allocInit(12, 3); {1090#true} is VALID [2022-04-15 06:48:46,789 INFO L272 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1090#true} is VALID [2022-04-15 06:48:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:46,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292956059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:46,789 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:46,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 14 [2022-04-15 06:48:47,002 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [733715798] [2022-04-15 06:48:47,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [733715798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:47,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:47,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 06:48:47,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496125872] [2022-04-15 06:48:47,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:47,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 25 [2022-04-15 06:48:47,004 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:47,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 06:48:47,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:47,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 06:48:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:47,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 06:48:47,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=233, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:48:47,026 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 06:48:47,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:47,445 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-04-15 06:48:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 06:48:47,445 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 25 [2022-04-15 06:48:47,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 06:48:47,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-15 06:48:47,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 06:48:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 46 transitions. [2022-04-15 06:48:47,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 46 transitions. [2022-04-15 06:48:47,488 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 06:48:47,489 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:48:47,489 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 06:48:47,489 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=568, Unknown=0, NotChecked=0, Total=870 [2022-04-15 06:48:47,490 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:47,490 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 29 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:48:47,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 06:48:47,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 06:48:47,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:47,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 06:48:47,523 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 06:48:47,523 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 06:48:47,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:47,524 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:48:47,524 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:48:47,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:47,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:47,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 33 states. [2022-04-15 06:48:47,525 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 33 states. [2022-04-15 06:48:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:47,526 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-04-15 06:48:47,526 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:48:47,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:47,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:47,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:47,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:47,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 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 06:48:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-15 06:48:47,528 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 25 [2022-04-15 06:48:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:47,528 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-15 06:48:47,528 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 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 06:48:47,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-15 06:48:47,577 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 06:48:47,577 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-15 06:48:47,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 06:48:47,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:47,578 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:47,594 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 06:48:47,778 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:47,779 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:47,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:47,779 INFO L85 PathProgramCache]: Analyzing trace with hash 29002067, now seen corresponding path program 4 times [2022-04-15 06:48:47,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:47,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1067369161] [2022-04-15 06:48:51,861 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:48:51,934 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:52,189 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:52,190 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1837865407, now seen corresponding path program 1 times [2022-04-15 06:48:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:52,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809875798] [2022-04-15 06:48:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:52,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:52,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:52,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {1476#(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(17, 2);call #Ultimate.allocInit(12, 3); {1466#true} is VALID [2022-04-15 06:48:52,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#true} assume true; {1466#true} is VALID [2022-04-15 06:48:52,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1466#true} {1466#true} #52#return; {1466#true} is VALID [2022-04-15 06:48:52,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1476#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:52,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {1476#(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(17, 2);call #Ultimate.allocInit(12, 3); {1466#true} is VALID [2022-04-15 06:48:52,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2022-04-15 06:48:52,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #52#return; {1466#true} is VALID [2022-04-15 06:48:52,268 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret9 := main(); {1466#true} is VALID [2022-04-15 06:48:52,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,269 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#(<= 500000 main_~y~0)} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_28| |v_main_#t~post4_27|)) (.cse1 (= v_main_~x~0_88 v_main_~x~0_87))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_88 500000))) (and (< v_main_~x~0_87 500001) (< v_main_~x~0_88 v_main_~x~0_87)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_28|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_27|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(<= 500000 main_~y~0)} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#(<= 500000 main_~y~0)} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse2 (<= 500000 v_main_~x~0_90))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_90 1000000))) (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse1 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_55))) (and (= .cse4 (+ v_main_~x~0_89 v_main_~y~0_56)) (< .cse4 (+ v_main_~y~0_56 1000001)) .cse2 (< v_main_~y~0_56 v_main_~y~0_55))))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#(<= 500000 main_~y~0)} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1472#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:52,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1473#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:52,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1474#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:52,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {1474#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1475#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:48:52,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {1475#(<= 499992 main_~y~0)} assume !(~y~0 > 0); {1467#false} is VALID [2022-04-15 06:48:52,273 INFO L272 TraceCheckUtils]: 15: Hoare triple {1467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1467#false} is VALID [2022-04-15 06:48:52,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2022-04-15 06:48:52,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2022-04-15 06:48:52,274 INFO L290 TraceCheckUtils]: 18: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2022-04-15 06:48:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:52,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809875798] [2022-04-15 06:48:52,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809875798] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:52,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320828030] [2022-04-15 06:48:52,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:52,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:52,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:52,276 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 06:48:52,277 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 06:48:52,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:52,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 06:48:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:52,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:52,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1466#true} is VALID [2022-04-15 06:48:52,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#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(17, 2);call #Ultimate.allocInit(12, 3); {1466#true} is VALID [2022-04-15 06:48:52,462 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2022-04-15 06:48:52,462 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #52#return; {1466#true} is VALID [2022-04-15 06:48:52,462 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret9 := main(); {1466#true} is VALID [2022-04-15 06:48:52,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {1471#(<= 500000 main_~y~0)} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_28| |v_main_#t~post4_27|)) (.cse1 (= v_main_~x~0_88 v_main_~x~0_87))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_88 500000))) (and (< v_main_~x~0_87 500001) (< v_main_~x~0_88 v_main_~x~0_87)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_28|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_27|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1471#(<= 500000 main_~y~0)} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {1471#(<= 500000 main_~y~0)} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse2 (<= 500000 v_main_~x~0_90))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_90 1000000))) (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse1 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_55))) (and (= .cse4 (+ v_main_~x~0_89 v_main_~y~0_56)) (< .cse4 (+ v_main_~y~0_56 1000001)) .cse2 (< v_main_~y~0_56 v_main_~y~0_55))))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {1471#(<= 500000 main_~y~0)} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:52,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {1471#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1472#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:52,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {1472#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1473#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:52,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {1473#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1474#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:52,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {1474#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1475#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:48:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {1475#(<= 499992 main_~y~0)} assume !(~y~0 > 0); {1467#false} is VALID [2022-04-15 06:48:52,467 INFO L272 TraceCheckUtils]: 15: Hoare triple {1467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1467#false} is VALID [2022-04-15 06:48:52,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2022-04-15 06:48:52,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2022-04-15 06:48:52,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2022-04-15 06:48:52,467 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:52,467 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:52,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2022-04-15 06:48:52,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2022-04-15 06:48:52,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2022-04-15 06:48:52,665 INFO L272 TraceCheckUtils]: 15: Hoare triple {1467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1467#false} is VALID [2022-04-15 06:48:52,665 INFO L290 TraceCheckUtils]: 14: Hoare triple {1546#(< 0 main_~y~0)} assume !(~y~0 > 0); {1467#false} is VALID [2022-04-15 06:48:52,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {1550#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1546#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:52,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {1554#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1550#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:52,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {1558#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1554#(< 4 main_~y~0)} is VALID [2022-04-15 06:48:52,669 INFO L290 TraceCheckUtils]: 10: Hoare triple {1562#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1558#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:52,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {1562#(< 8 main_~y~0)} [71] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1562#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:52,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {1562#(< 8 main_~y~0)} [74] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_25| |v_main_#t~post5_24|)) (.cse1 (= v_main_~y~0_56 v_main_~y~0_55)) (.cse3 (= |v_main_#t~post6_25| |v_main_#t~post6_24|)) (.cse2 (<= 500000 v_main_~x~0_90))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_90 1000000))) (= v_main_~x~0_89 v_main_~x~0_90) .cse3) (and .cse0 .cse1 (= v_main_~x~0_90 v_main_~x~0_89) .cse3) (let ((.cse4 (+ v_main_~x~0_90 v_main_~y~0_55))) (and (= .cse4 (+ v_main_~x~0_89 v_main_~y~0_56)) (< .cse4 (+ v_main_~y~0_56 1000001)) .cse2 (< v_main_~y~0_56 v_main_~y~0_55))))) InVars {main_~y~0=v_main_~y~0_56, main_#t~post5=|v_main_#t~post5_25|, main_~x~0=v_main_~x~0_90, main_#t~post6=|v_main_#t~post6_25|} OutVars{main_~y~0=v_main_~y~0_55, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_89, main_#t~post6=|v_main_#t~post6_24|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1562#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:52,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {1562#(< 8 main_~y~0)} [73] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1562#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:52,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {1562#(< 8 main_~y~0)} [72] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_28| |v_main_#t~post4_27|)) (.cse1 (= v_main_~x~0_88 v_main_~x~0_87))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_88 500000))) (and (< v_main_~x~0_87 500001) (< v_main_~x~0_88 v_main_~x~0_87)))) InVars {main_~x~0=v_main_~x~0_88, main_#t~post4=|v_main_#t~post4_28|} OutVars{main_~x~0=v_main_~x~0_87, main_#t~post4=|v_main_#t~post4_27|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1562#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:52,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {1466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1562#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:52,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret9 := main(); {1466#true} is VALID [2022-04-15 06:48:52,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #52#return; {1466#true} is VALID [2022-04-15 06:48:52,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2022-04-15 06:48:52,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1466#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(17, 2);call #Ultimate.allocInit(12, 3); {1466#true} is VALID [2022-04-15 06:48:52,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1466#true} is VALID [2022-04-15 06:48:52,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:52,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320828030] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:52,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:52,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-15 06:48:52,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:52,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1067369161] [2022-04-15 06:48:52,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1067369161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:52,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:52,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 06:48:52,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369603912] [2022-04-15 06:48:52,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 28 [2022-04-15 06:48:52,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:52,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 06:48:52,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:52,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 06:48:52,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:52,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 06:48:52,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 06:48:52,912 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 06:48:53,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:53,380 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2022-04-15 06:48:53,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 06:48:53,380 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 28 [2022-04-15 06:48:53,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 06:48:53,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2022-04-15 06:48:53,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 06:48:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 56 transitions. [2022-04-15 06:48:53,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 56 transitions. [2022-04-15 06:48:53,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:53,426 INFO L225 Difference]: With dead ends: 59 [2022-04-15 06:48:53,426 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:48:53,427 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=368, Invalid=624, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:48:53,427 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:53,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:48:53,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:48:53,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 34. [2022-04-15 06:48:53,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:53,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 06:48:53,480 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 06:48:53,480 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 06:48:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:53,482 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 06:48:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 06:48:53,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:53,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:53,484 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 44 states. [2022-04-15 06:48:53,484 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 44 states. [2022-04-15 06:48:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:53,486 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-04-15 06:48:53,486 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 06:48:53,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:53,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:53,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:53,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 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 06:48:53,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-04-15 06:48:53,490 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 28 [2022-04-15 06:48:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:53,491 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-04-15 06:48:53,491 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6) internal successors, (24), 14 states have internal predecessors, (24), 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 06:48:53,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 37 transitions. [2022-04-15 06:48:53,530 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 06:48:53,530 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-04-15 06:48:53,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 06:48:53,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:53,531 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:53,554 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 06:48:53,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:53,748 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:53,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:53,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1699044070, now seen corresponding path program 5 times [2022-04-15 06:48:53,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:53,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1010194665] [2022-04-15 06:48:53,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:54,191 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:54,192 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1913865794, now seen corresponding path program 1 times [2022-04-15 06:48:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991534087] [2022-04-15 06:48:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:54,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:54,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1911#(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(17, 2);call #Ultimate.allocInit(12, 3); {1900#true} is VALID [2022-04-15 06:48:54,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1900#true} assume true; {1900#true} is VALID [2022-04-15 06:48:54,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1900#true} {1900#true} #52#return; {1900#true} is VALID [2022-04-15 06:48:54,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:54,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(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(17, 2);call #Ultimate.allocInit(12, 3); {1900#true} is VALID [2022-04-15 06:48:54,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2022-04-15 06:48:54,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #52#return; {1900#true} is VALID [2022-04-15 06:48:54,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret9 := main(); {1900#true} is VALID [2022-04-15 06:48:54,284 INFO L290 TraceCheckUtils]: 5: Hoare triple {1900#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,284 INFO L290 TraceCheckUtils]: 6: Hoare triple {1905#(<= 500000 main_~y~0)} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_114 v_main_~x~0_113)) (.cse1 (= |v_main_#t~post4_34| |v_main_#t~post4_33|))) (or (and (< v_main_~x~0_114 v_main_~x~0_113) (< v_main_~x~0_113 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_114 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_114, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {1905#(<= 500000 main_~y~0)} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {1905#(<= 500000 main_~y~0)} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_116)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= v_main_~x~0_116 v_main_~x~0_115)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|)) (.cse5 (= v_main_~y~0_78 v_main_~y~0_77))) (or (let ((.cse0 (+ v_main_~x~0_116 v_main_~y~0_77))) (and (< v_main_~y~0_78 v_main_~y~0_77) (< .cse0 (+ v_main_~y~0_78 1000001)) (= (+ v_main_~x~0_115 v_main_~y~0_78) .cse0) .cse1)) (and (or (not .cse1) (not (< v_main_~x~0_116 1000000))) .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,286 INFO L290 TraceCheckUtils]: 9: Hoare triple {1905#(<= 500000 main_~y~0)} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {1905#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1906#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:54,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {1906#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1907#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:54,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1908#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:54,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1908#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1909#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:48:54,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1910#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:48:54,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(<= 499990 main_~y~0)} assume !(~y~0 > 0); {1901#false} is VALID [2022-04-15 06:48:54,290 INFO L272 TraceCheckUtils]: 16: Hoare triple {1901#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1901#false} is VALID [2022-04-15 06:48:54,290 INFO L290 TraceCheckUtils]: 17: Hoare triple {1901#false} ~cond := #in~cond; {1901#false} is VALID [2022-04-15 06:48:54,290 INFO L290 TraceCheckUtils]: 18: Hoare triple {1901#false} assume 0 == ~cond; {1901#false} is VALID [2022-04-15 06:48:54,291 INFO L290 TraceCheckUtils]: 19: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2022-04-15 06:48:54,292 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:54,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:54,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991534087] [2022-04-15 06:48:54,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991534087] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:54,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325569022] [2022-04-15 06:48:54,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:54,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:54,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:54,296 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 06:48:54,321 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 06:48:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:54,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:48:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:54,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:54,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1900#true} is VALID [2022-04-15 06:48:54,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {1900#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(17, 2);call #Ultimate.allocInit(12, 3); {1900#true} is VALID [2022-04-15 06:48:54,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2022-04-15 06:48:54,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #52#return; {1900#true} is VALID [2022-04-15 06:48:54,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret9 := main(); {1900#true} is VALID [2022-04-15 06:48:54,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {1900#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {1905#(<= 500000 main_~y~0)} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_114 v_main_~x~0_113)) (.cse1 (= |v_main_#t~post4_34| |v_main_#t~post4_33|))) (or (and (< v_main_~x~0_114 v_main_~x~0_113) (< v_main_~x~0_113 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_114 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_114, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {1905#(<= 500000 main_~y~0)} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {1905#(<= 500000 main_~y~0)} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_116)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= v_main_~x~0_116 v_main_~x~0_115)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|)) (.cse5 (= v_main_~y~0_78 v_main_~y~0_77))) (or (let ((.cse0 (+ v_main_~x~0_116 v_main_~y~0_77))) (and (< v_main_~y~0_78 v_main_~y~0_77) (< .cse0 (+ v_main_~y~0_78 1000001)) (= (+ v_main_~x~0_115 v_main_~y~0_78) .cse0) .cse1)) (and (or (not .cse1) (not (< v_main_~x~0_116 1000000))) .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {1905#(<= 500000 main_~y~0)} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1905#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:54,498 INFO L290 TraceCheckUtils]: 10: Hoare triple {1905#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1906#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:54,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {1906#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1907#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:54,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {1907#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1908#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:54,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {1908#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1909#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:48:54,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {1909#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1910#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:48:54,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {1910#(<= 499990 main_~y~0)} assume !(~y~0 > 0); {1901#false} is VALID [2022-04-15 06:48:54,502 INFO L272 TraceCheckUtils]: 16: Hoare triple {1901#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1901#false} is VALID [2022-04-15 06:48:54,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {1901#false} ~cond := #in~cond; {1901#false} is VALID [2022-04-15 06:48:54,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {1901#false} assume 0 == ~cond; {1901#false} is VALID [2022-04-15 06:48:54,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2022-04-15 06:48:54,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:54,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:54,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {1901#false} assume !false; {1901#false} is VALID [2022-04-15 06:48:54,717 INFO L290 TraceCheckUtils]: 18: Hoare triple {1901#false} assume 0 == ~cond; {1901#false} is VALID [2022-04-15 06:48:54,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {1901#false} ~cond := #in~cond; {1901#false} is VALID [2022-04-15 06:48:54,717 INFO L272 TraceCheckUtils]: 16: Hoare triple {1901#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {1901#false} is VALID [2022-04-15 06:48:54,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1984#(< 0 main_~y~0)} assume !(~y~0 > 0); {1901#false} is VALID [2022-04-15 06:48:54,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1988#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1984#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:54,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {1992#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1988#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:54,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {1996#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1992#(< 4 main_~y~0)} is VALID [2022-04-15 06:48:54,720 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {1996#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:54,720 INFO L290 TraceCheckUtils]: 10: Hoare triple {2004#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2000#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:54,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {2004#(< 10 main_~y~0)} [75] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2004#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:54,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {2004#(< 10 main_~y~0)} [78] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_116)) (.cse2 (= |v_main_#t~post6_32| |v_main_#t~post6_31|)) (.cse3 (= v_main_~x~0_116 v_main_~x~0_115)) (.cse4 (= |v_main_#t~post5_32| |v_main_#t~post5_31|)) (.cse5 (= v_main_~y~0_78 v_main_~y~0_77))) (or (let ((.cse0 (+ v_main_~x~0_116 v_main_~y~0_77))) (and (< v_main_~y~0_78 v_main_~y~0_77) (< .cse0 (+ v_main_~y~0_78 1000001)) (= (+ v_main_~x~0_115 v_main_~y~0_78) .cse0) .cse1)) (and (or (not .cse1) (not (< v_main_~x~0_116 1000000))) .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_78, main_#t~post5=|v_main_#t~post5_32|, main_~x~0=v_main_~x~0_116, main_#t~post6=|v_main_#t~post6_32|} OutVars{main_~y~0=v_main_~y~0_77, main_#t~post5=|v_main_#t~post5_31|, main_~x~0=v_main_~x~0_115, main_#t~post6=|v_main_#t~post6_31|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2004#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:54,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {2004#(< 10 main_~y~0)} [77] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2004#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:54,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {2004#(< 10 main_~y~0)} [76] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_114 v_main_~x~0_113)) (.cse1 (= |v_main_#t~post4_34| |v_main_#t~post4_33|))) (or (and (< v_main_~x~0_114 v_main_~x~0_113) (< v_main_~x~0_113 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_114 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_114, main_#t~post4=|v_main_#t~post4_34|} OutVars{main_~x~0=v_main_~x~0_113, main_#t~post4=|v_main_#t~post4_33|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2004#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:54,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {1900#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2004#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:54,723 INFO L272 TraceCheckUtils]: 4: Hoare triple {1900#true} call #t~ret9 := main(); {1900#true} is VALID [2022-04-15 06:48:54,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1900#true} {1900#true} #52#return; {1900#true} is VALID [2022-04-15 06:48:54,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {1900#true} assume true; {1900#true} is VALID [2022-04-15 06:48:54,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1900#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(17, 2);call #Ultimate.allocInit(12, 3); {1900#true} is VALID [2022-04-15 06:48:54,723 INFO L272 TraceCheckUtils]: 0: Hoare triple {1900#true} call ULTIMATE.init(); {1900#true} is VALID [2022-04-15 06:48:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:54,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325569022] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:54,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:54,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-15 06:48:54,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:54,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1010194665] [2022-04-15 06:48:54,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1010194665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:54,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:54,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 06:48:54,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261403808] [2022-04-15 06:48:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:54,992 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-15 06:48:54,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:54,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 06:48:55,023 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 06:48:55,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 06:48:55,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:55,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 06:48:55,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-15 06:48:55,024 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 06:48:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:55,655 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2022-04-15 06:48:55,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 06:48:55,656 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 33 [2022-04-15 06:48:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 06:48:55,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-15 06:48:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 06:48:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 55 transitions. [2022-04-15 06:48:55,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 55 transitions. [2022-04-15 06:48:55,721 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 06:48:55,722 INFO L225 Difference]: With dead ends: 65 [2022-04-15 06:48:55,722 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 06:48:55,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=531, Invalid=951, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 06:48:55,724 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 39 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:55,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 34 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:48:55,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 06:48:55,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-04-15 06:48:55,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:55,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,787 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,789 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:55,790 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 06:48:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:48:55,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:55,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:55,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,791 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:55,792 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-15 06:48:55,792 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:48:55,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:55,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:55,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:55,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:55,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 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 06:48:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-04-15 06:48:55,794 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 33 [2022-04-15 06:48:55,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:55,794 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-04-15 06:48:55,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 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 06:48:55,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 42 transitions. [2022-04-15 06:48:55,836 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 06:48:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-04-15 06:48:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 06:48:55,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:55,837 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:55,853 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 06:48:56,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:56,043 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:56,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:56,044 INFO L85 PathProgramCache]: Analyzing trace with hash 925460615, now seen corresponding path program 6 times [2022-04-15 06:48:56,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:56,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128351036] [2022-04-15 06:48:56,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:56,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:48:56,461 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:48:56,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1708440479, now seen corresponding path program 1 times [2022-04-15 06:48:56,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:48:56,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661567711] [2022-04-15 06:48:56,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:48:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:48:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {2374#(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(17, 2);call #Ultimate.allocInit(12, 3); {2362#true} is VALID [2022-04-15 06:48:56,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#true} assume true; {2362#true} is VALID [2022-04-15 06:48:56,562 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2362#true} {2362#true} #52#return; {2362#true} is VALID [2022-04-15 06:48:56,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {2362#true} call ULTIMATE.init(); {2374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:48:56,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {2374#(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(17, 2);call #Ultimate.allocInit(12, 3); {2362#true} is VALID [2022-04-15 06:48:56,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {2362#true} assume true; {2362#true} is VALID [2022-04-15 06:48:56,563 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2362#true} {2362#true} #52#return; {2362#true} is VALID [2022-04-15 06:48:56,563 INFO L272 TraceCheckUtils]: 4: Hoare triple {2362#true} call #t~ret9 := main(); {2362#true} is VALID [2022-04-15 06:48:56,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {2362#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2367#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:56,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {2367#(<= 500000 main_~y~0)} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_143 v_main_~x~0_142))) (or (and (< v_main_~x~0_143 v_main_~x~0_142) (< v_main_~x~0_142 500001)) (and (= |v_main_#t~post4_39| |v_main_#t~post4_40|) .cse0 (not (< v_main_~x~0_143 500000))) (and .cse0 (= |v_main_#t~post4_40| |v_main_#t~post4_39|)))) InVars {main_~x~0=v_main_~x~0_143, main_#t~post4=|v_main_#t~post4_40|} OutVars{main_~x~0=v_main_~x~0_142, main_#t~post4=|v_main_#t~post4_39|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2367#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:56,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {2367#(<= 500000 main_~y~0)} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2367#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:56,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {2367#(<= 500000 main_~y~0)} [82] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_145)) (.cse0 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse1 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and .cse0 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse1 (= v_main_~y~0_104 v_main_~y~0_103)) (let ((.cse2 (+ v_main_~x~0_145 v_main_~y~0_103))) (and (< v_main_~y~0_104 v_main_~y~0_103) (= .cse2 (+ v_main_~x~0_144 v_main_~y~0_104)) .cse3 (< .cse2 (+ v_main_~y~0_104 1000001)))) (and (or (not .cse3) (not (< v_main_~x~0_145 1000000))) (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 (= v_main_~y~0_103 v_main_~y~0_104)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2367#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:56,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {2367#(<= 500000 main_~y~0)} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2367#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:48:56,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {2367#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2368#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:48:56,566 INFO L290 TraceCheckUtils]: 11: Hoare triple {2368#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2369#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:48:56,567 INFO L290 TraceCheckUtils]: 12: Hoare triple {2369#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2370#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:48:56,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {2370#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2371#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:48:56,568 INFO L290 TraceCheckUtils]: 14: Hoare triple {2371#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2372#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:48:56,568 INFO L290 TraceCheckUtils]: 15: Hoare triple {2372#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2373#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:48:56,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {2373#(<= 499988 main_~y~0)} assume !(~y~0 > 0); {2363#false} is VALID [2022-04-15 06:48:56,569 INFO L272 TraceCheckUtils]: 17: Hoare triple {2363#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2363#false} is VALID [2022-04-15 06:48:56,569 INFO L290 TraceCheckUtils]: 18: Hoare triple {2363#false} ~cond := #in~cond; {2363#false} is VALID [2022-04-15 06:48:56,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#false} assume 0 == ~cond; {2363#false} is VALID [2022-04-15 06:48:56,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {2363#false} assume !false; {2363#false} is VALID [2022-04-15 06:48:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:48:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:48:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661567711] [2022-04-15 06:48:56,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661567711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:48:56,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228332585] [2022-04-15 06:48:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:48:56,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:56,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:48:56,571 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 06:48:56,572 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 06:48:56,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 06:48:56,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:48:56,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:48:57,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {2362#true} call ULTIMATE.init(); {2362#true} is VALID [2022-04-15 06:48:57,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#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(17, 2);call #Ultimate.allocInit(12, 3); {2362#true} is VALID [2022-04-15 06:48:57,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {2362#true} assume true; {2362#true} is VALID [2022-04-15 06:48:57,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2362#true} {2362#true} #52#return; {2362#true} is VALID [2022-04-15 06:48:57,022 INFO L272 TraceCheckUtils]: 4: Hoare triple {2362#true} call #t~ret9 := main(); {2362#true} is VALID [2022-04-15 06:48:57,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {2362#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2393#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:48:57,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {2393#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_143 v_main_~x~0_142))) (or (and (< v_main_~x~0_143 v_main_~x~0_142) (< v_main_~x~0_142 500001)) (and (= |v_main_#t~post4_39| |v_main_#t~post4_40|) .cse0 (not (< v_main_~x~0_143 500000))) (and .cse0 (= |v_main_#t~post4_40| |v_main_#t~post4_39|)))) InVars {main_~x~0=v_main_~x~0_143, main_#t~post4=|v_main_#t~post4_40|} OutVars{main_~x~0=v_main_~x~0_142, main_#t~post4=|v_main_#t~post4_39|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2397#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:48:57,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {2397#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2397#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:48:57,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {2397#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [82] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_145)) (.cse0 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse1 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and .cse0 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse1 (= v_main_~y~0_104 v_main_~y~0_103)) (let ((.cse2 (+ v_main_~x~0_145 v_main_~y~0_103))) (and (< v_main_~y~0_104 v_main_~y~0_103) (= .cse2 (+ v_main_~x~0_144 v_main_~y~0_104)) .cse3 (< .cse2 (+ v_main_~y~0_104 1000001)))) (and (or (not .cse3) (not (< v_main_~x~0_145 1000000))) (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 (= v_main_~y~0_103 v_main_~y~0_104)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2404#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:48:57,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {2404#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2408#(< 999999 main_~y~0)} is VALID [2022-04-15 06:48:57,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {2408#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2412#(< 999997 main_~y~0)} is VALID [2022-04-15 06:48:57,028 INFO L290 TraceCheckUtils]: 11: Hoare triple {2412#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2416#(< 999995 main_~y~0)} is VALID [2022-04-15 06:48:57,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {2416#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2420#(< 999993 main_~y~0)} is VALID [2022-04-15 06:48:57,029 INFO L290 TraceCheckUtils]: 13: Hoare triple {2420#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2424#(< 999991 main_~y~0)} is VALID [2022-04-15 06:48:57,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {2424#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2428#(< 999989 main_~y~0)} is VALID [2022-04-15 06:48:57,030 INFO L290 TraceCheckUtils]: 15: Hoare triple {2428#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2432#(< 999987 main_~y~0)} is VALID [2022-04-15 06:48:57,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {2432#(< 999987 main_~y~0)} assume !(~y~0 > 0); {2363#false} is VALID [2022-04-15 06:48:57,031 INFO L272 TraceCheckUtils]: 17: Hoare triple {2363#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2363#false} is VALID [2022-04-15 06:48:57,031 INFO L290 TraceCheckUtils]: 18: Hoare triple {2363#false} ~cond := #in~cond; {2363#false} is VALID [2022-04-15 06:48:57,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#false} assume 0 == ~cond; {2363#false} is VALID [2022-04-15 06:48:57,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {2363#false} assume !false; {2363#false} is VALID [2022-04-15 06:48:57,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:57,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:48:57,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {2363#false} assume !false; {2363#false} is VALID [2022-04-15 06:48:57,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {2363#false} assume 0 == ~cond; {2363#false} is VALID [2022-04-15 06:48:57,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {2363#false} ~cond := #in~cond; {2363#false} is VALID [2022-04-15 06:48:57,585 INFO L272 TraceCheckUtils]: 17: Hoare triple {2363#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2363#false} is VALID [2022-04-15 06:48:57,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {2460#(< 0 main_~y~0)} assume !(~y~0 > 0); {2363#false} is VALID [2022-04-15 06:48:57,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {2464#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2460#(< 0 main_~y~0)} is VALID [2022-04-15 06:48:57,594 INFO L290 TraceCheckUtils]: 14: Hoare triple {2468#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2464#(< 2 main_~y~0)} is VALID [2022-04-15 06:48:57,594 INFO L290 TraceCheckUtils]: 13: Hoare triple {2472#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2468#(< 4 main_~y~0)} is VALID [2022-04-15 06:48:57,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {2476#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2472#(< 6 main_~y~0)} is VALID [2022-04-15 06:48:57,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {2480#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2476#(< 8 main_~y~0)} is VALID [2022-04-15 06:48:57,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {2484#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2480#(< 10 main_~y~0)} is VALID [2022-04-15 06:48:57,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {2488#(or (< main_~x~0 1000000) (< 12 main_~y~0))} [79] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2484#(< 12 main_~y~0)} is VALID [2022-04-15 06:48:57,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {2492#(and (or (< main_~x~0 1000000) (< 12 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} [82] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_145)) (.cse0 (= |v_main_#t~post6_39| |v_main_#t~post6_38|)) (.cse1 (= v_main_~x~0_145 v_main_~x~0_144))) (or (and .cse0 (= |v_main_#t~post5_39| |v_main_#t~post5_38|) .cse1 (= v_main_~y~0_104 v_main_~y~0_103)) (let ((.cse2 (+ v_main_~x~0_145 v_main_~y~0_103))) (and (< v_main_~y~0_104 v_main_~y~0_103) (= .cse2 (+ v_main_~x~0_144 v_main_~y~0_104)) .cse3 (< .cse2 (+ v_main_~y~0_104 1000001)))) (and (or (not .cse3) (not (< v_main_~x~0_145 1000000))) (= |v_main_#t~post5_38| |v_main_#t~post5_39|) .cse0 .cse1 (= v_main_~y~0_103 v_main_~y~0_104)))) InVars {main_~y~0=v_main_~y~0_104, main_#t~post5=|v_main_#t~post5_39|, main_~x~0=v_main_~x~0_145, main_#t~post6=|v_main_#t~post6_39|} OutVars{main_~y~0=v_main_~y~0_103, main_#t~post5=|v_main_#t~post5_38|, main_~x~0=v_main_~x~0_144, main_#t~post6=|v_main_#t~post6_38|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2488#(or (< main_~x~0 1000000) (< 12 main_~y~0))} is VALID [2022-04-15 06:48:57,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {2492#(and (or (< main_~x~0 1000000) (< 12 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} [81] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2492#(and (or (< main_~x~0 1000000) (< 12 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} is VALID [2022-04-15 06:48:57,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {2499#(and (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 12 main_~y~0)) (<= 0 (+ main_~y~0 499987)))} [80] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_143 v_main_~x~0_142))) (or (and (< v_main_~x~0_143 v_main_~x~0_142) (< v_main_~x~0_142 500001)) (and (= |v_main_#t~post4_39| |v_main_#t~post4_40|) .cse0 (not (< v_main_~x~0_143 500000))) (and .cse0 (= |v_main_#t~post4_40| |v_main_#t~post4_39|)))) InVars {main_~x~0=v_main_~x~0_143, main_#t~post4=|v_main_#t~post4_40|} OutVars{main_~x~0=v_main_~x~0_142, main_#t~post4=|v_main_#t~post4_39|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2492#(and (or (< main_~x~0 1000000) (< 12 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} is VALID [2022-04-15 06:48:57,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {2362#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2499#(and (or (< main_~x~0 (+ main_~y~0 999988)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 12 main_~y~0)) (<= 0 (+ main_~y~0 499987)))} is VALID [2022-04-15 06:48:57,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {2362#true} call #t~ret9 := main(); {2362#true} is VALID [2022-04-15 06:48:57,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2362#true} {2362#true} #52#return; {2362#true} is VALID [2022-04-15 06:48:57,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {2362#true} assume true; {2362#true} is VALID [2022-04-15 06:48:57,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2362#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(17, 2);call #Ultimate.allocInit(12, 3); {2362#true} is VALID [2022-04-15 06:48:57,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {2362#true} call ULTIMATE.init(); {2362#true} is VALID [2022-04-15 06:48:57,601 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:48:57,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228332585] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:48:57,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:48:57,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 12] total 30 [2022-04-15 06:48:57,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:48:57,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128351036] [2022-04-15 06:48:57,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128351036] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:48:57,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:48:57,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 06:48:57,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072680048] [2022-04-15 06:48:57,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:48:57,941 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:57,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:48:57,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:57,968 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 06:48:57,969 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 06:48:57,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 06:48:57,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=981, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 06:48:57,970 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:58,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:58,887 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2022-04-15 06:48:58,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 06:48:58,887 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:58,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:48:58,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 06:48:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 06:48:58,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-15 06:48:58,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:48:58,944 INFO L225 Difference]: With dead ends: 75 [2022-04-15 06:48:58,944 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 06:48:58,945 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1057, Invalid=2249, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:48:58,945 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:48:58,946 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 24 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 06:48:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 06:48:58,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-04-15 06:48:59,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:48:59,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 06:48:59,001 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 06:48:59,001 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 06:48:59,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:59,002 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-15 06:48:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 06:48:59,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:59,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:59,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 44 states. [2022-04-15 06:48:59,003 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 44 states. [2022-04-15 06:48:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:48:59,004 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2022-04-15 06:48:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 06:48:59,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:48:59,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:48:59,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:48:59,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:48:59,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 39 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 06:48:59,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-04-15 06:48:59,006 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 38 [2022-04-15 06:48:59,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:48:59,006 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-04-15 06:48:59,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.619047619047619) internal successors, (34), 20 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 06:48:59,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 47 transitions. [2022-04-15 06:48:59,059 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 06:48:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-04-15 06:48:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 06:48:59,060 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:48:59,060 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:48:59,076 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 06:48:59,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:48:59,263 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:48:59,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:48:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash 897664690, now seen corresponding path program 7 times [2022-04-15 06:48:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:48:59,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280591258] [2022-04-15 06:49:03,328 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:03,374 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:03,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:03,708 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:03,711 INFO L85 PathProgramCache]: Analyzing trace with hash -594285534, now seen corresponding path program 1 times [2022-04-15 06:49:03,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:03,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004986683] [2022-04-15 06:49:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:03,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:03,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:03,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {2905#(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(17, 2);call #Ultimate.allocInit(12, 3); {2892#true} is VALID [2022-04-15 06:49:03,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-04-15 06:49:03,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2892#true} {2892#true} #52#return; {2892#true} is VALID [2022-04-15 06:49:03,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2892#true} call ULTIMATE.init(); {2905#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:03,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2905#(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(17, 2);call #Ultimate.allocInit(12, 3); {2892#true} is VALID [2022-04-15 06:49:03,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-04-15 06:49:03,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2892#true} {2892#true} #52#return; {2892#true} is VALID [2022-04-15 06:49:03,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {2892#true} call #t~ret9 := main(); {2892#true} is VALID [2022-04-15 06:49:03,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {2892#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:03,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {2897#(<= 500000 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_176 v_main_~x~0_175)) (.cse1 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_175 500001) (< v_main_~x~0_176 v_main_~x~0_175)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_176)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_176, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:03,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#(<= 500000 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:03,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {2897#(<= 500000 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (<= 500000 v_main_~x~0_178)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_178 v_main_~y~0_133))) (and .cse4 (= (+ v_main_~x~0_177 v_main_~y~0_134) .cse5) (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_178 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:03,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#(<= 500000 main_~y~0)} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:03,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2898#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:03,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {2898#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2899#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:03,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2900#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:03,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2901#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:03,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {2901#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2902#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:03,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {2902#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2903#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:03,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {2903#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2904#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:03,839 INFO L290 TraceCheckUtils]: 17: Hoare triple {2904#(<= 499986 main_~y~0)} assume !(~y~0 > 0); {2893#false} is VALID [2022-04-15 06:49:03,839 INFO L272 TraceCheckUtils]: 18: Hoare triple {2893#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2893#false} is VALID [2022-04-15 06:49:03,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {2893#false} ~cond := #in~cond; {2893#false} is VALID [2022-04-15 06:49:03,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#false} assume 0 == ~cond; {2893#false} is VALID [2022-04-15 06:49:03,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#false} assume !false; {2893#false} is VALID [2022-04-15 06:49:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:03,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004986683] [2022-04-15 06:49:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004986683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421016570] [2022-04-15 06:49:03,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:03,842 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 06:49:03,843 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 06:49:03,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:03,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 06:49:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:03,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:04,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {2892#true} call ULTIMATE.init(); {2892#true} is VALID [2022-04-15 06:49:04,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2892#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(17, 2);call #Ultimate.allocInit(12, 3); {2892#true} is VALID [2022-04-15 06:49:04,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-04-15 06:49:04,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2892#true} {2892#true} #52#return; {2892#true} is VALID [2022-04-15 06:49:04,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {2892#true} call #t~ret9 := main(); {2892#true} is VALID [2022-04-15 06:49:04,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {2892#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:04,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2897#(<= 500000 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_176 v_main_~x~0_175)) (.cse1 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_175 500001) (< v_main_~x~0_176 v_main_~x~0_175)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_176)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_176, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:04,081 INFO L290 TraceCheckUtils]: 7: Hoare triple {2897#(<= 500000 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:04,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2897#(<= 500000 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (<= 500000 v_main_~x~0_178)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_178 v_main_~y~0_133))) (and .cse4 (= (+ v_main_~x~0_177 v_main_~y~0_134) .cse5) (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_178 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:04,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2897#(<= 500000 main_~y~0)} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2897#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:04,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {2897#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2898#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:04,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {2898#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2899#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:04,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2899#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2900#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:04,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2900#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2901#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:04,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {2901#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2902#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:04,086 INFO L290 TraceCheckUtils]: 15: Hoare triple {2902#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2903#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:04,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {2903#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2904#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:04,087 INFO L290 TraceCheckUtils]: 17: Hoare triple {2904#(<= 499986 main_~y~0)} assume !(~y~0 > 0); {2893#false} is VALID [2022-04-15 06:49:04,087 INFO L272 TraceCheckUtils]: 18: Hoare triple {2893#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2893#false} is VALID [2022-04-15 06:49:04,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {2893#false} ~cond := #in~cond; {2893#false} is VALID [2022-04-15 06:49:04,088 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#false} assume 0 == ~cond; {2893#false} is VALID [2022-04-15 06:49:04,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#false} assume !false; {2893#false} is VALID [2022-04-15 06:49:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:04,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:04,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {2893#false} assume !false; {2893#false} is VALID [2022-04-15 06:49:04,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {2893#false} assume 0 == ~cond; {2893#false} is VALID [2022-04-15 06:49:04,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {2893#false} ~cond := #in~cond; {2893#false} is VALID [2022-04-15 06:49:04,333 INFO L272 TraceCheckUtils]: 18: Hoare triple {2893#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {2893#false} is VALID [2022-04-15 06:49:04,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {2984#(< 0 main_~y~0)} assume !(~y~0 > 0); {2893#false} is VALID [2022-04-15 06:49:04,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {2988#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2984#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:04,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {2992#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2988#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:04,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {2996#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2992#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:04,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {3000#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {2996#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:04,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {3004#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3000#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:04,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {3008#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3004#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:04,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {3012#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3008#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:04,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#(< 14 main_~y~0)} [83] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3012#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:04,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {3012#(< 14 main_~y~0)} [86] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_178 v_main_~x~0_177)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (<= 500000 v_main_~x~0_178)) (.cse3 (= |v_main_#t~post6_46| |v_main_#t~post6_45|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_178 v_main_~y~0_133))) (and .cse4 (= (+ v_main_~x~0_177 v_main_~y~0_134) .cse5) (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_178 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_178, main_#t~post6=|v_main_#t~post6_46|} OutVars{main_~y~0=v_main_~y~0_133, main_#t~post5=|v_main_#t~post5_45|, main_~x~0=v_main_~x~0_177, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3012#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:04,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {3012#(< 14 main_~y~0)} [85] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3012#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:04,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {3012#(< 14 main_~y~0)} [84] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_176 v_main_~x~0_175)) (.cse1 (= |v_main_#t~post4_47| |v_main_#t~post4_46|))) (or (and (< v_main_~x~0_175 500001) (< v_main_~x~0_176 v_main_~x~0_175)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_176)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_176, main_#t~post4=|v_main_#t~post4_47|} OutVars{main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3012#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:04,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {2892#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3012#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:04,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {2892#true} call #t~ret9 := main(); {2892#true} is VALID [2022-04-15 06:49:04,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2892#true} {2892#true} #52#return; {2892#true} is VALID [2022-04-15 06:49:04,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {2892#true} assume true; {2892#true} is VALID [2022-04-15 06:49:04,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {2892#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(17, 2);call #Ultimate.allocInit(12, 3); {2892#true} is VALID [2022-04-15 06:49:04,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {2892#true} call ULTIMATE.init(); {2892#true} is VALID [2022-04-15 06:49:04,339 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:04,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421016570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:04,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:04,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-15 06:49:04,676 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:04,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280591258] [2022-04-15 06:49:04,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280591258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:04,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:04,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 06:49:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931989867] [2022-04-15 06:49:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:04,677 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 43 [2022-04-15 06:49:04,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:04,678 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 06:49:04,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 06:49:04,725 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 06:49:04,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:04,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 06:49:04,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=591, Unknown=0, NotChecked=0, Total=992 [2022-04-15 06:49:04,727 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 06:49:05,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:05,744 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-04-15 06:49:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 06:49:05,745 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 43 [2022-04-15 06:49:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 06:49:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 06:49:05,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 06:49:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 65 transitions. [2022-04-15 06:49:05,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 65 transitions. [2022-04-15 06:49:05,805 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 06:49:05,806 INFO L225 Difference]: With dead ends: 85 [2022-04-15 06:49:05,806 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 06:49:05,807 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=941, Invalid=1815, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 06:49:05,807 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 65 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:05,808 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 34 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:49:05,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 06:49:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-04-15 06:49:05,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:05,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 06:49:05,885 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 06:49:05,885 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 06:49:05,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:05,886 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-15 06:49:05,886 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:49:05,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:05,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:05,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 49 states. [2022-04-15 06:49:05,887 INFO L87 Difference]: Start difference. First operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 49 states. [2022-04-15 06:49:05,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:05,888 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-04-15 06:49:05,888 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:49:05,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:05,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:05,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:05,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.0909090909090908) internal successors, (48), 44 states have internal predecessors, (48), 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 06:49:05,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-04-15 06:49:05,890 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 43 [2022-04-15 06:49:05,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:05,890 INFO L478 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-04-15 06:49:05,890 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 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 06:49:05,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 52 transitions. [2022-04-15 06:49:05,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-04-15 06:49:05,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-15 06:49:05,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:05,934 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:05,950 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 06:49:06,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:06,139 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:06,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:06,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1296637509, now seen corresponding path program 8 times [2022-04-15 06:49:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:06,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2031207387] [2022-04-15 06:49:06,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:06,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:06,476 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:06,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1876662913, now seen corresponding path program 1 times [2022-04-15 06:49:06,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:06,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368919676] [2022-04-15 06:49:06,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:06,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:06,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:06,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {3480#(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(17, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-15 06:49:06,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-15 06:49:06,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3466#true} {3466#true} #52#return; {3466#true} is VALID [2022-04-15 06:49:06,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {3466#true} call ULTIMATE.init(); {3480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:06,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {3480#(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(17, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-15 06:49:06,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-15 06:49:06,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3466#true} {3466#true} #52#return; {3466#true} is VALID [2022-04-15 06:49:06,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {3466#true} call #t~ret9 := main(); {3466#true} is VALID [2022-04-15 06:49:06,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {3466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:06,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {3471#(<= 500000 main_~y~0)} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 (<= 500000 v_main_~x~0_211) .cse1) (and (< v_main_~x~0_210 500001) (< v_main_~x~0_211 v_main_~x~0_210)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_211, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:06,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {3471#(<= 500000 main_~y~0)} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:06,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {3471#(<= 500000 main_~y~0)} [90] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_213)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse4 (= v_main_~y~0_168 v_main_~y~0_167))) (or (and (= (+ v_main_~x~0_213 v_main_~y~0_167) (+ v_main_~x~0_212 v_main_~y~0_168)) (< v_main_~x~0_213 v_main_~x~0_212) .cse0 (< v_main_~x~0_212 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_213 1000000))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_168, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:06,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {3471#(<= 500000 main_~y~0)} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3471#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:06,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {3471#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3472#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:06,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {3472#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3473#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:06,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {3473#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3474#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:06,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {3474#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3475#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:06,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {3475#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3476#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:06,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {3476#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3477#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:06,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {3477#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3478#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:06,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {3478#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3479#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:06,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {3479#(<= 499984 main_~y~0)} assume !(~y~0 > 0); {3467#false} is VALID [2022-04-15 06:49:06,613 INFO L272 TraceCheckUtils]: 19: Hoare triple {3467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3467#false} is VALID [2022-04-15 06:49:06,613 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#false} ~cond := #in~cond; {3467#false} is VALID [2022-04-15 06:49:06,613 INFO L290 TraceCheckUtils]: 21: Hoare triple {3467#false} assume 0 == ~cond; {3467#false} is VALID [2022-04-15 06:49:06,613 INFO L290 TraceCheckUtils]: 22: Hoare triple {3467#false} assume !false; {3467#false} is VALID [2022-04-15 06:49:06,613 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:06,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:06,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368919676] [2022-04-15 06:49:06,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368919676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:06,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665394577] [2022-04-15 06:49:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:06,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:06,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:06,616 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 06:49:06,625 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 06:49:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:06,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:49:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:06,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:07,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {3466#true} call ULTIMATE.init(); {3466#true} is VALID [2022-04-15 06:49:07,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {3466#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(17, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-15 06:49:07,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-15 06:49:07,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3466#true} {3466#true} #52#return; {3466#true} is VALID [2022-04-15 06:49:07,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {3466#true} call #t~ret9 := main(); {3466#true} is VALID [2022-04-15 06:49:07,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {3466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3499#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:49:07,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {3499#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 (<= 500000 v_main_~x~0_211) .cse1) (and (< v_main_~x~0_210 500001) (< v_main_~x~0_211 v_main_~x~0_210)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_211, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3503#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:07,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {3503#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3503#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:07,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {3503#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [90] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_213)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse4 (= v_main_~y~0_168 v_main_~y~0_167))) (or (and (= (+ v_main_~x~0_213 v_main_~y~0_167) (+ v_main_~x~0_212 v_main_~y~0_168)) (< v_main_~x~0_213 v_main_~x~0_212) .cse0 (< v_main_~x~0_212 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_213 1000000))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_168, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3510#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:49:07,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3514#(< 999999 main_~y~0)} is VALID [2022-04-15 06:49:07,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {3514#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3518#(< 999997 main_~y~0)} is VALID [2022-04-15 06:49:07,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {3518#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3522#(< 999995 main_~y~0)} is VALID [2022-04-15 06:49:07,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {3522#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3526#(< 999993 main_~y~0)} is VALID [2022-04-15 06:49:07,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {3526#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3530#(< 999991 main_~y~0)} is VALID [2022-04-15 06:49:07,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {3530#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3534#(< 999989 main_~y~0)} is VALID [2022-04-15 06:49:07,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {3534#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3538#(< 999987 main_~y~0)} is VALID [2022-04-15 06:49:07,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {3538#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3542#(< 999985 main_~y~0)} is VALID [2022-04-15 06:49:07,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3546#(< 999983 main_~y~0)} is VALID [2022-04-15 06:49:07,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {3546#(< 999983 main_~y~0)} assume !(~y~0 > 0); {3467#false} is VALID [2022-04-15 06:49:07,095 INFO L272 TraceCheckUtils]: 19: Hoare triple {3467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3467#false} is VALID [2022-04-15 06:49:07,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#false} ~cond := #in~cond; {3467#false} is VALID [2022-04-15 06:49:07,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {3467#false} assume 0 == ~cond; {3467#false} is VALID [2022-04-15 06:49:07,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {3467#false} assume !false; {3467#false} is VALID [2022-04-15 06:49:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:07,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:07,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {3467#false} assume !false; {3467#false} is VALID [2022-04-15 06:49:07,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {3467#false} assume 0 == ~cond; {3467#false} is VALID [2022-04-15 06:49:07,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {3467#false} ~cond := #in~cond; {3467#false} is VALID [2022-04-15 06:49:07,659 INFO L272 TraceCheckUtils]: 19: Hoare triple {3467#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {3467#false} is VALID [2022-04-15 06:49:07,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {3574#(< 0 main_~y~0)} assume !(~y~0 > 0); {3467#false} is VALID [2022-04-15 06:49:07,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {3578#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3574#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:07,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {3582#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3578#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:07,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {3586#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3582#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:07,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {3590#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3586#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:07,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {3594#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3590#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:07,663 INFO L290 TraceCheckUtils]: 12: Hoare triple {3598#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3594#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:07,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {3602#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3598#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:07,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {3606#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {3602#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:07,664 INFO L290 TraceCheckUtils]: 9: Hoare triple {3610#(or (< main_~x~0 1000000) (< 16 main_~y~0))} [87] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3606#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:07,665 INFO L290 TraceCheckUtils]: 8: Hoare triple {3614#(and (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} [90] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_213)) (.cse1 (= v_main_~x~0_213 v_main_~x~0_212)) (.cse2 (= |v_main_#t~post5_53| |v_main_#t~post5_52|)) (.cse3 (= |v_main_#t~post6_53| |v_main_#t~post6_52|)) (.cse4 (= v_main_~y~0_168 v_main_~y~0_167))) (or (and (= (+ v_main_~x~0_213 v_main_~y~0_167) (+ v_main_~x~0_212 v_main_~y~0_168)) (< v_main_~x~0_213 v_main_~x~0_212) .cse0 (< v_main_~x~0_212 1000001)) (and .cse1 .cse2 (or (not .cse0) (not (< v_main_~x~0_213 1000000))) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_168, main_#t~post5=|v_main_#t~post5_53|, main_~x~0=v_main_~x~0_213, main_#t~post6=|v_main_#t~post6_53|} OutVars{main_~y~0=v_main_~y~0_167, main_#t~post5=|v_main_#t~post5_52|, main_~x~0=v_main_~x~0_212, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3610#(or (< main_~x~0 1000000) (< 16 main_~y~0))} is VALID [2022-04-15 06:49:07,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {3614#(and (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} [89] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3614#(and (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} is VALID [2022-04-15 06:49:07,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {3621#(and (<= 0 (+ 499983 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} [88] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_211 v_main_~x~0_210)) (.cse1 (= |v_main_#t~post4_53| |v_main_#t~post4_52|))) (or (and .cse0 (<= 500000 v_main_~x~0_211) .cse1) (and (< v_main_~x~0_210 500001) (< v_main_~x~0_211 v_main_~x~0_210)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_211, main_#t~post4=|v_main_#t~post4_53|} OutVars{main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3614#(and (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} is VALID [2022-04-15 06:49:07,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {3466#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3621#(and (<= 0 (+ 499983 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999984)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 16 main_~y~0)))} is VALID [2022-04-15 06:49:07,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {3466#true} call #t~ret9 := main(); {3466#true} is VALID [2022-04-15 06:49:07,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3466#true} {3466#true} #52#return; {3466#true} is VALID [2022-04-15 06:49:07,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {3466#true} assume true; {3466#true} is VALID [2022-04-15 06:49:07,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {3466#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(17, 2);call #Ultimate.allocInit(12, 3); {3466#true} is VALID [2022-04-15 06:49:07,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {3466#true} call ULTIMATE.init(); {3466#true} is VALID [2022-04-15 06:49:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665394577] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:07,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2022-04-15 06:49:08,113 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:08,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2031207387] [2022-04-15 06:49:08,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2031207387] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:08,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:08,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 06:49:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926339902] [2022-04-15 06:49:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:08,126 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 48 [2022-04-15 06:49:08,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:08,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 06:49:08,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:08,161 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 06:49:08,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:08,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 06:49:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=1554, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 06:49:08,162 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 06:49:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,432 INFO L93 Difference]: Finished difference Result 95 states and 106 transitions. [2022-04-15 06:49:09,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 06:49:09,432 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 48 [2022-04-15 06:49:09,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:09,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 06:49:09,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2022-04-15 06:49:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 06:49:09,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 70 transitions. [2022-04-15 06:49:09,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 70 transitions. [2022-04-15 06:49:09,496 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 06:49:09,497 INFO L225 Difference]: With dead ends: 95 [2022-04-15 06:49:09,497 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 06:49:09,499 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1834 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1664, Invalid=3738, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 06:49:09,499 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:09,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 34 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 06:49:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 06:49:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-15 06:49:09,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:09,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 06:49:09,570 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 06:49:09,570 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 06:49:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,572 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 06:49:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 06:49:09,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:09,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:09,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 54 states. [2022-04-15 06:49:09,572 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 54 states. [2022-04-15 06:49:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:09,573 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-04-15 06:49:09,574 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 06:49:09,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:09,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:09,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:09,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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 06:49:09,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2022-04-15 06:49:09,575 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 48 [2022-04-15 06:49:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:09,575 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2022-04-15 06:49:09,576 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 26 states have internal predecessors, (44), 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 06:49:09,576 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 57 transitions. [2022-04-15 06:49:09,623 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 06:49:09,623 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2022-04-15 06:49:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 06:49:09,624 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:09,624 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:09,640 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 06:49:09,824 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,SelfDestructingSolverStorable10 [2022-04-15 06:49:09,825 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:09,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:09,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1149355906, now seen corresponding path program 9 times [2022-04-15 06:49:09,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:09,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [378264894] [2022-04-15 06:49:09,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:10,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:10,188 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:10,190 INFO L85 PathProgramCache]: Analyzing trace with hash -799401470, now seen corresponding path program 1 times [2022-04-15 06:49:10,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:10,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409125613] [2022-04-15 06:49:10,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:10,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:10,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {4128#(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(17, 2);call #Ultimate.allocInit(12, 3); {4110#true} is VALID [2022-04-15 06:49:10,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {4110#true} assume true; {4110#true} is VALID [2022-04-15 06:49:10,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4110#true} {4110#true} #52#return; {4110#true} is VALID [2022-04-15 06:49:10,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4110#true} call ULTIMATE.init(); {4128#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:10,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4128#(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(17, 2);call #Ultimate.allocInit(12, 3); {4110#true} is VALID [2022-04-15 06:49:10,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4110#true} assume true; {4110#true} is VALID [2022-04-15 06:49:10,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4110#true} {4110#true} #52#return; {4110#true} is VALID [2022-04-15 06:49:10,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {4110#true} call #t~ret9 := main(); {4110#true} is VALID [2022-04-15 06:49:10,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {4110#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4115#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:49:10,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {4115#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_60| |v_main_#t~post4_59|))) (or (and (< v_main_~x~0_250 v_main_~x~0_249) (< v_main_~x~0_249 500001)) (and (= v_main_~x~0_249 v_main_~x~0_250) (not (< v_main_~x~0_250 500000)) .cse0) (and (= v_main_~x~0_250 v_main_~x~0_249) .cse0))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post4=|v_main_#t~post4_60|} OutVars{main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4116#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:10,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4116#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4116#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:10,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {4116#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_252)) (.cse1 (= v_main_~x~0_252 v_main_~x~0_251)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_252 v_main_~x~0_251) (< v_main_~x~0_251 1000001) .cse0 (= (+ v_main_~x~0_252 v_main_~y~0_205) (+ v_main_~x~0_251 v_main_~y~0_206))) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .cse3) (and (or (not .cse0) (not (< v_main_~x~0_252 1000000))) .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4117#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:10,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4117#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4118#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:10,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {4118#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4119#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:10,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {4119#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4120#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:10,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {4120#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4121#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:10,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {4121#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4122#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:10,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {4122#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4123#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:10,386 INFO L290 TraceCheckUtils]: 15: Hoare triple {4123#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4124#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:10,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {4124#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4125#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:10,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {4125#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4126#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:10,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {4126#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4127#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:10,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {4127#(<= 499982 main_~y~0)} assume !(~y~0 > 0); {4111#false} is VALID [2022-04-15 06:49:10,389 INFO L272 TraceCheckUtils]: 20: Hoare triple {4111#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4111#false} is VALID [2022-04-15 06:49:10,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {4111#false} ~cond := #in~cond; {4111#false} is VALID [2022-04-15 06:49:10,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {4111#false} assume 0 == ~cond; {4111#false} is VALID [2022-04-15 06:49:10,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {4111#false} assume !false; {4111#false} is VALID [2022-04-15 06:49:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:10,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409125613] [2022-04-15 06:49:10,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409125613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:10,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225220818] [2022-04-15 06:49:10,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:10,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:10,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:10,391 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 06:49:10,414 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 06:49:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:10,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:49:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:10,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:10,881 INFO L272 TraceCheckUtils]: 0: Hoare triple {4110#true} call ULTIMATE.init(); {4110#true} is VALID [2022-04-15 06:49:10,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4110#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(17, 2);call #Ultimate.allocInit(12, 3); {4110#true} is VALID [2022-04-15 06:49:10,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4110#true} assume true; {4110#true} is VALID [2022-04-15 06:49:10,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4110#true} {4110#true} #52#return; {4110#true} is VALID [2022-04-15 06:49:10,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {4110#true} call #t~ret9 := main(); {4110#true} is VALID [2022-04-15 06:49:10,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4110#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4147#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:49:10,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {4147#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_60| |v_main_#t~post4_59|))) (or (and (< v_main_~x~0_250 v_main_~x~0_249) (< v_main_~x~0_249 500001)) (and (= v_main_~x~0_249 v_main_~x~0_250) (not (< v_main_~x~0_250 500000)) .cse0) (and (= v_main_~x~0_250 v_main_~x~0_249) .cse0))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post4=|v_main_#t~post4_60|} OutVars{main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4151#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:10,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {4151#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4151#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:10,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {4151#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_252)) (.cse1 (= v_main_~x~0_252 v_main_~x~0_251)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_252 v_main_~x~0_251) (< v_main_~x~0_251 1000001) .cse0 (= (+ v_main_~x~0_252 v_main_~y~0_205) (+ v_main_~x~0_251 v_main_~y~0_206))) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .cse3) (and (or (not .cse0) (not (< v_main_~x~0_252 1000000))) .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4158#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:49:10,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {4158#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4162#(< 999999 main_~y~0)} is VALID [2022-04-15 06:49:10,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {4162#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4166#(< 999997 main_~y~0)} is VALID [2022-04-15 06:49:10,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {4166#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4170#(< 999995 main_~y~0)} is VALID [2022-04-15 06:49:10,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {4170#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4174#(< 999993 main_~y~0)} is VALID [2022-04-15 06:49:10,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {4174#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4178#(< 999991 main_~y~0)} is VALID [2022-04-15 06:49:10,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {4178#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4182#(< 999989 main_~y~0)} is VALID [2022-04-15 06:49:10,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {4182#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4186#(< 999987 main_~y~0)} is VALID [2022-04-15 06:49:10,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {4186#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4190#(< 999985 main_~y~0)} is VALID [2022-04-15 06:49:10,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {4190#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4194#(< 999983 main_~y~0)} is VALID [2022-04-15 06:49:10,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {4194#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4198#(< 999981 main_~y~0)} is VALID [2022-04-15 06:49:10,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {4198#(< 999981 main_~y~0)} assume !(~y~0 > 0); {4111#false} is VALID [2022-04-15 06:49:10,892 INFO L272 TraceCheckUtils]: 20: Hoare triple {4111#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4111#false} is VALID [2022-04-15 06:49:10,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {4111#false} ~cond := #in~cond; {4111#false} is VALID [2022-04-15 06:49:10,892 INFO L290 TraceCheckUtils]: 22: Hoare triple {4111#false} assume 0 == ~cond; {4111#false} is VALID [2022-04-15 06:49:10,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {4111#false} assume !false; {4111#false} is VALID [2022-04-15 06:49:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:10,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:11,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {4111#false} assume !false; {4111#false} is VALID [2022-04-15 06:49:11,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {4111#false} assume 0 == ~cond; {4111#false} is VALID [2022-04-15 06:49:11,515 INFO L290 TraceCheckUtils]: 21: Hoare triple {4111#false} ~cond := #in~cond; {4111#false} is VALID [2022-04-15 06:49:11,515 INFO L272 TraceCheckUtils]: 20: Hoare triple {4111#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4111#false} is VALID [2022-04-15 06:49:11,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {4226#(< 0 main_~y~0)} assume !(~y~0 > 0); {4111#false} is VALID [2022-04-15 06:49:11,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {4230#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4226#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:11,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {4234#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4230#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:11,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {4238#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4234#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:11,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {4242#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4238#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:11,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {4246#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4242#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:11,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4246#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:11,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {4254#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4250#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:11,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {4258#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4254#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:11,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {4262#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4258#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:11,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {4266#(or (< main_~x~0 1000000) (< 18 main_~y~0))} [91] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4262#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:11,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {4270#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999982))))} [94] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_252)) (.cse1 (= v_main_~x~0_252 v_main_~x~0_251)) (.cse2 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_252 v_main_~x~0_251) (< v_main_~x~0_251 1000001) .cse0 (= (+ v_main_~x~0_252 v_main_~y~0_205) (+ v_main_~x~0_251 v_main_~y~0_206))) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .cse3) (and (or (not .cse0) (not (< v_main_~x~0_252 1000000))) .cse1 .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3))) InVars {main_~y~0=v_main_~y~0_206, main_#t~post5=|v_main_#t~post5_60|, main_~x~0=v_main_~x~0_252, main_#t~post6=|v_main_#t~post6_60|} OutVars{main_~y~0=v_main_~y~0_205, main_#t~post5=|v_main_#t~post5_59|, main_~x~0=v_main_~x~0_251, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4266#(or (< main_~x~0 1000000) (< 18 main_~y~0))} is VALID [2022-04-15 06:49:11,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {4270#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999982))))} [93] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4270#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999982))))} is VALID [2022-04-15 06:49:11,529 INFO L290 TraceCheckUtils]: 6: Hoare triple {4277#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999982))) (<= 0 (+ main_~y~0 499981)))} [92] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_60| |v_main_#t~post4_59|))) (or (and (< v_main_~x~0_250 v_main_~x~0_249) (< v_main_~x~0_249 500001)) (and (= v_main_~x~0_249 v_main_~x~0_250) (not (< v_main_~x~0_250 500000)) .cse0) (and (= v_main_~x~0_250 v_main_~x~0_249) .cse0))) InVars {main_~x~0=v_main_~x~0_250, main_#t~post4=|v_main_#t~post4_60|} OutVars{main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4270#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999982))))} is VALID [2022-04-15 06:49:11,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {4110#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4277#(and (or (< main_~x~0 1000000) (< 18 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999982))) (<= 0 (+ main_~y~0 499981)))} is VALID [2022-04-15 06:49:11,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {4110#true} call #t~ret9 := main(); {4110#true} is VALID [2022-04-15 06:49:11,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4110#true} {4110#true} #52#return; {4110#true} is VALID [2022-04-15 06:49:11,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {4110#true} assume true; {4110#true} is VALID [2022-04-15 06:49:11,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {4110#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(17, 2);call #Ultimate.allocInit(12, 3); {4110#true} is VALID [2022-04-15 06:49:11,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {4110#true} call ULTIMATE.init(); {4110#true} is VALID [2022-04-15 06:49:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:11,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225220818] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:11,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:11,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 42 [2022-04-15 06:49:12,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:12,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [378264894] [2022-04-15 06:49:12,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [378264894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:12,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:12,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:49:12,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972415846] [2022-04-15 06:49:12,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:12,149 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 53 [2022-04-15 06:49:12,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:12,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 06:49:12,196 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 06:49:12,196 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:49:12,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:12,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:49:12,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1205, Invalid=2217, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 06:49:12,198 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 06:49:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:14,050 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-04-15 06:49:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:49:14,050 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 53 [2022-04-15 06:49:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:14,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 06:49:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 75 transitions. [2022-04-15 06:49:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 06:49:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 75 transitions. [2022-04-15 06:49:14,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 75 transitions. [2022-04-15 06:49:14,123 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 06:49:14,124 INFO L225 Difference]: With dead ends: 133 [2022-04-15 06:49:14,124 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 06:49:14,126 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2572 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2150, Invalid=5160, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 06:49:14,126 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 45 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:14,126 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 29 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:49:14,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 06:49:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-15 06:49:14,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:14,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 06:49:14,264 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 06:49:14,264 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 06:49:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:14,266 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-15 06:49:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-15 06:49:14,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:14,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:14,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 87 states. [2022-04-15 06:49:14,267 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 87 states. [2022-04-15 06:49:14,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:14,268 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-04-15 06:49:14,268 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-15 06:49:14,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:14,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:14,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:14,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.0609756097560976) internal successors, (87), 82 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 06:49:14,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-04-15 06:49:14,271 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 53 [2022-04-15 06:49:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:14,271 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-04-15 06:49:14,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 29 states have internal predecessors, (49), 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 06:49:14,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 91 transitions. [2022-04-15 06:49:14,352 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 06:49:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-04-15 06:49:14,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 06:49:14,353 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:14,353 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:14,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 06:49:14,555 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:14,556 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:14,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2971242, now seen corresponding path program 10 times [2022-04-15 06:49:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:14,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570151625] [2022-04-15 06:49:18,614 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:18,665 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:18,877 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:18,878 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1323788449, now seen corresponding path program 1 times [2022-04-15 06:49:18,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:18,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383586200] [2022-04-15 06:49:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:18,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:19,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {4999#(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(17, 2);call #Ultimate.allocInit(12, 3); {4983#true} is VALID [2022-04-15 06:49:19,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {4983#true} assume true; {4983#true} is VALID [2022-04-15 06:49:19,058 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4983#true} {4983#true} #52#return; {4983#true} is VALID [2022-04-15 06:49:19,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {4983#true} call ULTIMATE.init(); {4999#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:19,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {4999#(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(17, 2);call #Ultimate.allocInit(12, 3); {4983#true} is VALID [2022-04-15 06:49:19,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {4983#true} assume true; {4983#true} is VALID [2022-04-15 06:49:19,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4983#true} {4983#true} #52#return; {4983#true} is VALID [2022-04-15 06:49:19,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {4983#true} call #t~ret9 := main(); {4983#true} is VALID [2022-04-15 06:49:19,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {4983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(<= 500000 main_~y~0)} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse1 (= |v_main_#t~post4_67| |v_main_#t~post4_66|))) (or (and (not (< v_main_~x~0_292 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)))) InVars {main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_67|} OutVars{main_~x~0=v_main_~x~0_291, main_#t~post4=|v_main_#t~post4_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4988#(<= 500000 main_~y~0)} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {4988#(<= 500000 main_~y~0)} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse5 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_294 v_main_~y~0_247))) (and (< .cse4 (+ v_main_~y~0_248 1000001)) (= (+ v_main_~x~0_293 v_main_~y~0_248) .cse4) .cse5 (< v_main_~y~0_248 v_main_~y~0_247))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {4988#(<= 500000 main_~y~0)} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {4988#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4989#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:19,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {4989#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4990#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:19,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {4990#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4991#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:19,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {4991#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4992#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:19,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {4992#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4993#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:19,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {4993#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4994#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:19,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {4994#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4995#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:19,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {4995#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4996#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:19,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {4996#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4997#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:19,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {4997#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4998#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:19,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(<= 499980 main_~y~0)} assume !(~y~0 > 0); {4984#false} is VALID [2022-04-15 06:49:19,068 INFO L272 TraceCheckUtils]: 21: Hoare triple {4984#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4984#false} is VALID [2022-04-15 06:49:19,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#false} ~cond := #in~cond; {4984#false} is VALID [2022-04-15 06:49:19,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {4984#false} assume 0 == ~cond; {4984#false} is VALID [2022-04-15 06:49:19,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {4984#false} assume !false; {4984#false} is VALID [2022-04-15 06:49:19,068 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:19,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:19,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383586200] [2022-04-15 06:49:19,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383586200] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:19,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891505723] [2022-04-15 06:49:19,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:19,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:19,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:19,071 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 06:49:19,101 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 06:49:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:19,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 06:49:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:19,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:19,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {4983#true} call ULTIMATE.init(); {4983#true} is VALID [2022-04-15 06:49:19,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {4983#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(17, 2);call #Ultimate.allocInit(12, 3); {4983#true} is VALID [2022-04-15 06:49:19,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {4983#true} assume true; {4983#true} is VALID [2022-04-15 06:49:19,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4983#true} {4983#true} #52#return; {4983#true} is VALID [2022-04-15 06:49:19,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {4983#true} call #t~ret9 := main(); {4983#true} is VALID [2022-04-15 06:49:19,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {4983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(<= 500000 main_~y~0)} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse1 (= |v_main_#t~post4_67| |v_main_#t~post4_66|))) (or (and (not (< v_main_~x~0_292 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)))) InVars {main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_67|} OutVars{main_~x~0=v_main_~x~0_291, main_#t~post4=|v_main_#t~post4_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {4988#(<= 500000 main_~y~0)} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {4988#(<= 500000 main_~y~0)} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse5 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_294 v_main_~y~0_247))) (and (< .cse4 (+ v_main_~y~0_248 1000001)) (= (+ v_main_~x~0_293 v_main_~y~0_248) .cse4) .cse5 (< v_main_~y~0_248 v_main_~y~0_247))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {4988#(<= 500000 main_~y~0)} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4988#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:19,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {4988#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4989#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:19,366 INFO L290 TraceCheckUtils]: 11: Hoare triple {4989#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4990#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:19,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {4990#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4991#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:19,367 INFO L290 TraceCheckUtils]: 13: Hoare triple {4991#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4992#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:19,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {4992#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4993#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:19,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {4993#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4994#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:19,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {4994#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4995#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:19,373 INFO L290 TraceCheckUtils]: 17: Hoare triple {4995#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4996#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:19,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {4996#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4997#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:19,374 INFO L290 TraceCheckUtils]: 19: Hoare triple {4997#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {4998#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:19,374 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(<= 499980 main_~y~0)} assume !(~y~0 > 0); {4984#false} is VALID [2022-04-15 06:49:19,375 INFO L272 TraceCheckUtils]: 21: Hoare triple {4984#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4984#false} is VALID [2022-04-15 06:49:19,375 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#false} ~cond := #in~cond; {4984#false} is VALID [2022-04-15 06:49:19,375 INFO L290 TraceCheckUtils]: 23: Hoare triple {4984#false} assume 0 == ~cond; {4984#false} is VALID [2022-04-15 06:49:19,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {4984#false} assume !false; {4984#false} is VALID [2022-04-15 06:49:19,375 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:19,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:19,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {4984#false} assume !false; {4984#false} is VALID [2022-04-15 06:49:19,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {4984#false} assume 0 == ~cond; {4984#false} is VALID [2022-04-15 06:49:19,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {4984#false} ~cond := #in~cond; {4984#false} is VALID [2022-04-15 06:49:19,720 INFO L272 TraceCheckUtils]: 21: Hoare triple {4984#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {4984#false} is VALID [2022-04-15 06:49:19,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {5087#(< 0 main_~y~0)} assume !(~y~0 > 0); {4984#false} is VALID [2022-04-15 06:49:19,721 INFO L290 TraceCheckUtils]: 19: Hoare triple {5091#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5087#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:19,722 INFO L290 TraceCheckUtils]: 18: Hoare triple {5095#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5091#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:19,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {5099#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5095#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:19,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {5103#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5099#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:19,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {5107#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5103#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:19,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {5111#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5107#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:19,729 INFO L290 TraceCheckUtils]: 13: Hoare triple {5115#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5111#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:19,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {5119#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5115#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:19,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {5123#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5119#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:19,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {5127#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5123#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:19,731 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#(< 20 main_~y~0)} [95] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5127#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:19,732 INFO L290 TraceCheckUtils]: 8: Hoare triple {5127#(< 20 main_~y~0)} [98] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse1 (= v_main_~x~0_294 v_main_~x~0_293)) (.cse2 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse3 (= |v_main_#t~post5_67| |v_main_#t~post5_66|)) (.cse5 (<= 500000 v_main_~x~0_294))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_294 v_main_~y~0_247))) (and (< .cse4 (+ v_main_~y~0_248 1000001)) (= (+ v_main_~x~0_293 v_main_~y~0_248) .cse4) .cse5 (< v_main_~y~0_248 v_main_~y~0_247))) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_294 1000000)))))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_294, main_#t~post6=|v_main_#t~post6_67|} OutVars{main_~y~0=v_main_~y~0_247, main_#t~post5=|v_main_#t~post5_66|, main_~x~0=v_main_~x~0_293, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5127#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:19,732 INFO L290 TraceCheckUtils]: 7: Hoare triple {5127#(< 20 main_~y~0)} [97] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5127#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:19,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {5127#(< 20 main_~y~0)} [96] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse1 (= |v_main_#t~post4_67| |v_main_#t~post4_66|))) (or (and (not (< v_main_~x~0_292 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_292 v_main_~x~0_291) (< v_main_~x~0_291 500001)))) InVars {main_~x~0=v_main_~x~0_292, main_#t~post4=|v_main_#t~post4_67|} OutVars{main_~x~0=v_main_~x~0_291, main_#t~post4=|v_main_#t~post4_66|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5127#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:19,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {4983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5127#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:19,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {4983#true} call #t~ret9 := main(); {4983#true} is VALID [2022-04-15 06:49:19,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4983#true} {4983#true} #52#return; {4983#true} is VALID [2022-04-15 06:49:19,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {4983#true} assume true; {4983#true} is VALID [2022-04-15 06:49:19,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {4983#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(17, 2);call #Ultimate.allocInit(12, 3); {4983#true} is VALID [2022-04-15 06:49:19,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {4983#true} call ULTIMATE.init(); {4983#true} is VALID [2022-04-15 06:49:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:19,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891505723] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:19,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:19,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-15 06:49:20,248 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:20,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570151625] [2022-04-15 06:49:20,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570151625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:20,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:20,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:49:20,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389866321] [2022-04-15 06:49:20,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:20,249 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 56 [2022-04-15 06:49:20,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:20,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 06:49:20,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:20,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:49:20,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:20,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:49:20,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=727, Invalid=1079, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 06:49:20,300 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 06:49:22,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:22,095 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-04-15 06:49:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:49:22,096 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 56 [2022-04-15 06:49:22,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:22,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 06:49:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-15 06:49:22,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 06:49:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 80 transitions. [2022-04-15 06:49:22,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 80 transitions. [2022-04-15 06:49:22,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:22,175 INFO L225 Difference]: With dead ends: 141 [2022-04-15 06:49:22,175 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 06:49:22,177 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1432 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1702, Invalid=3410, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:49:22,177 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 87 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:22,178 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 34 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:49:22,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 06:49:22,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 62. [2022-04-15 06:49:22,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:22,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 06:49:22,318 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 06:49:22,318 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 06:49:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:22,319 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 06:49:22,320 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-15 06:49:22,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:22,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:22,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 94 states. [2022-04-15 06:49:22,320 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 94 states. [2022-04-15 06:49:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:22,322 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-04-15 06:49:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-15 06:49:22,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:22,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:22,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:22,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:22,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 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 06:49:22,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2022-04-15 06:49:22,324 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 56 [2022-04-15 06:49:22,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:22,324 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2022-04-15 06:49:22,324 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.625) internal successors, (52), 31 states have internal predecessors, (52), 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 06:49:22,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 65 transitions. [2022-04-15 06:49:22,387 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 06:49:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2022-04-15 06:49:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 06:49:22,388 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:22,388 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:22,407 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 06:49:22,588 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 06:49:22,588 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:22,589 INFO L85 PathProgramCache]: Analyzing trace with hash 458392495, now seen corresponding path program 11 times [2022-04-15 06:49:22,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:22,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1325187264] [2022-04-15 06:49:26,679 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:26,742 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:27,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:27,019 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1169960990, now seen corresponding path program 1 times [2022-04-15 06:49:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:27,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110747196] [2022-04-15 06:49:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:27,191 INFO L290 TraceCheckUtils]: 0: Hoare triple {5847#(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(17, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-15 06:49:27,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-15 06:49:27,191 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5830#true} {5830#true} #52#return; {5830#true} is VALID [2022-04-15 06:49:27,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {5830#true} call ULTIMATE.init(); {5847#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:27,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {5847#(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(17, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-15 06:49:27,192 INFO L290 TraceCheckUtils]: 2: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-15 06:49:27,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5830#true} {5830#true} #52#return; {5830#true} is VALID [2022-04-15 06:49:27,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {5830#true} call #t~ret9 := main(); {5830#true} is VALID [2022-04-15 06:49:27,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {5830#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {5835#(<= 500000 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_335 v_main_~x~0_334)) (.cse1 (= |v_main_#t~post4_73| |v_main_#t~post4_72|))) (or (and .cse0 (<= 500000 v_main_~x~0_335) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_334 500001) (< v_main_~x~0_335 v_main_~x~0_334)))) InVars {main_~x~0=v_main_~x~0_335, main_#t~post4=|v_main_#t~post4_73|} OutVars{main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {5835#(<= 500000 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {5835#(<= 500000 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse5 (<= 500000 v_main_~x~0_337)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~x~0_337 v_main_~x~0_336)) (.cse3 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_337 v_main_~y~0_292))) (and (= .cse4 (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~y~0_293 v_main_~y~0_292) .cse5 (< .cse4 (+ v_main_~y~0_293 1000001)))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_337 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {5835#(<= 500000 main_~y~0)} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {5835#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5836#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:27,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {5836#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5837#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:27,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {5837#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5838#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:27,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {5838#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5839#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:27,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {5839#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5840#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:27,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {5840#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5841#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:27,198 INFO L290 TraceCheckUtils]: 16: Hoare triple {5841#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5842#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:27,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {5842#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5843#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:27,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5844#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:27,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {5844#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5845#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:27,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {5845#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5846#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:27,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {5846#(<= 499978 main_~y~0)} assume !(~y~0 > 0); {5831#false} is VALID [2022-04-15 06:49:27,201 INFO L272 TraceCheckUtils]: 22: Hoare triple {5831#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5831#false} is VALID [2022-04-15 06:49:27,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {5831#false} ~cond := #in~cond; {5831#false} is VALID [2022-04-15 06:49:27,201 INFO L290 TraceCheckUtils]: 24: Hoare triple {5831#false} assume 0 == ~cond; {5831#false} is VALID [2022-04-15 06:49:27,201 INFO L290 TraceCheckUtils]: 25: Hoare triple {5831#false} assume !false; {5831#false} is VALID [2022-04-15 06:49:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110747196] [2022-04-15 06:49:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110747196] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797939810] [2022-04-15 06:49:27,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:27,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:27,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:27,206 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 06:49:27,207 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 06:49:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:27,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 06:49:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:27,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:27,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {5830#true} call ULTIMATE.init(); {5830#true} is VALID [2022-04-15 06:49:27,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {5830#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(17, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-15 06:49:27,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-15 06:49:27,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5830#true} {5830#true} #52#return; {5830#true} is VALID [2022-04-15 06:49:27,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {5830#true} call #t~ret9 := main(); {5830#true} is VALID [2022-04-15 06:49:27,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {5830#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {5835#(<= 500000 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_335 v_main_~x~0_334)) (.cse1 (= |v_main_#t~post4_73| |v_main_#t~post4_72|))) (or (and .cse0 (<= 500000 v_main_~x~0_335) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_334 500001) (< v_main_~x~0_335 v_main_~x~0_334)))) InVars {main_~x~0=v_main_~x~0_335, main_#t~post4=|v_main_#t~post4_73|} OutVars{main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {5835#(<= 500000 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {5835#(<= 500000 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse5 (<= 500000 v_main_~x~0_337)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~x~0_337 v_main_~x~0_336)) (.cse3 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_337 v_main_~y~0_292))) (and (= .cse4 (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~y~0_293 v_main_~y~0_292) .cse5 (< .cse4 (+ v_main_~y~0_293 1000001)))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_337 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {5835#(<= 500000 main_~y~0)} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5835#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:27,441 INFO L290 TraceCheckUtils]: 10: Hoare triple {5835#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5836#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:27,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {5836#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5837#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:27,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {5837#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5838#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:27,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {5838#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5839#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:27,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {5839#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5840#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:27,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {5840#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5841#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:27,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {5841#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5842#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:27,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {5842#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5843#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:27,445 INFO L290 TraceCheckUtils]: 18: Hoare triple {5843#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5844#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:27,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {5844#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5845#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:27,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {5845#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5846#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:27,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {5846#(<= 499978 main_~y~0)} assume !(~y~0 > 0); {5831#false} is VALID [2022-04-15 06:49:27,447 INFO L272 TraceCheckUtils]: 22: Hoare triple {5831#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5831#false} is VALID [2022-04-15 06:49:27,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {5831#false} ~cond := #in~cond; {5831#false} is VALID [2022-04-15 06:49:27,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {5831#false} assume 0 == ~cond; {5831#false} is VALID [2022-04-15 06:49:27,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {5831#false} assume !false; {5831#false} is VALID [2022-04-15 06:49:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:27,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:27,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {5831#false} assume !false; {5831#false} is VALID [2022-04-15 06:49:27,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {5831#false} assume 0 == ~cond; {5831#false} is VALID [2022-04-15 06:49:27,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {5831#false} ~cond := #in~cond; {5831#false} is VALID [2022-04-15 06:49:27,801 INFO L272 TraceCheckUtils]: 22: Hoare triple {5831#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {5831#false} is VALID [2022-04-15 06:49:27,801 INFO L290 TraceCheckUtils]: 21: Hoare triple {5938#(< 0 main_~y~0)} assume !(~y~0 > 0); {5831#false} is VALID [2022-04-15 06:49:27,801 INFO L290 TraceCheckUtils]: 20: Hoare triple {5942#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5938#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:27,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {5946#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5942#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:27,806 INFO L290 TraceCheckUtils]: 18: Hoare triple {5950#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5946#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:27,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {5954#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5950#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:27,807 INFO L290 TraceCheckUtils]: 16: Hoare triple {5958#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5954#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:27,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {5962#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5958#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:27,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {5966#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5962#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:27,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {5970#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5966#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:27,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {5974#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5970#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:27,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {5978#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5974#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:27,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {5982#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {5978#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:27,810 INFO L290 TraceCheckUtils]: 9: Hoare triple {5982#(< 22 main_~y~0)} [99] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5982#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:27,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {5982#(< 22 main_~y~0)} [102] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_293 v_main_~y~0_292)) (.cse5 (<= 500000 v_main_~x~0_337)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~x~0_337 v_main_~x~0_336)) (.cse3 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_337 v_main_~y~0_292))) (and (= .cse4 (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~y~0_293 v_main_~y~0_292) .cse5 (< .cse4 (+ v_main_~y~0_293 1000001)))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_337 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_337, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_292, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5982#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:27,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {5982#(< 22 main_~y~0)} [101] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5982#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:27,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#(< 22 main_~y~0)} [100] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_335 v_main_~x~0_334)) (.cse1 (= |v_main_#t~post4_73| |v_main_#t~post4_72|))) (or (and .cse0 (<= 500000 v_main_~x~0_335) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_334 500001) (< v_main_~x~0_335 v_main_~x~0_334)))) InVars {main_~x~0=v_main_~x~0_335, main_#t~post4=|v_main_#t~post4_73|} OutVars{main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_72|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5982#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:27,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {5830#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5982#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:27,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {5830#true} call #t~ret9 := main(); {5830#true} is VALID [2022-04-15 06:49:27,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5830#true} {5830#true} #52#return; {5830#true} is VALID [2022-04-15 06:49:27,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {5830#true} assume true; {5830#true} is VALID [2022-04-15 06:49:27,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {5830#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(17, 2);call #Ultimate.allocInit(12, 3); {5830#true} is VALID [2022-04-15 06:49:27,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {5830#true} call ULTIMATE.init(); {5830#true} is VALID [2022-04-15 06:49:27,812 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:27,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797939810] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:27,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 27 [2022-04-15 06:49:28,376 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1325187264] [2022-04-15 06:49:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1325187264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:28,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 06:49:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852378334] [2022-04-15 06:49:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:28,377 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 61 [2022-04-15 06:49:28,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:28,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 06:49:28,423 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 06:49:28,424 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 06:49:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 06:49:28,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1296, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 06:49:28,425 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 06:49:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,692 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2022-04-15 06:49:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 06:49:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 61 [2022-04-15 06:49:30,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 06:49:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-15 06:49:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 06:49:30,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 83 transitions. [2022-04-15 06:49:30,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 83 transitions. [2022-04-15 06:49:30,777 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 06:49:30,778 INFO L225 Difference]: With dead ends: 121 [2022-04-15 06:49:30,778 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 06:49:30,780 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1735 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2028, Invalid=4134, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:49:30,781 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 95 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:30,781 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 54 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 06:49:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 06:49:30,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-15 06:49:30,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:30,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,877 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,877 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,878 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 06:49:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:49:30,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:30,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,879 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:30,880 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-04-15 06:49:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:49:30,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:30,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:30,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:30,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.064516129032258) internal successors, (66), 62 states have internal predecessors, (66), 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 06:49:30,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2022-04-15 06:49:30,882 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 61 [2022-04-15 06:49:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:30,882 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2022-04-15 06:49:30,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 34 states have internal predecessors, (57), 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 06:49:30,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 70 transitions. [2022-04-15 06:49:30,951 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 06:49:30,951 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2022-04-15 06:49:30,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 06:49:30,952 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:30,952 INFO L499 BasicCegarLoop]: trace histogram [21, 20, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:30,968 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 06:49:31,152 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,SelfDestructingSolverStorable13 [2022-04-15 06:49:31,153 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:31,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:31,153 INFO L85 PathProgramCache]: Analyzing trace with hash -426318370, now seen corresponding path program 12 times [2022-04-15 06:49:31,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:31,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1338557186] [2022-04-15 06:49:35,232 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:35,291 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:39,409 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:39,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:39,522 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:39,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1439650111, now seen corresponding path program 1 times [2022-04-15 06:49:39,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:39,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038509903] [2022-04-15 06:49:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:39,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:39,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:39,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:39,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {6630#(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(17, 2);call #Ultimate.allocInit(12, 3); {6609#true} is VALID [2022-04-15 06:49:39,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#true} assume true; {6609#true} is VALID [2022-04-15 06:49:39,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6609#true} {6609#true} #52#return; {6609#true} is VALID [2022-04-15 06:49:39,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {6609#true} call ULTIMATE.init(); {6630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:39,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {6630#(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(17, 2);call #Ultimate.allocInit(12, 3); {6609#true} is VALID [2022-04-15 06:49:39,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {6609#true} assume true; {6609#true} is VALID [2022-04-15 06:49:39,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6609#true} {6609#true} #52#return; {6609#true} is VALID [2022-04-15 06:49:39,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {6609#true} call #t~ret9 := main(); {6609#true} is VALID [2022-04-15 06:49:39,763 INFO L290 TraceCheckUtils]: 5: Hoare triple {6609#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6614#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:49:39,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {6614#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1 (not (< v_main_~x~0_381 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6615#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:39,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {6615#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6615#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:39,766 INFO L290 TraceCheckUtils]: 8: Hoare triple {6615#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [106] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse2 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse4 (<= 500000 v_main_~x~0_383)) (.cse3 (= v_main_~y~0_342 v_main_~y~0_341))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_382 v_main_~y~0_342) (+ v_main_~x~0_383 v_main_~y~0_341)) (< v_main_~x~0_382 1000001) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_383 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_383, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_341, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_382, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6616#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:49:39,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {6616#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:39,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {6617#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6618#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:39,768 INFO L290 TraceCheckUtils]: 11: Hoare triple {6618#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6619#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:39,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {6619#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6620#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:39,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {6620#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6621#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:39,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {6621#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6622#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:39,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {6622#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6623#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:39,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {6623#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6624#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:39,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {6624#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6625#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:39,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {6625#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6626#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:39,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {6626#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6627#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:39,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {6627#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6628#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:39,774 INFO L290 TraceCheckUtils]: 21: Hoare triple {6628#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6629#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:49:39,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {6629#(<= 499976 main_~y~0)} assume !(~y~0 > 0); {6610#false} is VALID [2022-04-15 06:49:39,775 INFO L272 TraceCheckUtils]: 23: Hoare triple {6610#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6610#false} is VALID [2022-04-15 06:49:39,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {6610#false} ~cond := #in~cond; {6610#false} is VALID [2022-04-15 06:49:39,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {6610#false} assume 0 == ~cond; {6610#false} is VALID [2022-04-15 06:49:39,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2022-04-15 06:49:39,776 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:39,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:39,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038509903] [2022-04-15 06:49:39,776 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038509903] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:39,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [303494529] [2022-04-15 06:49:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:39,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:39,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:39,779 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 06:49:39,780 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 06:49:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:39,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 06:49:39,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:39,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:40,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {6609#true} call ULTIMATE.init(); {6609#true} is VALID [2022-04-15 06:49:40,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#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(17, 2);call #Ultimate.allocInit(12, 3); {6609#true} is VALID [2022-04-15 06:49:40,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {6609#true} assume true; {6609#true} is VALID [2022-04-15 06:49:40,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6609#true} {6609#true} #52#return; {6609#true} is VALID [2022-04-15 06:49:40,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {6609#true} call #t~ret9 := main(); {6609#true} is VALID [2022-04-15 06:49:40,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {6609#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:40,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {6617#(<= 500000 main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1 (not (< v_main_~x~0_381 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:40,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {6617#(<= 500000 main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:40,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {6617#(<= 500000 main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse2 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse4 (<= 500000 v_main_~x~0_383)) (.cse3 (= v_main_~y~0_342 v_main_~y~0_341))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_382 v_main_~y~0_342) (+ v_main_~x~0_383 v_main_~y~0_341)) (< v_main_~x~0_382 1000001) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_383 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_383, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_341, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_382, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:40,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {6617#(<= 500000 main_~y~0)} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6617#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:40,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {6617#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6618#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:40,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {6618#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6619#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:40,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {6619#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6620#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:40,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {6620#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6621#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:40,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {6621#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6622#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:40,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {6622#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6623#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:40,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {6623#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6624#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:40,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {6624#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6625#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:40,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {6625#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6626#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:40,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {6626#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6627#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:40,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {6627#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6628#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:40,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {6628#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6629#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:49:40,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {6629#(<= 499976 main_~y~0)} assume !(~y~0 > 0); {6610#false} is VALID [2022-04-15 06:49:40,068 INFO L272 TraceCheckUtils]: 23: Hoare triple {6610#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6610#false} is VALID [2022-04-15 06:49:40,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {6610#false} ~cond := #in~cond; {6610#false} is VALID [2022-04-15 06:49:40,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {6610#false} assume 0 == ~cond; {6610#false} is VALID [2022-04-15 06:49:40,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2022-04-15 06:49:40,068 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:40,069 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:40,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {6610#false} assume !false; {6610#false} is VALID [2022-04-15 06:49:40,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {6610#false} assume 0 == ~cond; {6610#false} is VALID [2022-04-15 06:49:40,496 INFO L290 TraceCheckUtils]: 24: Hoare triple {6610#false} ~cond := #in~cond; {6610#false} is VALID [2022-04-15 06:49:40,496 INFO L272 TraceCheckUtils]: 23: Hoare triple {6610#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {6610#false} is VALID [2022-04-15 06:49:40,497 INFO L290 TraceCheckUtils]: 22: Hoare triple {6724#(< 0 main_~y~0)} assume !(~y~0 > 0); {6610#false} is VALID [2022-04-15 06:49:40,497 INFO L290 TraceCheckUtils]: 21: Hoare triple {6728#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6724#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:40,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {6732#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6728#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:40,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {6736#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6732#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:40,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {6740#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6736#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:40,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {6744#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6740#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:40,511 INFO L290 TraceCheckUtils]: 16: Hoare triple {6748#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6744#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:40,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {6752#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6748#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:40,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {6756#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6752#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:40,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {6760#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6756#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:40,514 INFO L290 TraceCheckUtils]: 12: Hoare triple {6764#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6760#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:40,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {6768#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6764#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:40,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {6772#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {6768#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:40,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {6772#(< 24 main_~y~0)} [103] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6772#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:40,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {6772#(< 24 main_~y~0)} [106] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse2 (= |v_main_#t~post5_81| |v_main_#t~post5_80|)) (.cse4 (<= 500000 v_main_~x~0_383)) (.cse3 (= v_main_~y~0_342 v_main_~y~0_341))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_382 v_main_~y~0_342) (+ v_main_~x~0_383 v_main_~y~0_341)) (< v_main_~x~0_382 1000001) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_383 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_342, main_#t~post5=|v_main_#t~post5_81|, main_~x~0=v_main_~x~0_383, main_#t~post6=|v_main_#t~post6_81|} OutVars{main_~y~0=v_main_~y~0_341, main_#t~post5=|v_main_#t~post5_80|, main_~x~0=v_main_~x~0_382, main_#t~post6=|v_main_#t~post6_80|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {6772#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:40,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {6772#(< 24 main_~y~0)} [105] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6772#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:40,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {6772#(< 24 main_~y~0)} [104] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_79| |v_main_#t~post4_78|))) (or (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1 (not (< v_main_~x~0_381 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_79|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_78|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6772#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:40,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {6609#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6772#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:40,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {6609#true} call #t~ret9 := main(); {6609#true} is VALID [2022-04-15 06:49:40,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6609#true} {6609#true} #52#return; {6609#true} is VALID [2022-04-15 06:49:40,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {6609#true} assume true; {6609#true} is VALID [2022-04-15 06:49:40,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {6609#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(17, 2);call #Ultimate.allocInit(12, 3); {6609#true} is VALID [2022-04-15 06:49:40,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {6609#true} call ULTIMATE.init(); {6609#true} is VALID [2022-04-15 06:49:40,518 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:40,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [303494529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:40,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:40,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 15] total 32 [2022-04-15 06:49:41,189 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:41,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1338557186] [2022-04-15 06:49:41,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1338557186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:41,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:41,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 06:49:41,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136802845] [2022-04-15 06:49:41,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:41,190 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:41,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:41,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:41,238 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 06:49:41,239 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 06:49:41,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:41,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 06:49:41,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1104, Invalid=1758, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:49:41,240 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:43,808 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-04-15 06:49:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 06:49:43,809 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 88 transitions. [2022-04-15 06:49:43,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 88 transitions. [2022-04-15 06:49:43,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 88 transitions. [2022-04-15 06:49:43,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:43,895 INFO L225 Difference]: With dead ends: 169 [2022-04-15 06:49:43,896 INFO L226 Difference]: Without dead ends: 110 [2022-04-15 06:49:43,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2270 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2474, Invalid=5358, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:49:43,898 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:43,898 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 34 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:49:43,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-15 06:49:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-15 06:49:44,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:44,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 06:49:44,089 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 06:49:44,089 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 06:49:44,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:44,091 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2022-04-15 06:49:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 06:49:44,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:44,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:44,092 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 110 states. [2022-04-15 06:49:44,092 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 110 states. [2022-04-15 06:49:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:44,094 INFO L93 Difference]: Finished difference Result 110 states and 114 transitions. [2022-04-15 06:49:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 06:49:44,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:44,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:44,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:44,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 06:49:44,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-15 06:49:44,096 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 66 [2022-04-15 06:49:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:44,097 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-15 06:49:44,097 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.631578947368421) internal successors, (62), 37 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 06:49:44,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-15 06:49:44,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:49:44,208 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 06:49:44,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 06:49:44,209 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:44,209 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:44,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 06:49:44,409 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,SelfDestructingSolverStorable14 [2022-04-15 06:49:44,409 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:44,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:44,410 INFO L85 PathProgramCache]: Analyzing trace with hash 595715488, now seen corresponding path program 13 times [2022-04-15 06:49:44,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:44,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [198010270] [2022-04-15 06:49:48,471 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:48,522 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:52,656 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:49:52,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:52,772 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:52,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1079046718, now seen corresponding path program 1 times [2022-04-15 06:49:52,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:52,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524405141] [2022-04-15 06:49:52,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:52,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:52,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {7694#(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(17, 2);call #Ultimate.allocInit(12, 3); {7675#true} is VALID [2022-04-15 06:49:52,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {7675#true} assume true; {7675#true} is VALID [2022-04-15 06:49:52,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7675#true} {7675#true} #52#return; {7675#true} is VALID [2022-04-15 06:49:52,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {7675#true} call ULTIMATE.init(); {7694#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:52,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {7694#(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(17, 2);call #Ultimate.allocInit(12, 3); {7675#true} is VALID [2022-04-15 06:49:52,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {7675#true} assume true; {7675#true} is VALID [2022-04-15 06:49:52,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7675#true} {7675#true} #52#return; {7675#true} is VALID [2022-04-15 06:49:52,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {7675#true} call #t~ret9 := main(); {7675#true} is VALID [2022-04-15 06:49:52,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {7675#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7680#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:52,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {7680#(<= 500000 main_~y~0)} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_85| |v_main_#t~post4_84|))) (or (and (= v_main_~x~0_429 v_main_~x~0_430) (<= 500000 v_main_~x~0_430) .cse0) (and (< v_main_~x~0_429 500001) (< v_main_~x~0_430 v_main_~x~0_429)) (and .cse0 (= v_main_~x~0_430 v_main_~x~0_429)))) InVars {main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_85|} OutVars{main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_84|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7680#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:52,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {7680#(<= 500000 main_~y~0)} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7680#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:52,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {7680#(<= 500000 main_~y~0)} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~x~0_432 v_main_~x~0_431)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 500000 v_main_~x~0_432)) (.cse3 (= v_main_~y~0_395 v_main_~y~0_394))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_432 v_main_~x~0_431) .cse4 (< v_main_~x~0_431 1000001) (= (+ v_main_~x~0_431 v_main_~y~0_395) (+ v_main_~x~0_432 v_main_~y~0_394))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_432 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7680#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:52,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {7680#(<= 500000 main_~y~0)} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7680#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:52,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {7680#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7681#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:52,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {7681#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7682#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:52,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {7682#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7683#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:52,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {7683#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7684#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:52,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {7684#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7685#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:52,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {7685#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7686#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:52,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {7686#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7687#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:52,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {7687#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7688#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:52,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {7688#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7689#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:52,977 INFO L290 TraceCheckUtils]: 19: Hoare triple {7689#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7690#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:52,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {7690#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7691#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:52,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {7691#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7692#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:49:52,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {7692#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7693#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:49:52,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {7693#(<= 499974 main_~y~0)} assume !(~y~0 > 0); {7676#false} is VALID [2022-04-15 06:49:52,979 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7676#false} is VALID [2022-04-15 06:49:52,979 INFO L290 TraceCheckUtils]: 25: Hoare triple {7676#false} ~cond := #in~cond; {7676#false} is VALID [2022-04-15 06:49:52,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {7676#false} assume 0 == ~cond; {7676#false} is VALID [2022-04-15 06:49:52,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {7676#false} assume !false; {7676#false} is VALID [2022-04-15 06:49:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:52,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:52,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524405141] [2022-04-15 06:49:52,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524405141] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:52,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731111930] [2022-04-15 06:49:52,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:52,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:52,981 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 06:49:52,981 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 06:49:53,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 06:49:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:53,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:53,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {7675#true} call ULTIMATE.init(); {7675#true} is VALID [2022-04-15 06:49:53,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {7675#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(17, 2);call #Ultimate.allocInit(12, 3); {7675#true} is VALID [2022-04-15 06:49:53,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {7675#true} assume true; {7675#true} is VALID [2022-04-15 06:49:53,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7675#true} {7675#true} #52#return; {7675#true} is VALID [2022-04-15 06:49:53,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {7675#true} call #t~ret9 := main(); {7675#true} is VALID [2022-04-15 06:49:53,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {7675#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7713#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:49:53,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {7713#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_85| |v_main_#t~post4_84|))) (or (and (= v_main_~x~0_429 v_main_~x~0_430) (<= 500000 v_main_~x~0_430) .cse0) (and (< v_main_~x~0_429 500001) (< v_main_~x~0_430 v_main_~x~0_429)) (and .cse0 (= v_main_~x~0_430 v_main_~x~0_429)))) InVars {main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_85|} OutVars{main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_84|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7717#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:53,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {7717#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7717#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:49:53,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {7717#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~x~0_432 v_main_~x~0_431)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 500000 v_main_~x~0_432)) (.cse3 (= v_main_~y~0_395 v_main_~y~0_394))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_432 v_main_~x~0_431) .cse4 (< v_main_~x~0_431 1000001) (= (+ v_main_~x~0_431 v_main_~y~0_395) (+ v_main_~x~0_432 v_main_~y~0_394))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_432 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7724#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:49:53,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {7724#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7728#(< 999999 main_~y~0)} is VALID [2022-04-15 06:49:53,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {7728#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7732#(< 999997 main_~y~0)} is VALID [2022-04-15 06:49:53,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {7732#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7736#(< 999995 main_~y~0)} is VALID [2022-04-15 06:49:53,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {7736#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7740#(< 999993 main_~y~0)} is VALID [2022-04-15 06:49:53,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {7740#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7744#(< 999991 main_~y~0)} is VALID [2022-04-15 06:49:53,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {7744#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7748#(< 999989 main_~y~0)} is VALID [2022-04-15 06:49:53,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {7748#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7752#(< 999987 main_~y~0)} is VALID [2022-04-15 06:49:53,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {7752#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7756#(< 999985 main_~y~0)} is VALID [2022-04-15 06:49:53,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {7756#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7760#(< 999983 main_~y~0)} is VALID [2022-04-15 06:49:53,565 INFO L290 TraceCheckUtils]: 18: Hoare triple {7760#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7764#(< 999981 main_~y~0)} is VALID [2022-04-15 06:49:53,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {7764#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7768#(< 999979 main_~y~0)} is VALID [2022-04-15 06:49:53,566 INFO L290 TraceCheckUtils]: 20: Hoare triple {7768#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7772#(< 999977 main_~y~0)} is VALID [2022-04-15 06:49:53,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {7772#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7776#(< 999975 main_~y~0)} is VALID [2022-04-15 06:49:53,567 INFO L290 TraceCheckUtils]: 22: Hoare triple {7776#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7780#(< 999973 main_~y~0)} is VALID [2022-04-15 06:49:53,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {7780#(< 999973 main_~y~0)} assume !(~y~0 > 0); {7676#false} is VALID [2022-04-15 06:49:53,567 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7676#false} is VALID [2022-04-15 06:49:53,567 INFO L290 TraceCheckUtils]: 25: Hoare triple {7676#false} ~cond := #in~cond; {7676#false} is VALID [2022-04-15 06:49:53,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {7676#false} assume 0 == ~cond; {7676#false} is VALID [2022-04-15 06:49:53,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {7676#false} assume !false; {7676#false} is VALID [2022-04-15 06:49:53,568 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:53,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:54,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {7676#false} assume !false; {7676#false} is VALID [2022-04-15 06:49:54,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {7676#false} assume 0 == ~cond; {7676#false} is VALID [2022-04-15 06:49:54,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {7676#false} ~cond := #in~cond; {7676#false} is VALID [2022-04-15 06:49:54,300 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {7676#false} is VALID [2022-04-15 06:49:54,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {7808#(< 0 main_~y~0)} assume !(~y~0 > 0); {7676#false} is VALID [2022-04-15 06:49:54,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {7812#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7808#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:54,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {7816#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7812#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:54,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {7820#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7816#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:54,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {7824#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7820#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:54,303 INFO L290 TraceCheckUtils]: 18: Hoare triple {7828#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7824#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:54,303 INFO L290 TraceCheckUtils]: 17: Hoare triple {7832#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7828#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:54,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {7836#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7832#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:54,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {7840#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7836#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:54,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {7844#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7840#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:54,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {7848#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7844#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:54,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {7852#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7848#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:54,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {7856#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7852#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:54,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {7860#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {7856#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:54,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {7864#(or (< main_~x~0 1000000) (< 26 main_~y~0))} [107] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7860#(< 26 main_~y~0)} is VALID [2022-04-15 06:49:54,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {7868#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974)) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} [110] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~x~0_432 v_main_~x~0_431)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse4 (<= 500000 v_main_~x~0_432)) (.cse3 (= v_main_~y~0_395 v_main_~y~0_394))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_432 v_main_~x~0_431) .cse4 (< v_main_~x~0_431 1000001) (= (+ v_main_~x~0_431 v_main_~y~0_395) (+ v_main_~x~0_432 v_main_~y~0_394))) (and .cse0 .cse1 .cse2 (or (not .cse4) (not (< v_main_~x~0_432 1000000))) .cse3))) InVars {main_~y~0=v_main_~y~0_395, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_394, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_431, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7864#(or (< main_~x~0 1000000) (< 26 main_~y~0))} is VALID [2022-04-15 06:49:54,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {7868#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974)) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} [109] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7868#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974)) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} is VALID [2022-04-15 06:49:54,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {7875#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974))) (<= 0 (+ main_~y~0 499973)) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} [108] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_85| |v_main_#t~post4_84|))) (or (and (= v_main_~x~0_429 v_main_~x~0_430) (<= 500000 v_main_~x~0_430) .cse0) (and (< v_main_~x~0_429 500001) (< v_main_~x~0_430 v_main_~x~0_429)) (and .cse0 (= v_main_~x~0_430 v_main_~x~0_429)))) InVars {main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_85|} OutVars{main_~x~0=v_main_~x~0_429, main_#t~post4=|v_main_#t~post4_84|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7868#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974)) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} is VALID [2022-04-15 06:49:54,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {7675#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7875#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999974))) (<= 0 (+ main_~y~0 499973)) (or (< main_~x~0 1000000) (< 26 main_~y~0)))} is VALID [2022-04-15 06:49:54,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {7675#true} call #t~ret9 := main(); {7675#true} is VALID [2022-04-15 06:49:54,310 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7675#true} {7675#true} #52#return; {7675#true} is VALID [2022-04-15 06:49:54,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {7675#true} assume true; {7675#true} is VALID [2022-04-15 06:49:54,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {7675#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(17, 2);call #Ultimate.allocInit(12, 3); {7675#true} is VALID [2022-04-15 06:49:54,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {7675#true} call ULTIMATE.init(); {7675#true} is VALID [2022-04-15 06:49:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:49:54,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731111930] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:54,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:54,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 19] total 51 [2022-04-15 06:49:55,148 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:49:55,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [198010270] [2022-04-15 06:49:55,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [198010270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:49:55,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:49:55,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 06:49:55,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057981917] [2022-04-15 06:49:55,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:49:55,151 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 69 [2022-04-15 06:49:55,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:49:55,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 06:49:55,205 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 06:49:55,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 06:49:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 06:49:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1916, Invalid=3340, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 06:49:55,208 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 06:49:57,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:57,896 INFO L93 Difference]: Finished difference Result 177 states and 191 transitions. [2022-04-15 06:49:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 06:49:57,896 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 69 [2022-04-15 06:49:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:49:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 06:49:57,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 93 transitions. [2022-04-15 06:49:57,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 06:49:57,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 93 transitions. [2022-04-15 06:49:57,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 93 transitions. [2022-04-15 06:49:57,991 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 06:49:57,992 INFO L225 Difference]: With dead ends: 177 [2022-04-15 06:49:57,992 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 06:49:57,993 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4107 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3585, Invalid=8405, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:49:57,994 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 130 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:49:57,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 44 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 06:49:57,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 06:49:58,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 75. [2022-04-15 06:49:58,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:49:58,097 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 06:49:58,097 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 06:49:58,097 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 06:49:58,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:58,099 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:49:58,099 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:49:58,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:58,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:58,100 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 117 states. [2022-04-15 06:49:58,100 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 117 states. [2022-04-15 06:49:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:49:58,102 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 06:49:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 06:49:58,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:49:58,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:49:58,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:49:58,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:49:58,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0571428571428572) internal successors, (74), 70 states have internal predecessors, (74), 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 06:49:58,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2022-04-15 06:49:58,104 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 69 [2022-04-15 06:49:58,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:49:58,104 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2022-04-15 06:49:58,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.625) internal successors, (65), 39 states have internal predecessors, (65), 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 06:49:58,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 78 transitions. [2022-04-15 06:49:58,171 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 06:49:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2022-04-15 06:49:58,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 06:49:58,171 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:49:58,171 INFO L499 BasicCegarLoop]: trace histogram [24, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:49:58,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 06:49:58,372 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,SelfDestructingSolverStorable15 [2022-04-15 06:49:58,372 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:49:58,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:49:58,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1301555187, now seen corresponding path program 14 times [2022-04-15 06:49:58,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:49:58,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617002749] [2022-04-15 06:49:58,480 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:58,691 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:49:58,693 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:49:58,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1276734689, now seen corresponding path program 1 times [2022-04-15 06:49:58,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:49:58,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817797709] [2022-04-15 06:49:58,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:58,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:49:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:58,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:49:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:58,876 INFO L290 TraceCheckUtils]: 0: Hoare triple {8750#(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(17, 2);call #Ultimate.allocInit(12, 3); {8730#true} is VALID [2022-04-15 06:49:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-15 06:49:58,876 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8730#true} {8730#true} #52#return; {8730#true} is VALID [2022-04-15 06:49:58,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {8730#true} call ULTIMATE.init(); {8750#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:49:58,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {8750#(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(17, 2);call #Ultimate.allocInit(12, 3); {8730#true} is VALID [2022-04-15 06:49:58,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-15 06:49:58,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8730#true} #52#return; {8730#true} is VALID [2022-04-15 06:49:58,877 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#true} call #t~ret9 := main(); {8730#true} is VALID [2022-04-15 06:49:58,877 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:58,877 INFO L290 TraceCheckUtils]: 6: Hoare triple {8735#(<= 500000 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_482 v_main_~x~0_481)) (.cse1 (= |v_main_#t~post4_92| |v_main_#t~post4_91|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_482 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_482 v_main_~x~0_481) (< v_main_~x~0_481 500001)))) InVars {main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_92|} OutVars{main_~x~0=v_main_~x~0_481, main_#t~post4=|v_main_#t~post4_91|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:58,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {8735#(<= 500000 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:58,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {8735#(<= 500000 main_~y~0)} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse5 (<= 500000 v_main_~x~0_484)) (.cse1 (= v_main_~y~0_451 v_main_~y~0_450)) (.cse2 (= v_main_~x~0_484 v_main_~x~0_483)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_484 v_main_~y~0_450))) (and (< .cse4 (+ v_main_~y~0_451 1000001)) (= .cse4 (+ v_main_~x~0_483 v_main_~y~0_451)) .cse5 (< v_main_~y~0_451 v_main_~y~0_450))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_484 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_451, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_450, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_483, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:58,879 INFO L290 TraceCheckUtils]: 9: Hoare triple {8735#(<= 500000 main_~y~0)} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:58,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {8735#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8736#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:58,880 INFO L290 TraceCheckUtils]: 11: Hoare triple {8736#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8737#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:58,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {8737#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8738#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:58,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8739#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:58,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {8739#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8740#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:58,882 INFO L290 TraceCheckUtils]: 15: Hoare triple {8740#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8741#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:58,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {8741#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8742#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:58,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {8742#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8743#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:58,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {8743#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8744#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:58,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {8744#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8745#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:58,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {8745#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8746#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:58,885 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8747#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:49:58,885 INFO L290 TraceCheckUtils]: 22: Hoare triple {8747#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8748#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:49:58,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {8748#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8749#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:49:58,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {8749#(<= 499972 main_~y~0)} assume !(~y~0 > 0); {8731#false} is VALID [2022-04-15 06:49:58,886 INFO L272 TraceCheckUtils]: 25: Hoare triple {8731#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8731#false} is VALID [2022-04-15 06:49:58,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {8731#false} ~cond := #in~cond; {8731#false} is VALID [2022-04-15 06:49:58,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {8731#false} assume 0 == ~cond; {8731#false} is VALID [2022-04-15 06:49:58,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-15 06:49:58,886 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:58,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:49:58,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817797709] [2022-04-15 06:49:58,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817797709] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:49:58,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598760759] [2022-04-15 06:49:58,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:49:58,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:49:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:49:58,888 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 06:49:58,889 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 06:49:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:58,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 06:49:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:49:58,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:49:59,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {8730#true} call ULTIMATE.init(); {8730#true} is VALID [2022-04-15 06:49:59,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#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(17, 2);call #Ultimate.allocInit(12, 3); {8730#true} is VALID [2022-04-15 06:49:59,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-15 06:49:59,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8730#true} #52#return; {8730#true} is VALID [2022-04-15 06:49:59,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#true} call #t~ret9 := main(); {8730#true} is VALID [2022-04-15 06:49:59,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:59,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {8735#(<= 500000 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_482 v_main_~x~0_481)) (.cse1 (= |v_main_#t~post4_92| |v_main_#t~post4_91|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_482 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_482 v_main_~x~0_481) (< v_main_~x~0_481 500001)))) InVars {main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_92|} OutVars{main_~x~0=v_main_~x~0_481, main_#t~post4=|v_main_#t~post4_91|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:59,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {8735#(<= 500000 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:59,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {8735#(<= 500000 main_~y~0)} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse5 (<= 500000 v_main_~x~0_484)) (.cse1 (= v_main_~y~0_451 v_main_~y~0_450)) (.cse2 (= v_main_~x~0_484 v_main_~x~0_483)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_484 v_main_~y~0_450))) (and (< .cse4 (+ v_main_~y~0_451 1000001)) (= .cse4 (+ v_main_~x~0_483 v_main_~y~0_451)) .cse5 (< v_main_~y~0_451 v_main_~y~0_450))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_484 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_451, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_450, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_483, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:59,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {8735#(<= 500000 main_~y~0)} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8735#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:49:59,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {8735#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8736#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:49:59,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {8736#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8737#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:49:59,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {8737#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8738#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:49:59,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {8738#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8739#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:49:59,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {8739#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8740#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:49:59,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {8740#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8741#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:49:59,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {8741#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8742#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:49:59,192 INFO L290 TraceCheckUtils]: 17: Hoare triple {8742#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8743#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:49:59,192 INFO L290 TraceCheckUtils]: 18: Hoare triple {8743#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8744#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:49:59,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {8744#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8745#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:49:59,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {8745#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8746#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:49:59,194 INFO L290 TraceCheckUtils]: 21: Hoare triple {8746#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8747#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:49:59,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {8747#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8748#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:49:59,195 INFO L290 TraceCheckUtils]: 23: Hoare triple {8748#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8749#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:49:59,195 INFO L290 TraceCheckUtils]: 24: Hoare triple {8749#(<= 499972 main_~y~0)} assume !(~y~0 > 0); {8731#false} is VALID [2022-04-15 06:49:59,195 INFO L272 TraceCheckUtils]: 25: Hoare triple {8731#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8731#false} is VALID [2022-04-15 06:49:59,195 INFO L290 TraceCheckUtils]: 26: Hoare triple {8731#false} ~cond := #in~cond; {8731#false} is VALID [2022-04-15 06:49:59,195 INFO L290 TraceCheckUtils]: 27: Hoare triple {8731#false} assume 0 == ~cond; {8731#false} is VALID [2022-04-15 06:49:59,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-15 06:49:59,196 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:59,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:49:59,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {8731#false} assume !false; {8731#false} is VALID [2022-04-15 06:49:59,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {8731#false} assume 0 == ~cond; {8731#false} is VALID [2022-04-15 06:49:59,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {8731#false} ~cond := #in~cond; {8731#false} is VALID [2022-04-15 06:49:59,676 INFO L272 TraceCheckUtils]: 25: Hoare triple {8731#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {8731#false} is VALID [2022-04-15 06:49:59,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {8850#(< 0 main_~y~0)} assume !(~y~0 > 0); {8731#false} is VALID [2022-04-15 06:49:59,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {8854#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8850#(< 0 main_~y~0)} is VALID [2022-04-15 06:49:59,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {8858#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8854#(< 2 main_~y~0)} is VALID [2022-04-15 06:49:59,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {8862#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8858#(< 4 main_~y~0)} is VALID [2022-04-15 06:49:59,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {8866#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8862#(< 6 main_~y~0)} is VALID [2022-04-15 06:49:59,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {8870#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8866#(< 8 main_~y~0)} is VALID [2022-04-15 06:49:59,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {8874#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8870#(< 10 main_~y~0)} is VALID [2022-04-15 06:49:59,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {8878#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8874#(< 12 main_~y~0)} is VALID [2022-04-15 06:49:59,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {8882#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8878#(< 14 main_~y~0)} is VALID [2022-04-15 06:49:59,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {8886#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8882#(< 16 main_~y~0)} is VALID [2022-04-15 06:49:59,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {8890#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8886#(< 18 main_~y~0)} is VALID [2022-04-15 06:49:59,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {8894#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8890#(< 20 main_~y~0)} is VALID [2022-04-15 06:49:59,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {8898#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8894#(< 22 main_~y~0)} is VALID [2022-04-15 06:49:59,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {8902#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8898#(< 24 main_~y~0)} is VALID [2022-04-15 06:49:59,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {8906#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {8902#(< 26 main_~y~0)} is VALID [2022-04-15 06:49:59,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {8906#(< 28 main_~y~0)} [111] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8906#(< 28 main_~y~0)} is VALID [2022-04-15 06:49:59,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {8906#(< 28 main_~y~0)} [114] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse5 (<= 500000 v_main_~x~0_484)) (.cse1 (= v_main_~y~0_451 v_main_~y~0_450)) (.cse2 (= v_main_~x~0_484 v_main_~x~0_483)) (.cse3 (= |v_main_#t~post6_95| |v_main_#t~post6_94|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_484 v_main_~y~0_450))) (and (< .cse4 (+ v_main_~y~0_451 1000001)) (= .cse4 (+ v_main_~x~0_483 v_main_~y~0_451)) .cse5 (< v_main_~y~0_451 v_main_~y~0_450))) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_484 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_451, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_450, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_483, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8906#(< 28 main_~y~0)} is VALID [2022-04-15 06:49:59,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {8906#(< 28 main_~y~0)} [113] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8906#(< 28 main_~y~0)} is VALID [2022-04-15 06:49:59,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {8906#(< 28 main_~y~0)} [112] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_482 v_main_~x~0_481)) (.cse1 (= |v_main_#t~post4_92| |v_main_#t~post4_91|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_482 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_482 v_main_~x~0_481) (< v_main_~x~0_481 500001)))) InVars {main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_92|} OutVars{main_~x~0=v_main_~x~0_481, main_#t~post4=|v_main_#t~post4_91|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8906#(< 28 main_~y~0)} is VALID [2022-04-15 06:49:59,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {8730#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8906#(< 28 main_~y~0)} is VALID [2022-04-15 06:49:59,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {8730#true} call #t~ret9 := main(); {8730#true} is VALID [2022-04-15 06:49:59,686 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8730#true} {8730#true} #52#return; {8730#true} is VALID [2022-04-15 06:49:59,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {8730#true} assume true; {8730#true} is VALID [2022-04-15 06:49:59,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {8730#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(17, 2);call #Ultimate.allocInit(12, 3); {8730#true} is VALID [2022-04-15 06:49:59,686 INFO L272 TraceCheckUtils]: 0: Hoare triple {8730#true} call ULTIMATE.init(); {8730#true} is VALID [2022-04-15 06:49:59,686 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:49:59,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598760759] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:49:59,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:49:59,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 33 [2022-04-15 06:50:00,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:00,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617002749] [2022-04-15 06:50:00,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617002749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:00,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:00,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 06:50:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917432856] [2022-04-15 06:50:00,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:00,441 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:00,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:00,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:00,494 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 06:50:00,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 06:50:00,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 06:50:00,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1322, Invalid=1984, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:50:00,495 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:03,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,409 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-04-15 06:50:03,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 06:50:03,409 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:03,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:03,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:03,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2022-04-15 06:50:03,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 96 transitions. [2022-04-15 06:50:03,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 96 transitions. [2022-04-15 06:50:03,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:03,506 INFO L225 Difference]: With dead ends: 147 [2022-04-15 06:50:03,506 INFO L226 Difference]: Without dead ends: 80 [2022-04-15 06:50:03,507 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2705 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3090, Invalid=6416, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:50:03,507 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 114 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:03,507 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 24 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 06:50:03,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-15 06:50:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-04-15 06:50:03,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:03,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 06:50:03,625 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 06:50:03,625 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 06:50:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,626 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-15 06:50:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 06:50:03,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 80 states. [2022-04-15 06:50:03,627 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 80 states. [2022-04-15 06:50:03,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:03,628 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2022-04-15 06:50:03,628 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 06:50:03,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:03,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:03,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:03,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:03,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0533333333333332) internal successors, (79), 75 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 06:50:03,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2022-04-15 06:50:03,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 74 [2022-04-15 06:50:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:03,630 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2022-04-15 06:50:03,631 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 1.627906976744186) internal successors, (70), 42 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 06:50:03,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 83 transitions. [2022-04-15 06:50:03,711 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 06:50:03,711 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2022-04-15 06:50:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 06:50:03,711 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:03,711 INFO L499 BasicCegarLoop]: trace histogram [26, 25, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:03,728 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 06:50:03,912 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:03,912 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:03,912 INFO L85 PathProgramCache]: Analyzing trace with hash 44893420, now seen corresponding path program 15 times [2022-04-15 06:50:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:03,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [209158068] [2022-04-15 06:50:04,026 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:04,253 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:04,254 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:04,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1636183134, now seen corresponding path program 1 times [2022-04-15 06:50:04,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:04,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444632462] [2022-04-15 06:50:04,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:04,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:04,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:04,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {9679#(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(17, 2);call #Ultimate.allocInit(12, 3); {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {9658#true} assume true; {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9658#true} {9658#true} #52#return; {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L272 TraceCheckUtils]: 0: Hoare triple {9658#true} call ULTIMATE.init(); {9679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:04,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {9679#(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(17, 2);call #Ultimate.allocInit(12, 3); {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {9658#true} assume true; {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9658#true} {9658#true} #52#return; {9658#true} is VALID [2022-04-15 06:50:04,471 INFO L272 TraceCheckUtils]: 4: Hoare triple {9658#true} call #t~ret9 := main(); {9658#true} is VALID [2022-04-15 06:50:04,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {9658#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {9663#(<= 500000 main_~y~0)} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_536 v_main_~x~0_535)) (.cse1 (= |v_main_#t~post4_98| |v_main_#t~post4_97|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 v_main_~x~0_535) (< v_main_~x~0_535 500001)) (and .cse0 (not (< v_main_~x~0_536 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_98|} OutVars{main_~x~0=v_main_~x~0_535, main_#t~post4=|v_main_#t~post4_97|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {9663#(<= 500000 main_~y~0)} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(<= 500000 main_~y~0)} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_538 v_main_~x~0_537)) (.cse1 (= v_main_~y~0_511 v_main_~y~0_510)) (.cse2 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse3 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse4 (<= 500000 v_main_~x~0_538))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_538 1000000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_538 v_main_~x~0_537) (< v_main_~x~0_537 1000001) .cse4 (= (+ v_main_~x~0_538 v_main_~y~0_510) (+ v_main_~x~0_537 v_main_~y~0_511))))) InVars {main_~y~0=v_main_~y~0_511, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_510, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(<= 500000 main_~y~0)} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {9663#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9664#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:04,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {9664#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9665#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:04,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {9665#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9666#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:04,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {9666#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9667#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:04,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {9667#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9668#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:04,476 INFO L290 TraceCheckUtils]: 15: Hoare triple {9668#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9669#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:04,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {9669#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9670#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:04,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {9670#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9671#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:04,478 INFO L290 TraceCheckUtils]: 18: Hoare triple {9671#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9672#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:04,478 INFO L290 TraceCheckUtils]: 19: Hoare triple {9672#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9673#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:04,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {9673#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9674#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:04,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {9674#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9675#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:04,480 INFO L290 TraceCheckUtils]: 22: Hoare triple {9675#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9676#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:04,480 INFO L290 TraceCheckUtils]: 23: Hoare triple {9676#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9677#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:04,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {9677#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9678#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:04,481 INFO L290 TraceCheckUtils]: 25: Hoare triple {9678#(<= 499970 main_~y~0)} assume !(~y~0 > 0); {9659#false} is VALID [2022-04-15 06:50:04,481 INFO L272 TraceCheckUtils]: 26: Hoare triple {9659#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9659#false} is VALID [2022-04-15 06:50:04,481 INFO L290 TraceCheckUtils]: 27: Hoare triple {9659#false} ~cond := #in~cond; {9659#false} is VALID [2022-04-15 06:50:04,481 INFO L290 TraceCheckUtils]: 28: Hoare triple {9659#false} assume 0 == ~cond; {9659#false} is VALID [2022-04-15 06:50:04,481 INFO L290 TraceCheckUtils]: 29: Hoare triple {9659#false} assume !false; {9659#false} is VALID [2022-04-15 06:50:04,482 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:04,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444632462] [2022-04-15 06:50:04,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444632462] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:04,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670535620] [2022-04-15 06:50:04,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:04,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:04,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:04,483 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 06:50:04,484 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 06:50:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:04,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 06:50:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:04,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:04,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {9658#true} call ULTIMATE.init(); {9658#true} is VALID [2022-04-15 06:50:04,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {9658#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(17, 2);call #Ultimate.allocInit(12, 3); {9658#true} is VALID [2022-04-15 06:50:04,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {9658#true} assume true; {9658#true} is VALID [2022-04-15 06:50:04,777 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9658#true} {9658#true} #52#return; {9658#true} is VALID [2022-04-15 06:50:04,777 INFO L272 TraceCheckUtils]: 4: Hoare triple {9658#true} call #t~ret9 := main(); {9658#true} is VALID [2022-04-15 06:50:04,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {9658#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,778 INFO L290 TraceCheckUtils]: 6: Hoare triple {9663#(<= 500000 main_~y~0)} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_536 v_main_~x~0_535)) (.cse1 (= |v_main_#t~post4_98| |v_main_#t~post4_97|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 v_main_~x~0_535) (< v_main_~x~0_535 500001)) (and .cse0 (not (< v_main_~x~0_536 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_98|} OutVars{main_~x~0=v_main_~x~0_535, main_#t~post4=|v_main_#t~post4_97|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {9663#(<= 500000 main_~y~0)} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {9663#(<= 500000 main_~y~0)} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_538 v_main_~x~0_537)) (.cse1 (= v_main_~y~0_511 v_main_~y~0_510)) (.cse2 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse3 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse4 (<= 500000 v_main_~x~0_538))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_538 1000000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_538 v_main_~x~0_537) (< v_main_~x~0_537 1000001) .cse4 (= (+ v_main_~x~0_538 v_main_~y~0_510) (+ v_main_~x~0_537 v_main_~y~0_511))))) InVars {main_~y~0=v_main_~y~0_511, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_510, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,779 INFO L290 TraceCheckUtils]: 9: Hoare triple {9663#(<= 500000 main_~y~0)} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9663#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:04,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {9663#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9664#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:04,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {9664#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9665#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:04,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {9665#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9666#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:04,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {9666#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9667#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:04,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {9667#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9668#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:04,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {9668#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9669#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:04,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {9669#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9670#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:04,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {9670#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9671#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:04,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {9671#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9672#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:04,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {9672#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9673#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:04,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {9673#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9674#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:04,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {9674#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9675#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:04,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {9675#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9676#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:04,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {9676#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9677#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:04,787 INFO L290 TraceCheckUtils]: 24: Hoare triple {9677#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9678#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:04,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {9678#(<= 499970 main_~y~0)} assume !(~y~0 > 0); {9659#false} is VALID [2022-04-15 06:50:04,787 INFO L272 TraceCheckUtils]: 26: Hoare triple {9659#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9659#false} is VALID [2022-04-15 06:50:04,787 INFO L290 TraceCheckUtils]: 27: Hoare triple {9659#false} ~cond := #in~cond; {9659#false} is VALID [2022-04-15 06:50:04,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {9659#false} assume 0 == ~cond; {9659#false} is VALID [2022-04-15 06:50:04,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {9659#false} assume !false; {9659#false} is VALID [2022-04-15 06:50:04,787 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:04,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:05,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {9659#false} assume !false; {9659#false} is VALID [2022-04-15 06:50:05,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {9659#false} assume 0 == ~cond; {9659#false} is VALID [2022-04-15 06:50:05,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {9659#false} ~cond := #in~cond; {9659#false} is VALID [2022-04-15 06:50:05,303 INFO L272 TraceCheckUtils]: 26: Hoare triple {9659#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {9659#false} is VALID [2022-04-15 06:50:05,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {9782#(< 0 main_~y~0)} assume !(~y~0 > 0); {9659#false} is VALID [2022-04-15 06:50:05,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {9786#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9782#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:05,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {9790#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9786#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:05,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {9794#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9790#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:05,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {9798#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9794#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:05,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {9802#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9798#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:05,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {9806#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9802#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:05,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {9810#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9806#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:05,308 INFO L290 TraceCheckUtils]: 17: Hoare triple {9814#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9810#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:05,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {9818#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9814#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:05,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {9822#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9818#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:05,309 INFO L290 TraceCheckUtils]: 14: Hoare triple {9826#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9822#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:05,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {9830#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9826#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:05,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {9834#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9830#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:05,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {9838#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9834#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:05,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {9842#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {9838#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:05,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {9842#(< 30 main_~y~0)} [115] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9842#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:05,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {9842#(< 30 main_~y~0)} [118] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_538 v_main_~x~0_537)) (.cse1 (= v_main_~y~0_511 v_main_~y~0_510)) (.cse2 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse3 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse4 (<= 500000 v_main_~x~0_538))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_538 1000000)) (not .cse4))) (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_538 v_main_~x~0_537) (< v_main_~x~0_537 1000001) .cse4 (= (+ v_main_~x~0_538 v_main_~y~0_510) (+ v_main_~x~0_537 v_main_~y~0_511))))) InVars {main_~y~0=v_main_~y~0_511, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_510, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_537, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9842#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:05,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {9842#(< 30 main_~y~0)} [117] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9842#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:05,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {9842#(< 30 main_~y~0)} [116] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_536 v_main_~x~0_535)) (.cse1 (= |v_main_#t~post4_98| |v_main_#t~post4_97|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 v_main_~x~0_535) (< v_main_~x~0_535 500001)) (and .cse0 (not (< v_main_~x~0_536 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_98|} OutVars{main_~x~0=v_main_~x~0_535, main_#t~post4=|v_main_#t~post4_97|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9842#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:05,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {9658#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9842#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:05,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {9658#true} call #t~ret9 := main(); {9658#true} is VALID [2022-04-15 06:50:05,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9658#true} {9658#true} #52#return; {9658#true} is VALID [2022-04-15 06:50:05,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {9658#true} assume true; {9658#true} is VALID [2022-04-15 06:50:05,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {9658#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(17, 2);call #Ultimate.allocInit(12, 3); {9658#true} is VALID [2022-04-15 06:50:05,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {9658#true} call ULTIMATE.init(); {9658#true} is VALID [2022-04-15 06:50:05,313 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:05,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670535620] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:05,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:05,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-15 06:50:06,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:06,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [209158068] [2022-04-15 06:50:06,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [209158068] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:06,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:06,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 06:50:06,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006828422] [2022-04-15 06:50:06,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:06,208 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 79 [2022-04-15 06:50:06,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:06,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 06:50:06,285 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 06:50:06,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 06:50:06,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:06,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 06:50:06,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1507, Invalid=2275, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:50:06,286 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 06:50:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:09,602 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-04-15 06:50:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 06:50:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 79 [2022-04-15 06:50:09,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:09,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 06:50:09,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 06:50:09,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 06:50:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 101 transitions. [2022-04-15 06:50:09,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 101 transitions. [2022-04-15 06:50:09,688 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 06:50:09,690 INFO L225 Difference]: With dead ends: 157 [2022-04-15 06:50:09,690 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 06:50:09,691 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3523, Invalid=7397, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:50:09,692 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 151 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:09,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 49 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 06:50:09,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 06:50:09,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-04-15 06:50:09,814 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:09,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 06:50:09,814 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 06:50:09,814 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 06:50:09,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:09,819 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-15 06:50:09,819 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:50:09,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:09,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:09,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 85 states. [2022-04-15 06:50:09,820 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 85 states. [2022-04-15 06:50:09,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:09,822 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2022-04-15 06:50:09,822 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:50:09,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:09,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:09,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:09,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:09,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 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 06:50:09,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-15 06:50:09,824 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 79 [2022-04-15 06:50:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:09,824 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-15 06:50:09,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 45 states have internal predecessors, (75), 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 06:50:09,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-15 06:50:09,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 06:50:09,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 06:50:09,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:09,915 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:09,939 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 06:50:10,115 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 06:50:10,115 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash -696201791, now seen corresponding path program 16 times [2022-04-15 06:50:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:10,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [133102854] [2022-04-15 06:50:14,195 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:14,244 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:14,499 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:14,500 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1988338433, now seen corresponding path program 1 times [2022-04-15 06:50:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:14,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498925990] [2022-04-15 06:50:14,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:14,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:14,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:14,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {10664#(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(17, 2);call #Ultimate.allocInit(12, 3); {10642#true} is VALID [2022-04-15 06:50:14,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {10642#true} assume true; {10642#true} is VALID [2022-04-15 06:50:14,736 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10642#true} {10642#true} #52#return; {10642#true} is VALID [2022-04-15 06:50:14,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10664#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:14,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {10664#(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(17, 2);call #Ultimate.allocInit(12, 3); {10642#true} is VALID [2022-04-15 06:50:14,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2022-04-15 06:50:14,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #52#return; {10642#true} is VALID [2022-04-15 06:50:14,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret9 := main(); {10642#true} is VALID [2022-04-15 06:50:14,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {10642#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:14,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {10647#(<= 500000 main_~y~0)} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_104| |v_main_#t~post4_103|)) (.cse1 (= v_main_~x~0_593 v_main_~x~0_592))) (or (and (< v_main_~x~0_593 v_main_~x~0_592) (< v_main_~x~0_592 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_593 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_593, main_#t~post4=|v_main_#t~post4_104|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_103|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:14,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {10647#(<= 500000 main_~y~0)} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:14,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {10647#(<= 500000 main_~y~0)} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_575 v_main_~y~0_574)) (.cse1 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (<= 500000 v_main_~x~0_595))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_595 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_595 v_main_~y~0_574))) (and .cse2 (< .cse5 (+ v_main_~y~0_575 1000001)) (= .cse5 (+ v_main_~x~0_594 v_main_~y~0_575)) (< v_main_~y~0_575 v_main_~y~0_574))))) InVars {main_~y~0=v_main_~y~0_575, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_595, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_574, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_594, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:14,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {10647#(<= 500000 main_~y~0)} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:14,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {10647#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10648#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:14,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {10648#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10649#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:14,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {10649#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10650#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:14,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {10650#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10651#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:14,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {10651#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10652#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:14,745 INFO L290 TraceCheckUtils]: 15: Hoare triple {10652#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10653#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:14,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {10653#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10654#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:14,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {10654#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10655#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:14,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {10655#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10656#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:14,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10657#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:14,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {10657#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10658#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:14,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {10658#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10659#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:14,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {10659#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10660#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:14,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {10660#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10661#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:14,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {10661#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10662#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:14,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {10662#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10663#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:14,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {10663#(<= 499968 main_~y~0)} assume !(~y~0 > 0); {10643#false} is VALID [2022-04-15 06:50:14,752 INFO L272 TraceCheckUtils]: 27: Hoare triple {10643#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10643#false} is VALID [2022-04-15 06:50:14,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2022-04-15 06:50:14,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2022-04-15 06:50:14,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2022-04-15 06:50:14,753 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:14,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:14,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498925990] [2022-04-15 06:50:14,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498925990] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:14,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930388021] [2022-04-15 06:50:14,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:14,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:14,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:14,754 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 06:50:14,756 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 06:50:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:14,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 06:50:14,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:14,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:15,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2022-04-15 06:50:15,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {10642#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(17, 2);call #Ultimate.allocInit(12, 3); {10642#true} is VALID [2022-04-15 06:50:15,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2022-04-15 06:50:15,062 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #52#return; {10642#true} is VALID [2022-04-15 06:50:15,062 INFO L272 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret9 := main(); {10642#true} is VALID [2022-04-15 06:50:15,062 INFO L290 TraceCheckUtils]: 5: Hoare triple {10642#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:15,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {10647#(<= 500000 main_~y~0)} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_104| |v_main_#t~post4_103|)) (.cse1 (= v_main_~x~0_593 v_main_~x~0_592))) (or (and (< v_main_~x~0_593 v_main_~x~0_592) (< v_main_~x~0_592 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_593 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_593, main_#t~post4=|v_main_#t~post4_104|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_103|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:15,063 INFO L290 TraceCheckUtils]: 7: Hoare triple {10647#(<= 500000 main_~y~0)} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:15,064 INFO L290 TraceCheckUtils]: 8: Hoare triple {10647#(<= 500000 main_~y~0)} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_575 v_main_~y~0_574)) (.cse1 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (<= 500000 v_main_~x~0_595))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_595 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_595 v_main_~y~0_574))) (and .cse2 (< .cse5 (+ v_main_~y~0_575 1000001)) (= .cse5 (+ v_main_~x~0_594 v_main_~y~0_575)) (< v_main_~y~0_575 v_main_~y~0_574))))) InVars {main_~y~0=v_main_~y~0_575, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_595, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_574, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_594, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:15,064 INFO L290 TraceCheckUtils]: 9: Hoare triple {10647#(<= 500000 main_~y~0)} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10647#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:15,064 INFO L290 TraceCheckUtils]: 10: Hoare triple {10647#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10648#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:15,065 INFO L290 TraceCheckUtils]: 11: Hoare triple {10648#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10649#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:15,065 INFO L290 TraceCheckUtils]: 12: Hoare triple {10649#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10650#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:15,066 INFO L290 TraceCheckUtils]: 13: Hoare triple {10650#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10651#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:15,066 INFO L290 TraceCheckUtils]: 14: Hoare triple {10651#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10652#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:15,067 INFO L290 TraceCheckUtils]: 15: Hoare triple {10652#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10653#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:15,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {10653#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10654#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:15,068 INFO L290 TraceCheckUtils]: 17: Hoare triple {10654#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10655#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:15,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {10655#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10656#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:15,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {10656#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10657#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:15,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {10657#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10658#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:15,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {10658#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10659#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:15,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {10659#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10660#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:15,071 INFO L290 TraceCheckUtils]: 23: Hoare triple {10660#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10661#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:15,071 INFO L290 TraceCheckUtils]: 24: Hoare triple {10661#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10662#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:15,072 INFO L290 TraceCheckUtils]: 25: Hoare triple {10662#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10663#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:15,072 INFO L290 TraceCheckUtils]: 26: Hoare triple {10663#(<= 499968 main_~y~0)} assume !(~y~0 > 0); {10643#false} is VALID [2022-04-15 06:50:15,072 INFO L272 TraceCheckUtils]: 27: Hoare triple {10643#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10643#false} is VALID [2022-04-15 06:50:15,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2022-04-15 06:50:15,073 INFO L290 TraceCheckUtils]: 29: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2022-04-15 06:50:15,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2022-04-15 06:50:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:15,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:15,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {10643#false} assume !false; {10643#false} is VALID [2022-04-15 06:50:15,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {10643#false} assume 0 == ~cond; {10643#false} is VALID [2022-04-15 06:50:15,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {10643#false} ~cond := #in~cond; {10643#false} is VALID [2022-04-15 06:50:15,638 INFO L272 TraceCheckUtils]: 27: Hoare triple {10643#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {10643#false} is VALID [2022-04-15 06:50:15,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {10770#(< 0 main_~y~0)} assume !(~y~0 > 0); {10643#false} is VALID [2022-04-15 06:50:15,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {10774#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10770#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:15,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {10778#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10774#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:15,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {10782#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10778#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:15,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {10786#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10782#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:15,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {10790#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10786#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:15,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {10794#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10790#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:15,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {10798#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10794#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:15,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {10802#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10798#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:15,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {10806#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10802#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:15,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {10810#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10806#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:15,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {10814#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10810#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:15,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {10818#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10814#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:15,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {10822#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10818#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:15,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {10826#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10822#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:15,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {10830#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10826#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:15,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {10834#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {10830#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:15,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {10834#(< 32 main_~y~0)} [119] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10834#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:15,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {10834#(< 32 main_~y~0)} [122] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_575 v_main_~y~0_574)) (.cse1 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse3 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse4 (= |v_main_#t~post5_109| |v_main_#t~post5_108|)) (.cse2 (<= 500000 v_main_~x~0_595))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_595 1000000)) (not .cse2)) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_595 v_main_~y~0_574))) (and .cse2 (< .cse5 (+ v_main_~y~0_575 1000001)) (= .cse5 (+ v_main_~x~0_594 v_main_~y~0_575)) (< v_main_~y~0_575 v_main_~y~0_574))))) InVars {main_~y~0=v_main_~y~0_575, main_#t~post5=|v_main_#t~post5_109|, main_~x~0=v_main_~x~0_595, main_#t~post6=|v_main_#t~post6_109|} OutVars{main_~y~0=v_main_~y~0_574, main_#t~post5=|v_main_#t~post5_108|, main_~x~0=v_main_~x~0_594, main_#t~post6=|v_main_#t~post6_108|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10834#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:15,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {10834#(< 32 main_~y~0)} [121] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10834#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:15,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {10834#(< 32 main_~y~0)} [120] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_104| |v_main_#t~post4_103|)) (.cse1 (= v_main_~x~0_593 v_main_~x~0_592))) (or (and (< v_main_~x~0_593 v_main_~x~0_592) (< v_main_~x~0_592 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_593 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_593, main_#t~post4=|v_main_#t~post4_104|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_103|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10834#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:15,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {10642#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10834#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:15,650 INFO L272 TraceCheckUtils]: 4: Hoare triple {10642#true} call #t~ret9 := main(); {10642#true} is VALID [2022-04-15 06:50:15,650 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10642#true} {10642#true} #52#return; {10642#true} is VALID [2022-04-15 06:50:15,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {10642#true} assume true; {10642#true} is VALID [2022-04-15 06:50:15,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {10642#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(17, 2);call #Ultimate.allocInit(12, 3); {10642#true} is VALID [2022-04-15 06:50:15,651 INFO L272 TraceCheckUtils]: 0: Hoare triple {10642#true} call ULTIMATE.init(); {10642#true} is VALID [2022-04-15 06:50:15,651 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:15,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930388021] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:15,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:15,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 37 [2022-04-15 06:50:16,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:16,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [133102854] [2022-04-15 06:50:16,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [133102854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:16,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:16,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:50:16,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530483731] [2022-04-15 06:50:16,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:16,573 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 84 [2022-04-15 06:50:16,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:16,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 06:50:16,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:16,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:50:16,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:50:16,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1704, Invalid=2586, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:50:16,642 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 06:50:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:20,359 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-04-15 06:50:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:50:20,359 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 84 [2022-04-15 06:50:20,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 06:50:20,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 106 transitions. [2022-04-15 06:50:20,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 06:50:20,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 106 transitions. [2022-04-15 06:50:20,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 106 transitions. [2022-04-15 06:50:20,460 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 06:50:20,461 INFO L225 Difference]: With dead ends: 167 [2022-04-15 06:50:20,461 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 06:50:20,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3984, Invalid=8448, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:50:20,463 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:20,463 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 44 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 06:50:20,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 06:50:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-15 06:50:20,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:20,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 06:50:20,596 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 06:50:20,596 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 06:50:20,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:20,598 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-04-15 06:50:20,598 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 06:50:20,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:20,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:20,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 90 states. [2022-04-15 06:50:20,598 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 90 states. [2022-04-15 06:50:20,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:20,600 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-04-15 06:50:20,600 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 06:50:20,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:20,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:20,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:20,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:20,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 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 06:50:20,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-04-15 06:50:20,602 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 84 [2022-04-15 06:50:20,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:20,602 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-04-15 06:50:20,602 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6326530612244898) internal successors, (80), 48 states have internal predecessors, (80), 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 06:50:20,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 93 transitions. [2022-04-15 06:50:20,682 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 06:50:20,682 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 06:50:20,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 06:50:20,683 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:20,683 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:20,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 06:50:20,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:20,887 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:20,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:20,888 INFO L85 PathProgramCache]: Analyzing trace with hash -945173960, now seen corresponding path program 17 times [2022-04-15 06:50:20,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:20,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [820919604] [2022-04-15 06:50:24,950 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:25,007 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:25,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:25,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1929240190, now seen corresponding path program 1 times [2022-04-15 06:50:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:25,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714459478] [2022-04-15 06:50:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:25,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:25,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:25,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {11705#(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(17, 2);call #Ultimate.allocInit(12, 3); {11682#true} is VALID [2022-04-15 06:50:25,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {11682#true} assume true; {11682#true} is VALID [2022-04-15 06:50:25,487 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11682#true} {11682#true} #52#return; {11682#true} is VALID [2022-04-15 06:50:25,487 INFO L272 TraceCheckUtils]: 0: Hoare triple {11682#true} call ULTIMATE.init(); {11705#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:25,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {11705#(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(17, 2);call #Ultimate.allocInit(12, 3); {11682#true} is VALID [2022-04-15 06:50:25,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {11682#true} assume true; {11682#true} is VALID [2022-04-15 06:50:25,488 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11682#true} {11682#true} #52#return; {11682#true} is VALID [2022-04-15 06:50:25,488 INFO L272 TraceCheckUtils]: 4: Hoare triple {11682#true} call #t~ret9 := main(); {11682#true} is VALID [2022-04-15 06:50:25,488 INFO L290 TraceCheckUtils]: 5: Hoare triple {11682#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11687#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:25,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {11687#(<= 500000 main_~y~0)} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11687#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:25,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {11687#(<= 500000 main_~y~0)} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11687#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:25,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {11687#(<= 500000 main_~y~0)} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_655)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and (< v_main_~x~0_654 1000001) (= (+ v_main_~x~0_655 v_main_~y~0_642) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_655 v_main_~x~0_654) .cse0) (and .cse1 .cse2 .cse3 (= v_main_~y~0_643 v_main_~y~0_642)) (and (or (not .cse0) (not (< v_main_~x~0_655 1000000))) .cse1 .cse2 .cse3 (= v_main_~y~0_642 v_main_~y~0_643)))) InVars {main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_642, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11687#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:25,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {11687#(<= 500000 main_~y~0)} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11687#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:25,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {11687#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11688#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:25,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {11688#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11689#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:25,491 INFO L290 TraceCheckUtils]: 12: Hoare triple {11689#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11690#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:25,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {11690#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11691#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:25,492 INFO L290 TraceCheckUtils]: 14: Hoare triple {11691#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11692#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:25,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {11692#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11693#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:25,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {11693#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11694#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:25,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {11694#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11695#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:25,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {11695#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11696#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:25,495 INFO L290 TraceCheckUtils]: 19: Hoare triple {11696#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11697#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:25,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {11697#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11698#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:25,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {11698#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11699#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:25,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {11699#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11700#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:25,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {11700#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11701#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:25,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {11701#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11702#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:25,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {11702#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11703#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:25,499 INFO L290 TraceCheckUtils]: 26: Hoare triple {11703#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11704#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:25,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {11704#(<= 499966 main_~y~0)} assume !(~y~0 > 0); {11683#false} is VALID [2022-04-15 06:50:25,499 INFO L272 TraceCheckUtils]: 28: Hoare triple {11683#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11683#false} is VALID [2022-04-15 06:50:25,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {11683#false} ~cond := #in~cond; {11683#false} is VALID [2022-04-15 06:50:25,500 INFO L290 TraceCheckUtils]: 30: Hoare triple {11683#false} assume 0 == ~cond; {11683#false} is VALID [2022-04-15 06:50:25,500 INFO L290 TraceCheckUtils]: 31: Hoare triple {11683#false} assume !false; {11683#false} is VALID [2022-04-15 06:50:25,500 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:25,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714459478] [2022-04-15 06:50:25,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714459478] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:25,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946824175] [2022-04-15 06:50:25,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:25,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:25,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:25,501 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 06:50:25,502 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 06:50:25,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:25,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 06:50:25,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:25,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:26,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {11682#true} call ULTIMATE.init(); {11682#true} is VALID [2022-04-15 06:50:26,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {11682#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(17, 2);call #Ultimate.allocInit(12, 3); {11682#true} is VALID [2022-04-15 06:50:26,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {11682#true} assume true; {11682#true} is VALID [2022-04-15 06:50:26,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11682#true} {11682#true} #52#return; {11682#true} is VALID [2022-04-15 06:50:26,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {11682#true} call #t~ret9 := main(); {11682#true} is VALID [2022-04-15 06:50:26,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {11682#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11724#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:50:26,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {11724#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11728#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:50:26,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {11728#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11728#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:50:26,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {11728#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_655)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and (< v_main_~x~0_654 1000001) (= (+ v_main_~x~0_655 v_main_~y~0_642) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_655 v_main_~x~0_654) .cse0) (and .cse1 .cse2 .cse3 (= v_main_~y~0_643 v_main_~y~0_642)) (and (or (not .cse0) (not (< v_main_~x~0_655 1000000))) .cse1 .cse2 .cse3 (= v_main_~y~0_642 v_main_~y~0_643)))) InVars {main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_642, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11735#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:50:26,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {11735#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11739#(< 999999 main_~y~0)} is VALID [2022-04-15 06:50:26,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {11739#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11743#(< 999997 main_~y~0)} is VALID [2022-04-15 06:50:26,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {11743#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11747#(< 999995 main_~y~0)} is VALID [2022-04-15 06:50:26,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {11747#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11751#(< 999993 main_~y~0)} is VALID [2022-04-15 06:50:26,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {11751#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11755#(< 999991 main_~y~0)} is VALID [2022-04-15 06:50:26,193 INFO L290 TraceCheckUtils]: 14: Hoare triple {11755#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11759#(< 999989 main_~y~0)} is VALID [2022-04-15 06:50:26,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {11759#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11763#(< 999987 main_~y~0)} is VALID [2022-04-15 06:50:26,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {11763#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11767#(< 999985 main_~y~0)} is VALID [2022-04-15 06:50:26,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {11767#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11771#(< 999983 main_~y~0)} is VALID [2022-04-15 06:50:26,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {11771#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11775#(< 999981 main_~y~0)} is VALID [2022-04-15 06:50:26,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {11775#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11779#(< 999979 main_~y~0)} is VALID [2022-04-15 06:50:26,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {11779#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11783#(< 999977 main_~y~0)} is VALID [2022-04-15 06:50:26,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {11783#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11787#(< 999975 main_~y~0)} is VALID [2022-04-15 06:50:26,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {11787#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11791#(< 999973 main_~y~0)} is VALID [2022-04-15 06:50:26,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {11791#(< 999973 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11795#(< 999971 main_~y~0)} is VALID [2022-04-15 06:50:26,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {11795#(< 999971 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11799#(< 999969 main_~y~0)} is VALID [2022-04-15 06:50:26,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {11799#(< 999969 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11803#(< 999967 main_~y~0)} is VALID [2022-04-15 06:50:26,200 INFO L290 TraceCheckUtils]: 26: Hoare triple {11803#(< 999967 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11807#(< 999965 main_~y~0)} is VALID [2022-04-15 06:50:26,200 INFO L290 TraceCheckUtils]: 27: Hoare triple {11807#(< 999965 main_~y~0)} assume !(~y~0 > 0); {11683#false} is VALID [2022-04-15 06:50:26,200 INFO L272 TraceCheckUtils]: 28: Hoare triple {11683#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11683#false} is VALID [2022-04-15 06:50:26,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {11683#false} ~cond := #in~cond; {11683#false} is VALID [2022-04-15 06:50:26,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {11683#false} assume 0 == ~cond; {11683#false} is VALID [2022-04-15 06:50:26,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {11683#false} assume !false; {11683#false} is VALID [2022-04-15 06:50:26,201 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:26,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:27,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {11683#false} assume !false; {11683#false} is VALID [2022-04-15 06:50:27,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {11683#false} assume 0 == ~cond; {11683#false} is VALID [2022-04-15 06:50:27,091 INFO L290 TraceCheckUtils]: 29: Hoare triple {11683#false} ~cond := #in~cond; {11683#false} is VALID [2022-04-15 06:50:27,091 INFO L272 TraceCheckUtils]: 28: Hoare triple {11683#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {11683#false} is VALID [2022-04-15 06:50:27,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {11835#(< 0 main_~y~0)} assume !(~y~0 > 0); {11683#false} is VALID [2022-04-15 06:50:27,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {11839#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11835#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:27,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {11843#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11839#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:27,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {11847#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11843#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:27,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {11851#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11847#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:27,094 INFO L290 TraceCheckUtils]: 22: Hoare triple {11855#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11851#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:27,094 INFO L290 TraceCheckUtils]: 21: Hoare triple {11859#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11855#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:27,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {11863#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11859#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:27,096 INFO L290 TraceCheckUtils]: 19: Hoare triple {11867#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11863#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:27,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {11871#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11867#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:27,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {11875#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11871#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:27,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {11879#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11875#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:27,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {11883#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11879#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:27,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {11887#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11883#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:27,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {11891#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11887#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:27,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {11895#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11891#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:27,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {11899#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11895#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:27,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {11903#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {11899#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:27,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {11907#(or (< main_~x~0 1000000) (< 34 main_~y~0))} [123] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11903#(< 34 main_~y~0)} is VALID [2022-04-15 06:50:27,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {11911#(and (or (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999966)) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} [126] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_655)) (.cse1 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= v_main_~x~0_655 v_main_~x~0_654)) (.cse3 (= |v_main_#t~post6_116| |v_main_#t~post6_115|))) (or (and (< v_main_~x~0_654 1000001) (= (+ v_main_~x~0_655 v_main_~y~0_642) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_655 v_main_~x~0_654) .cse0) (and .cse1 .cse2 .cse3 (= v_main_~y~0_643 v_main_~y~0_642)) (and (or (not .cse0) (not (< v_main_~x~0_655 1000000))) .cse1 .cse2 .cse3 (= v_main_~y~0_642 v_main_~y~0_643)))) InVars {main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_655, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_642, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {11907#(or (< main_~x~0 1000000) (< 34 main_~y~0))} is VALID [2022-04-15 06:50:27,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {11911#(and (or (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999966)) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} [125] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11911#(and (or (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999966)) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} is VALID [2022-04-15 06:50:27,103 INFO L290 TraceCheckUtils]: 6: Hoare triple {11918#(and (or (and (<= 0 (+ main_~y~0 499965)) (< main_~x~0 (+ main_~y~0 999966))) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} [124] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_653 v_main_~x~0_652)) (.cse1 (= |v_main_#t~post4_110| |v_main_#t~post4_109|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_653)) (and (< v_main_~x~0_653 v_main_~x~0_652) (< v_main_~x~0_652 500001)))) InVars {main_~x~0=v_main_~x~0_653, main_#t~post4=|v_main_#t~post4_110|} OutVars{main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_109|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11911#(and (or (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999966)) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} is VALID [2022-04-15 06:50:27,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {11682#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11918#(and (or (and (<= 0 (+ main_~y~0 499965)) (< main_~x~0 (+ main_~y~0 999966))) (<= 34 main_~y~0)) (or (< main_~x~0 1000000) (< 34 main_~y~0)))} is VALID [2022-04-15 06:50:27,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {11682#true} call #t~ret9 := main(); {11682#true} is VALID [2022-04-15 06:50:27,104 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11682#true} {11682#true} #52#return; {11682#true} is VALID [2022-04-15 06:50:27,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {11682#true} assume true; {11682#true} is VALID [2022-04-15 06:50:27,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {11682#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(17, 2);call #Ultimate.allocInit(12, 3); {11682#true} is VALID [2022-04-15 06:50:27,104 INFO L272 TraceCheckUtils]: 0: Hoare triple {11682#true} call ULTIMATE.init(); {11682#true} is VALID [2022-04-15 06:50:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:27,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946824175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:27,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:27,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 23] total 63 [2022-04-15 06:50:28,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [820919604] [2022-04-15 06:50:28,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [820919604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:28,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:28,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:50:28,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777892655] [2022-04-15 06:50:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:28,387 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 89 [2022-04-15 06:50:28,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:28,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 06:50:28,462 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 06:50:28,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:50:28,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:28,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:50:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3078, Invalid=5478, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:50:28,466 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 06:50:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:32,937 INFO L93 Difference]: Finished difference Result 177 states and 188 transitions. [2022-04-15 06:50:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:50:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 89 [2022-04-15 06:50:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:32,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 06:50:32,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-15 06:50:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 06:50:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 111 transitions. [2022-04-15 06:50:32,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 111 transitions. [2022-04-15 06:50:33,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:33,055 INFO L225 Difference]: With dead ends: 177 [2022-04-15 06:50:33,055 INFO L226 Difference]: Without dead ends: 95 [2022-04-15 06:50:33,057 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6833 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5815, Invalid=14207, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 06:50:33,058 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 138 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:33,058 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 29 Invalid, 2089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 06:50:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-15 06:50:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-04-15 06:50:33,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:33,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,222 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,222 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:33,224 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:50:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:50:33,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:33,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:33,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,225 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:33,226 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 06:50:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:50:33,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:33,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:33,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:33,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:33,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0444444444444445) internal successors, (94), 90 states have internal predecessors, (94), 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 06:50:33,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 98 transitions. [2022-04-15 06:50:33,228 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 98 transitions. Word has length 89 [2022-04-15 06:50:33,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:33,228 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 98 transitions. [2022-04-15 06:50:33,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 51 states have internal predecessors, (85), 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 06:50:33,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 98 transitions. [2022-04-15 06:50:33,324 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 06:50:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 98 transitions. [2022-04-15 06:50:33,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 06:50:33,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:33,324 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:33,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 06:50:33,547 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:33,547 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:33,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:33,548 INFO L85 PathProgramCache]: Analyzing trace with hash 140017013, now seen corresponding path program 18 times [2022-04-15 06:50:33,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:33,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1471091457] [2022-04-15 06:50:33,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:33,880 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:33,881 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:33,884 INFO L85 PathProgramCache]: Analyzing trace with hash 47272225, now seen corresponding path program 1 times [2022-04-15 06:50:33,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:33,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100692836] [2022-04-15 06:50:33,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:33,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:34,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:34,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {12828#(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(17, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 06:50:34,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 06:50:34,193 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12801#true} {12801#true} #52#return; {12801#true} is VALID [2022-04-15 06:50:34,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:34,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {12828#(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(17, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 06:50:34,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 06:50:34,194 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #52#return; {12801#true} is VALID [2022-04-15 06:50:34,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret9 := main(); {12801#true} is VALID [2022-04-15 06:50:34,194 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12806#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:50:34,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {12806#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_117| |v_main_#t~post4_116|)) (.cse1 (= v_main_~x~0_717 v_main_~x~0_716))) (or (and (< v_main_~x~0_716 500001) (< v_main_~x~0_717 v_main_~x~0_716)) (and .cse0 .cse1 (not (< v_main_~x~0_717 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_717, main_#t~post4=|v_main_#t~post4_117|} OutVars{main_~x~0=v_main_~x~0_716, main_#t~post4=|v_main_#t~post4_116|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12807#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:50:34,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {12807#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12807#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:50:34,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {12807#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_719)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse3 (= v_main_~x~0_719 v_main_~x~0_718)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714))) (or (and (< v_main_~x~0_719 v_main_~x~0_718) (< v_main_~x~0_718 1000001) .cse0 (= (+ v_main_~x~0_719 v_main_~y~0_714) (+ v_main_~x~0_718 v_main_~y~0_715))) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_719 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_719, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_718, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12808#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:50:34,196 INFO L290 TraceCheckUtils]: 9: Hoare triple {12808#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12809#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:34,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {12809#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12810#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:34,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {12810#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12811#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:34,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {12811#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12812#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:34,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {12812#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12813#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:34,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {12813#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12814#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:34,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {12814#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12815#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:34,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {12815#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12816#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:34,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {12816#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12817#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:34,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {12817#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12818#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:34,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {12818#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12819#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:34,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {12819#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12820#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:34,205 INFO L290 TraceCheckUtils]: 21: Hoare triple {12820#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12821#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:34,206 INFO L290 TraceCheckUtils]: 22: Hoare triple {12821#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12822#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:34,206 INFO L290 TraceCheckUtils]: 23: Hoare triple {12822#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12823#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:34,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {12823#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12824#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:34,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {12824#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12825#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:34,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {12825#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12826#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:34,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {12826#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12827#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:50:34,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {12827#(<= 499964 main_~y~0)} assume !(~y~0 > 0); {12802#false} is VALID [2022-04-15 06:50:34,209 INFO L272 TraceCheckUtils]: 29: Hoare triple {12802#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12802#false} is VALID [2022-04-15 06:50:34,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {12802#false} ~cond := #in~cond; {12802#false} is VALID [2022-04-15 06:50:34,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {12802#false} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 06:50:34,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 06:50:34,210 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:34,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100692836] [2022-04-15 06:50:34,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100692836] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:34,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736259382] [2022-04-15 06:50:34,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:34,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:34,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:34,216 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 06:50:34,217 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 06:50:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:34,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:50:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:34,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:34,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12801#true} is VALID [2022-04-15 06:50:34,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#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(17, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 06:50:34,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 06:50:34,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #52#return; {12801#true} is VALID [2022-04-15 06:50:34,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret9 := main(); {12801#true} is VALID [2022-04-15 06:50:34,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12847#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:50:34,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {12847#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_117| |v_main_#t~post4_116|)) (.cse1 (= v_main_~x~0_717 v_main_~x~0_716))) (or (and (< v_main_~x~0_716 500001) (< v_main_~x~0_717 v_main_~x~0_716)) (and .cse0 .cse1 (not (< v_main_~x~0_717 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_717, main_#t~post4=|v_main_#t~post4_117|} OutVars{main_~x~0=v_main_~x~0_716, main_#t~post4=|v_main_#t~post4_116|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12851#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:50:34,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {12851#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12851#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:50:34,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {12851#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_719)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse3 (= v_main_~x~0_719 v_main_~x~0_718)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714))) (or (and (< v_main_~x~0_719 v_main_~x~0_718) (< v_main_~x~0_718 1000001) .cse0 (= (+ v_main_~x~0_719 v_main_~y~0_714) (+ v_main_~x~0_718 v_main_~y~0_715))) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_719 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_719, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_718, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12858#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:50:34,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {12858#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12862#(< 999999 main_~y~0)} is VALID [2022-04-15 06:50:34,895 INFO L290 TraceCheckUtils]: 10: Hoare triple {12862#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12866#(< 999997 main_~y~0)} is VALID [2022-04-15 06:50:34,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {12866#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12870#(< 999995 main_~y~0)} is VALID [2022-04-15 06:50:34,896 INFO L290 TraceCheckUtils]: 12: Hoare triple {12870#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12874#(< 999993 main_~y~0)} is VALID [2022-04-15 06:50:34,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {12874#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12878#(< 999991 main_~y~0)} is VALID [2022-04-15 06:50:34,897 INFO L290 TraceCheckUtils]: 14: Hoare triple {12878#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12882#(< 999989 main_~y~0)} is VALID [2022-04-15 06:50:34,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {12882#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12886#(< 999987 main_~y~0)} is VALID [2022-04-15 06:50:34,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {12886#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12890#(< 999985 main_~y~0)} is VALID [2022-04-15 06:50:34,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {12890#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12894#(< 999983 main_~y~0)} is VALID [2022-04-15 06:50:34,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {12894#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12898#(< 999981 main_~y~0)} is VALID [2022-04-15 06:50:34,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {12898#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12902#(< 999979 main_~y~0)} is VALID [2022-04-15 06:50:34,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {12902#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12906#(< 999977 main_~y~0)} is VALID [2022-04-15 06:50:34,901 INFO L290 TraceCheckUtils]: 21: Hoare triple {12906#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12910#(< 999975 main_~y~0)} is VALID [2022-04-15 06:50:34,901 INFO L290 TraceCheckUtils]: 22: Hoare triple {12910#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12914#(< 999973 main_~y~0)} is VALID [2022-04-15 06:50:34,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {12914#(< 999973 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12918#(< 999971 main_~y~0)} is VALID [2022-04-15 06:50:34,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {12918#(< 999971 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12922#(< 999969 main_~y~0)} is VALID [2022-04-15 06:50:34,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {12922#(< 999969 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12926#(< 999967 main_~y~0)} is VALID [2022-04-15 06:50:34,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {12926#(< 999967 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12930#(< 999965 main_~y~0)} is VALID [2022-04-15 06:50:34,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {12930#(< 999965 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12934#(< 999963 main_~y~0)} is VALID [2022-04-15 06:50:34,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {12934#(< 999963 main_~y~0)} assume !(~y~0 > 0); {12802#false} is VALID [2022-04-15 06:50:34,905 INFO L272 TraceCheckUtils]: 29: Hoare triple {12802#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12802#false} is VALID [2022-04-15 06:50:34,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {12802#false} ~cond := #in~cond; {12802#false} is VALID [2022-04-15 06:50:34,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {12802#false} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 06:50:34,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 06:50:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:34,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:35,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {12802#false} assume !false; {12802#false} is VALID [2022-04-15 06:50:35,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {12802#false} assume 0 == ~cond; {12802#false} is VALID [2022-04-15 06:50:35,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {12802#false} ~cond := #in~cond; {12802#false} is VALID [2022-04-15 06:50:35,930 INFO L272 TraceCheckUtils]: 29: Hoare triple {12802#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {12802#false} is VALID [2022-04-15 06:50:35,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {12962#(< 0 main_~y~0)} assume !(~y~0 > 0); {12802#false} is VALID [2022-04-15 06:50:35,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {12966#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12962#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:35,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {12970#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12966#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:35,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {12974#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12970#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:35,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {12978#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12974#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:35,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {12982#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12978#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:35,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {12986#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12982#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:35,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {12990#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12986#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:35,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {12994#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12990#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:35,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {12998#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12994#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:35,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {13002#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {12998#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:35,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {13006#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13002#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:35,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {13010#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13006#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:35,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {13014#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13010#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:35,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {13018#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13014#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:35,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {13022#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13018#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:35,941 INFO L290 TraceCheckUtils]: 12: Hoare triple {13026#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13022#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:35,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {13030#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13026#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:35,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {13034#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {13030#(< 34 main_~y~0)} is VALID [2022-04-15 06:50:35,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {13038#(or (< main_~x~0 1000000) (< 36 main_~y~0))} [127] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13034#(< 36 main_~y~0)} is VALID [2022-04-15 06:50:35,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {13042#(and (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999964))))} [130] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_719)) (.cse1 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse2 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse3 (= v_main_~x~0_719 v_main_~x~0_718)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714))) (or (and (< v_main_~x~0_719 v_main_~x~0_718) (< v_main_~x~0_718 1000001) .cse0 (= (+ v_main_~x~0_719 v_main_~y~0_714) (+ v_main_~x~0_718 v_main_~y~0_715))) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_719 1000000)) (not .cse0))) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_719, main_#t~post6=|v_main_#t~post6_123|} OutVars{main_~y~0=v_main_~y~0_714, main_#t~post5=|v_main_#t~post5_122|, main_~x~0=v_main_~x~0_718, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13038#(or (< main_~x~0 1000000) (< 36 main_~y~0))} is VALID [2022-04-15 06:50:35,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {13042#(and (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999964))))} [129] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13042#(and (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999964))))} is VALID [2022-04-15 06:50:35,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {13049#(and (<= 0 (+ 499963 main_~y~0)) (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999964))))} [128] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_117| |v_main_#t~post4_116|)) (.cse1 (= v_main_~x~0_717 v_main_~x~0_716))) (or (and (< v_main_~x~0_716 500001) (< v_main_~x~0_717 v_main_~x~0_716)) (and .cse0 .cse1 (not (< v_main_~x~0_717 500000))) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_717, main_#t~post4=|v_main_#t~post4_117|} OutVars{main_~x~0=v_main_~x~0_716, main_#t~post4=|v_main_#t~post4_116|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13042#(and (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999964))))} is VALID [2022-04-15 06:50:35,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {12801#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13049#(and (<= 0 (+ 499963 main_~y~0)) (or (< main_~x~0 1000000) (< 36 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999964))))} is VALID [2022-04-15 06:50:35,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {12801#true} call #t~ret9 := main(); {12801#true} is VALID [2022-04-15 06:50:35,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12801#true} {12801#true} #52#return; {12801#true} is VALID [2022-04-15 06:50:35,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {12801#true} assume true; {12801#true} is VALID [2022-04-15 06:50:35,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {12801#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(17, 2);call #Ultimate.allocInit(12, 3); {12801#true} is VALID [2022-04-15 06:50:35,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {12801#true} call ULTIMATE.init(); {12801#true} is VALID [2022-04-15 06:50:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:50:35,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736259382] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:35,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:35,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 69 [2022-04-15 06:50:37,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:37,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1471091457] [2022-04-15 06:50:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1471091457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:37,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:37,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:50:37,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704229729] [2022-04-15 06:50:37,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:37,379 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:37,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:37,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:37,447 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 06:50:37,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:50:37,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:37,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:50:37,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3615, Invalid=6687, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 06:50:37,449 INFO L87 Difference]: Start difference. First operand 95 states and 98 transitions. Second operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:43,040 INFO L93 Difference]: Finished difference Result 247 states and 258 transitions. [2022-04-15 06:50:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:50:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2022-04-15 06:50:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 116 transitions. [2022-04-15 06:50:43,044 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 116 transitions. [2022-04-15 06:50:43,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:43,165 INFO L225 Difference]: With dead ends: 247 [2022-04-15 06:50:43,165 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 06:50:43,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8210 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=6667, Invalid=16895, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:50:43,168 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2279 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 2279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:43,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 29 Invalid, 2579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 2279 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:50:43,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 06:50:43,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-04-15 06:50:43,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:43,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 06:50:43,511 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 06:50:43,511 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 06:50:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:43,514 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2022-04-15 06:50:43,514 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-15 06:50:43,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:43,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:43,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 160 states. [2022-04-15 06:50:43,515 INFO L87 Difference]: Start difference. First operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 160 states. [2022-04-15 06:50:43,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:43,517 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2022-04-15 06:50:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-15 06:50:43,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:43,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:43,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:43,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 155 states have (on average 1.032258064516129) internal successors, (160), 155 states have internal predecessors, (160), 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 06:50:43,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 164 transitions. [2022-04-15 06:50:43,520 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 164 transitions. Word has length 94 [2022-04-15 06:50:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:43,521 INFO L478 AbstractCegarLoop]: Abstraction has 160 states and 164 transitions. [2022-04-15 06:50:43,521 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.6363636363636365) internal successors, (90), 54 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 06:50:43,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 160 states and 164 transitions. [2022-04-15 06:50:43,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 164 transitions. [2022-04-15 06:50:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 06:50:43,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:43,693 INFO L499 BasicCegarLoop]: trace histogram [33, 32, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:43,719 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 06:50:43,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:43,894 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:43,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:43,894 INFO L85 PathProgramCache]: Analyzing trace with hash -168854935, now seen corresponding path program 19 times [2022-04-15 06:50:43,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:43,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1394846457] [2022-04-15 06:50:44,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:44,242 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:44,243 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:44,249 INFO L85 PathProgramCache]: Analyzing trace with hash 438695778, now seen corresponding path program 1 times [2022-04-15 06:50:44,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:44,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361165394] [2022-04-15 06:50:44,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:44,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:44,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:44,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:44,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {14366#(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(17, 2);call #Ultimate.allocInit(12, 3); {14341#true} is VALID [2022-04-15 06:50:44,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {14341#true} assume true; {14341#true} is VALID [2022-04-15 06:50:44,603 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14341#true} {14341#true} #52#return; {14341#true} is VALID [2022-04-15 06:50:44,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {14341#true} call ULTIMATE.init(); {14366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:44,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {14366#(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(17, 2);call #Ultimate.allocInit(12, 3); {14341#true} is VALID [2022-04-15 06:50:44,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {14341#true} assume true; {14341#true} is VALID [2022-04-15 06:50:44,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14341#true} {14341#true} #52#return; {14341#true} is VALID [2022-04-15 06:50:44,605 INFO L272 TraceCheckUtils]: 4: Hoare triple {14341#true} call #t~ret9 := main(); {14341#true} is VALID [2022-04-15 06:50:44,605 INFO L290 TraceCheckUtils]: 5: Hoare triple {14341#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:44,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {14346#(<= 500000 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_124| |v_main_#t~post4_123|)) (.cse1 (= v_main_~x~0_784 v_main_~x~0_783))) (or (and (not (< v_main_~x~0_784 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_783 500001) (< v_main_~x~0_784 v_main_~x~0_783)))) InVars {main_~x~0=v_main_~x~0_784, main_#t~post4=|v_main_#t~post4_124|} OutVars{main_~x~0=v_main_~x~0_783, main_#t~post4=|v_main_#t~post4_123|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:44,606 INFO L290 TraceCheckUtils]: 7: Hoare triple {14346#(<= 500000 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:44,607 INFO L290 TraceCheckUtils]: 8: Hoare triple {14346#(<= 500000 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_786)) (.cse1 (= v_main_~x~0_786 v_main_~x~0_785)) (.cse2 (= v_main_~y~0_791 v_main_~y~0_790)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (or (not (< v_main_~x~0_786 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_786 v_main_~x~0_785) (< v_main_~x~0_785 1000001) (= (+ v_main_~x~0_785 v_main_~y~0_791) (+ v_main_~x~0_786 v_main_~y~0_790)) .cse0) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_791, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_786, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_785, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:44,607 INFO L290 TraceCheckUtils]: 9: Hoare triple {14346#(<= 500000 main_~y~0)} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:44,608 INFO L290 TraceCheckUtils]: 10: Hoare triple {14346#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14347#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:44,608 INFO L290 TraceCheckUtils]: 11: Hoare triple {14347#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14348#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:44,609 INFO L290 TraceCheckUtils]: 12: Hoare triple {14348#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14349#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:44,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {14349#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14350#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:44,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {14350#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14351#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:44,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {14351#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14352#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:44,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {14352#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14353#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:44,612 INFO L290 TraceCheckUtils]: 17: Hoare triple {14353#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14354#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:44,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {14354#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14355#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:44,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {14355#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14356#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:44,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {14356#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14357#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:44,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {14357#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14358#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:44,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {14358#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14359#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:44,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {14359#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14360#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:44,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14361#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:44,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {14361#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14362#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:44,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {14362#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14363#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:44,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {14363#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14364#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:50:44,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {14364#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14365#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:50:44,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {14365#(<= 499962 main_~y~0)} assume !(~y~0 > 0); {14342#false} is VALID [2022-04-15 06:50:44,620 INFO L272 TraceCheckUtils]: 30: Hoare triple {14342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14342#false} is VALID [2022-04-15 06:50:44,620 INFO L290 TraceCheckUtils]: 31: Hoare triple {14342#false} ~cond := #in~cond; {14342#false} is VALID [2022-04-15 06:50:44,620 INFO L290 TraceCheckUtils]: 32: Hoare triple {14342#false} assume 0 == ~cond; {14342#false} is VALID [2022-04-15 06:50:44,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {14342#false} assume !false; {14342#false} is VALID [2022-04-15 06:50:44,620 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:44,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361165394] [2022-04-15 06:50:44,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361165394] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:44,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911765108] [2022-04-15 06:50:44,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:44,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:44,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:44,623 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 06:50:44,633 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 06:50:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:44,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 06:50:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:44,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:45,025 INFO L272 TraceCheckUtils]: 0: Hoare triple {14341#true} call ULTIMATE.init(); {14341#true} is VALID [2022-04-15 06:50:45,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {14341#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(17, 2);call #Ultimate.allocInit(12, 3); {14341#true} is VALID [2022-04-15 06:50:45,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {14341#true} assume true; {14341#true} is VALID [2022-04-15 06:50:45,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14341#true} {14341#true} #52#return; {14341#true} is VALID [2022-04-15 06:50:45,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {14341#true} call #t~ret9 := main(); {14341#true} is VALID [2022-04-15 06:50:45,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {14341#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:45,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {14346#(<= 500000 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_124| |v_main_#t~post4_123|)) (.cse1 (= v_main_~x~0_784 v_main_~x~0_783))) (or (and (not (< v_main_~x~0_784 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_783 500001) (< v_main_~x~0_784 v_main_~x~0_783)))) InVars {main_~x~0=v_main_~x~0_784, main_#t~post4=|v_main_#t~post4_124|} OutVars{main_~x~0=v_main_~x~0_783, main_#t~post4=|v_main_#t~post4_123|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:45,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {14346#(<= 500000 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:45,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {14346#(<= 500000 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_786)) (.cse1 (= v_main_~x~0_786 v_main_~x~0_785)) (.cse2 (= v_main_~y~0_791 v_main_~y~0_790)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (or (not (< v_main_~x~0_786 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_786 v_main_~x~0_785) (< v_main_~x~0_785 1000001) (= (+ v_main_~x~0_785 v_main_~y~0_791) (+ v_main_~x~0_786 v_main_~y~0_790)) .cse0) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_791, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_786, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_785, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:45,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {14346#(<= 500000 main_~y~0)} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14346#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:45,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {14346#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14347#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:45,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {14347#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14348#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:45,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {14348#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14349#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:45,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {14349#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14350#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:45,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {14350#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14351#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:45,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {14351#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14352#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:45,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {14352#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14353#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:45,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {14353#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14354#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:45,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {14354#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14355#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:45,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {14355#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14356#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:45,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {14356#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14357#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:45,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {14357#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14358#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:45,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {14358#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14359#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:45,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {14359#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14360#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:45,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {14360#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14361#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:45,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {14361#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14362#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:45,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {14362#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14363#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:45,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {14363#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14364#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:50:45,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {14364#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14365#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:50:45,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {14365#(<= 499962 main_~y~0)} assume !(~y~0 > 0); {14342#false} is VALID [2022-04-15 06:50:45,038 INFO L272 TraceCheckUtils]: 30: Hoare triple {14342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14342#false} is VALID [2022-04-15 06:50:45,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {14342#false} ~cond := #in~cond; {14342#false} is VALID [2022-04-15 06:50:45,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {14342#false} assume 0 == ~cond; {14342#false} is VALID [2022-04-15 06:50:45,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {14342#false} assume !false; {14342#false} is VALID [2022-04-15 06:50:45,039 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:45,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:45,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {14342#false} assume !false; {14342#false} is VALID [2022-04-15 06:50:45,747 INFO L290 TraceCheckUtils]: 32: Hoare triple {14342#false} assume 0 == ~cond; {14342#false} is VALID [2022-04-15 06:50:45,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {14342#false} ~cond := #in~cond; {14342#false} is VALID [2022-04-15 06:50:45,747 INFO L272 TraceCheckUtils]: 30: Hoare triple {14342#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {14342#false} is VALID [2022-04-15 06:50:45,747 INFO L290 TraceCheckUtils]: 29: Hoare triple {14481#(< 0 main_~y~0)} assume !(~y~0 > 0); {14342#false} is VALID [2022-04-15 06:50:45,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {14485#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14481#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:45,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {14489#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14485#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:45,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {14493#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14489#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:45,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {14497#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14493#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:45,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {14501#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14497#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:45,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {14505#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14501#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:45,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {14509#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14505#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:45,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {14513#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14509#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:45,752 INFO L290 TraceCheckUtils]: 20: Hoare triple {14517#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14513#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:45,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {14521#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14517#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:45,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {14525#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14521#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:45,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {14529#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14525#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:45,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {14533#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14529#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:45,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {14537#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14533#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:45,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {14541#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14537#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:45,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {14545#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14541#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:45,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {14549#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14545#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:45,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {14553#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14549#(< 34 main_~y~0)} is VALID [2022-04-15 06:50:45,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {14557#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {14553#(< 36 main_~y~0)} is VALID [2022-04-15 06:50:45,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {14557#(< 38 main_~y~0)} [131] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14557#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:45,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {14557#(< 38 main_~y~0)} [134] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_786)) (.cse1 (= v_main_~x~0_786 v_main_~x~0_785)) (.cse2 (= v_main_~y~0_791 v_main_~y~0_790)) (.cse3 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse4 (= |v_main_#t~post6_130| |v_main_#t~post6_129|))) (or (and (or (not (< v_main_~x~0_786 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_786 v_main_~x~0_785) (< v_main_~x~0_785 1000001) (= (+ v_main_~x~0_785 v_main_~y~0_791) (+ v_main_~x~0_786 v_main_~y~0_790)) .cse0) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_791, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_786, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_785, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14557#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:45,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {14557#(< 38 main_~y~0)} [133] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14557#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:45,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {14557#(< 38 main_~y~0)} [132] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_124| |v_main_#t~post4_123|)) (.cse1 (= v_main_~x~0_784 v_main_~x~0_783))) (or (and (not (< v_main_~x~0_784 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_783 500001) (< v_main_~x~0_784 v_main_~x~0_783)))) InVars {main_~x~0=v_main_~x~0_784, main_#t~post4=|v_main_#t~post4_124|} OutVars{main_~x~0=v_main_~x~0_783, main_#t~post4=|v_main_#t~post4_123|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14557#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:45,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {14341#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14557#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:45,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {14341#true} call #t~ret9 := main(); {14341#true} is VALID [2022-04-15 06:50:45,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14341#true} {14341#true} #52#return; {14341#true} is VALID [2022-04-15 06:50:45,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {14341#true} assume true; {14341#true} is VALID [2022-04-15 06:50:45,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {14341#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(17, 2);call #Ultimate.allocInit(12, 3); {14341#true} is VALID [2022-04-15 06:50:45,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {14341#true} call ULTIMATE.init(); {14341#true} is VALID [2022-04-15 06:50:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:45,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911765108] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:45,768 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 43 [2022-04-15 06:50:46,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:46,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1394846457] [2022-04-15 06:50:46,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1394846457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:46,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:46,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:50:46,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660552356] [2022-04-15 06:50:46,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:46,953 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 97 [2022-04-15 06:50:46,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:46,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 06:50:47,032 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 06:50:47,032 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:50:47,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:47,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:50:47,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2324, Invalid=3528, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 06:50:47,033 INFO L87 Difference]: Start difference. First operand 160 states and 164 transitions. Second operand has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 06:50:52,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:52,281 INFO L93 Difference]: Finished difference Result 255 states and 269 transitions. [2022-04-15 06:50:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:50:52,281 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 97 [2022-04-15 06:50:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:50:52,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 06:50:52,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 121 transitions. [2022-04-15 06:50:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 06:50:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 121 transitions. [2022-04-15 06:50:52,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 121 transitions. [2022-04-15 06:50:52,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:50:52,410 INFO L225 Difference]: With dead ends: 255 [2022-04-15 06:50:52,410 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 06:50:52,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4898 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5426, Invalid=11604, Unknown=0, NotChecked=0, Total=17030 [2022-04-15 06:50:52,412 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 114 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 2513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:50:52,412 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 44 Invalid, 2513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 06:50:52,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 06:50:52,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 103. [2022-04-15 06:50:52,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:50:52,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 06:50:52,592 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 06:50:52,592 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 06:50:52,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:52,596 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2022-04-15 06:50:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2022-04-15 06:50:52,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:52,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:52,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 167 states. [2022-04-15 06:50:52,597 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 167 states. [2022-04-15 06:50:52,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:50:52,600 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2022-04-15 06:50:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 171 transitions. [2022-04-15 06:50:52,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:50:52,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:50:52,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:50:52,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:50:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0408163265306123) internal successors, (102), 98 states have internal predecessors, (102), 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 06:50:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2022-04-15 06:50:52,603 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 97 [2022-04-15 06:50:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:50:52,603 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2022-04-15 06:50:52,604 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.631578947368421) internal successors, (93), 56 states have internal predecessors, (93), 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 06:50:52,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2022-04-15 06:50:52,715 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 06:50:52,716 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-04-15 06:50:52,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 06:50:52,716 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:50:52,716 INFO L499 BasicCegarLoop]: trace histogram [35, 34, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:50:52,741 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 06:50:52,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:52,917 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:50:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:50:52,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1165760156, now seen corresponding path program 20 times [2022-04-15 06:50:52,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:52,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1919066124] [2022-04-15 06:50:55,192 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:50:55,247 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:55,488 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:50:55,489 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:50:55,491 INFO L85 PathProgramCache]: Analyzing trace with hash -2115733695, now seen corresponding path program 1 times [2022-04-15 06:50:55,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:50:55,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608373887] [2022-04-15 06:50:55,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:55,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:50:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:55,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:50:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:55,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {15808#(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(17, 2);call #Ultimate.allocInit(12, 3); {15782#true} is VALID [2022-04-15 06:50:55,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 06:50:55,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15782#true} {15782#true} #52#return; {15782#true} is VALID [2022-04-15 06:50:55,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15808#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:50:55,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {15808#(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(17, 2);call #Ultimate.allocInit(12, 3); {15782#true} is VALID [2022-04-15 06:50:55,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 06:50:55,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #52#return; {15782#true} is VALID [2022-04-15 06:50:55,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret9 := main(); {15782#true} is VALID [2022-04-15 06:50:55,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:55,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {15787#(<= 500000 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_130| |v_main_#t~post4_129|)) (.cse1 (= v_main_~x~0_852 v_main_~x~0_851))) (or (and .cse0 .cse1) (and (< v_main_~x~0_851 500001) (< v_main_~x~0_852 v_main_~x~0_851)) (and (not (< v_main_~x~0_852 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_852, main_#t~post4=|v_main_#t~post4_130|} OutVars{main_~x~0=v_main_~x~0_851, main_#t~post4=|v_main_#t~post4_129|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:55,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {15787#(<= 500000 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:55,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {15787#(<= 500000 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~x~0_854 v_main_~x~0_853)) (.cse2 (<= 500000 v_main_~x~0_854))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_854 1000000)) (not .cse2)) (= v_main_~y~0_869 v_main_~y~0_870) .cse3) (and .cse0 .cse1 (= v_main_~y~0_870 v_main_~y~0_869) .cse3) (let ((.cse4 (+ v_main_~x~0_854 v_main_~y~0_869))) (and (< v_main_~y~0_870 v_main_~y~0_869) (= (+ v_main_~x~0_853 v_main_~y~0_870) .cse4) (< .cse4 (+ v_main_~y~0_870 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_870, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_854, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_853, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:55,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {15787#(<= 500000 main_~y~0)} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:55,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {15787#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15788#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:55,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {15788#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15789#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:55,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {15789#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15790#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:55,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15791#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:55,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15792#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:55,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {15792#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15793#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:55,841 INFO L290 TraceCheckUtils]: 16: Hoare triple {15793#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15794#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:55,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {15794#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15795#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:55,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {15795#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15796#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:55,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {15796#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15797#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:55,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {15797#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15798#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:55,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {15798#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15799#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:55,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {15799#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15800#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:55,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {15800#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15801#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:55,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {15801#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15802#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:55,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {15802#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15803#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:55,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {15803#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15804#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:55,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {15804#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15805#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:50:55,849 INFO L290 TraceCheckUtils]: 28: Hoare triple {15805#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15806#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:50:55,849 INFO L290 TraceCheckUtils]: 29: Hoare triple {15806#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15807#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:50:55,850 INFO L290 TraceCheckUtils]: 30: Hoare triple {15807#(<= 499960 main_~y~0)} assume !(~y~0 > 0); {15783#false} is VALID [2022-04-15 06:50:55,850 INFO L272 TraceCheckUtils]: 31: Hoare triple {15783#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15783#false} is VALID [2022-04-15 06:50:55,850 INFO L290 TraceCheckUtils]: 32: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 06:50:55,850 INFO L290 TraceCheckUtils]: 33: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 06:50:55,850 INFO L290 TraceCheckUtils]: 34: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 06:50:55,851 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:55,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:50:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608373887] [2022-04-15 06:50:55,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608373887] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:50:55,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303707370] [2022-04-15 06:50:55,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:50:55,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:50:55,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:50:55,853 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 06:50:55,876 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 06:50:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:55,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 06:50:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:50:55,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:50:56,229 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 06:50:56,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#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(17, 2);call #Ultimate.allocInit(12, 3); {15782#true} is VALID [2022-04-15 06:50:56,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 06:50:56,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #52#return; {15782#true} is VALID [2022-04-15 06:50:56,229 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret9 := main(); {15782#true} is VALID [2022-04-15 06:50:56,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:56,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {15787#(<= 500000 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_130| |v_main_#t~post4_129|)) (.cse1 (= v_main_~x~0_852 v_main_~x~0_851))) (or (and .cse0 .cse1) (and (< v_main_~x~0_851 500001) (< v_main_~x~0_852 v_main_~x~0_851)) (and (not (< v_main_~x~0_852 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_852, main_#t~post4=|v_main_#t~post4_130|} OutVars{main_~x~0=v_main_~x~0_851, main_#t~post4=|v_main_#t~post4_129|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:56,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {15787#(<= 500000 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:56,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {15787#(<= 500000 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~x~0_854 v_main_~x~0_853)) (.cse2 (<= 500000 v_main_~x~0_854))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_854 1000000)) (not .cse2)) (= v_main_~y~0_869 v_main_~y~0_870) .cse3) (and .cse0 .cse1 (= v_main_~y~0_870 v_main_~y~0_869) .cse3) (let ((.cse4 (+ v_main_~x~0_854 v_main_~y~0_869))) (and (< v_main_~y~0_870 v_main_~y~0_869) (= (+ v_main_~x~0_853 v_main_~y~0_870) .cse4) (< .cse4 (+ v_main_~y~0_870 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_870, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_854, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_853, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:56,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {15787#(<= 500000 main_~y~0)} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15787#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:50:56,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {15787#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15788#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:50:56,233 INFO L290 TraceCheckUtils]: 11: Hoare triple {15788#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15789#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:50:56,233 INFO L290 TraceCheckUtils]: 12: Hoare triple {15789#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15790#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:50:56,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {15790#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15791#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:50:56,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {15791#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15792#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:50:56,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {15792#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15793#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:50:56,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {15793#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15794#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:50:56,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {15794#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15795#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:50:56,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {15795#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15796#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:50:56,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {15796#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15797#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:50:56,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {15797#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15798#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:50:56,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {15798#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15799#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:50:56,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {15799#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15800#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:50:56,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {15800#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15801#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:50:56,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {15801#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15802#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:50:56,241 INFO L290 TraceCheckUtils]: 25: Hoare triple {15802#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15803#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:50:56,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {15803#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15804#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:50:56,242 INFO L290 TraceCheckUtils]: 27: Hoare triple {15804#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15805#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:50:56,243 INFO L290 TraceCheckUtils]: 28: Hoare triple {15805#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15806#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:50:56,243 INFO L290 TraceCheckUtils]: 29: Hoare triple {15806#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15807#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:50:56,244 INFO L290 TraceCheckUtils]: 30: Hoare triple {15807#(<= 499960 main_~y~0)} assume !(~y~0 > 0); {15783#false} is VALID [2022-04-15 06:50:56,244 INFO L272 TraceCheckUtils]: 31: Hoare triple {15783#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15783#false} is VALID [2022-04-15 06:50:56,244 INFO L290 TraceCheckUtils]: 32: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 06:50:56,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 06:50:56,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 06:50:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:56,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:50:57,117 INFO L290 TraceCheckUtils]: 34: Hoare triple {15783#false} assume !false; {15783#false} is VALID [2022-04-15 06:50:57,117 INFO L290 TraceCheckUtils]: 33: Hoare triple {15783#false} assume 0 == ~cond; {15783#false} is VALID [2022-04-15 06:50:57,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {15783#false} ~cond := #in~cond; {15783#false} is VALID [2022-04-15 06:50:57,117 INFO L272 TraceCheckUtils]: 31: Hoare triple {15783#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {15783#false} is VALID [2022-04-15 06:50:57,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {15926#(< 0 main_~y~0)} assume !(~y~0 > 0); {15783#false} is VALID [2022-04-15 06:50:57,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {15930#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15926#(< 0 main_~y~0)} is VALID [2022-04-15 06:50:57,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {15934#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15930#(< 2 main_~y~0)} is VALID [2022-04-15 06:50:57,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {15938#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15934#(< 4 main_~y~0)} is VALID [2022-04-15 06:50:57,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {15942#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15938#(< 6 main_~y~0)} is VALID [2022-04-15 06:50:57,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {15946#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15942#(< 8 main_~y~0)} is VALID [2022-04-15 06:50:57,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {15950#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15946#(< 10 main_~y~0)} is VALID [2022-04-15 06:50:57,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {15954#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15950#(< 12 main_~y~0)} is VALID [2022-04-15 06:50:57,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {15958#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15954#(< 14 main_~y~0)} is VALID [2022-04-15 06:50:57,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {15962#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15958#(< 16 main_~y~0)} is VALID [2022-04-15 06:50:57,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {15966#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15962#(< 18 main_~y~0)} is VALID [2022-04-15 06:50:57,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {15970#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15966#(< 20 main_~y~0)} is VALID [2022-04-15 06:50:57,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {15974#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15970#(< 22 main_~y~0)} is VALID [2022-04-15 06:50:57,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {15978#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15974#(< 24 main_~y~0)} is VALID [2022-04-15 06:50:57,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {15982#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15978#(< 26 main_~y~0)} is VALID [2022-04-15 06:50:57,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {15986#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15982#(< 28 main_~y~0)} is VALID [2022-04-15 06:50:57,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {15990#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15986#(< 30 main_~y~0)} is VALID [2022-04-15 06:50:57,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {15994#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15990#(< 32 main_~y~0)} is VALID [2022-04-15 06:50:57,129 INFO L290 TraceCheckUtils]: 12: Hoare triple {15998#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15994#(< 34 main_~y~0)} is VALID [2022-04-15 06:50:57,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {16002#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {15998#(< 36 main_~y~0)} is VALID [2022-04-15 06:50:57,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {16006#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {16002#(< 38 main_~y~0)} is VALID [2022-04-15 06:50:57,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {16006#(< 40 main_~y~0)} [135] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {16006#(< 40 main_~y~0)} is VALID [2022-04-15 06:50:57,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {16006#(< 40 main_~y~0)} [138] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse1 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~x~0_854 v_main_~x~0_853)) (.cse2 (<= 500000 v_main_~x~0_854))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_854 1000000)) (not .cse2)) (= v_main_~y~0_869 v_main_~y~0_870) .cse3) (and .cse0 .cse1 (= v_main_~y~0_870 v_main_~y~0_869) .cse3) (let ((.cse4 (+ v_main_~x~0_854 v_main_~y~0_869))) (and (< v_main_~y~0_870 v_main_~y~0_869) (= (+ v_main_~x~0_853 v_main_~y~0_870) .cse4) (< .cse4 (+ v_main_~y~0_870 1000001)) .cse2)))) InVars {main_~y~0=v_main_~y~0_870, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_854, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_853, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16006#(< 40 main_~y~0)} is VALID [2022-04-15 06:50:57,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {16006#(< 40 main_~y~0)} [137] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16006#(< 40 main_~y~0)} is VALID [2022-04-15 06:50:57,132 INFO L290 TraceCheckUtils]: 6: Hoare triple {16006#(< 40 main_~y~0)} [136] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_130| |v_main_#t~post4_129|)) (.cse1 (= v_main_~x~0_852 v_main_~x~0_851))) (or (and .cse0 .cse1) (and (< v_main_~x~0_851 500001) (< v_main_~x~0_852 v_main_~x~0_851)) (and (not (< v_main_~x~0_852 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_852, main_#t~post4=|v_main_#t~post4_130|} OutVars{main_~x~0=v_main_~x~0_851, main_#t~post4=|v_main_#t~post4_129|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16006#(< 40 main_~y~0)} is VALID [2022-04-15 06:50:57,133 INFO L290 TraceCheckUtils]: 5: Hoare triple {15782#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16006#(< 40 main_~y~0)} is VALID [2022-04-15 06:50:57,133 INFO L272 TraceCheckUtils]: 4: Hoare triple {15782#true} call #t~ret9 := main(); {15782#true} is VALID [2022-04-15 06:50:57,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15782#true} {15782#true} #52#return; {15782#true} is VALID [2022-04-15 06:50:57,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {15782#true} assume true; {15782#true} is VALID [2022-04-15 06:50:57,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {15782#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(17, 2);call #Ultimate.allocInit(12, 3); {15782#true} is VALID [2022-04-15 06:50:57,133 INFO L272 TraceCheckUtils]: 0: Hoare triple {15782#true} call ULTIMATE.init(); {15782#true} is VALID [2022-04-15 06:50:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:50:57,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303707370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:50:57,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:50:57,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 45 [2022-04-15 06:50:58,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:50:58,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1919066124] [2022-04-15 06:50:58,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1919066124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:50:58,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:50:58,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:50:58,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906751848] [2022-04-15 06:50:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:50:58,441 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:50:58,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:50:58,441 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:50:58,516 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 06:50:58,516 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:50:58,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:50:58,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:50:58,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2567, Invalid=3913, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 06:50:58,518 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:51:04,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:04,128 INFO L93 Difference]: Finished difference Result 203 states and 214 transitions. [2022-04-15 06:51:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:51:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:51:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:51:04,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 124 transitions. [2022-04-15 06:51:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:51:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 124 transitions. [2022-04-15 06:51:04,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 124 transitions. [2022-04-15 06:51:04,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:04,259 INFO L225 Difference]: With dead ends: 203 [2022-04-15 06:51:04,259 INFO L226 Difference]: Without dead ends: 108 [2022-04-15 06:51:04,261 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5446 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5994, Invalid=12912, Unknown=0, NotChecked=0, Total=18906 [2022-04-15 06:51:04,262 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 121 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2608 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:04,262 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [121 Valid, 39 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2608 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 06:51:04,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-15 06:51:04,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-15 06:51:04,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:04,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 06:51:04,458 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 06:51:04,458 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 06:51:04,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:04,460 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-04-15 06:51:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-04-15 06:51:04,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:04,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:04,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 108 states. [2022-04-15 06:51:04,461 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 108 states. [2022-04-15 06:51:04,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:04,463 INFO L93 Difference]: Finished difference Result 108 states and 111 transitions. [2022-04-15 06:51:04,463 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-04-15 06:51:04,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:04,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:04,464 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:04,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0388349514563107) internal successors, (107), 103 states have internal predecessors, (107), 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 06:51:04,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 111 transitions. [2022-04-15 06:51:04,466 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 111 transitions. Word has length 102 [2022-04-15 06:51:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:04,466 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 111 transitions. [2022-04-15 06:51:04,466 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 1.6333333333333333) internal successors, (98), 59 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 06:51:04,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 111 transitions. [2022-04-15 06:51:04,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 111 transitions. [2022-04-15 06:51:04,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 06:51:04,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:04,582 INFO L499 BasicCegarLoop]: trace histogram [37, 36, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:04,617 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 06:51:04,792 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,SelfDestructingSolverStorable22 [2022-04-15 06:51:04,792 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:04,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:04,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1415302795, now seen corresponding path program 21 times [2022-04-15 06:51:04,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:04,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [139159536] [2022-04-15 06:51:08,865 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:08,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:09,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:09,137 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 222516546, now seen corresponding path program 1 times [2022-04-15 06:51:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:09,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631442994] [2022-04-15 06:51:09,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:09,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:09,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:09,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:09,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {17054#(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(17, 2);call #Ultimate.allocInit(12, 3); {17027#true} is VALID [2022-04-15 06:51:09,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {17027#true} assume true; {17027#true} is VALID [2022-04-15 06:51:09,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17027#true} {17027#true} #52#return; {17027#true} is VALID [2022-04-15 06:51:09,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {17027#true} call ULTIMATE.init(); {17054#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:09,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {17054#(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(17, 2);call #Ultimate.allocInit(12, 3); {17027#true} is VALID [2022-04-15 06:51:09,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {17027#true} assume true; {17027#true} is VALID [2022-04-15 06:51:09,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17027#true} {17027#true} #52#return; {17027#true} is VALID [2022-04-15 06:51:09,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {17027#true} call #t~ret9 := main(); {17027#true} is VALID [2022-04-15 06:51:09,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {17027#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {17032#(<= 500000 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_136| |v_main_#t~post4_135|)) (.cse1 (= v_main_~x~0_923 v_main_~x~0_922))) (or (and .cse0 .cse1 (not (< v_main_~x~0_923 500000))) (and (< v_main_~x~0_922 500001) (< v_main_~x~0_923 v_main_~x~0_922)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_923, main_#t~post4=|v_main_#t~post4_136|} OutVars{main_~x~0=v_main_~x~0_922, main_#t~post4=|v_main_#t~post4_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {17032#(<= 500000 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {17032#(<= 500000 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_953 v_main_~y~0_952)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_925 v_main_~x~0_924)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (<= 500000 v_main_~x~0_925))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_925 1000000)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_925 v_main_~y~0_952))) (and (= .cse5 (+ v_main_~x~0_924 v_main_~y~0_953)) (< v_main_~y~0_953 v_main_~y~0_952) (< .cse5 (+ v_main_~y~0_953 1000001)) .cse4)))) InVars {main_~y~0=v_main_~y~0_953, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_925, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_924, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {17032#(<= 500000 main_~y~0)} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {17032#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17033#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:09,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {17033#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17034#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:09,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {17034#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17035#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:09,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {17035#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17036#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:09,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {17036#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17037#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:09,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17038#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:09,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {17038#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17039#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:09,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {17039#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17040#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:09,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {17040#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17041#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:09,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {17041#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17042#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:09,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {17042#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17043#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:09,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {17043#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17044#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:09,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {17044#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17045#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:09,451 INFO L290 TraceCheckUtils]: 23: Hoare triple {17045#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17046#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:09,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {17046#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17047#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:09,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {17047#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17048#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:09,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {17048#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17049#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:09,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {17049#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17050#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:09,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {17050#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17051#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:09,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {17051#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17052#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:09,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {17052#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17053#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:09,455 INFO L290 TraceCheckUtils]: 31: Hoare triple {17053#(<= 499958 main_~y~0)} assume !(~y~0 > 0); {17028#false} is VALID [2022-04-15 06:51:09,455 INFO L272 TraceCheckUtils]: 32: Hoare triple {17028#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17028#false} is VALID [2022-04-15 06:51:09,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {17028#false} ~cond := #in~cond; {17028#false} is VALID [2022-04-15 06:51:09,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {17028#false} assume 0 == ~cond; {17028#false} is VALID [2022-04-15 06:51:09,455 INFO L290 TraceCheckUtils]: 35: Hoare triple {17028#false} assume !false; {17028#false} is VALID [2022-04-15 06:51:09,455 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:09,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631442994] [2022-04-15 06:51:09,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631442994] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:09,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328886163] [2022-04-15 06:51:09,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:09,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:09,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:09,457 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 06:51:09,458 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 06:51:09,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:09,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 06:51:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:09,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:09,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {17027#true} call ULTIMATE.init(); {17027#true} is VALID [2022-04-15 06:51:09,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {17027#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(17, 2);call #Ultimate.allocInit(12, 3); {17027#true} is VALID [2022-04-15 06:51:09,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {17027#true} assume true; {17027#true} is VALID [2022-04-15 06:51:09,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17027#true} {17027#true} #52#return; {17027#true} is VALID [2022-04-15 06:51:09,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {17027#true} call #t~ret9 := main(); {17027#true} is VALID [2022-04-15 06:51:09,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {17027#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {17032#(<= 500000 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_136| |v_main_#t~post4_135|)) (.cse1 (= v_main_~x~0_923 v_main_~x~0_922))) (or (and .cse0 .cse1 (not (< v_main_~x~0_923 500000))) (and (< v_main_~x~0_922 500001) (< v_main_~x~0_923 v_main_~x~0_922)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_923, main_#t~post4=|v_main_#t~post4_136|} OutVars{main_~x~0=v_main_~x~0_922, main_#t~post4=|v_main_#t~post4_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {17032#(<= 500000 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {17032#(<= 500000 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_953 v_main_~y~0_952)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_925 v_main_~x~0_924)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (<= 500000 v_main_~x~0_925))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_925 1000000)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_925 v_main_~y~0_952))) (and (= .cse5 (+ v_main_~x~0_924 v_main_~y~0_953)) (< v_main_~y~0_953 v_main_~y~0_952) (< .cse5 (+ v_main_~y~0_953 1000001)) .cse4)))) InVars {main_~y~0=v_main_~y~0_953, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_925, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_924, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {17032#(<= 500000 main_~y~0)} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17032#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:09,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {17032#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17033#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:09,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {17033#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17034#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:09,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {17034#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17035#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:09,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {17035#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17036#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:09,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {17036#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17037#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:09,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {17037#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17038#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:09,822 INFO L290 TraceCheckUtils]: 16: Hoare triple {17038#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17039#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:09,823 INFO L290 TraceCheckUtils]: 17: Hoare triple {17039#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17040#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:09,823 INFO L290 TraceCheckUtils]: 18: Hoare triple {17040#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17041#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:09,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {17041#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17042#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:09,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {17042#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17043#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:09,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {17043#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17044#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:09,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {17044#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17045#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:09,826 INFO L290 TraceCheckUtils]: 23: Hoare triple {17045#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17046#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:09,826 INFO L290 TraceCheckUtils]: 24: Hoare triple {17046#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17047#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:09,827 INFO L290 TraceCheckUtils]: 25: Hoare triple {17047#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17048#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:09,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {17048#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17049#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:09,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {17049#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17050#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:09,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {17050#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17051#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:09,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {17051#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17052#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:09,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {17052#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17053#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:09,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {17053#(<= 499958 main_~y~0)} assume !(~y~0 > 0); {17028#false} is VALID [2022-04-15 06:51:09,830 INFO L272 TraceCheckUtils]: 32: Hoare triple {17028#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17028#false} is VALID [2022-04-15 06:51:09,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {17028#false} ~cond := #in~cond; {17028#false} is VALID [2022-04-15 06:51:09,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {17028#false} assume 0 == ~cond; {17028#false} is VALID [2022-04-15 06:51:09,830 INFO L290 TraceCheckUtils]: 35: Hoare triple {17028#false} assume !false; {17028#false} is VALID [2022-04-15 06:51:09,830 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:09,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:10,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {17028#false} assume !false; {17028#false} is VALID [2022-04-15 06:51:10,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {17028#false} assume 0 == ~cond; {17028#false} is VALID [2022-04-15 06:51:10,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {17028#false} ~cond := #in~cond; {17028#false} is VALID [2022-04-15 06:51:10,652 INFO L272 TraceCheckUtils]: 32: Hoare triple {17028#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {17028#false} is VALID [2022-04-15 06:51:10,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {17175#(< 0 main_~y~0)} assume !(~y~0 > 0); {17028#false} is VALID [2022-04-15 06:51:10,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {17179#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17175#(< 0 main_~y~0)} is VALID [2022-04-15 06:51:10,654 INFO L290 TraceCheckUtils]: 29: Hoare triple {17183#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17179#(< 2 main_~y~0)} is VALID [2022-04-15 06:51:10,654 INFO L290 TraceCheckUtils]: 28: Hoare triple {17187#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17183#(< 4 main_~y~0)} is VALID [2022-04-15 06:51:10,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {17191#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17187#(< 6 main_~y~0)} is VALID [2022-04-15 06:51:10,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {17195#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17191#(< 8 main_~y~0)} is VALID [2022-04-15 06:51:10,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {17199#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17195#(< 10 main_~y~0)} is VALID [2022-04-15 06:51:10,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {17203#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17199#(< 12 main_~y~0)} is VALID [2022-04-15 06:51:10,657 INFO L290 TraceCheckUtils]: 23: Hoare triple {17207#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17203#(< 14 main_~y~0)} is VALID [2022-04-15 06:51:10,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {17211#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17207#(< 16 main_~y~0)} is VALID [2022-04-15 06:51:10,658 INFO L290 TraceCheckUtils]: 21: Hoare triple {17215#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17211#(< 18 main_~y~0)} is VALID [2022-04-15 06:51:10,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {17219#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17215#(< 20 main_~y~0)} is VALID [2022-04-15 06:51:10,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {17223#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17219#(< 22 main_~y~0)} is VALID [2022-04-15 06:51:10,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {17227#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17223#(< 24 main_~y~0)} is VALID [2022-04-15 06:51:10,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {17231#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17227#(< 26 main_~y~0)} is VALID [2022-04-15 06:51:10,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {17235#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17231#(< 28 main_~y~0)} is VALID [2022-04-15 06:51:10,661 INFO L290 TraceCheckUtils]: 15: Hoare triple {17239#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17235#(< 30 main_~y~0)} is VALID [2022-04-15 06:51:10,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {17243#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17239#(< 32 main_~y~0)} is VALID [2022-04-15 06:51:10,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {17247#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17243#(< 34 main_~y~0)} is VALID [2022-04-15 06:51:10,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {17251#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17247#(< 36 main_~y~0)} is VALID [2022-04-15 06:51:10,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {17255#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17251#(< 38 main_~y~0)} is VALID [2022-04-15 06:51:10,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {17259#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {17255#(< 40 main_~y~0)} is VALID [2022-04-15 06:51:10,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {17259#(< 42 main_~y~0)} [139] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17259#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:10,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {17259#(< 42 main_~y~0)} [142] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_953 v_main_~y~0_952)) (.cse1 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse2 (= v_main_~x~0_925 v_main_~x~0_924)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|)) (.cse4 (<= 500000 v_main_~x~0_925))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_925 1000000)) (not .cse4)) .cse3) (let ((.cse5 (+ v_main_~x~0_925 v_main_~y~0_952))) (and (= .cse5 (+ v_main_~x~0_924 v_main_~y~0_953)) (< v_main_~y~0_953 v_main_~y~0_952) (< .cse5 (+ v_main_~y~0_953 1000001)) .cse4)))) InVars {main_~y~0=v_main_~y~0_953, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_925, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_924, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17259#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:10,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {17259#(< 42 main_~y~0)} [141] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17259#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:10,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {17259#(< 42 main_~y~0)} [140] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_136| |v_main_#t~post4_135|)) (.cse1 (= v_main_~x~0_923 v_main_~x~0_922))) (or (and .cse0 .cse1 (not (< v_main_~x~0_923 500000))) (and (< v_main_~x~0_922 500001) (< v_main_~x~0_923 v_main_~x~0_922)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_923, main_#t~post4=|v_main_#t~post4_136|} OutVars{main_~x~0=v_main_~x~0_922, main_#t~post4=|v_main_#t~post4_135|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17259#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:10,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {17027#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17259#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:10,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {17027#true} call #t~ret9 := main(); {17027#true} is VALID [2022-04-15 06:51:10,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17027#true} {17027#true} #52#return; {17027#true} is VALID [2022-04-15 06:51:10,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {17027#true} assume true; {17027#true} is VALID [2022-04-15 06:51:10,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {17027#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(17, 2);call #Ultimate.allocInit(12, 3); {17027#true} is VALID [2022-04-15 06:51:10,665 INFO L272 TraceCheckUtils]: 0: Hoare triple {17027#true} call ULTIMATE.init(); {17027#true} is VALID [2022-04-15 06:51:10,666 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:10,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328886163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:10,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:10,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 47 [2022-04-15 06:51:12,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:12,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [139159536] [2022-04-15 06:51:12,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [139159536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:12,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:12,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:51:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394487218] [2022-04-15 06:51:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 107 [2022-04-15 06:51:12,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:12,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 06:51:12,129 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 06:51:12,129 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:51:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:12,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:51:12,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2822, Invalid=4318, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:51:12,130 INFO L87 Difference]: Start difference. First operand 108 states and 111 transitions. Second operand has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 06:51:18,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,221 INFO L93 Difference]: Finished difference Result 213 states and 224 transitions. [2022-04-15 06:51:18,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:51:18,222 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 107 [2022-04-15 06:51:18,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:18,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 06:51:18,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 129 transitions. [2022-04-15 06:51:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 06:51:18,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 129 transitions. [2022-04-15 06:51:18,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 129 transitions. [2022-04-15 06:51:18,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:18,354 INFO L225 Difference]: With dead ends: 213 [2022-04-15 06:51:18,354 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 06:51:18,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6023 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=6590, Invalid=14290, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:51:18,357 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 167 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:18,357 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 39 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 06:51:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 06:51:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-04-15 06:51:18,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:18,557 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 06:51:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 06:51:18,558 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 06:51:18,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,560 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 06:51:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 06:51:18,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 113 states. [2022-04-15 06:51:18,560 INFO L87 Difference]: Start difference. First operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 113 states. [2022-04-15 06:51:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:18,562 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 06:51:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 06:51:18,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:18,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:18,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:18,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:18,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 108 states have (on average 1.037037037037037) internal successors, (112), 108 states have internal predecessors, (112), 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 06:51:18,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2022-04-15 06:51:18,565 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 107 [2022-04-15 06:51:18,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:18,566 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2022-04-15 06:51:18,566 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 62 states have internal predecessors, (103), 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 06:51:18,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2022-04-15 06:51:18,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:18,685 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2022-04-15 06:51:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-15 06:51:18,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:18,686 INFO L499 BasicCegarLoop]: trace histogram [39, 38, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:18,712 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 06:51:18,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 06:51:18,887 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash -896139432, now seen corresponding path program 22 times [2022-04-15 06:51:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:18,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [296266594] [2022-04-15 06:51:20,964 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:21,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:21,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:21,312 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:21,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1545540961, now seen corresponding path program 1 times [2022-04-15 06:51:21,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:21,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077095583] [2022-04-15 06:51:21,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:21,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:21,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:21,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {18356#(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(17, 2);call #Ultimate.allocInit(12, 3); {18328#true} is VALID [2022-04-15 06:51:21,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {18328#true} assume true; {18328#true} is VALID [2022-04-15 06:51:21,675 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18328#true} {18328#true} #52#return; {18328#true} is VALID [2022-04-15 06:51:21,675 INFO L272 TraceCheckUtils]: 0: Hoare triple {18328#true} call ULTIMATE.init(); {18356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {18356#(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(17, 2);call #Ultimate.allocInit(12, 3); {18328#true} is VALID [2022-04-15 06:51:21,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {18328#true} assume true; {18328#true} is VALID [2022-04-15 06:51:21,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18328#true} {18328#true} #52#return; {18328#true} is VALID [2022-04-15 06:51:21,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {18328#true} call #t~ret9 := main(); {18328#true} is VALID [2022-04-15 06:51:21,683 INFO L290 TraceCheckUtils]: 5: Hoare triple {18328#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:21,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {18333#(<= 500000 main_~y~0)} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_997 v_main_~x~0_996))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_997) .cse0 .cse1) (and (< v_main_~x~0_997 v_main_~x~0_996) (< v_main_~x~0_996 500001)))) InVars {main_~x~0=v_main_~x~0_997, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_996, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:21,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {18333#(<= 500000 main_~y~0)} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:21,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {18333#(<= 500000 main_~y~0)} [146] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_999 v_main_~x~0_998)) (.cse5 (<= 500000 v_main_~x~0_999)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_999 v_main_~y~0_1039))) (and (= .cse4 (+ v_main_~x~0_998 v_main_~y~0_1040)) (< .cse4 (+ 1000001 v_main_~y~0_1040)) (< v_main_~y~0_1040 v_main_~y~0_1039) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_999 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_999, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_998, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:21,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {18333#(<= 500000 main_~y~0)} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:21,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {18333#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18334#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:21,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {18334#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18335#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:21,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {18335#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18336#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:21,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {18336#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18337#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:21,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {18337#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18338#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:21,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {18338#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18339#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:21,691 INFO L290 TraceCheckUtils]: 16: Hoare triple {18339#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18340#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:21,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {18340#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18341#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:21,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {18341#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18342#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:21,692 INFO L290 TraceCheckUtils]: 19: Hoare triple {18342#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18343#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:21,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {18343#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18344#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:21,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {18344#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18345#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:21,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18346#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:21,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {18346#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18347#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:21,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {18347#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18348#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:21,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {18348#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18349#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:21,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {18349#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18350#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:21,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {18350#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18351#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:21,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {18351#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18352#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:21,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {18352#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18353#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:21,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {18353#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18354#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:21,698 INFO L290 TraceCheckUtils]: 31: Hoare triple {18354#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18355#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:21,698 INFO L290 TraceCheckUtils]: 32: Hoare triple {18355#(<= 499956 main_~y~0)} assume !(~y~0 > 0); {18329#false} is VALID [2022-04-15 06:51:21,699 INFO L272 TraceCheckUtils]: 33: Hoare triple {18329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18329#false} is VALID [2022-04-15 06:51:21,699 INFO L290 TraceCheckUtils]: 34: Hoare triple {18329#false} ~cond := #in~cond; {18329#false} is VALID [2022-04-15 06:51:21,699 INFO L290 TraceCheckUtils]: 35: Hoare triple {18329#false} assume 0 == ~cond; {18329#false} is VALID [2022-04-15 06:51:21,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {18329#false} assume !false; {18329#false} is VALID [2022-04-15 06:51:21,699 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:21,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:21,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077095583] [2022-04-15 06:51:21,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077095583] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:21,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492418692] [2022-04-15 06:51:21,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:21,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:21,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:21,701 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 06:51:21,702 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 06:51:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:21,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 06:51:21,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:21,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:22,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {18328#true} call ULTIMATE.init(); {18328#true} is VALID [2022-04-15 06:51:22,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {18328#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(17, 2);call #Ultimate.allocInit(12, 3); {18328#true} is VALID [2022-04-15 06:51:22,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {18328#true} assume true; {18328#true} is VALID [2022-04-15 06:51:22,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18328#true} {18328#true} #52#return; {18328#true} is VALID [2022-04-15 06:51:22,144 INFO L272 TraceCheckUtils]: 4: Hoare triple {18328#true} call #t~ret9 := main(); {18328#true} is VALID [2022-04-15 06:51:22,144 INFO L290 TraceCheckUtils]: 5: Hoare triple {18328#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:22,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {18333#(<= 500000 main_~y~0)} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_997 v_main_~x~0_996))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_997) .cse0 .cse1) (and (< v_main_~x~0_997 v_main_~x~0_996) (< v_main_~x~0_996 500001)))) InVars {main_~x~0=v_main_~x~0_997, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_996, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:22,145 INFO L290 TraceCheckUtils]: 7: Hoare triple {18333#(<= 500000 main_~y~0)} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:22,146 INFO L290 TraceCheckUtils]: 8: Hoare triple {18333#(<= 500000 main_~y~0)} [146] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_999 v_main_~x~0_998)) (.cse5 (<= 500000 v_main_~x~0_999)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_999 v_main_~y~0_1039))) (and (= .cse4 (+ v_main_~x~0_998 v_main_~y~0_1040)) (< .cse4 (+ 1000001 v_main_~y~0_1040)) (< v_main_~y~0_1040 v_main_~y~0_1039) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_999 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_999, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_998, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:22,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {18333#(<= 500000 main_~y~0)} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18333#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:22,146 INFO L290 TraceCheckUtils]: 10: Hoare triple {18333#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18334#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:22,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {18334#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18335#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:22,147 INFO L290 TraceCheckUtils]: 12: Hoare triple {18335#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18336#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:22,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {18336#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18337#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:22,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {18337#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18338#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:22,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {18338#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18339#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:22,149 INFO L290 TraceCheckUtils]: 16: Hoare triple {18339#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18340#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:22,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {18340#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18341#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:22,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {18341#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18342#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:22,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {18342#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18343#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:22,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {18343#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18344#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:22,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {18344#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18345#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:22,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {18345#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18346#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:22,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {18346#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18347#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:22,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {18347#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18348#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:22,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {18348#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18349#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:22,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {18349#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18350#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:22,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {18350#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18351#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:22,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {18351#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18352#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:22,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {18352#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18353#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:22,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {18353#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18354#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:22,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {18354#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18355#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:22,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {18355#(<= 499956 main_~y~0)} assume !(~y~0 > 0); {18329#false} is VALID [2022-04-15 06:51:22,159 INFO L272 TraceCheckUtils]: 33: Hoare triple {18329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18329#false} is VALID [2022-04-15 06:51:22,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {18329#false} ~cond := #in~cond; {18329#false} is VALID [2022-04-15 06:51:22,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {18329#false} assume 0 == ~cond; {18329#false} is VALID [2022-04-15 06:51:22,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {18329#false} assume !false; {18329#false} is VALID [2022-04-15 06:51:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:22,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:23,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {18329#false} assume !false; {18329#false} is VALID [2022-04-15 06:51:23,047 INFO L290 TraceCheckUtils]: 35: Hoare triple {18329#false} assume 0 == ~cond; {18329#false} is VALID [2022-04-15 06:51:23,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {18329#false} ~cond := #in~cond; {18329#false} is VALID [2022-04-15 06:51:23,047 INFO L272 TraceCheckUtils]: 33: Hoare triple {18329#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {18329#false} is VALID [2022-04-15 06:51:23,047 INFO L290 TraceCheckUtils]: 32: Hoare triple {18480#(< 0 main_~y~0)} assume !(~y~0 > 0); {18329#false} is VALID [2022-04-15 06:51:23,048 INFO L290 TraceCheckUtils]: 31: Hoare triple {18484#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18480#(< 0 main_~y~0)} is VALID [2022-04-15 06:51:23,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {18488#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18484#(< 2 main_~y~0)} is VALID [2022-04-15 06:51:23,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {18492#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18488#(< 4 main_~y~0)} is VALID [2022-04-15 06:51:23,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {18496#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18492#(< 6 main_~y~0)} is VALID [2022-04-15 06:51:23,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {18500#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18496#(< 8 main_~y~0)} is VALID [2022-04-15 06:51:23,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {18504#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18500#(< 10 main_~y~0)} is VALID [2022-04-15 06:51:23,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {18508#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18504#(< 12 main_~y~0)} is VALID [2022-04-15 06:51:23,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {18512#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18508#(< 14 main_~y~0)} is VALID [2022-04-15 06:51:23,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {18516#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18512#(< 16 main_~y~0)} is VALID [2022-04-15 06:51:23,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {18520#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18516#(< 18 main_~y~0)} is VALID [2022-04-15 06:51:23,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {18524#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18520#(< 20 main_~y~0)} is VALID [2022-04-15 06:51:23,054 INFO L290 TraceCheckUtils]: 20: Hoare triple {18528#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18524#(< 22 main_~y~0)} is VALID [2022-04-15 06:51:23,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {18532#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18528#(< 24 main_~y~0)} is VALID [2022-04-15 06:51:23,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {18536#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18532#(< 26 main_~y~0)} is VALID [2022-04-15 06:51:23,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {18540#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18536#(< 28 main_~y~0)} is VALID [2022-04-15 06:51:23,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {18544#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18540#(< 30 main_~y~0)} is VALID [2022-04-15 06:51:23,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {18548#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18544#(< 32 main_~y~0)} is VALID [2022-04-15 06:51:23,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {18552#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18548#(< 34 main_~y~0)} is VALID [2022-04-15 06:51:23,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {18556#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18552#(< 36 main_~y~0)} is VALID [2022-04-15 06:51:23,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {18560#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18556#(< 38 main_~y~0)} is VALID [2022-04-15 06:51:23,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {18564#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18560#(< 40 main_~y~0)} is VALID [2022-04-15 06:51:23,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {18568#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {18564#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:23,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {18568#(< 44 main_~y~0)} [143] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {18568#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:23,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {18568#(< 44 main_~y~0)} [146] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_999 v_main_~x~0_998)) (.cse5 (<= 500000 v_main_~x~0_999)) (.cse1 (= v_main_~y~0_1040 v_main_~y~0_1039)) (.cse2 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse3 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_999 v_main_~y~0_1039))) (and (= .cse4 (+ v_main_~x~0_998 v_main_~y~0_1040)) (< .cse4 (+ 1000001 v_main_~y~0_1040)) (< v_main_~y~0_1040 v_main_~y~0_1039) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_999 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1040, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_999, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_998, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18568#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:23,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {18568#(< 44 main_~y~0)} [145] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18568#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:23,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {18568#(< 44 main_~y~0)} [144] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_142| |v_main_#t~post4_141|)) (.cse1 (= v_main_~x~0_997 v_main_~x~0_996))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_997) .cse0 .cse1) (and (< v_main_~x~0_997 v_main_~x~0_996) (< v_main_~x~0_996 500001)))) InVars {main_~x~0=v_main_~x~0_997, main_#t~post4=|v_main_#t~post4_142|} OutVars{main_~x~0=v_main_~x~0_996, main_#t~post4=|v_main_#t~post4_141|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18568#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:23,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {18328#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18568#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:23,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {18328#true} call #t~ret9 := main(); {18328#true} is VALID [2022-04-15 06:51:23,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18328#true} {18328#true} #52#return; {18328#true} is VALID [2022-04-15 06:51:23,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {18328#true} assume true; {18328#true} is VALID [2022-04-15 06:51:23,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {18328#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(17, 2);call #Ultimate.allocInit(12, 3); {18328#true} is VALID [2022-04-15 06:51:23,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {18328#true} call ULTIMATE.init(); {18328#true} is VALID [2022-04-15 06:51:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:23,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492418692] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:23,061 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:23,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 49 [2022-04-15 06:51:24,483 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:24,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [296266594] [2022-04-15 06:51:24,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [296266594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:24,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:24,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:51:24,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766126265] [2022-04-15 06:51:24,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 112 [2022-04-15 06:51:24,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:24,485 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 06:51:24,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:24,564 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:51:24,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:24,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:51:24,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3089, Invalid=4743, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 06:51:24,566 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 06:51:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:31,243 INFO L93 Difference]: Finished difference Result 223 states and 234 transitions. [2022-04-15 06:51:31,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 06:51:31,244 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 112 [2022-04-15 06:51:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:31,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 06:51:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2022-04-15 06:51:31,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 06:51:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 134 transitions. [2022-04-15 06:51:31,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 134 transitions. [2022-04-15 06:51:31,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:31,379 INFO L225 Difference]: With dead ends: 223 [2022-04-15 06:51:31,379 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 06:51:31,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6629 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7214, Invalid=15738, Unknown=0, NotChecked=0, Total=22952 [2022-04-15 06:51:31,382 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 174 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 3446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:31,382 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 29 Invalid, 3446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 06:51:31,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 06:51:31,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-15 06:51:31,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:31,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 06:51:31,597 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 06:51:31,597 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 06:51:31,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:31,599 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-15 06:51:31,599 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 06:51:31,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:31,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:31,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 118 states. [2022-04-15 06:51:31,600 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 118 states. [2022-04-15 06:51:31,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:31,602 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-04-15 06:51:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 06:51:31,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:31,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:31,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:31,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:31,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0353982300884956) internal successors, (117), 113 states have internal predecessors, (117), 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 06:51:31,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 121 transitions. [2022-04-15 06:51:31,605 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 121 transitions. Word has length 112 [2022-04-15 06:51:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:31,606 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 121 transitions. [2022-04-15 06:51:31,606 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.6363636363636365) internal successors, (108), 65 states have internal predecessors, (108), 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 06:51:31,606 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 121 transitions. [2022-04-15 06:51:31,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:31,727 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 121 transitions. [2022-04-15 06:51:31,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 06:51:31,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:31,728 INFO L499 BasicCegarLoop]: trace histogram [41, 40, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:31,751 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 06:51:31,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:31,929 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:31,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1857282431, now seen corresponding path program 23 times [2022-04-15 06:51:31,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:31,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [354969208] [2022-04-15 06:51:36,019 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:51:36,074 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:36,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:36,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:36,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1178090274, now seen corresponding path program 1 times [2022-04-15 06:51:36,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:36,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913947058] [2022-04-15 06:51:36,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:36,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:36,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:36,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {19714#(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(17, 2);call #Ultimate.allocInit(12, 3); {19685#true} is VALID [2022-04-15 06:51:36,678 INFO L290 TraceCheckUtils]: 1: Hoare triple {19685#true} assume true; {19685#true} is VALID [2022-04-15 06:51:36,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19685#true} {19685#true} #52#return; {19685#true} is VALID [2022-04-15 06:51:36,678 INFO L272 TraceCheckUtils]: 0: Hoare triple {19685#true} call ULTIMATE.init(); {19714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:36,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {19714#(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(17, 2);call #Ultimate.allocInit(12, 3); {19685#true} is VALID [2022-04-15 06:51:36,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {19685#true} assume true; {19685#true} is VALID [2022-04-15 06:51:36,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19685#true} {19685#true} #52#return; {19685#true} is VALID [2022-04-15 06:51:36,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {19685#true} call #t~ret9 := main(); {19685#true} is VALID [2022-04-15 06:51:36,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {19685#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:36,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {19690#(<= 500000 main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1074 v_main_~x~0_1073)) (.cse1 (= |v_main_#t~post4_148| |v_main_#t~post4_147|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1073 500001) (< v_main_~x~0_1074 v_main_~x~0_1073)) (and .cse0 (<= 500000 v_main_~x~0_1074) .cse1))) InVars {main_~x~0=v_main_~x~0_1074, main_#t~post4=|v_main_#t~post4_148|} OutVars{main_~x~0=v_main_~x~0_1073, main_#t~post4=|v_main_#t~post4_147|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:36,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {19690#(<= 500000 main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:36,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {19690#(<= 500000 main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse1 (= v_main_~y~0_1131 v_main_~y~0_1130)) (.cse2 (= v_main_~x~0_1076 v_main_~x~0_1075)) (.cse3 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse4 (<= 500000 v_main_~x~0_1076))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_1076 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1076 v_main_~y~0_1130))) (and .cse4 (< v_main_~y~0_1131 v_main_~y~0_1130) (= (+ v_main_~x~0_1075 v_main_~y~0_1131) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1131)))))) InVars {main_~y~0=v_main_~y~0_1131, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1076, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1075, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:36,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {19690#(<= 500000 main_~y~0)} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:36,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {19690#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19691#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:36,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {19691#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19692#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:36,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {19692#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19693#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:36,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {19693#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19694#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:36,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {19694#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19695#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:36,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {19695#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19696#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:36,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {19696#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19697#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:36,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {19697#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19698#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:36,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {19698#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19699#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:36,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {19699#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19700#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:36,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {19700#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19701#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:36,687 INFO L290 TraceCheckUtils]: 21: Hoare triple {19701#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19702#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:36,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {19702#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19703#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:36,688 INFO L290 TraceCheckUtils]: 23: Hoare triple {19703#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19704#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:36,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {19704#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19705#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:36,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {19705#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19706#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:36,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {19706#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19707#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:36,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {19707#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19708#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:36,690 INFO L290 TraceCheckUtils]: 28: Hoare triple {19708#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19709#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:36,691 INFO L290 TraceCheckUtils]: 29: Hoare triple {19709#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19710#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:36,691 INFO L290 TraceCheckUtils]: 30: Hoare triple {19710#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19711#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:36,692 INFO L290 TraceCheckUtils]: 31: Hoare triple {19711#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19712#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:36,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {19712#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19713#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:51:36,693 INFO L290 TraceCheckUtils]: 33: Hoare triple {19713#(<= 499954 main_~y~0)} assume !(~y~0 > 0); {19686#false} is VALID [2022-04-15 06:51:36,693 INFO L272 TraceCheckUtils]: 34: Hoare triple {19686#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19686#false} is VALID [2022-04-15 06:51:36,693 INFO L290 TraceCheckUtils]: 35: Hoare triple {19686#false} ~cond := #in~cond; {19686#false} is VALID [2022-04-15 06:51:36,693 INFO L290 TraceCheckUtils]: 36: Hoare triple {19686#false} assume 0 == ~cond; {19686#false} is VALID [2022-04-15 06:51:36,693 INFO L290 TraceCheckUtils]: 37: Hoare triple {19686#false} assume !false; {19686#false} is VALID [2022-04-15 06:51:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:36,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913947058] [2022-04-15 06:51:36,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913947058] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:36,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080446270] [2022-04-15 06:51:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:36,695 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 06:51:36,696 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 06:51:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:36,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:51:36,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:36,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:37,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {19685#true} call ULTIMATE.init(); {19685#true} is VALID [2022-04-15 06:51:37,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {19685#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(17, 2);call #Ultimate.allocInit(12, 3); {19685#true} is VALID [2022-04-15 06:51:37,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {19685#true} assume true; {19685#true} is VALID [2022-04-15 06:51:37,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19685#true} {19685#true} #52#return; {19685#true} is VALID [2022-04-15 06:51:37,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {19685#true} call #t~ret9 := main(); {19685#true} is VALID [2022-04-15 06:51:37,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {19685#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:37,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {19690#(<= 500000 main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1074 v_main_~x~0_1073)) (.cse1 (= |v_main_#t~post4_148| |v_main_#t~post4_147|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1073 500001) (< v_main_~x~0_1074 v_main_~x~0_1073)) (and .cse0 (<= 500000 v_main_~x~0_1074) .cse1))) InVars {main_~x~0=v_main_~x~0_1074, main_#t~post4=|v_main_#t~post4_148|} OutVars{main_~x~0=v_main_~x~0_1073, main_#t~post4=|v_main_#t~post4_147|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:37,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {19690#(<= 500000 main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:37,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {19690#(<= 500000 main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse1 (= v_main_~y~0_1131 v_main_~y~0_1130)) (.cse2 (= v_main_~x~0_1076 v_main_~x~0_1075)) (.cse3 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse4 (<= 500000 v_main_~x~0_1076))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_1076 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1076 v_main_~y~0_1130))) (and .cse4 (< v_main_~y~0_1131 v_main_~y~0_1130) (= (+ v_main_~x~0_1075 v_main_~y~0_1131) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1131)))))) InVars {main_~y~0=v_main_~y~0_1131, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1076, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1075, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:37,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {19690#(<= 500000 main_~y~0)} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19690#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:37,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {19690#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19691#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:37,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {19691#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19692#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:37,071 INFO L290 TraceCheckUtils]: 12: Hoare triple {19692#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19693#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:37,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {19693#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19694#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:37,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {19694#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19695#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:37,072 INFO L290 TraceCheckUtils]: 15: Hoare triple {19695#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19696#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:37,073 INFO L290 TraceCheckUtils]: 16: Hoare triple {19696#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19697#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:37,073 INFO L290 TraceCheckUtils]: 17: Hoare triple {19697#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19698#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:37,074 INFO L290 TraceCheckUtils]: 18: Hoare triple {19698#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19699#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:37,074 INFO L290 TraceCheckUtils]: 19: Hoare triple {19699#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19700#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:37,075 INFO L290 TraceCheckUtils]: 20: Hoare triple {19700#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19701#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:37,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {19701#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19702#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:37,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {19702#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19703#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:37,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {19703#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19704#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:37,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {19704#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19705#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:37,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {19705#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19706#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:37,078 INFO L290 TraceCheckUtils]: 26: Hoare triple {19706#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19707#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:37,078 INFO L290 TraceCheckUtils]: 27: Hoare triple {19707#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19708#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:37,079 INFO L290 TraceCheckUtils]: 28: Hoare triple {19708#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19709#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:37,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {19709#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19710#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:37,080 INFO L290 TraceCheckUtils]: 30: Hoare triple {19710#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19711#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:37,080 INFO L290 TraceCheckUtils]: 31: Hoare triple {19711#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19712#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:37,081 INFO L290 TraceCheckUtils]: 32: Hoare triple {19712#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19713#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:51:37,081 INFO L290 TraceCheckUtils]: 33: Hoare triple {19713#(<= 499954 main_~y~0)} assume !(~y~0 > 0); {19686#false} is VALID [2022-04-15 06:51:37,081 INFO L272 TraceCheckUtils]: 34: Hoare triple {19686#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19686#false} is VALID [2022-04-15 06:51:37,081 INFO L290 TraceCheckUtils]: 35: Hoare triple {19686#false} ~cond := #in~cond; {19686#false} is VALID [2022-04-15 06:51:37,081 INFO L290 TraceCheckUtils]: 36: Hoare triple {19686#false} assume 0 == ~cond; {19686#false} is VALID [2022-04-15 06:51:37,081 INFO L290 TraceCheckUtils]: 37: Hoare triple {19686#false} assume !false; {19686#false} is VALID [2022-04-15 06:51:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:37,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:38,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {19686#false} assume !false; {19686#false} is VALID [2022-04-15 06:51:38,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {19686#false} assume 0 == ~cond; {19686#false} is VALID [2022-04-15 06:51:38,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {19686#false} ~cond := #in~cond; {19686#false} is VALID [2022-04-15 06:51:38,000 INFO L272 TraceCheckUtils]: 34: Hoare triple {19686#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {19686#false} is VALID [2022-04-15 06:51:38,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {19841#(< 0 main_~y~0)} assume !(~y~0 > 0); {19686#false} is VALID [2022-04-15 06:51:38,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {19845#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19841#(< 0 main_~y~0)} is VALID [2022-04-15 06:51:38,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {19849#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19845#(< 2 main_~y~0)} is VALID [2022-04-15 06:51:38,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {19853#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19849#(< 4 main_~y~0)} is VALID [2022-04-15 06:51:38,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {19857#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19853#(< 6 main_~y~0)} is VALID [2022-04-15 06:51:38,003 INFO L290 TraceCheckUtils]: 28: Hoare triple {19861#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19857#(< 8 main_~y~0)} is VALID [2022-04-15 06:51:38,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {19865#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19861#(< 10 main_~y~0)} is VALID [2022-04-15 06:51:38,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {19869#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19865#(< 12 main_~y~0)} is VALID [2022-04-15 06:51:38,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {19873#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19869#(< 14 main_~y~0)} is VALID [2022-04-15 06:51:38,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {19877#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19873#(< 16 main_~y~0)} is VALID [2022-04-15 06:51:38,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {19881#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19877#(< 18 main_~y~0)} is VALID [2022-04-15 06:51:38,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {19885#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19881#(< 20 main_~y~0)} is VALID [2022-04-15 06:51:38,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {19889#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19885#(< 22 main_~y~0)} is VALID [2022-04-15 06:51:38,007 INFO L290 TraceCheckUtils]: 20: Hoare triple {19893#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19889#(< 24 main_~y~0)} is VALID [2022-04-15 06:51:38,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {19897#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19893#(< 26 main_~y~0)} is VALID [2022-04-15 06:51:38,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {19901#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19897#(< 28 main_~y~0)} is VALID [2022-04-15 06:51:38,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {19905#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19901#(< 30 main_~y~0)} is VALID [2022-04-15 06:51:38,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {19909#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19905#(< 32 main_~y~0)} is VALID [2022-04-15 06:51:38,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {19913#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19909#(< 34 main_~y~0)} is VALID [2022-04-15 06:51:38,010 INFO L290 TraceCheckUtils]: 14: Hoare triple {19917#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19913#(< 36 main_~y~0)} is VALID [2022-04-15 06:51:38,010 INFO L290 TraceCheckUtils]: 13: Hoare triple {19921#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19917#(< 38 main_~y~0)} is VALID [2022-04-15 06:51:38,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {19925#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19921#(< 40 main_~y~0)} is VALID [2022-04-15 06:51:38,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {19929#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19925#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:38,012 INFO L290 TraceCheckUtils]: 10: Hoare triple {19933#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {19929#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:38,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {19933#(< 46 main_~y~0)} [147] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {19933#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:38,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {19933#(< 46 main_~y~0)} [150] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse1 (= v_main_~y~0_1131 v_main_~y~0_1130)) (.cse2 (= v_main_~x~0_1076 v_main_~x~0_1075)) (.cse3 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse4 (<= 500000 v_main_~x~0_1076))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_1076 1000000))) .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1076 v_main_~y~0_1130))) (and .cse4 (< v_main_~y~0_1131 v_main_~y~0_1130) (= (+ v_main_~x~0_1075 v_main_~y~0_1131) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1131)))))) InVars {main_~y~0=v_main_~y~0_1131, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1076, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1075, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19933#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:38,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {19933#(< 46 main_~y~0)} [149] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19933#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:38,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {19933#(< 46 main_~y~0)} [148] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1074 v_main_~x~0_1073)) (.cse1 (= |v_main_#t~post4_148| |v_main_#t~post4_147|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1073 500001) (< v_main_~x~0_1074 v_main_~x~0_1073)) (and .cse0 (<= 500000 v_main_~x~0_1074) .cse1))) InVars {main_~x~0=v_main_~x~0_1074, main_#t~post4=|v_main_#t~post4_148|} OutVars{main_~x~0=v_main_~x~0_1073, main_#t~post4=|v_main_#t~post4_147|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19933#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:38,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {19685#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19933#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:38,014 INFO L272 TraceCheckUtils]: 4: Hoare triple {19685#true} call #t~ret9 := main(); {19685#true} is VALID [2022-04-15 06:51:38,014 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19685#true} {19685#true} #52#return; {19685#true} is VALID [2022-04-15 06:51:38,014 INFO L290 TraceCheckUtils]: 2: Hoare triple {19685#true} assume true; {19685#true} is VALID [2022-04-15 06:51:38,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {19685#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(17, 2);call #Ultimate.allocInit(12, 3); {19685#true} is VALID [2022-04-15 06:51:38,014 INFO L272 TraceCheckUtils]: 0: Hoare triple {19685#true} call ULTIMATE.init(); {19685#true} is VALID [2022-04-15 06:51:38,014 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:38,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080446270] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:38,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:38,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 51 [2022-04-15 06:51:39,575 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:39,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [354969208] [2022-04-15 06:51:39,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [354969208] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:39,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:39,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:51:39,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829793762] [2022-04-15 06:51:39,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:39,576 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 117 [2022-04-15 06:51:39,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:39,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 06:51:39,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:39,665 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:51:39,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:39,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:51:39,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3368, Invalid=5188, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 06:51:39,666 INFO L87 Difference]: Start difference. First operand 118 states and 121 transitions. Second operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 06:51:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:47,194 INFO L93 Difference]: Finished difference Result 233 states and 244 transitions. [2022-04-15 06:51:47,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:51:47,194 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 117 [2022-04-15 06:51:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:51:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 06:51:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 139 transitions. [2022-04-15 06:51:47,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 06:51:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 139 transitions. [2022-04-15 06:51:47,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 139 transitions. [2022-04-15 06:51:47,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:47,338 INFO L225 Difference]: With dead ends: 233 [2022-04-15 06:51:47,338 INFO L226 Difference]: Without dead ends: 123 [2022-04-15 06:51:47,340 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7264 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=7866, Invalid=17256, Unknown=0, NotChecked=0, Total=25122 [2022-04-15 06:51:47,341 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 270 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 3831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:51:47,342 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [270 Valid, 34 Invalid, 3831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-04-15 06:51:47,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-04-15 06:51:47,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2022-04-15 06:51:47,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:51:47,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 06:51:47,571 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 06:51:47,571 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 06:51:47,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:47,573 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-15 06:51:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 06:51:47,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:47,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:47,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 123 states. [2022-04-15 06:51:47,574 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 123 states. [2022-04-15 06:51:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:51:47,576 INFO L93 Difference]: Finished difference Result 123 states and 126 transitions. [2022-04-15 06:51:47,576 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 06:51:47,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:51:47,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:51:47,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:51:47,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:51:47,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0338983050847457) internal successors, (122), 118 states have internal predecessors, (122), 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 06:51:47,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 126 transitions. [2022-04-15 06:51:47,580 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 126 transitions. Word has length 117 [2022-04-15 06:51:47,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:51:47,580 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 126 transitions. [2022-04-15 06:51:47,580 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.6376811594202898) internal successors, (113), 68 states have internal predecessors, (113), 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 06:51:47,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 126 transitions. [2022-04-15 06:51:47,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:47,706 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 126 transitions. [2022-04-15 06:51:47,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:51:47,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:51:47,706 INFO L499 BasicCegarLoop]: trace histogram [43, 42, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:51:47,723 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 06:51:47,911 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:47,911 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:51:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:51:47,912 INFO L85 PathProgramCache]: Analyzing trace with hash 483082060, now seen corresponding path program 24 times [2022-04-15 06:51:47,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:47,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1429609184] [2022-04-15 06:51:48,005 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:48,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:51:48,256 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:51:48,258 INFO L85 PathProgramCache]: Analyzing trace with hash -245159039, now seen corresponding path program 1 times [2022-04-15 06:51:48,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:51:48,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238568254] [2022-04-15 06:51:48,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:48,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:51:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:51:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {21131#(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(17, 2);call #Ultimate.allocInit(12, 3); {21098#true} is VALID [2022-04-15 06:51:48,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {21098#true} assume true; {21098#true} is VALID [2022-04-15 06:51:48,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21098#true} {21098#true} #52#return; {21098#true} is VALID [2022-04-15 06:51:48,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {21098#true} call ULTIMATE.init(); {21131#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:51:48,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {21131#(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(17, 2);call #Ultimate.allocInit(12, 3); {21098#true} is VALID [2022-04-15 06:51:48,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {21098#true} assume true; {21098#true} is VALID [2022-04-15 06:51:48,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21098#true} {21098#true} #52#return; {21098#true} is VALID [2022-04-15 06:51:48,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {21098#true} call #t~ret9 := main(); {21098#true} is VALID [2022-04-15 06:51:48,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {21098#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21103#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-15 06:51:48,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {21103#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse1 (= |v_main_#t~post4_154| |v_main_#t~post4_153|))) (or (and (< v_main_~x~0_1154 v_main_~x~0_1153) (< v_main_~x~0_1153 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1154) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1154, main_#t~post4=|v_main_#t~post4_154|} OutVars{main_~x~0=v_main_~x~0_1153, main_#t~post4=|v_main_#t~post4_153|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21104#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:51:48,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {21104#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21104#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:51:48,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {21104#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1156 v_main_~x~0_1155)) (.cse1 (= v_main_~y~0_1226 v_main_~y~0_1225)) (.cse4 (<= 500000 v_main_~x~0_1156)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1156 v_main_~y~0_1225) (+ v_main_~x~0_1155 v_main_~y~0_1226)) .cse4 (< v_main_~x~0_1156 v_main_~x~0_1155) (< v_main_~x~0_1155 1000001)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1156 1000000)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1226, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1156, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1155, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21105#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-15 06:51:48,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {21105#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:48,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {21106#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21107#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:48,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {21107#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21108#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:48,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {21108#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21109#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:48,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {21109#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21110#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:48,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {21110#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21111#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:48,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {21111#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21112#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:48,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {21112#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21113#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:48,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {21113#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21114#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:48,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {21114#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21115#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:48,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {21115#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21116#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:48,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {21116#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21117#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:48,709 INFO L290 TraceCheckUtils]: 21: Hoare triple {21117#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21118#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:48,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {21118#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21119#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:48,710 INFO L290 TraceCheckUtils]: 23: Hoare triple {21119#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21120#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:48,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {21120#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21121#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:48,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {21121#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21122#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:48,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {21122#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21123#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:48,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {21123#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21124#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:48,713 INFO L290 TraceCheckUtils]: 28: Hoare triple {21124#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21125#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:48,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {21125#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21126#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:48,714 INFO L290 TraceCheckUtils]: 30: Hoare triple {21126#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21127#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:48,714 INFO L290 TraceCheckUtils]: 31: Hoare triple {21127#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21128#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:48,715 INFO L290 TraceCheckUtils]: 32: Hoare triple {21128#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21129#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:51:48,715 INFO L290 TraceCheckUtils]: 33: Hoare triple {21129#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21130#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:51:48,716 INFO L290 TraceCheckUtils]: 34: Hoare triple {21130#(<= 499952 main_~y~0)} assume !(~y~0 > 0); {21099#false} is VALID [2022-04-15 06:51:48,716 INFO L272 TraceCheckUtils]: 35: Hoare triple {21099#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21099#false} is VALID [2022-04-15 06:51:48,716 INFO L290 TraceCheckUtils]: 36: Hoare triple {21099#false} ~cond := #in~cond; {21099#false} is VALID [2022-04-15 06:51:48,716 INFO L290 TraceCheckUtils]: 37: Hoare triple {21099#false} assume 0 == ~cond; {21099#false} is VALID [2022-04-15 06:51:48,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {21099#false} assume !false; {21099#false} is VALID [2022-04-15 06:51:48,716 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:51:48,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:51:48,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238568254] [2022-04-15 06:51:48,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238568254] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:51:48,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139306295] [2022-04-15 06:51:48,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:51:48,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:51:48,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:51:48,718 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 06:51:48,718 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 06:51:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 06:51:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:51:48,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:51:49,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {21098#true} call ULTIMATE.init(); {21098#true} is VALID [2022-04-15 06:51:49,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {21098#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(17, 2);call #Ultimate.allocInit(12, 3); {21098#true} is VALID [2022-04-15 06:51:49,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {21098#true} assume true; {21098#true} is VALID [2022-04-15 06:51:49,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21098#true} {21098#true} #52#return; {21098#true} is VALID [2022-04-15 06:51:49,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {21098#true} call #t~ret9 := main(); {21098#true} is VALID [2022-04-15 06:51:49,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {21098#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:49,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {21106#(<= 500000 main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse1 (= |v_main_#t~post4_154| |v_main_#t~post4_153|))) (or (and (< v_main_~x~0_1154 v_main_~x~0_1153) (< v_main_~x~0_1153 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1154) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1154, main_#t~post4=|v_main_#t~post4_154|} OutVars{main_~x~0=v_main_~x~0_1153, main_#t~post4=|v_main_#t~post4_153|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:49,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {21106#(<= 500000 main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:49,128 INFO L290 TraceCheckUtils]: 8: Hoare triple {21106#(<= 500000 main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1156 v_main_~x~0_1155)) (.cse1 (= v_main_~y~0_1226 v_main_~y~0_1225)) (.cse4 (<= 500000 v_main_~x~0_1156)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1156 v_main_~y~0_1225) (+ v_main_~x~0_1155 v_main_~y~0_1226)) .cse4 (< v_main_~x~0_1156 v_main_~x~0_1155) (< v_main_~x~0_1155 1000001)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1156 1000000)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1226, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1156, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1155, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:49,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {21106#(<= 500000 main_~y~0)} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21106#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:51:49,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {21106#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21107#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:51:49,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {21107#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21108#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:51:49,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {21108#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21109#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:51:49,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {21109#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21110#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:51:49,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {21110#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21111#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:51:49,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {21111#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21112#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:51:49,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {21112#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21113#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:51:49,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {21113#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21114#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:51:49,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {21114#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21115#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:51:49,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {21115#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21116#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:51:49,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {21116#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21117#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:51:49,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {21117#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21118#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:51:49,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {21118#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21119#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:51:49,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {21119#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21120#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:51:49,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {21120#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21121#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:51:49,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {21121#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21122#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:51:49,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {21122#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21123#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:51:49,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {21123#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21124#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:51:49,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {21124#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21125#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:51:49,139 INFO L290 TraceCheckUtils]: 29: Hoare triple {21125#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21126#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:51:49,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {21126#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21127#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:51:49,140 INFO L290 TraceCheckUtils]: 31: Hoare triple {21127#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21128#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:51:49,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {21128#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21129#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:51:49,141 INFO L290 TraceCheckUtils]: 33: Hoare triple {21129#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21130#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:51:49,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {21130#(<= 499952 main_~y~0)} assume !(~y~0 > 0); {21099#false} is VALID [2022-04-15 06:51:49,141 INFO L272 TraceCheckUtils]: 35: Hoare triple {21099#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21099#false} is VALID [2022-04-15 06:51:49,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {21099#false} ~cond := #in~cond; {21099#false} is VALID [2022-04-15 06:51:49,141 INFO L290 TraceCheckUtils]: 37: Hoare triple {21099#false} assume 0 == ~cond; {21099#false} is VALID [2022-04-15 06:51:49,141 INFO L290 TraceCheckUtils]: 38: Hoare triple {21099#false} assume !false; {21099#false} is VALID [2022-04-15 06:51:49,142 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:49,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:51:50,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {21099#false} assume !false; {21099#false} is VALID [2022-04-15 06:51:50,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {21099#false} assume 0 == ~cond; {21099#false} is VALID [2022-04-15 06:51:50,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {21099#false} ~cond := #in~cond; {21099#false} is VALID [2022-04-15 06:51:50,170 INFO L272 TraceCheckUtils]: 35: Hoare triple {21099#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {21099#false} is VALID [2022-04-15 06:51:50,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {21261#(< 0 main_~y~0)} assume !(~y~0 > 0); {21099#false} is VALID [2022-04-15 06:51:50,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {21265#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21261#(< 0 main_~y~0)} is VALID [2022-04-15 06:51:50,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {21269#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21265#(< 2 main_~y~0)} is VALID [2022-04-15 06:51:50,172 INFO L290 TraceCheckUtils]: 31: Hoare triple {21273#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21269#(< 4 main_~y~0)} is VALID [2022-04-15 06:51:50,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {21277#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21273#(< 6 main_~y~0)} is VALID [2022-04-15 06:51:50,173 INFO L290 TraceCheckUtils]: 29: Hoare triple {21281#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21277#(< 8 main_~y~0)} is VALID [2022-04-15 06:51:50,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {21285#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21281#(< 10 main_~y~0)} is VALID [2022-04-15 06:51:50,174 INFO L290 TraceCheckUtils]: 27: Hoare triple {21289#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21285#(< 12 main_~y~0)} is VALID [2022-04-15 06:51:50,174 INFO L290 TraceCheckUtils]: 26: Hoare triple {21293#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21289#(< 14 main_~y~0)} is VALID [2022-04-15 06:51:50,175 INFO L290 TraceCheckUtils]: 25: Hoare triple {21297#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21293#(< 16 main_~y~0)} is VALID [2022-04-15 06:51:50,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {21301#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21297#(< 18 main_~y~0)} is VALID [2022-04-15 06:51:50,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {21305#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21301#(< 20 main_~y~0)} is VALID [2022-04-15 06:51:50,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {21309#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21305#(< 22 main_~y~0)} is VALID [2022-04-15 06:51:50,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {21313#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21309#(< 24 main_~y~0)} is VALID [2022-04-15 06:51:50,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {21317#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21313#(< 26 main_~y~0)} is VALID [2022-04-15 06:51:50,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {21321#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21317#(< 28 main_~y~0)} is VALID [2022-04-15 06:51:50,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {21325#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21321#(< 30 main_~y~0)} is VALID [2022-04-15 06:51:50,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {21329#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21325#(< 32 main_~y~0)} is VALID [2022-04-15 06:51:50,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {21333#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21329#(< 34 main_~y~0)} is VALID [2022-04-15 06:51:50,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {21337#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21333#(< 36 main_~y~0)} is VALID [2022-04-15 06:51:50,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {21341#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21337#(< 38 main_~y~0)} is VALID [2022-04-15 06:51:50,181 INFO L290 TraceCheckUtils]: 13: Hoare triple {21345#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21341#(< 40 main_~y~0)} is VALID [2022-04-15 06:51:50,181 INFO L290 TraceCheckUtils]: 12: Hoare triple {21349#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21345#(< 42 main_~y~0)} is VALID [2022-04-15 06:51:50,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {21353#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21349#(< 44 main_~y~0)} is VALID [2022-04-15 06:51:50,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {21357#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {21353#(< 46 main_~y~0)} is VALID [2022-04-15 06:51:50,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {21357#(< 48 main_~y~0)} [151] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {21357#(< 48 main_~y~0)} is VALID [2022-04-15 06:51:50,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {21357#(< 48 main_~y~0)} [154] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1156 v_main_~x~0_1155)) (.cse1 (= v_main_~y~0_1226 v_main_~y~0_1225)) (.cse4 (<= 500000 v_main_~x~0_1156)) (.cse2 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_1156 v_main_~y~0_1225) (+ v_main_~x~0_1155 v_main_~y~0_1226)) .cse4 (< v_main_~x~0_1156 v_main_~x~0_1155) (< v_main_~x~0_1155 1000001)) (and .cse0 .cse1 (or (not (< v_main_~x~0_1156 1000000)) (not .cse4)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1226, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1156, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1155, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21357#(< 48 main_~y~0)} is VALID [2022-04-15 06:51:50,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {21357#(< 48 main_~y~0)} [153] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21357#(< 48 main_~y~0)} is VALID [2022-04-15 06:51:50,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {21357#(< 48 main_~y~0)} [152] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse1 (= |v_main_#t~post4_154| |v_main_#t~post4_153|))) (or (and (< v_main_~x~0_1154 v_main_~x~0_1153) (< v_main_~x~0_1153 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1154) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1154, main_#t~post4=|v_main_#t~post4_154|} OutVars{main_~x~0=v_main_~x~0_1153, main_#t~post4=|v_main_#t~post4_153|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21357#(< 48 main_~y~0)} is VALID [2022-04-15 06:51:50,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {21098#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21357#(< 48 main_~y~0)} is VALID [2022-04-15 06:51:50,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {21098#true} call #t~ret9 := main(); {21098#true} is VALID [2022-04-15 06:51:50,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21098#true} {21098#true} #52#return; {21098#true} is VALID [2022-04-15 06:51:50,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {21098#true} assume true; {21098#true} is VALID [2022-04-15 06:51:50,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {21098#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(17, 2);call #Ultimate.allocInit(12, 3); {21098#true} is VALID [2022-04-15 06:51:50,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {21098#true} call ULTIMATE.init(); {21098#true} is VALID [2022-04-15 06:51:50,185 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:51:50,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139306295] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:51:50,185 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:51:50,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27, 27] total 56 [2022-04-15 06:51:51,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:51:51,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1429609184] [2022-04-15 06:51:51,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1429609184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:51:51,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:51:51,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-15 06:51:51,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944920544] [2022-04-15 06:51:51,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:51:51,915 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 122 [2022-04-15 06:51:51,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:51:51,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 06:51:52,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:51:52,007 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-15 06:51:52,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:51:52,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-15 06:51:52,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3816, Invalid=6084, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:51:52,009 INFO L87 Difference]: Start difference. First operand 123 states and 126 transitions. Second operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 06:52:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:00,338 INFO L93 Difference]: Finished difference Result 325 states and 336 transitions. [2022-04-15 06:52:00,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-15 06:52:00,339 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 122 [2022-04-15 06:52:00,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:00,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 06:52:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-15 06:52:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 06:52:00,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 144 transitions. [2022-04-15 06:52:00,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 144 transitions. [2022-04-15 06:52:00,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:00,460 INFO L225 Difference]: With dead ends: 325 [2022-04-15 06:52:00,460 INFO L226 Difference]: Without dead ends: 210 [2022-04-15 06:52:00,462 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8331 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=8708, Invalid=19684, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 06:52:00,462 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:00,462 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 19 Invalid, 4205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:52:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-04-15 06:52:00,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2022-04-15 06:52:00,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:00,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 06:52:00,854 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 06:52:00,854 INFO L87 Difference]: Start difference. First operand 210 states. Second operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 06:52:00,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:00,857 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-15 06:52:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:52:00,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:00,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:00,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 210 states. [2022-04-15 06:52:00,858 INFO L87 Difference]: Start difference. First operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 210 states. [2022-04-15 06:52:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:00,861 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2022-04-15 06:52:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:52:00,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:00,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:00,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:00,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 205 states have (on average 1.024390243902439) internal successors, (210), 205 states have internal predecessors, (210), 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 06:52:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 214 transitions. [2022-04-15 06:52:00,866 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 214 transitions. Word has length 122 [2022-04-15 06:52:00,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:00,866 INFO L478 AbstractCegarLoop]: Abstraction has 210 states and 214 transitions. [2022-04-15 06:52:00,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 1.6388888888888888) internal successors, (118), 71 states have internal predecessors, (118), 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 06:52:00,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 210 states and 214 transitions. [2022-04-15 06:52:01,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 214 transitions. [2022-04-15 06:52:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:52:01,061 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:01,061 INFO L499 BasicCegarLoop]: trace histogram [44, 43, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:01,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-15 06:52:01,262 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,SelfDestructingSolverStorable26 [2022-04-15 06:52:01,262 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:01,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:01,262 INFO L85 PathProgramCache]: Analyzing trace with hash 195292402, now seen corresponding path program 25 times [2022-04-15 06:52:01,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:01,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1685168708] [2022-04-15 06:52:04,414 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:52:04,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:04,697 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:04,698 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:04,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1654478590, now seen corresponding path program 1 times [2022-04-15 06:52:04,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:04,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249616593] [2022-04-15 06:52:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:04,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:05,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:05,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:05,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {23093#(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(17, 2);call #Ultimate.allocInit(12, 3); {23062#true} is VALID [2022-04-15 06:52:05,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {23062#true} assume true; {23062#true} is VALID [2022-04-15 06:52:05,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23062#true} {23062#true} #52#return; {23062#true} is VALID [2022-04-15 06:52:05,162 INFO L272 TraceCheckUtils]: 0: Hoare triple {23062#true} call ULTIMATE.init(); {23093#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:05,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {23093#(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(17, 2);call #Ultimate.allocInit(12, 3); {23062#true} is VALID [2022-04-15 06:52:05,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {23062#true} assume true; {23062#true} is VALID [2022-04-15 06:52:05,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23062#true} {23062#true} #52#return; {23062#true} is VALID [2022-04-15 06:52:05,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {23062#true} call #t~ret9 := main(); {23062#true} is VALID [2022-04-15 06:52:05,162 INFO L290 TraceCheckUtils]: 5: Hoare triple {23062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {23067#(<= 500000 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1237 v_main_~x~0_1236))) (or (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0) (and (< v_main_~x~0_1236 500001) (< v_main_~x~0_1237 v_main_~x~0_1236)) (and (= |v_main_#t~post4_159| |v_main_#t~post4_160|) (not (< v_main_~x~0_1237 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1237, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {23067#(<= 500000 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {23067#(<= 500000 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_1239)) (.cse0 (= v_main_~x~0_1239 v_main_~x~0_1238)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~y~0_1325 v_main_~y~0_1324)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1239 v_main_~x~0_1238) .cse4 (= (+ v_main_~x~0_1238 v_main_~y~0_1325) (+ v_main_~x~0_1239 v_main_~y~0_1324)) (< v_main_~x~0_1238 1000001)) (and (or (not .cse4) (not (< v_main_~x~0_1239 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1325, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1239, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {23067#(<= 500000 main_~y~0)} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {23067#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23068#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:05,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {23068#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23069#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:05,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {23069#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23070#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:05,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {23070#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23071#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:05,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {23071#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23072#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:05,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {23072#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23073#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:05,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {23073#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23074#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:05,168 INFO L290 TraceCheckUtils]: 17: Hoare triple {23074#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23075#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:05,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {23075#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23076#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:05,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {23076#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23077#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:05,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {23077#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23078#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:05,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23079#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:05,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {23079#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23080#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:05,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {23080#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23081#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:05,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {23081#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23082#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:05,172 INFO L290 TraceCheckUtils]: 25: Hoare triple {23082#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23083#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:05,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {23083#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23084#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:05,173 INFO L290 TraceCheckUtils]: 27: Hoare triple {23084#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23085#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:05,173 INFO L290 TraceCheckUtils]: 28: Hoare triple {23085#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23086#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:05,174 INFO L290 TraceCheckUtils]: 29: Hoare triple {23086#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23087#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:05,174 INFO L290 TraceCheckUtils]: 30: Hoare triple {23087#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23088#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:05,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {23088#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23089#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:05,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {23089#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23090#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:05,176 INFO L290 TraceCheckUtils]: 33: Hoare triple {23090#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23091#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:05,176 INFO L290 TraceCheckUtils]: 34: Hoare triple {23091#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23092#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:05,176 INFO L290 TraceCheckUtils]: 35: Hoare triple {23092#(<= 499950 main_~y~0)} assume !(~y~0 > 0); {23063#false} is VALID [2022-04-15 06:52:05,176 INFO L272 TraceCheckUtils]: 36: Hoare triple {23063#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {23063#false} is VALID [2022-04-15 06:52:05,177 INFO L290 TraceCheckUtils]: 37: Hoare triple {23063#false} ~cond := #in~cond; {23063#false} is VALID [2022-04-15 06:52:05,177 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#false} assume 0 == ~cond; {23063#false} is VALID [2022-04-15 06:52:05,177 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#false} assume !false; {23063#false} is VALID [2022-04-15 06:52:05,177 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:05,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:05,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249616593] [2022-04-15 06:52:05,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249616593] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:05,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245451838] [2022-04-15 06:52:05,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:05,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:05,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:05,178 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 06:52:05,179 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 06:52:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:05,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:52:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:05,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:05,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {23062#true} call ULTIMATE.init(); {23062#true} is VALID [2022-04-15 06:52:05,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {23062#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(17, 2);call #Ultimate.allocInit(12, 3); {23062#true} is VALID [2022-04-15 06:52:05,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {23062#true} assume true; {23062#true} is VALID [2022-04-15 06:52:05,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23062#true} {23062#true} #52#return; {23062#true} is VALID [2022-04-15 06:52:05,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {23062#true} call #t~ret9 := main(); {23062#true} is VALID [2022-04-15 06:52:05,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {23062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {23067#(<= 500000 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1237 v_main_~x~0_1236))) (or (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0) (and (< v_main_~x~0_1236 500001) (< v_main_~x~0_1237 v_main_~x~0_1236)) (and (= |v_main_#t~post4_159| |v_main_#t~post4_160|) (not (< v_main_~x~0_1237 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1237, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {23067#(<= 500000 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,654 INFO L290 TraceCheckUtils]: 8: Hoare triple {23067#(<= 500000 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_1239)) (.cse0 (= v_main_~x~0_1239 v_main_~x~0_1238)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~y~0_1325 v_main_~y~0_1324)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1239 v_main_~x~0_1238) .cse4 (= (+ v_main_~x~0_1238 v_main_~y~0_1325) (+ v_main_~x~0_1239 v_main_~y~0_1324)) (< v_main_~x~0_1238 1000001)) (and (or (not .cse4) (not (< v_main_~x~0_1239 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1325, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1239, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,654 INFO L290 TraceCheckUtils]: 9: Hoare triple {23067#(<= 500000 main_~y~0)} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {23067#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:05,655 INFO L290 TraceCheckUtils]: 10: Hoare triple {23067#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23068#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:05,655 INFO L290 TraceCheckUtils]: 11: Hoare triple {23068#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23069#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:05,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {23069#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23070#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:05,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {23070#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23071#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:05,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {23071#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23072#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:05,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {23072#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23073#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:05,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {23073#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23074#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:05,658 INFO L290 TraceCheckUtils]: 17: Hoare triple {23074#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23075#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:05,659 INFO L290 TraceCheckUtils]: 18: Hoare triple {23075#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23076#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:05,659 INFO L290 TraceCheckUtils]: 19: Hoare triple {23076#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23077#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:05,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {23077#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23078#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:05,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {23078#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23079#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:05,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {23079#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23080#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:05,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {23080#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23081#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:05,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {23081#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23082#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:05,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {23082#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23083#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:05,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {23083#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23084#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:05,663 INFO L290 TraceCheckUtils]: 27: Hoare triple {23084#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23085#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:05,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {23085#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23086#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:05,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {23086#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23087#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:05,665 INFO L290 TraceCheckUtils]: 30: Hoare triple {23087#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23088#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:05,665 INFO L290 TraceCheckUtils]: 31: Hoare triple {23088#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23089#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:05,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {23089#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23090#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:05,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {23090#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23091#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:05,667 INFO L290 TraceCheckUtils]: 34: Hoare triple {23091#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23092#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:05,667 INFO L290 TraceCheckUtils]: 35: Hoare triple {23092#(<= 499950 main_~y~0)} assume !(~y~0 > 0); {23063#false} is VALID [2022-04-15 06:52:05,667 INFO L272 TraceCheckUtils]: 36: Hoare triple {23063#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {23063#false} is VALID [2022-04-15 06:52:05,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {23063#false} ~cond := #in~cond; {23063#false} is VALID [2022-04-15 06:52:05,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#false} assume 0 == ~cond; {23063#false} is VALID [2022-04-15 06:52:05,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#false} assume !false; {23063#false} is VALID [2022-04-15 06:52:05,668 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:05,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:06,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#false} assume !false; {23063#false} is VALID [2022-04-15 06:52:06,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#false} assume 0 == ~cond; {23063#false} is VALID [2022-04-15 06:52:06,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {23063#false} ~cond := #in~cond; {23063#false} is VALID [2022-04-15 06:52:06,749 INFO L272 TraceCheckUtils]: 36: Hoare triple {23063#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {23063#false} is VALID [2022-04-15 06:52:06,750 INFO L290 TraceCheckUtils]: 35: Hoare triple {23226#(< 0 main_~y~0)} assume !(~y~0 > 0); {23063#false} is VALID [2022-04-15 06:52:06,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {23230#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23226#(< 0 main_~y~0)} is VALID [2022-04-15 06:52:06,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {23234#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23230#(< 2 main_~y~0)} is VALID [2022-04-15 06:52:06,751 INFO L290 TraceCheckUtils]: 32: Hoare triple {23238#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23234#(< 4 main_~y~0)} is VALID [2022-04-15 06:52:06,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {23242#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23238#(< 6 main_~y~0)} is VALID [2022-04-15 06:52:06,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {23246#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23242#(< 8 main_~y~0)} is VALID [2022-04-15 06:52:06,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {23250#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23246#(< 10 main_~y~0)} is VALID [2022-04-15 06:52:06,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {23254#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23250#(< 12 main_~y~0)} is VALID [2022-04-15 06:52:06,754 INFO L290 TraceCheckUtils]: 27: Hoare triple {23258#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23254#(< 14 main_~y~0)} is VALID [2022-04-15 06:52:06,754 INFO L290 TraceCheckUtils]: 26: Hoare triple {23262#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23258#(< 16 main_~y~0)} is VALID [2022-04-15 06:52:06,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {23266#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23262#(< 18 main_~y~0)} is VALID [2022-04-15 06:52:06,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {23270#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23266#(< 20 main_~y~0)} is VALID [2022-04-15 06:52:06,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {23274#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23270#(< 22 main_~y~0)} is VALID [2022-04-15 06:52:06,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {23278#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23274#(< 24 main_~y~0)} is VALID [2022-04-15 06:52:06,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {23282#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23278#(< 26 main_~y~0)} is VALID [2022-04-15 06:52:06,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {23286#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23282#(< 28 main_~y~0)} is VALID [2022-04-15 06:52:06,758 INFO L290 TraceCheckUtils]: 19: Hoare triple {23290#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23286#(< 30 main_~y~0)} is VALID [2022-04-15 06:52:06,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {23294#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23290#(< 32 main_~y~0)} is VALID [2022-04-15 06:52:06,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {23298#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23294#(< 34 main_~y~0)} is VALID [2022-04-15 06:52:06,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {23302#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23298#(< 36 main_~y~0)} is VALID [2022-04-15 06:52:06,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {23306#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23302#(< 38 main_~y~0)} is VALID [2022-04-15 06:52:06,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {23310#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23306#(< 40 main_~y~0)} is VALID [2022-04-15 06:52:06,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {23314#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23310#(< 42 main_~y~0)} is VALID [2022-04-15 06:52:06,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {23318#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23314#(< 44 main_~y~0)} is VALID [2022-04-15 06:52:06,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {23322#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23318#(< 46 main_~y~0)} is VALID [2022-04-15 06:52:06,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {23326#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {23322#(< 48 main_~y~0)} is VALID [2022-04-15 06:52:06,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {23326#(< 50 main_~y~0)} [155] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {23326#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:06,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {23326#(< 50 main_~y~0)} [158] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_1239)) (.cse0 (= v_main_~x~0_1239 v_main_~x~0_1238)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= v_main_~y~0_1325 v_main_~y~0_1324)) (.cse3 (= |v_main_#t~post6_172| |v_main_#t~post6_171|))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1239 v_main_~x~0_1238) .cse4 (= (+ v_main_~x~0_1238 v_main_~y~0_1325) (+ v_main_~x~0_1239 v_main_~y~0_1324)) (< v_main_~x~0_1238 1000001)) (and (or (not .cse4) (not (< v_main_~x~0_1239 1000000))) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_1325, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1239, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23326#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:06,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {23326#(< 50 main_~y~0)} [157] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23326#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:06,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {23326#(< 50 main_~y~0)} [156] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1237 v_main_~x~0_1236))) (or (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0) (and (< v_main_~x~0_1236 500001) (< v_main_~x~0_1237 v_main_~x~0_1236)) (and (= |v_main_#t~post4_159| |v_main_#t~post4_160|) (not (< v_main_~x~0_1237 500000)) .cse0))) InVars {main_~x~0=v_main_~x~0_1237, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23326#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:06,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {23062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23326#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:06,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {23062#true} call #t~ret9 := main(); {23062#true} is VALID [2022-04-15 06:52:06,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23062#true} {23062#true} #52#return; {23062#true} is VALID [2022-04-15 06:52:06,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {23062#true} assume true; {23062#true} is VALID [2022-04-15 06:52:06,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {23062#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(17, 2);call #Ultimate.allocInit(12, 3); {23062#true} is VALID [2022-04-15 06:52:06,765 INFO L272 TraceCheckUtils]: 0: Hoare triple {23062#true} call ULTIMATE.init(); {23062#true} is VALID [2022-04-15 06:52:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245451838] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:06,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 55 [2022-04-15 06:52:08,601 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1685168708] [2022-04-15 06:52:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1685168708] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:08,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:08,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [74] imperfect sequences [] total 74 [2022-04-15 06:52:08,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276654998] [2022-04-15 06:52:08,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:08,602 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 125 [2022-04-15 06:52:08,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:08,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 06:52:08,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:08,693 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-04-15 06:52:08,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:08,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-04-15 06:52:08,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3907, Invalid=5993, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 06:52:08,695 INFO L87 Difference]: Start difference. First operand 210 states and 214 transitions. Second operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 06:52:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:17,170 INFO L93 Difference]: Finished difference Result 333 states and 347 transitions. [2022-04-15 06:52:17,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-04-15 06:52:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 125 [2022-04-15 06:52:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:17,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 06:52:17,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 149 transitions. [2022-04-15 06:52:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 06:52:17,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 149 transitions. [2022-04-15 06:52:17,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 149 transitions. [2022-04-15 06:52:17,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:17,335 INFO L225 Difference]: With dead ends: 333 [2022-04-15 06:52:17,335 INFO L226 Difference]: Without dead ends: 217 [2022-04-15 06:52:17,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=9115, Invalid=19955, Unknown=0, NotChecked=0, Total=29070 [2022-04-15 06:52:17,339 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 148 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4054 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 4279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 4054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:17,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 44 Invalid, 4279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 4054 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 06:52:17,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-04-15 06:52:17,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 131. [2022-04-15 06:52:17,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:17,574 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 06:52:17,574 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 06:52:17,574 INFO L87 Difference]: Start difference. First operand 217 states. Second operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 06:52:17,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:17,577 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-04-15 06:52:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-04-15 06:52:17,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:17,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:17,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 217 states. [2022-04-15 06:52:17,578 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 217 states. [2022-04-15 06:52:17,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:17,581 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-04-15 06:52:17,581 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 221 transitions. [2022-04-15 06:52:17,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:17,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:17,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:17,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:17,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0317460317460319) internal successors, (130), 126 states have internal predecessors, (130), 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 06:52:17,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 134 transitions. [2022-04-15 06:52:17,584 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 134 transitions. Word has length 125 [2022-04-15 06:52:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:17,584 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 134 transitions. [2022-04-15 06:52:17,585 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 1.635135135135135) internal successors, (121), 73 states have internal predecessors, (121), 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 06:52:17,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 134 transitions. [2022-04-15 06:52:17,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 134 transitions. [2022-04-15 06:52:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:52:17,720 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:17,720 INFO L499 BasicCegarLoop]: trace histogram [46, 45, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:17,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:17,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:52:17,920 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:17,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:17,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1280005371, now seen corresponding path program 26 times [2022-04-15 06:52:17,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:17,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872337491] [2022-04-15 06:52:18,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:18,348 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:18,349 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1189955167, now seen corresponding path program 1 times [2022-04-15 06:52:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:18,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880922409] [2022-04-15 06:52:18,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:18,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:18,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:18,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {24940#(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(17, 2);call #Ultimate.allocInit(12, 3); {24908#true} is VALID [2022-04-15 06:52:18,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {24908#true} assume true; {24908#true} is VALID [2022-04-15 06:52:18,840 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24908#true} {24908#true} #52#return; {24908#true} is VALID [2022-04-15 06:52:18,841 INFO L272 TraceCheckUtils]: 0: Hoare triple {24908#true} call ULTIMATE.init(); {24940#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:18,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {24940#(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(17, 2);call #Ultimate.allocInit(12, 3); {24908#true} is VALID [2022-04-15 06:52:18,841 INFO L290 TraceCheckUtils]: 2: Hoare triple {24908#true} assume true; {24908#true} is VALID [2022-04-15 06:52:18,841 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24908#true} {24908#true} #52#return; {24908#true} is VALID [2022-04-15 06:52:18,842 INFO L272 TraceCheckUtils]: 4: Hoare triple {24908#true} call #t~ret9 := main(); {24908#true} is VALID [2022-04-15 06:52:18,842 INFO L290 TraceCheckUtils]: 5: Hoare triple {24908#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:18,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {24913#(<= 500000 main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_166| |v_main_#t~post4_165|)) (.cse1 (= v_main_~x~0_1322 v_main_~x~0_1321))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1322 500000))) (and (< v_main_~x~0_1322 v_main_~x~0_1321) (< v_main_~x~0_1321 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} OutVars{main_~x~0=v_main_~x~0_1321, main_#t~post4=|v_main_#t~post4_165|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:18,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {24913#(<= 500000 main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:18,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {24913#(<= 500000 main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1324 v_main_~x~0_1323)) (.cse3 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse0 (<= 500000 v_main_~x~0_1324)) (.cse4 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse5 (= |v_main_#t~post5_179| |v_main_#t~post5_178|))) (or (let ((.cse1 (+ v_main_~x~0_1324 v_main_~y~0_1426))) (and .cse0 (< v_main_~y~0_1427 v_main_~y~0_1426) (= (+ v_main_~x~0_1323 v_main_~y~0_1427) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1427)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1324 1000000))) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1324, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1323, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:18,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {24913#(<= 500000 main_~y~0)} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:18,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {24913#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24914#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:18,846 INFO L290 TraceCheckUtils]: 11: Hoare triple {24914#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24915#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:18,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24916#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:18,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {24916#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24917#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:18,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {24917#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24918#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:18,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {24918#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24919#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:18,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {24919#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24920#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:18,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {24920#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24921#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:18,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {24921#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24922#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:18,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {24922#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24923#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:18,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {24923#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24924#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:18,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {24924#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24925#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:18,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {24925#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24926#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:18,854 INFO L290 TraceCheckUtils]: 23: Hoare triple {24926#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24927#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:18,854 INFO L290 TraceCheckUtils]: 24: Hoare triple {24927#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24928#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:18,855 INFO L290 TraceCheckUtils]: 25: Hoare triple {24928#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24929#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:18,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {24929#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24930#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:18,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {24930#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24931#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:18,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {24931#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24932#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:18,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {24932#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24933#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:18,857 INFO L290 TraceCheckUtils]: 30: Hoare triple {24933#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24934#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:18,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {24934#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24935#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:18,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {24935#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24936#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:18,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {24936#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24937#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:18,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {24937#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24938#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:18,859 INFO L290 TraceCheckUtils]: 35: Hoare triple {24938#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24939#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:18,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {24939#(<= 499948 main_~y~0)} assume !(~y~0 > 0); {24909#false} is VALID [2022-04-15 06:52:18,860 INFO L272 TraceCheckUtils]: 37: Hoare triple {24909#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24909#false} is VALID [2022-04-15 06:52:18,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {24909#false} ~cond := #in~cond; {24909#false} is VALID [2022-04-15 06:52:18,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {24909#false} assume 0 == ~cond; {24909#false} is VALID [2022-04-15 06:52:18,860 INFO L290 TraceCheckUtils]: 40: Hoare triple {24909#false} assume !false; {24909#false} is VALID [2022-04-15 06:52:18,860 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:18,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880922409] [2022-04-15 06:52:18,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880922409] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:18,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562456618] [2022-04-15 06:52:18,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:18,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:18,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:18,862 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:18,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:52:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:18,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 06:52:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:18,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:19,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {24908#true} call ULTIMATE.init(); {24908#true} is VALID [2022-04-15 06:52:19,272 INFO L290 TraceCheckUtils]: 1: Hoare triple {24908#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(17, 2);call #Ultimate.allocInit(12, 3); {24908#true} is VALID [2022-04-15 06:52:19,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {24908#true} assume true; {24908#true} is VALID [2022-04-15 06:52:19,272 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24908#true} {24908#true} #52#return; {24908#true} is VALID [2022-04-15 06:52:19,272 INFO L272 TraceCheckUtils]: 4: Hoare triple {24908#true} call #t~ret9 := main(); {24908#true} is VALID [2022-04-15 06:52:19,272 INFO L290 TraceCheckUtils]: 5: Hoare triple {24908#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:19,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {24913#(<= 500000 main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_166| |v_main_#t~post4_165|)) (.cse1 (= v_main_~x~0_1322 v_main_~x~0_1321))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1322 500000))) (and (< v_main_~x~0_1322 v_main_~x~0_1321) (< v_main_~x~0_1321 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} OutVars{main_~x~0=v_main_~x~0_1321, main_#t~post4=|v_main_#t~post4_165|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:19,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {24913#(<= 500000 main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:19,274 INFO L290 TraceCheckUtils]: 8: Hoare triple {24913#(<= 500000 main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1324 v_main_~x~0_1323)) (.cse3 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse0 (<= 500000 v_main_~x~0_1324)) (.cse4 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse5 (= |v_main_#t~post5_179| |v_main_#t~post5_178|))) (or (let ((.cse1 (+ v_main_~x~0_1324 v_main_~y~0_1426))) (and .cse0 (< v_main_~y~0_1427 v_main_~y~0_1426) (= (+ v_main_~x~0_1323 v_main_~y~0_1427) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1427)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1324 1000000))) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1324, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1323, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:19,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {24913#(<= 500000 main_~y~0)} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {24913#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:19,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {24913#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24914#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:19,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {24914#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24915#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:19,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {24915#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24916#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:19,276 INFO L290 TraceCheckUtils]: 13: Hoare triple {24916#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24917#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:19,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {24917#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24918#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:19,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {24918#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24919#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:19,277 INFO L290 TraceCheckUtils]: 16: Hoare triple {24919#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24920#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:19,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {24920#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24921#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:19,278 INFO L290 TraceCheckUtils]: 18: Hoare triple {24921#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24922#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:19,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {24922#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24923#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:19,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {24923#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24924#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:19,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {24924#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24925#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:19,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {24925#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24926#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:19,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {24926#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24927#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:19,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {24927#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24928#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:19,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {24928#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24929#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:19,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {24929#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24930#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:19,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {24930#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24931#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:19,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {24931#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24932#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:19,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {24932#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24933#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:19,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {24933#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24934#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:19,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {24934#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24935#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:19,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {24935#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24936#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:19,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {24936#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24937#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:19,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {24937#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24938#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:19,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {24938#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {24939#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:19,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {24939#(<= 499948 main_~y~0)} assume !(~y~0 > 0); {24909#false} is VALID [2022-04-15 06:52:19,287 INFO L272 TraceCheckUtils]: 37: Hoare triple {24909#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24909#false} is VALID [2022-04-15 06:52:19,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {24909#false} ~cond := #in~cond; {24909#false} is VALID [2022-04-15 06:52:19,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {24909#false} assume 0 == ~cond; {24909#false} is VALID [2022-04-15 06:52:19,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {24909#false} assume !false; {24909#false} is VALID [2022-04-15 06:52:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:19,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:20,408 INFO L290 TraceCheckUtils]: 40: Hoare triple {24909#false} assume !false; {24909#false} is VALID [2022-04-15 06:52:20,408 INFO L290 TraceCheckUtils]: 39: Hoare triple {24909#false} assume 0 == ~cond; {24909#false} is VALID [2022-04-15 06:52:20,408 INFO L290 TraceCheckUtils]: 38: Hoare triple {24909#false} ~cond := #in~cond; {24909#false} is VALID [2022-04-15 06:52:20,408 INFO L272 TraceCheckUtils]: 37: Hoare triple {24909#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {24909#false} is VALID [2022-04-15 06:52:20,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {25076#(< 0 main_~y~0)} assume !(~y~0 > 0); {24909#false} is VALID [2022-04-15 06:52:20,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {25080#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25076#(< 0 main_~y~0)} is VALID [2022-04-15 06:52:20,410 INFO L290 TraceCheckUtils]: 34: Hoare triple {25084#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25080#(< 2 main_~y~0)} is VALID [2022-04-15 06:52:20,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {25088#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25084#(< 4 main_~y~0)} is VALID [2022-04-15 06:52:20,411 INFO L290 TraceCheckUtils]: 32: Hoare triple {25092#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25088#(< 6 main_~y~0)} is VALID [2022-04-15 06:52:20,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {25096#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25092#(< 8 main_~y~0)} is VALID [2022-04-15 06:52:20,412 INFO L290 TraceCheckUtils]: 30: Hoare triple {25100#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25096#(< 10 main_~y~0)} is VALID [2022-04-15 06:52:20,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {25104#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25100#(< 12 main_~y~0)} is VALID [2022-04-15 06:52:20,413 INFO L290 TraceCheckUtils]: 28: Hoare triple {25108#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25104#(< 14 main_~y~0)} is VALID [2022-04-15 06:52:20,413 INFO L290 TraceCheckUtils]: 27: Hoare triple {25112#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25108#(< 16 main_~y~0)} is VALID [2022-04-15 06:52:20,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {25116#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25112#(< 18 main_~y~0)} is VALID [2022-04-15 06:52:20,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {25120#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25116#(< 20 main_~y~0)} is VALID [2022-04-15 06:52:20,415 INFO L290 TraceCheckUtils]: 24: Hoare triple {25124#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25120#(< 22 main_~y~0)} is VALID [2022-04-15 06:52:20,415 INFO L290 TraceCheckUtils]: 23: Hoare triple {25128#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25124#(< 24 main_~y~0)} is VALID [2022-04-15 06:52:20,415 INFO L290 TraceCheckUtils]: 22: Hoare triple {25132#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25128#(< 26 main_~y~0)} is VALID [2022-04-15 06:52:20,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {25136#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25132#(< 28 main_~y~0)} is VALID [2022-04-15 06:52:20,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {25140#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25136#(< 30 main_~y~0)} is VALID [2022-04-15 06:52:20,417 INFO L290 TraceCheckUtils]: 19: Hoare triple {25144#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25140#(< 32 main_~y~0)} is VALID [2022-04-15 06:52:20,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {25148#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25144#(< 34 main_~y~0)} is VALID [2022-04-15 06:52:20,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {25152#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25148#(< 36 main_~y~0)} is VALID [2022-04-15 06:52:20,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {25156#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25152#(< 38 main_~y~0)} is VALID [2022-04-15 06:52:20,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {25160#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25156#(< 40 main_~y~0)} is VALID [2022-04-15 06:52:20,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {25164#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25160#(< 42 main_~y~0)} is VALID [2022-04-15 06:52:20,420 INFO L290 TraceCheckUtils]: 13: Hoare triple {25168#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25164#(< 44 main_~y~0)} is VALID [2022-04-15 06:52:20,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {25172#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25168#(< 46 main_~y~0)} is VALID [2022-04-15 06:52:20,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {25176#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25172#(< 48 main_~y~0)} is VALID [2022-04-15 06:52:20,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {25180#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {25176#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:20,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {25180#(< 52 main_~y~0)} [159] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {25180#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:20,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {25180#(< 52 main_~y~0)} [162] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1324 v_main_~x~0_1323)) (.cse3 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse0 (<= 500000 v_main_~x~0_1324)) (.cse4 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse5 (= |v_main_#t~post5_179| |v_main_#t~post5_178|))) (or (let ((.cse1 (+ v_main_~x~0_1324 v_main_~y~0_1426))) (and .cse0 (< v_main_~y~0_1427 v_main_~y~0_1426) (= (+ v_main_~x~0_1323 v_main_~y~0_1427) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1427)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_1324 1000000))) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1324, main_#t~post6=|v_main_#t~post6_179|} OutVars{main_~y~0=v_main_~y~0_1426, main_#t~post5=|v_main_#t~post5_178|, main_~x~0=v_main_~x~0_1323, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25180#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:20,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {25180#(< 52 main_~y~0)} [161] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25180#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:20,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {25180#(< 52 main_~y~0)} [160] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_166| |v_main_#t~post4_165|)) (.cse1 (= v_main_~x~0_1322 v_main_~x~0_1321))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1322 500000))) (and (< v_main_~x~0_1322 v_main_~x~0_1321) (< v_main_~x~0_1321 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} OutVars{main_~x~0=v_main_~x~0_1321, main_#t~post4=|v_main_#t~post4_165|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25180#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:20,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {24908#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25180#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:20,423 INFO L272 TraceCheckUtils]: 4: Hoare triple {24908#true} call #t~ret9 := main(); {24908#true} is VALID [2022-04-15 06:52:20,423 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24908#true} {24908#true} #52#return; {24908#true} is VALID [2022-04-15 06:52:20,423 INFO L290 TraceCheckUtils]: 2: Hoare triple {24908#true} assume true; {24908#true} is VALID [2022-04-15 06:52:20,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {24908#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(17, 2);call #Ultimate.allocInit(12, 3); {24908#true} is VALID [2022-04-15 06:52:20,424 INFO L272 TraceCheckUtils]: 0: Hoare triple {24908#true} call ULTIMATE.init(); {24908#true} is VALID [2022-04-15 06:52:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:20,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562456618] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:20,424 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:20,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 57 [2022-04-15 06:52:22,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:22,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872337491] [2022-04-15 06:52:22,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872337491] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:22,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:22,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-15 06:52:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980757288] [2022-04-15 06:52:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:22,270 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 130 [2022-04-15 06:52:22,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:22,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 06:52:22,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:22,362 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-15 06:52:22,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:22,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-15 06:52:22,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4220, Invalid=6492, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:52:22,364 INFO L87 Difference]: Start difference. First operand 131 states and 134 transitions. Second operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 06:52:31,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:31,329 INFO L93 Difference]: Finished difference Result 259 states and 270 transitions. [2022-04-15 06:52:31,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-15 06:52:31,330 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 130 [2022-04-15 06:52:31,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 06:52:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 152 transitions. [2022-04-15 06:52:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 06:52:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 152 transitions. [2022-04-15 06:52:31,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 152 transitions. [2022-04-15 06:52:31,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:31,475 INFO L225 Difference]: With dead ends: 259 [2022-04-15 06:52:31,475 INFO L226 Difference]: Without dead ends: 136 [2022-04-15 06:52:31,477 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9136 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=9846, Invalid=21660, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:52:31,482 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 203 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4402 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 4402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:31,482 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 39 Invalid, 4682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 4402 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-04-15 06:52:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-15 06:52:31,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-04-15 06:52:31,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:31,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 06:52:31,715 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 06:52:31,715 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 06:52:31,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:31,717 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2022-04-15 06:52:31,717 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-04-15 06:52:31,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:31,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:31,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 136 states. [2022-04-15 06:52:31,718 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 136 states. [2022-04-15 06:52:31,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:31,719 INFO L93 Difference]: Finished difference Result 136 states and 139 transitions. [2022-04-15 06:52:31,719 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-04-15 06:52:31,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:31,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:31,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:31,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0305343511450382) internal successors, (135), 131 states have internal predecessors, (135), 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 06:52:31,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2022-04-15 06:52:31,722 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 130 [2022-04-15 06:52:31,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:31,722 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2022-04-15 06:52:31,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 76 states have internal predecessors, (126), 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 06:52:31,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 139 transitions. [2022-04-15 06:52:31,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-04-15 06:52:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 06:52:31,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:31,838 INFO L499 BasicCegarLoop]: trace histogram [48, 47, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:31,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:32,039 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:52:32,039 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:32,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:32,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1991455810, now seen corresponding path program 27 times [2022-04-15 06:52:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:32,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [664542933] [2022-04-15 06:52:32,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:32,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:32,354 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1012883742, now seen corresponding path program 1 times [2022-04-15 06:52:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:32,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504254592] [2022-04-15 06:52:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:32,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:32,826 INFO L290 TraceCheckUtils]: 0: Hoare triple {26503#(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(17, 2);call #Ultimate.allocInit(12, 3); {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {26470#true} assume true; {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26470#true} {26470#true} #52#return; {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {26470#true} call ULTIMATE.init(); {26503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:32,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {26503#(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(17, 2);call #Ultimate.allocInit(12, 3); {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {26470#true} assume true; {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26470#true} {26470#true} #52#return; {26470#true} is VALID [2022-04-15 06:52:32,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {26470#true} call #t~ret9 := main(); {26470#true} is VALID [2022-04-15 06:52:32,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {26470#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:32,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {26475#(<= 500000 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_172| |v_main_#t~post4_171|))) (or (and .cse0 (<= 500000 v_main_~x~0_1410) (= v_main_~x~0_1409 v_main_~x~0_1410)) (and (< v_main_~x~0_1409 500001) (< v_main_~x~0_1410 v_main_~x~0_1409)) (and (= v_main_~x~0_1410 v_main_~x~0_1409) .cse0))) InVars {main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} OutVars{main_~x~0=v_main_~x~0_1409, main_#t~post4=|v_main_#t~post4_171|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:32,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {26475#(<= 500000 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:32,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {26475#(<= 500000 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1412 v_main_~x~0_1411)) (.cse3 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse4 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse1 (<= 500000 v_main_~x~0_1412))) (or (and .cse0 (or (not (< v_main_~x~0_1412 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (= (+ v_main_~x~0_1411 v_main_~y~0_1533) (+ v_main_~x~0_1412 v_main_~y~0_1532)) (< v_main_~x~0_1412 v_main_~x~0_1411) (< v_main_~x~0_1411 1000001)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1412, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1532, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1411, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:32,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {26475#(<= 500000 main_~y~0)} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:32,829 INFO L290 TraceCheckUtils]: 10: Hoare triple {26475#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26476#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:32,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {26476#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26477#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:32,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {26477#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26478#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:32,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {26478#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26479#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:32,831 INFO L290 TraceCheckUtils]: 14: Hoare triple {26479#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26480#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:32,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {26480#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26481#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:32,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {26481#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26482#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:32,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {26482#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26483#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:32,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {26483#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26484#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:32,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {26484#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26485#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:32,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {26485#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26486#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:32,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {26486#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26487#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:32,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {26487#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26488#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:32,835 INFO L290 TraceCheckUtils]: 23: Hoare triple {26488#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26489#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:32,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {26489#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26490#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:32,836 INFO L290 TraceCheckUtils]: 25: Hoare triple {26490#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26491#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:32,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {26491#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26492#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:32,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {26492#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26493#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:32,837 INFO L290 TraceCheckUtils]: 28: Hoare triple {26493#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26494#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:32,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {26494#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26495#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:32,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {26495#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26496#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:32,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {26496#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26497#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:32,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {26497#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26498#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:32,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {26498#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26499#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:32,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {26499#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26500#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:32,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {26500#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26501#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:32,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {26501#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26502#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:52:32,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {26502#(<= 499946 main_~y~0)} assume !(~y~0 > 0); {26471#false} is VALID [2022-04-15 06:52:32,842 INFO L272 TraceCheckUtils]: 38: Hoare triple {26471#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {26471#false} is VALID [2022-04-15 06:52:32,842 INFO L290 TraceCheckUtils]: 39: Hoare triple {26471#false} ~cond := #in~cond; {26471#false} is VALID [2022-04-15 06:52:32,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {26471#false} assume 0 == ~cond; {26471#false} is VALID [2022-04-15 06:52:32,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {26471#false} assume !false; {26471#false} is VALID [2022-04-15 06:52:32,842 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:32,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:32,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504254592] [2022-04-15 06:52:32,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504254592] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:32,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [51140393] [2022-04-15 06:52:32,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:32,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:32,844 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:32,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:52:32,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:32,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:52:32,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:32,919 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:33,251 INFO L272 TraceCheckUtils]: 0: Hoare triple {26470#true} call ULTIMATE.init(); {26470#true} is VALID [2022-04-15 06:52:33,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {26470#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(17, 2);call #Ultimate.allocInit(12, 3); {26470#true} is VALID [2022-04-15 06:52:33,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {26470#true} assume true; {26470#true} is VALID [2022-04-15 06:52:33,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26470#true} {26470#true} #52#return; {26470#true} is VALID [2022-04-15 06:52:33,251 INFO L272 TraceCheckUtils]: 4: Hoare triple {26470#true} call #t~ret9 := main(); {26470#true} is VALID [2022-04-15 06:52:33,252 INFO L290 TraceCheckUtils]: 5: Hoare triple {26470#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:33,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {26475#(<= 500000 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_172| |v_main_#t~post4_171|))) (or (and .cse0 (<= 500000 v_main_~x~0_1410) (= v_main_~x~0_1409 v_main_~x~0_1410)) (and (< v_main_~x~0_1409 500001) (< v_main_~x~0_1410 v_main_~x~0_1409)) (and (= v_main_~x~0_1410 v_main_~x~0_1409) .cse0))) InVars {main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} OutVars{main_~x~0=v_main_~x~0_1409, main_#t~post4=|v_main_#t~post4_171|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:33,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {26475#(<= 500000 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:33,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {26475#(<= 500000 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1412 v_main_~x~0_1411)) (.cse3 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse4 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse1 (<= 500000 v_main_~x~0_1412))) (or (and .cse0 (or (not (< v_main_~x~0_1412 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (= (+ v_main_~x~0_1411 v_main_~y~0_1533) (+ v_main_~x~0_1412 v_main_~y~0_1532)) (< v_main_~x~0_1412 v_main_~x~0_1411) (< v_main_~x~0_1411 1000001)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1412, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1532, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1411, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:33,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {26475#(<= 500000 main_~y~0)} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {26475#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:33,254 INFO L290 TraceCheckUtils]: 10: Hoare triple {26475#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26476#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:33,254 INFO L290 TraceCheckUtils]: 11: Hoare triple {26476#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26477#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:33,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {26477#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26478#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:33,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {26478#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26479#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:33,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {26479#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26480#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:33,256 INFO L290 TraceCheckUtils]: 15: Hoare triple {26480#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26481#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:33,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {26481#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26482#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:33,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {26482#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26483#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:33,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {26483#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26484#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:33,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {26484#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26485#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:33,259 INFO L290 TraceCheckUtils]: 20: Hoare triple {26485#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26486#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:33,259 INFO L290 TraceCheckUtils]: 21: Hoare triple {26486#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26487#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:33,260 INFO L290 TraceCheckUtils]: 22: Hoare triple {26487#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26488#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:33,260 INFO L290 TraceCheckUtils]: 23: Hoare triple {26488#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26489#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:33,261 INFO L290 TraceCheckUtils]: 24: Hoare triple {26489#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26490#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:33,261 INFO L290 TraceCheckUtils]: 25: Hoare triple {26490#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26491#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:33,262 INFO L290 TraceCheckUtils]: 26: Hoare triple {26491#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26492#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:33,262 INFO L290 TraceCheckUtils]: 27: Hoare triple {26492#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26493#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:33,263 INFO L290 TraceCheckUtils]: 28: Hoare triple {26493#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26494#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:33,263 INFO L290 TraceCheckUtils]: 29: Hoare triple {26494#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26495#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:33,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {26495#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26496#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:33,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {26496#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26497#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:33,265 INFO L290 TraceCheckUtils]: 32: Hoare triple {26497#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26498#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:33,265 INFO L290 TraceCheckUtils]: 33: Hoare triple {26498#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26499#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:33,266 INFO L290 TraceCheckUtils]: 34: Hoare triple {26499#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26500#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:33,266 INFO L290 TraceCheckUtils]: 35: Hoare triple {26500#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26501#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:33,266 INFO L290 TraceCheckUtils]: 36: Hoare triple {26501#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26502#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:52:33,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {26502#(<= 499946 main_~y~0)} assume !(~y~0 > 0); {26471#false} is VALID [2022-04-15 06:52:33,267 INFO L272 TraceCheckUtils]: 38: Hoare triple {26471#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {26471#false} is VALID [2022-04-15 06:52:33,267 INFO L290 TraceCheckUtils]: 39: Hoare triple {26471#false} ~cond := #in~cond; {26471#false} is VALID [2022-04-15 06:52:33,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {26471#false} assume 0 == ~cond; {26471#false} is VALID [2022-04-15 06:52:33,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {26471#false} assume !false; {26471#false} is VALID [2022-04-15 06:52:33,267 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:33,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:34,475 INFO L290 TraceCheckUtils]: 41: Hoare triple {26471#false} assume !false; {26471#false} is VALID [2022-04-15 06:52:34,476 INFO L290 TraceCheckUtils]: 40: Hoare triple {26471#false} assume 0 == ~cond; {26471#false} is VALID [2022-04-15 06:52:34,476 INFO L290 TraceCheckUtils]: 39: Hoare triple {26471#false} ~cond := #in~cond; {26471#false} is VALID [2022-04-15 06:52:34,476 INFO L272 TraceCheckUtils]: 38: Hoare triple {26471#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {26471#false} is VALID [2022-04-15 06:52:34,476 INFO L290 TraceCheckUtils]: 37: Hoare triple {26642#(< 0 main_~y~0)} assume !(~y~0 > 0); {26471#false} is VALID [2022-04-15 06:52:34,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {26646#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26642#(< 0 main_~y~0)} is VALID [2022-04-15 06:52:34,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {26650#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26646#(< 2 main_~y~0)} is VALID [2022-04-15 06:52:34,478 INFO L290 TraceCheckUtils]: 34: Hoare triple {26654#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26650#(< 4 main_~y~0)} is VALID [2022-04-15 06:52:34,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {26658#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26654#(< 6 main_~y~0)} is VALID [2022-04-15 06:52:34,480 INFO L290 TraceCheckUtils]: 32: Hoare triple {26662#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26658#(< 8 main_~y~0)} is VALID [2022-04-15 06:52:34,480 INFO L290 TraceCheckUtils]: 31: Hoare triple {26666#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26662#(< 10 main_~y~0)} is VALID [2022-04-15 06:52:34,481 INFO L290 TraceCheckUtils]: 30: Hoare triple {26670#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26666#(< 12 main_~y~0)} is VALID [2022-04-15 06:52:34,482 INFO L290 TraceCheckUtils]: 29: Hoare triple {26674#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26670#(< 14 main_~y~0)} is VALID [2022-04-15 06:52:34,482 INFO L290 TraceCheckUtils]: 28: Hoare triple {26678#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26674#(< 16 main_~y~0)} is VALID [2022-04-15 06:52:34,483 INFO L290 TraceCheckUtils]: 27: Hoare triple {26682#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26678#(< 18 main_~y~0)} is VALID [2022-04-15 06:52:34,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {26686#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26682#(< 20 main_~y~0)} is VALID [2022-04-15 06:52:34,484 INFO L290 TraceCheckUtils]: 25: Hoare triple {26690#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26686#(< 22 main_~y~0)} is VALID [2022-04-15 06:52:34,484 INFO L290 TraceCheckUtils]: 24: Hoare triple {26694#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26690#(< 24 main_~y~0)} is VALID [2022-04-15 06:52:34,484 INFO L290 TraceCheckUtils]: 23: Hoare triple {26698#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26694#(< 26 main_~y~0)} is VALID [2022-04-15 06:52:34,485 INFO L290 TraceCheckUtils]: 22: Hoare triple {26702#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26698#(< 28 main_~y~0)} is VALID [2022-04-15 06:52:34,485 INFO L290 TraceCheckUtils]: 21: Hoare triple {26706#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26702#(< 30 main_~y~0)} is VALID [2022-04-15 06:52:34,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {26710#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26706#(< 32 main_~y~0)} is VALID [2022-04-15 06:52:34,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {26714#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26710#(< 34 main_~y~0)} is VALID [2022-04-15 06:52:34,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {26718#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26714#(< 36 main_~y~0)} is VALID [2022-04-15 06:52:34,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {26722#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26718#(< 38 main_~y~0)} is VALID [2022-04-15 06:52:34,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {26726#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26722#(< 40 main_~y~0)} is VALID [2022-04-15 06:52:34,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {26730#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26726#(< 42 main_~y~0)} is VALID [2022-04-15 06:52:34,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {26734#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26730#(< 44 main_~y~0)} is VALID [2022-04-15 06:52:34,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {26738#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26734#(< 46 main_~y~0)} is VALID [2022-04-15 06:52:34,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {26742#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26738#(< 48 main_~y~0)} is VALID [2022-04-15 06:52:34,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {26746#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26742#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:34,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {26750#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {26746#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:34,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {26750#(< 54 main_~y~0)} [163] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {26750#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:34,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {26750#(< 54 main_~y~0)} [166] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~x~0_1412 v_main_~x~0_1411)) (.cse3 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse4 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse1 (<= 500000 v_main_~x~0_1412))) (or (and .cse0 (or (not (< v_main_~x~0_1412 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and .cse1 (= (+ v_main_~x~0_1411 v_main_~y~0_1533) (+ v_main_~x~0_1412 v_main_~y~0_1532)) (< v_main_~x~0_1412 v_main_~x~0_1411) (< v_main_~x~0_1411 1000001)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1412, main_#t~post6=|v_main_#t~post6_186|} OutVars{main_~y~0=v_main_~y~0_1532, main_#t~post5=|v_main_#t~post5_185|, main_~x~0=v_main_~x~0_1411, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {26750#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:34,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {26750#(< 54 main_~y~0)} [165] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {26750#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:34,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {26750#(< 54 main_~y~0)} [164] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_172| |v_main_#t~post4_171|))) (or (and .cse0 (<= 500000 v_main_~x~0_1410) (= v_main_~x~0_1409 v_main_~x~0_1410)) (and (< v_main_~x~0_1409 500001) (< v_main_~x~0_1410 v_main_~x~0_1409)) (and (= v_main_~x~0_1410 v_main_~x~0_1409) .cse0))) InVars {main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} OutVars{main_~x~0=v_main_~x~0_1409, main_#t~post4=|v_main_#t~post4_171|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {26750#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:34,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {26470#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {26750#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:34,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {26470#true} call #t~ret9 := main(); {26470#true} is VALID [2022-04-15 06:52:34,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26470#true} {26470#true} #52#return; {26470#true} is VALID [2022-04-15 06:52:34,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {26470#true} assume true; {26470#true} is VALID [2022-04-15 06:52:34,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {26470#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(17, 2);call #Ultimate.allocInit(12, 3); {26470#true} is VALID [2022-04-15 06:52:34,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {26470#true} call ULTIMATE.init(); {26470#true} is VALID [2022-04-15 06:52:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [51140393] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:34,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:34,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 59 [2022-04-15 06:52:36,435 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:36,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [664542933] [2022-04-15 06:52:36,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [664542933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:36,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:36,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-04-15 06:52:36,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662366591] [2022-04-15 06:52:36,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:36,436 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 135 [2022-04-15 06:52:36,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:36,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 06:52:36,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:36,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-15 06:52:36,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-15 06:52:36,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4545, Invalid=7011, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 06:52:36,544 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 06:52:46,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:46,404 INFO L93 Difference]: Finished difference Result 269 states and 280 transitions. [2022-04-15 06:52:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-04-15 06:52:46,405 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 135 [2022-04-15 06:52:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:52:46,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 06:52:46,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 157 transitions. [2022-04-15 06:52:46,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 06:52:46,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 157 transitions. [2022-04-15 06:52:46,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 157 transitions. [2022-04-15 06:52:46,557 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:46,558 INFO L225 Difference]: With dead ends: 269 [2022-04-15 06:52:46,558 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 06:52:46,560 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9879 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10605, Invalid=23435, Unknown=0, NotChecked=0, Total=34040 [2022-04-15 06:52:46,560 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 262 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4824 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 4824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:52:46,561 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [262 Valid, 44 Invalid, 5167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 4824 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-15 06:52:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 06:52:46,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-04-15 06:52:46,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:52:46,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 06:52:46,785 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 06:52:46,785 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 06:52:46,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:46,787 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-15 06:52:46,787 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 06:52:46,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:46,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:46,788 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 141 states. [2022-04-15 06:52:46,788 INFO L87 Difference]: Start difference. First operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 141 states. [2022-04-15 06:52:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:52:46,790 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2022-04-15 06:52:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 06:52:46,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:52:46,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:52:46,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:52:46,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:52:46,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 136 states have (on average 1.0294117647058822) internal successors, (140), 136 states have internal predecessors, (140), 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 06:52:46,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 144 transitions. [2022-04-15 06:52:46,792 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 144 transitions. Word has length 135 [2022-04-15 06:52:46,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:52:46,792 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 144 transitions. [2022-04-15 06:52:46,793 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 1.6375) internal successors, (131), 79 states have internal predecessors, (131), 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 06:52:46,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 144 transitions. [2022-04-15 06:52:46,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:46,935 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 144 transitions. [2022-04-15 06:52:46,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 06:52:46,936 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:52:46,936 INFO L499 BasicCegarLoop]: trace histogram [50, 49, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:52:46,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 06:52:47,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:47,158 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:52:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:52:47,159 INFO L85 PathProgramCache]: Analyzing trace with hash 86113071, now seen corresponding path program 28 times [2022-04-15 06:52:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:47,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122703800] [2022-04-15 06:52:47,270 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:47,528 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:52:47,529 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:52:47,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1645199297, now seen corresponding path program 1 times [2022-04-15 06:52:47,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:52:47,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857019344] [2022-04-15 06:52:47,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:47,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:52:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:48,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:52:48,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:48,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {28122#(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(17, 2);call #Ultimate.allocInit(12, 3); {28088#true} is VALID [2022-04-15 06:52:48,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {28088#true} assume true; {28088#true} is VALID [2022-04-15 06:52:48,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28088#true} {28088#true} #52#return; {28088#true} is VALID [2022-04-15 06:52:48,033 INFO L272 TraceCheckUtils]: 0: Hoare triple {28088#true} call ULTIMATE.init(); {28122#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:52:48,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {28122#(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(17, 2);call #Ultimate.allocInit(12, 3); {28088#true} is VALID [2022-04-15 06:52:48,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {28088#true} assume true; {28088#true} is VALID [2022-04-15 06:52:48,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28088#true} {28088#true} #52#return; {28088#true} is VALID [2022-04-15 06:52:48,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {28088#true} call #t~ret9 := main(); {28088#true} is VALID [2022-04-15 06:52:48,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {28088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {28093#(<= 500000 main_~y~0)} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_178| |v_main_#t~post4_177|)) (.cse1 (= v_main_~x~0_1501 v_main_~x~0_1500))) (or (and .cse0 (<= 500000 v_main_~x~0_1501) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1500 500001) (< v_main_~x~0_1501 v_main_~x~0_1500)))) InVars {main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} OutVars{main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {28093#(<= 500000 main_~y~0)} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {28093#(<= 500000 main_~y~0)} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1503)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1643 v_main_~y~0_1642)) (.cse2 (= v_main_~x~0_1503 v_main_~x~0_1502)) (.cse4 (= |v_main_#t~post6_193| |v_main_#t~post6_192|))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1503 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1503 v_main_~y~0_1642))) (and .cse3 (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) (= .cse5 (+ v_main_~x~0_1502 v_main_~y~0_1643)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1643, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1503, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1642, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {28093#(<= 500000 main_~y~0)} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {28093#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28094#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:48,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {28094#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28095#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:48,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {28095#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28096#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:48,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {28096#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28097#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:48,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {28097#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28098#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:48,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {28098#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28099#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:48,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {28099#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28100#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:48,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {28100#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28101#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:48,042 INFO L290 TraceCheckUtils]: 18: Hoare triple {28101#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28102#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:48,042 INFO L290 TraceCheckUtils]: 19: Hoare triple {28102#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28103#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:48,043 INFO L290 TraceCheckUtils]: 20: Hoare triple {28103#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28104#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:48,044 INFO L290 TraceCheckUtils]: 21: Hoare triple {28104#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28105#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:48,044 INFO L290 TraceCheckUtils]: 22: Hoare triple {28105#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28106#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:48,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {28106#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28107#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:48,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {28107#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28108#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:48,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {28108#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28109#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:48,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {28109#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28110#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:48,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {28110#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28111#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:48,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {28111#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28112#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:48,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {28112#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28113#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:48,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {28113#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28114#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:48,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {28114#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28115#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:48,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {28115#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28116#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:48,051 INFO L290 TraceCheckUtils]: 33: Hoare triple {28116#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28117#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:48,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {28117#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28118#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:48,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {28118#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28119#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:48,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {28119#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28120#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:52:48,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {28120#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28121#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:52:48,054 INFO L290 TraceCheckUtils]: 38: Hoare triple {28121#(<= 499944 main_~y~0)} assume !(~y~0 > 0); {28089#false} is VALID [2022-04-15 06:52:48,054 INFO L272 TraceCheckUtils]: 39: Hoare triple {28089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {28089#false} is VALID [2022-04-15 06:52:48,054 INFO L290 TraceCheckUtils]: 40: Hoare triple {28089#false} ~cond := #in~cond; {28089#false} is VALID [2022-04-15 06:52:48,054 INFO L290 TraceCheckUtils]: 41: Hoare triple {28089#false} assume 0 == ~cond; {28089#false} is VALID [2022-04-15 06:52:48,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {28089#false} assume !false; {28089#false} is VALID [2022-04-15 06:52:48,055 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:48,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:52:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857019344] [2022-04-15 06:52:48,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857019344] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:52:48,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671848976] [2022-04-15 06:52:48,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:52:48,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:52:48,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:52:48,060 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:52:48,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:52:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:48,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:52:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:52:48,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:52:48,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {28088#true} call ULTIMATE.init(); {28088#true} is VALID [2022-04-15 06:52:48,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {28088#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(17, 2);call #Ultimate.allocInit(12, 3); {28088#true} is VALID [2022-04-15 06:52:48,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {28088#true} assume true; {28088#true} is VALID [2022-04-15 06:52:48,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28088#true} {28088#true} #52#return; {28088#true} is VALID [2022-04-15 06:52:48,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {28088#true} call #t~ret9 := main(); {28088#true} is VALID [2022-04-15 06:52:48,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {28088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {28093#(<= 500000 main_~y~0)} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_178| |v_main_#t~post4_177|)) (.cse1 (= v_main_~x~0_1501 v_main_~x~0_1500))) (or (and .cse0 (<= 500000 v_main_~x~0_1501) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1500 500001) (< v_main_~x~0_1501 v_main_~x~0_1500)))) InVars {main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} OutVars{main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,513 INFO L290 TraceCheckUtils]: 7: Hoare triple {28093#(<= 500000 main_~y~0)} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {28093#(<= 500000 main_~y~0)} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1503)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1643 v_main_~y~0_1642)) (.cse2 (= v_main_~x~0_1503 v_main_~x~0_1502)) (.cse4 (= |v_main_#t~post6_193| |v_main_#t~post6_192|))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1503 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1503 v_main_~y~0_1642))) (and .cse3 (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) (= .cse5 (+ v_main_~x~0_1502 v_main_~y~0_1643)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1643, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1503, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1642, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {28093#(<= 500000 main_~y~0)} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {28093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:52:48,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {28093#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28094#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:52:48,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {28094#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28095#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:52:48,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {28095#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28096#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:52:48,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {28096#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28097#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:52:48,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {28097#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28098#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:52:48,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {28098#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28099#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:52:48,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {28099#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28100#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:52:48,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {28100#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28101#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:52:48,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {28101#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28102#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:52:48,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {28102#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28103#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:52:48,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {28103#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28104#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:52:48,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {28104#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28105#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:52:48,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {28105#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28106#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:52:48,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {28106#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28107#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:52:48,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {28107#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28108#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:52:48,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {28108#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28109#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:52:48,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {28109#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28110#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:52:48,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {28110#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28111#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:52:48,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {28111#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28112#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:52:48,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {28112#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28113#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:52:48,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {28113#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28114#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:52:48,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {28114#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28115#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:52:48,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {28115#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28116#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:52:48,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {28116#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28117#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:52:48,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {28117#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28118#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:52:48,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {28118#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28119#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:52:48,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {28119#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28120#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:52:48,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {28120#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28121#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:52:48,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {28121#(<= 499944 main_~y~0)} assume !(~y~0 > 0); {28089#false} is VALID [2022-04-15 06:52:48,528 INFO L272 TraceCheckUtils]: 39: Hoare triple {28089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {28089#false} is VALID [2022-04-15 06:52:48,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {28089#false} ~cond := #in~cond; {28089#false} is VALID [2022-04-15 06:52:48,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {28089#false} assume 0 == ~cond; {28089#false} is VALID [2022-04-15 06:52:48,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {28089#false} assume !false; {28089#false} is VALID [2022-04-15 06:52:48,529 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:48,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:52:49,767 INFO L290 TraceCheckUtils]: 42: Hoare triple {28089#false} assume !false; {28089#false} is VALID [2022-04-15 06:52:49,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {28089#false} assume 0 == ~cond; {28089#false} is VALID [2022-04-15 06:52:49,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {28089#false} ~cond := #in~cond; {28089#false} is VALID [2022-04-15 06:52:49,767 INFO L272 TraceCheckUtils]: 39: Hoare triple {28089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {28089#false} is VALID [2022-04-15 06:52:49,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {28264#(< 0 main_~y~0)} assume !(~y~0 > 0); {28089#false} is VALID [2022-04-15 06:52:49,768 INFO L290 TraceCheckUtils]: 37: Hoare triple {28268#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28264#(< 0 main_~y~0)} is VALID [2022-04-15 06:52:49,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {28272#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28268#(< 2 main_~y~0)} is VALID [2022-04-15 06:52:49,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {28276#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28272#(< 4 main_~y~0)} is VALID [2022-04-15 06:52:49,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {28280#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28276#(< 6 main_~y~0)} is VALID [2022-04-15 06:52:49,770 INFO L290 TraceCheckUtils]: 33: Hoare triple {28284#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28280#(< 8 main_~y~0)} is VALID [2022-04-15 06:52:49,770 INFO L290 TraceCheckUtils]: 32: Hoare triple {28288#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28284#(< 10 main_~y~0)} is VALID [2022-04-15 06:52:49,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {28292#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28288#(< 12 main_~y~0)} is VALID [2022-04-15 06:52:49,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {28296#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28292#(< 14 main_~y~0)} is VALID [2022-04-15 06:52:49,772 INFO L290 TraceCheckUtils]: 29: Hoare triple {28300#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28296#(< 16 main_~y~0)} is VALID [2022-04-15 06:52:49,772 INFO L290 TraceCheckUtils]: 28: Hoare triple {28304#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28300#(< 18 main_~y~0)} is VALID [2022-04-15 06:52:49,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {28308#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28304#(< 20 main_~y~0)} is VALID [2022-04-15 06:52:49,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {28312#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28308#(< 22 main_~y~0)} is VALID [2022-04-15 06:52:49,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {28316#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28312#(< 24 main_~y~0)} is VALID [2022-04-15 06:52:49,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {28320#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28316#(< 26 main_~y~0)} is VALID [2022-04-15 06:52:49,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {28324#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28320#(< 28 main_~y~0)} is VALID [2022-04-15 06:52:49,775 INFO L290 TraceCheckUtils]: 22: Hoare triple {28328#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28324#(< 30 main_~y~0)} is VALID [2022-04-15 06:52:49,775 INFO L290 TraceCheckUtils]: 21: Hoare triple {28332#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28328#(< 32 main_~y~0)} is VALID [2022-04-15 06:52:49,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {28336#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28332#(< 34 main_~y~0)} is VALID [2022-04-15 06:52:49,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {28340#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28336#(< 36 main_~y~0)} is VALID [2022-04-15 06:52:49,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {28344#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28340#(< 38 main_~y~0)} is VALID [2022-04-15 06:52:49,785 INFO L290 TraceCheckUtils]: 17: Hoare triple {28348#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28344#(< 40 main_~y~0)} is VALID [2022-04-15 06:52:49,785 INFO L290 TraceCheckUtils]: 16: Hoare triple {28352#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28348#(< 42 main_~y~0)} is VALID [2022-04-15 06:52:49,786 INFO L290 TraceCheckUtils]: 15: Hoare triple {28356#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28352#(< 44 main_~y~0)} is VALID [2022-04-15 06:52:49,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {28360#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28356#(< 46 main_~y~0)} is VALID [2022-04-15 06:52:49,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {28364#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28360#(< 48 main_~y~0)} is VALID [2022-04-15 06:52:49,787 INFO L290 TraceCheckUtils]: 12: Hoare triple {28368#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28364#(< 50 main_~y~0)} is VALID [2022-04-15 06:52:49,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {28372#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28368#(< 52 main_~y~0)} is VALID [2022-04-15 06:52:49,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {28376#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {28372#(< 54 main_~y~0)} is VALID [2022-04-15 06:52:49,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {28376#(< 56 main_~y~0)} [167] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {28376#(< 56 main_~y~0)} is VALID [2022-04-15 06:52:49,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {28376#(< 56 main_~y~0)} [170] L11-2-->L18-1_primed: Formula: (let ((.cse3 (<= 500000 v_main_~x~0_1503)) (.cse0 (= |v_main_#t~post5_193| |v_main_#t~post5_192|)) (.cse1 (= v_main_~y~0_1643 v_main_~y~0_1642)) (.cse2 (= v_main_~x~0_1503 v_main_~x~0_1502)) (.cse4 (= |v_main_#t~post6_193| |v_main_#t~post6_192|))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_1503 1000000)) (not .cse3)) .cse4) (let ((.cse5 (+ v_main_~x~0_1503 v_main_~y~0_1642))) (and .cse3 (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) (= .cse5 (+ v_main_~x~0_1502 v_main_~y~0_1643)))) (and .cse0 .cse1 .cse2 .cse4))) InVars {main_~y~0=v_main_~y~0_1643, main_#t~post5=|v_main_#t~post5_193|, main_~x~0=v_main_~x~0_1503, main_#t~post6=|v_main_#t~post6_193|} OutVars{main_~y~0=v_main_~y~0_1642, main_#t~post5=|v_main_#t~post5_192|, main_~x~0=v_main_~x~0_1502, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28376#(< 56 main_~y~0)} is VALID [2022-04-15 06:52:49,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {28376#(< 56 main_~y~0)} [169] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28376#(< 56 main_~y~0)} is VALID [2022-04-15 06:52:49,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {28376#(< 56 main_~y~0)} [168] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_178| |v_main_#t~post4_177|)) (.cse1 (= v_main_~x~0_1501 v_main_~x~0_1500))) (or (and .cse0 (<= 500000 v_main_~x~0_1501) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_1500 500001) (< v_main_~x~0_1501 v_main_~x~0_1500)))) InVars {main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} OutVars{main_~x~0=v_main_~x~0_1500, main_#t~post4=|v_main_#t~post4_177|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28376#(< 56 main_~y~0)} is VALID [2022-04-15 06:52:49,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {28088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28376#(< 56 main_~y~0)} is VALID [2022-04-15 06:52:49,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {28088#true} call #t~ret9 := main(); {28088#true} is VALID [2022-04-15 06:52:49,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28088#true} {28088#true} #52#return; {28088#true} is VALID [2022-04-15 06:52:49,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {28088#true} assume true; {28088#true} is VALID [2022-04-15 06:52:49,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {28088#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(17, 2);call #Ultimate.allocInit(12, 3); {28088#true} is VALID [2022-04-15 06:52:49,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {28088#true} call ULTIMATE.init(); {28088#true} is VALID [2022-04-15 06:52:49,791 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:52:49,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671848976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:52:49,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:52:49,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 61 [2022-04-15 06:52:51,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:52:51,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122703800] [2022-04-15 06:52:51,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122703800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:52:51,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:52:51,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-15 06:52:51,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176199347] [2022-04-15 06:52:51,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:52:51,885 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 140 [2022-04-15 06:52:51,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:52:51,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 06:52:52,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:52:52,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-15 06:52:52,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:52:52,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-15 06:52:52,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4882, Invalid=7550, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 06:52:52,016 INFO L87 Difference]: Start difference. First operand 141 states and 144 transitions. Second operand has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 06:53:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:02,742 INFO L93 Difference]: Finished difference Result 279 states and 290 transitions. [2022-04-15 06:53:02,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-15 06:53:02,743 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 140 [2022-04-15 06:53:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:02,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 06:53:02,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 162 transitions. [2022-04-15 06:53:02,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 06:53:02,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 162 transitions. [2022-04-15 06:53:02,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 162 transitions. [2022-04-15 06:53:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:02,883 INFO L225 Difference]: With dead ends: 279 [2022-04-15 06:53:02,883 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 06:53:02,885 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10651 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=11392, Invalid=25280, Unknown=0, NotChecked=0, Total=36672 [2022-04-15 06:53:02,885 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 272 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 5211 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 5211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:02,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [272 Valid, 34 Invalid, 5567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 5211 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-15 06:53:02,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 06:53:03,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-15 06:53:03,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:03,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 06:53:03,168 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 06:53:03,168 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 06:53:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:03,170 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2022-04-15 06:53:03,170 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2022-04-15 06:53:03,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:03,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:03,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 146 states. [2022-04-15 06:53:03,170 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 146 states. [2022-04-15 06:53:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:03,172 INFO L93 Difference]: Finished difference Result 146 states and 149 transitions. [2022-04-15 06:53:03,172 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2022-04-15 06:53:03,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:03,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:03,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:03,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:03,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0283687943262412) internal successors, (145), 141 states have internal predecessors, (145), 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 06:53:03,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 149 transitions. [2022-04-15 06:53:03,174 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 149 transitions. Word has length 140 [2022-04-15 06:53:03,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:03,175 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 149 transitions. [2022-04-15 06:53:03,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 82 states have internal predecessors, (136), 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 06:53:03,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 149 transitions. [2022-04-15 06:53:03,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:03,303 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 149 transitions. [2022-04-15 06:53:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 06:53:03,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:03,304 INFO L499 BasicCegarLoop]: trace histogram [52, 51, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:03,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 06:53:03,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:03,507 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:03,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:03,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1994813578, now seen corresponding path program 29 times [2022-04-15 06:53:03,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:03,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1308950177] [2022-04-15 06:53:07,566 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:53:07,611 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:07,830 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:07,831 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash 575675586, now seen corresponding path program 1 times [2022-04-15 06:53:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:07,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829033225] [2022-04-15 06:53:07,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:07,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {29797#(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(17, 2);call #Ultimate.allocInit(12, 3); {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {29762#true} assume true; {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29762#true} {29762#true} #52#return; {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L272 TraceCheckUtils]: 0: Hoare triple {29762#true} call ULTIMATE.init(); {29797#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:08,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {29797#(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(17, 2);call #Ultimate.allocInit(12, 3); {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {29762#true} assume true; {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29762#true} {29762#true} #52#return; {29762#true} is VALID [2022-04-15 06:53:08,306 INFO L272 TraceCheckUtils]: 4: Hoare triple {29762#true} call #t~ret9 := main(); {29762#true} is VALID [2022-04-15 06:53:08,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {29762#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {29767#(<= 500000 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1595 v_main_~x~0_1594))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1594 500001) (< v_main_~x~0_1595 v_main_~x~0_1594)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1595)))) InVars {main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1594, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {29767#(<= 500000 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {29767#(<= 500000 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1597)) (.cse2 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse3 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse4 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse5 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (let ((.cse0 (+ v_main_~x~0_1597 v_main_~y~0_1756))) (and (< .cse0 (+ 1000001 v_main_~y~0_1757)) .cse1 (< v_main_~y~0_1757 v_main_~y~0_1756) (= (+ v_main_~x~0_1596 v_main_~y~0_1757) .cse0))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_1597 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1597, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1756, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1596, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {29767#(<= 500000 main_~y~0)} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {29767#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29768#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:08,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {29768#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29769#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:08,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {29769#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29770#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:08,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {29770#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29771#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:08,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {29771#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29772#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:08,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {29772#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29773#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:08,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {29773#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29774#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:08,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {29774#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29775#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:08,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {29775#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29776#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:08,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {29776#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29777#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:08,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {29777#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29778#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:08,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {29778#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29779#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:08,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {29779#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29780#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:08,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {29780#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29781#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:08,316 INFO L290 TraceCheckUtils]: 24: Hoare triple {29781#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29782#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:08,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {29782#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29783#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:08,317 INFO L290 TraceCheckUtils]: 26: Hoare triple {29783#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29784#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:08,317 INFO L290 TraceCheckUtils]: 27: Hoare triple {29784#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29785#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:08,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {29785#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29786#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:08,318 INFO L290 TraceCheckUtils]: 29: Hoare triple {29786#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29787#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:08,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {29787#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29788#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:08,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {29788#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29789#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:08,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {29789#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29790#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:08,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {29790#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29791#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:08,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {29791#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29792#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:08,321 INFO L290 TraceCheckUtils]: 35: Hoare triple {29792#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29793#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:08,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {29793#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29794#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:08,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {29794#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29795#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:08,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {29795#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29796#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:08,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {29796#(<= 499942 main_~y~0)} assume !(~y~0 > 0); {29763#false} is VALID [2022-04-15 06:53:08,323 INFO L272 TraceCheckUtils]: 40: Hoare triple {29763#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29763#false} is VALID [2022-04-15 06:53:08,323 INFO L290 TraceCheckUtils]: 41: Hoare triple {29763#false} ~cond := #in~cond; {29763#false} is VALID [2022-04-15 06:53:08,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {29763#false} assume 0 == ~cond; {29763#false} is VALID [2022-04-15 06:53:08,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {29763#false} assume !false; {29763#false} is VALID [2022-04-15 06:53:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:08,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:08,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829033225] [2022-04-15 06:53:08,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829033225] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:08,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173247182] [2022-04-15 06:53:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:08,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:08,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:08,325 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:08,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:53:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 06:53:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:08,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:08,762 INFO L272 TraceCheckUtils]: 0: Hoare triple {29762#true} call ULTIMATE.init(); {29762#true} is VALID [2022-04-15 06:53:08,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {29762#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(17, 2);call #Ultimate.allocInit(12, 3); {29762#true} is VALID [2022-04-15 06:53:08,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {29762#true} assume true; {29762#true} is VALID [2022-04-15 06:53:08,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29762#true} {29762#true} #52#return; {29762#true} is VALID [2022-04-15 06:53:08,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {29762#true} call #t~ret9 := main(); {29762#true} is VALID [2022-04-15 06:53:08,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {29762#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {29767#(<= 500000 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1595 v_main_~x~0_1594))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1594 500001) (< v_main_~x~0_1595 v_main_~x~0_1594)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1595)))) InVars {main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1594, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {29767#(<= 500000 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {29767#(<= 500000 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1597)) (.cse2 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse3 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse4 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse5 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (let ((.cse0 (+ v_main_~x~0_1597 v_main_~y~0_1756))) (and (< .cse0 (+ 1000001 v_main_~y~0_1757)) .cse1 (< v_main_~y~0_1757 v_main_~y~0_1756) (= (+ v_main_~x~0_1596 v_main_~y~0_1757) .cse0))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_1597 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1597, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1756, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1596, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {29767#(<= 500000 main_~y~0)} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {29767#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:08,765 INFO L290 TraceCheckUtils]: 10: Hoare triple {29767#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29768#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:08,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {29768#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29769#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:08,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {29769#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29770#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:08,766 INFO L290 TraceCheckUtils]: 13: Hoare triple {29770#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29771#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:08,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {29771#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29772#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:08,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {29772#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29773#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:08,767 INFO L290 TraceCheckUtils]: 16: Hoare triple {29773#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29774#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:08,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {29774#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29775#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:08,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {29775#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29776#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:08,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {29776#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29777#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:08,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {29777#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29778#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:08,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {29778#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29779#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:08,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {29779#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29780#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:08,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {29780#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29781#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:08,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {29781#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29782#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:08,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {29782#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29783#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:08,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {29783#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29784#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:08,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {29784#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29785#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:08,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {29785#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29786#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:08,774 INFO L290 TraceCheckUtils]: 29: Hoare triple {29786#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29787#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:08,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {29787#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29788#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:08,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {29788#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29789#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:08,776 INFO L290 TraceCheckUtils]: 32: Hoare triple {29789#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29790#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:08,776 INFO L290 TraceCheckUtils]: 33: Hoare triple {29790#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29791#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:08,777 INFO L290 TraceCheckUtils]: 34: Hoare triple {29791#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29792#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:08,777 INFO L290 TraceCheckUtils]: 35: Hoare triple {29792#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29793#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:08,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {29793#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29794#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:08,779 INFO L290 TraceCheckUtils]: 37: Hoare triple {29794#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29795#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:08,780 INFO L290 TraceCheckUtils]: 38: Hoare triple {29795#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29796#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:08,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {29796#(<= 499942 main_~y~0)} assume !(~y~0 > 0); {29763#false} is VALID [2022-04-15 06:53:08,781 INFO L272 TraceCheckUtils]: 40: Hoare triple {29763#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29763#false} is VALID [2022-04-15 06:53:08,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {29763#false} ~cond := #in~cond; {29763#false} is VALID [2022-04-15 06:53:08,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {29763#false} assume 0 == ~cond; {29763#false} is VALID [2022-04-15 06:53:08,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {29763#false} assume !false; {29763#false} is VALID [2022-04-15 06:53:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:08,781 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:10,127 INFO L290 TraceCheckUtils]: 43: Hoare triple {29763#false} assume !false; {29763#false} is VALID [2022-04-15 06:53:10,127 INFO L290 TraceCheckUtils]: 42: Hoare triple {29763#false} assume 0 == ~cond; {29763#false} is VALID [2022-04-15 06:53:10,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {29763#false} ~cond := #in~cond; {29763#false} is VALID [2022-04-15 06:53:10,127 INFO L272 TraceCheckUtils]: 40: Hoare triple {29763#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {29763#false} is VALID [2022-04-15 06:53:10,128 INFO L290 TraceCheckUtils]: 39: Hoare triple {29942#(< 0 main_~y~0)} assume !(~y~0 > 0); {29763#false} is VALID [2022-04-15 06:53:10,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {29946#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29942#(< 0 main_~y~0)} is VALID [2022-04-15 06:53:10,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {29950#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29946#(< 2 main_~y~0)} is VALID [2022-04-15 06:53:10,130 INFO L290 TraceCheckUtils]: 36: Hoare triple {29954#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29950#(< 4 main_~y~0)} is VALID [2022-04-15 06:53:10,130 INFO L290 TraceCheckUtils]: 35: Hoare triple {29958#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29954#(< 6 main_~y~0)} is VALID [2022-04-15 06:53:10,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {29962#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29958#(< 8 main_~y~0)} is VALID [2022-04-15 06:53:10,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {29966#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29962#(< 10 main_~y~0)} is VALID [2022-04-15 06:53:10,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {29970#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29966#(< 12 main_~y~0)} is VALID [2022-04-15 06:53:10,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {29974#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29970#(< 14 main_~y~0)} is VALID [2022-04-15 06:53:10,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {29978#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29974#(< 16 main_~y~0)} is VALID [2022-04-15 06:53:10,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {29982#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29978#(< 18 main_~y~0)} is VALID [2022-04-15 06:53:10,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {29986#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29982#(< 20 main_~y~0)} is VALID [2022-04-15 06:53:10,135 INFO L290 TraceCheckUtils]: 27: Hoare triple {29990#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29986#(< 22 main_~y~0)} is VALID [2022-04-15 06:53:10,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {29994#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29990#(< 24 main_~y~0)} is VALID [2022-04-15 06:53:10,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {29998#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29994#(< 26 main_~y~0)} is VALID [2022-04-15 06:53:10,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {30002#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {29998#(< 28 main_~y~0)} is VALID [2022-04-15 06:53:10,138 INFO L290 TraceCheckUtils]: 23: Hoare triple {30006#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30002#(< 30 main_~y~0)} is VALID [2022-04-15 06:53:10,138 INFO L290 TraceCheckUtils]: 22: Hoare triple {30010#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30006#(< 32 main_~y~0)} is VALID [2022-04-15 06:53:10,139 INFO L290 TraceCheckUtils]: 21: Hoare triple {30014#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30010#(< 34 main_~y~0)} is VALID [2022-04-15 06:53:10,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {30018#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30014#(< 36 main_~y~0)} is VALID [2022-04-15 06:53:10,140 INFO L290 TraceCheckUtils]: 19: Hoare triple {30022#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30018#(< 38 main_~y~0)} is VALID [2022-04-15 06:53:10,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {30026#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30022#(< 40 main_~y~0)} is VALID [2022-04-15 06:53:10,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {30030#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30026#(< 42 main_~y~0)} is VALID [2022-04-15 06:53:10,142 INFO L290 TraceCheckUtils]: 16: Hoare triple {30034#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30030#(< 44 main_~y~0)} is VALID [2022-04-15 06:53:10,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {30038#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30034#(< 46 main_~y~0)} is VALID [2022-04-15 06:53:10,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {30042#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30038#(< 48 main_~y~0)} is VALID [2022-04-15 06:53:10,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {30046#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30042#(< 50 main_~y~0)} is VALID [2022-04-15 06:53:10,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {30050#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30046#(< 52 main_~y~0)} is VALID [2022-04-15 06:53:10,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {30054#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30050#(< 54 main_~y~0)} is VALID [2022-04-15 06:53:10,145 INFO L290 TraceCheckUtils]: 10: Hoare triple {30058#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {30054#(< 56 main_~y~0)} is VALID [2022-04-15 06:53:10,146 INFO L290 TraceCheckUtils]: 9: Hoare triple {30058#(< 58 main_~y~0)} [171] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {30058#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:10,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {30058#(< 58 main_~y~0)} [174] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_1597)) (.cse2 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse3 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse4 (= v_main_~x~0_1597 v_main_~x~0_1596)) (.cse5 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (let ((.cse0 (+ v_main_~x~0_1597 v_main_~y~0_1756))) (and (< .cse0 (+ 1000001 v_main_~y~0_1757)) .cse1 (< v_main_~y~0_1757 v_main_~y~0_1756) (= (+ v_main_~x~0_1596 v_main_~y~0_1757) .cse0))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse1) (not (< v_main_~x~0_1597 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1597, main_#t~post6=|v_main_#t~post6_200|} OutVars{main_~y~0=v_main_~y~0_1756, main_#t~post5=|v_main_#t~post5_199|, main_~x~0=v_main_~x~0_1596, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30058#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:10,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {30058#(< 58 main_~y~0)} [173] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30058#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:10,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {30058#(< 58 main_~y~0)} [172] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_184| |v_main_#t~post4_183|)) (.cse1 (= v_main_~x~0_1595 v_main_~x~0_1594))) (or (and .cse0 .cse1) (and (< v_main_~x~0_1594 500001) (< v_main_~x~0_1595 v_main_~x~0_1594)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1595)))) InVars {main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} OutVars{main_~x~0=v_main_~x~0_1594, main_#t~post4=|v_main_#t~post4_183|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {30058#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:10,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {29762#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30058#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:10,148 INFO L272 TraceCheckUtils]: 4: Hoare triple {29762#true} call #t~ret9 := main(); {29762#true} is VALID [2022-04-15 06:53:10,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29762#true} {29762#true} #52#return; {29762#true} is VALID [2022-04-15 06:53:10,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {29762#true} assume true; {29762#true} is VALID [2022-04-15 06:53:10,148 INFO L290 TraceCheckUtils]: 1: Hoare triple {29762#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(17, 2);call #Ultimate.allocInit(12, 3); {29762#true} is VALID [2022-04-15 06:53:10,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {29762#true} call ULTIMATE.init(); {29762#true} is VALID [2022-04-15 06:53:10,149 INFO L134 CoverageAnalysis]: Checked inductivity of 437 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:10,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173247182] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:10,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:10,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 63 [2022-04-15 06:53:12,338 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:12,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1308950177] [2022-04-15 06:53:12,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1308950177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:12,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:12,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-15 06:53:12,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516861973] [2022-04-15 06:53:12,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 145 [2022-04-15 06:53:12,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:12,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 06:53:12,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:12,442 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-15 06:53:12,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:12,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-15 06:53:12,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5231, Invalid=8109, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:53:12,444 INFO L87 Difference]: Start difference. First operand 146 states and 149 transitions. Second operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 06:53:23,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:23,862 INFO L93 Difference]: Finished difference Result 289 states and 300 transitions. [2022-04-15 06:53:23,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-15 06:53:23,862 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 145 [2022-04-15 06:53:23,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:23,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 06:53:23,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2022-04-15 06:53:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 06:53:23,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 167 transitions. [2022-04-15 06:53:23,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 167 transitions. [2022-04-15 06:53:24,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:24,008 INFO L225 Difference]: With dead ends: 289 [2022-04-15 06:53:24,009 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 06:53:24,012 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 115 SyntacticMatches, 2 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11452 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=12207, Invalid=27195, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 06:53:24,012 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 336 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5623 mSolverCounterSat, 426 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 426 IncrementalHoareTripleChecker+Valid, 5623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:24,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [336 Valid, 44 Invalid, 6049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [426 Valid, 5623 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-04-15 06:53:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 06:53:24,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-04-15 06:53:24,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:24,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 06:53:24,266 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 06:53:24,266 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 06:53:24,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:24,267 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 06:53:24,267 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 06:53:24,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:24,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:24,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 151 states. [2022-04-15 06:53:24,268 INFO L87 Difference]: Start difference. First operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 151 states. [2022-04-15 06:53:24,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:24,269 INFO L93 Difference]: Finished difference Result 151 states and 154 transitions. [2022-04-15 06:53:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 06:53:24,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:24,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:24,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:24,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:24,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 146 states have (on average 1.0273972602739727) internal successors, (150), 146 states have internal predecessors, (150), 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 06:53:24,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 154 transitions. [2022-04-15 06:53:24,271 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 154 transitions. Word has length 145 [2022-04-15 06:53:24,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:24,271 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 154 transitions. [2022-04-15 06:53:24,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 1.6395348837209303) internal successors, (141), 85 states have internal predecessors, (141), 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 06:53:24,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 154 transitions. [2022-04-15 06:53:24,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 154 transitions. [2022-04-15 06:53:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-15 06:53:24,414 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:24,414 INFO L499 BasicCegarLoop]: trace histogram [54, 53, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:24,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:24,630 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:24,630 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:24,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:24,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1646279523, now seen corresponding path program 30 times [2022-04-15 06:53:24,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:24,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [299258078] [2022-04-15 06:53:24,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:24,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:24,960 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:24,963 INFO L85 PathProgramCache]: Analyzing trace with hash -222544415, now seen corresponding path program 1 times [2022-04-15 06:53:24,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:24,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670102503] [2022-04-15 06:53:24,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:24,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:25,540 INFO L290 TraceCheckUtils]: 0: Hoare triple {31528#(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(17, 2);call #Ultimate.allocInit(12, 3); {31492#true} is VALID [2022-04-15 06:53:25,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {31492#true} assume true; {31492#true} is VALID [2022-04-15 06:53:25,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31492#true} {31492#true} #52#return; {31492#true} is VALID [2022-04-15 06:53:25,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {31492#true} call ULTIMATE.init(); {31528#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:25,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {31528#(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(17, 2);call #Ultimate.allocInit(12, 3); {31492#true} is VALID [2022-04-15 06:53:25,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {31492#true} assume true; {31492#true} is VALID [2022-04-15 06:53:25,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31492#true} {31492#true} #52#return; {31492#true} is VALID [2022-04-15 06:53:25,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {31492#true} call #t~ret9 := main(); {31492#true} is VALID [2022-04-15 06:53:25,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {31492#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:25,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {31497#(<= 500000 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1692 v_main_~x~0_1691))) (or (and (< v_main_~x~0_1692 v_main_~x~0_1691) (< v_main_~x~0_1691 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1692) .cse1))) InVars {main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1691, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:25,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {31497#(<= 500000 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:25,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {31497#(<= 500000 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1694 v_main_~x~0_1693)) (.cse1 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse2 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse3 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse4 (<= 500000 v_main_~x~0_1694))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1694 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1694 v_main_~y~0_1874))) (and (< .cse5 (+ 1000001 v_main_~y~0_1875)) (< v_main_~y~0_1875 v_main_~y~0_1874) (= (+ v_main_~x~0_1693 v_main_~y~0_1875) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1694, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1874, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1693, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:25,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {31497#(<= 500000 main_~y~0)} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:25,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {31497#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31498#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:25,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {31498#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31499#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:25,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {31499#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31500#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:25,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {31500#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31501#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:25,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {31501#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31502#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:25,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {31502#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31503#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:25,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {31503#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31504#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:25,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {31504#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31505#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:25,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {31505#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31506#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:25,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {31506#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31507#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:25,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {31507#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31508#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:25,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {31508#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31509#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:25,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {31509#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31510#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:25,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {31510#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31511#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:25,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {31511#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31512#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:25,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {31512#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31513#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:25,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {31513#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31514#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:25,553 INFO L290 TraceCheckUtils]: 27: Hoare triple {31514#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31515#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:25,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {31515#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31516#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:25,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {31516#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31517#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:25,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {31517#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31518#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:25,555 INFO L290 TraceCheckUtils]: 31: Hoare triple {31518#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31519#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:25,555 INFO L290 TraceCheckUtils]: 32: Hoare triple {31519#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31520#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:25,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {31520#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31521#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:25,556 INFO L290 TraceCheckUtils]: 34: Hoare triple {31521#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31522#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:25,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {31522#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31523#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:25,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {31523#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31524#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:25,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {31524#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31525#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:25,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {31525#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31526#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:25,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {31526#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31527#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:53:25,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {31527#(<= 499940 main_~y~0)} assume !(~y~0 > 0); {31493#false} is VALID [2022-04-15 06:53:25,559 INFO L272 TraceCheckUtils]: 41: Hoare triple {31493#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31493#false} is VALID [2022-04-15 06:53:25,559 INFO L290 TraceCheckUtils]: 42: Hoare triple {31493#false} ~cond := #in~cond; {31493#false} is VALID [2022-04-15 06:53:25,559 INFO L290 TraceCheckUtils]: 43: Hoare triple {31493#false} assume 0 == ~cond; {31493#false} is VALID [2022-04-15 06:53:25,559 INFO L290 TraceCheckUtils]: 44: Hoare triple {31493#false} assume !false; {31493#false} is VALID [2022-04-15 06:53:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670102503] [2022-04-15 06:53:25,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670102503] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:25,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612619249] [2022-04-15 06:53:25,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:25,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:25,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:25,561 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:25,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 06:53:25,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:25,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 06:53:25,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:25,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:26,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {31492#true} call ULTIMATE.init(); {31492#true} is VALID [2022-04-15 06:53:26,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {31492#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(17, 2);call #Ultimate.allocInit(12, 3); {31492#true} is VALID [2022-04-15 06:53:26,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {31492#true} assume true; {31492#true} is VALID [2022-04-15 06:53:26,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31492#true} {31492#true} #52#return; {31492#true} is VALID [2022-04-15 06:53:26,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {31492#true} call #t~ret9 := main(); {31492#true} is VALID [2022-04-15 06:53:26,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {31492#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:26,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {31497#(<= 500000 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1692 v_main_~x~0_1691))) (or (and (< v_main_~x~0_1692 v_main_~x~0_1691) (< v_main_~x~0_1691 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1692) .cse1))) InVars {main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1691, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:26,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {31497#(<= 500000 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:26,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {31497#(<= 500000 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1694 v_main_~x~0_1693)) (.cse1 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse2 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse3 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse4 (<= 500000 v_main_~x~0_1694))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1694 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1694 v_main_~y~0_1874))) (and (< .cse5 (+ 1000001 v_main_~y~0_1875)) (< v_main_~y~0_1875 v_main_~y~0_1874) (= (+ v_main_~x~0_1693 v_main_~y~0_1875) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1694, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1874, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1693, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:26,022 INFO L290 TraceCheckUtils]: 9: Hoare triple {31497#(<= 500000 main_~y~0)} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31497#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:26,022 INFO L290 TraceCheckUtils]: 10: Hoare triple {31497#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31498#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:26,023 INFO L290 TraceCheckUtils]: 11: Hoare triple {31498#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31499#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:26,023 INFO L290 TraceCheckUtils]: 12: Hoare triple {31499#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31500#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:26,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {31500#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31501#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:26,024 INFO L290 TraceCheckUtils]: 14: Hoare triple {31501#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31502#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:26,025 INFO L290 TraceCheckUtils]: 15: Hoare triple {31502#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31503#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:26,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {31503#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31504#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:26,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {31504#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31505#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:26,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {31505#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31506#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:26,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {31506#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31507#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:26,027 INFO L290 TraceCheckUtils]: 20: Hoare triple {31507#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31508#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:26,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {31508#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31509#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:26,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {31509#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31510#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:26,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {31510#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31511#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:26,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {31511#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31512#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:26,030 INFO L290 TraceCheckUtils]: 25: Hoare triple {31512#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31513#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:26,030 INFO L290 TraceCheckUtils]: 26: Hoare triple {31513#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31514#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:26,031 INFO L290 TraceCheckUtils]: 27: Hoare triple {31514#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31515#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:26,031 INFO L290 TraceCheckUtils]: 28: Hoare triple {31515#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31516#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:26,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {31516#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31517#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:26,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {31517#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31518#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:26,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {31518#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31519#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:26,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {31519#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31520#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:26,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {31520#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31521#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:26,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {31521#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31522#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:26,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {31522#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31523#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:26,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {31523#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31524#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:26,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {31524#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31525#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:26,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {31525#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31526#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:26,037 INFO L290 TraceCheckUtils]: 39: Hoare triple {31526#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31527#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:53:26,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {31527#(<= 499940 main_~y~0)} assume !(~y~0 > 0); {31493#false} is VALID [2022-04-15 06:53:26,037 INFO L272 TraceCheckUtils]: 41: Hoare triple {31493#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31493#false} is VALID [2022-04-15 06:53:26,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {31493#false} ~cond := #in~cond; {31493#false} is VALID [2022-04-15 06:53:26,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {31493#false} assume 0 == ~cond; {31493#false} is VALID [2022-04-15 06:53:26,037 INFO L290 TraceCheckUtils]: 44: Hoare triple {31493#false} assume !false; {31493#false} is VALID [2022-04-15 06:53:26,038 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:26,038 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:27,472 INFO L290 TraceCheckUtils]: 44: Hoare triple {31493#false} assume !false; {31493#false} is VALID [2022-04-15 06:53:27,472 INFO L290 TraceCheckUtils]: 43: Hoare triple {31493#false} assume 0 == ~cond; {31493#false} is VALID [2022-04-15 06:53:27,472 INFO L290 TraceCheckUtils]: 42: Hoare triple {31493#false} ~cond := #in~cond; {31493#false} is VALID [2022-04-15 06:53:27,472 INFO L272 TraceCheckUtils]: 41: Hoare triple {31493#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {31493#false} is VALID [2022-04-15 06:53:27,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {31676#(< 0 main_~y~0)} assume !(~y~0 > 0); {31493#false} is VALID [2022-04-15 06:53:27,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {31680#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31676#(< 0 main_~y~0)} is VALID [2022-04-15 06:53:27,474 INFO L290 TraceCheckUtils]: 38: Hoare triple {31684#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31680#(< 2 main_~y~0)} is VALID [2022-04-15 06:53:27,474 INFO L290 TraceCheckUtils]: 37: Hoare triple {31688#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31684#(< 4 main_~y~0)} is VALID [2022-04-15 06:53:27,475 INFO L290 TraceCheckUtils]: 36: Hoare triple {31692#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31688#(< 6 main_~y~0)} is VALID [2022-04-15 06:53:27,475 INFO L290 TraceCheckUtils]: 35: Hoare triple {31696#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31692#(< 8 main_~y~0)} is VALID [2022-04-15 06:53:27,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {31700#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31696#(< 10 main_~y~0)} is VALID [2022-04-15 06:53:27,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {31704#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31700#(< 12 main_~y~0)} is VALID [2022-04-15 06:53:27,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {31708#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31704#(< 14 main_~y~0)} is VALID [2022-04-15 06:53:27,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {31712#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31708#(< 16 main_~y~0)} is VALID [2022-04-15 06:53:27,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {31716#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31712#(< 18 main_~y~0)} is VALID [2022-04-15 06:53:27,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {31720#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31716#(< 20 main_~y~0)} is VALID [2022-04-15 06:53:27,486 INFO L290 TraceCheckUtils]: 28: Hoare triple {31724#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31720#(< 22 main_~y~0)} is VALID [2022-04-15 06:53:27,487 INFO L290 TraceCheckUtils]: 27: Hoare triple {31728#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31724#(< 24 main_~y~0)} is VALID [2022-04-15 06:53:27,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {31732#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31728#(< 26 main_~y~0)} is VALID [2022-04-15 06:53:27,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {31736#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31732#(< 28 main_~y~0)} is VALID [2022-04-15 06:53:27,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {31740#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31736#(< 30 main_~y~0)} is VALID [2022-04-15 06:53:27,489 INFO L290 TraceCheckUtils]: 23: Hoare triple {31744#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31740#(< 32 main_~y~0)} is VALID [2022-04-15 06:53:27,490 INFO L290 TraceCheckUtils]: 22: Hoare triple {31748#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31744#(< 34 main_~y~0)} is VALID [2022-04-15 06:53:27,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {31752#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31748#(< 36 main_~y~0)} is VALID [2022-04-15 06:53:27,491 INFO L290 TraceCheckUtils]: 20: Hoare triple {31756#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31752#(< 38 main_~y~0)} is VALID [2022-04-15 06:53:27,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {31760#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31756#(< 40 main_~y~0)} is VALID [2022-04-15 06:53:27,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {31764#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31760#(< 42 main_~y~0)} is VALID [2022-04-15 06:53:27,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {31768#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31764#(< 44 main_~y~0)} is VALID [2022-04-15 06:53:27,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {31772#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31768#(< 46 main_~y~0)} is VALID [2022-04-15 06:53:27,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {31776#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31772#(< 48 main_~y~0)} is VALID [2022-04-15 06:53:27,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {31780#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31776#(< 50 main_~y~0)} is VALID [2022-04-15 06:53:27,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {31784#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31780#(< 52 main_~y~0)} is VALID [2022-04-15 06:53:27,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {31788#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31784#(< 54 main_~y~0)} is VALID [2022-04-15 06:53:27,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {31792#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31788#(< 56 main_~y~0)} is VALID [2022-04-15 06:53:27,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {31796#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {31792#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:27,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {31796#(< 60 main_~y~0)} [175] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {31796#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:27,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {31796#(< 60 main_~y~0)} [178] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1694 v_main_~x~0_1693)) (.cse1 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse2 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse3 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse4 (<= 500000 v_main_~x~0_1694))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1694 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1694 v_main_~y~0_1874))) (and (< .cse5 (+ 1000001 v_main_~y~0_1875)) (< v_main_~y~0_1875 v_main_~y~0_1874) (= (+ v_main_~x~0_1693 v_main_~y~0_1875) .cse5) .cse4)))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1694, main_#t~post6=|v_main_#t~post6_207|} OutVars{main_~y~0=v_main_~y~0_1874, main_#t~post5=|v_main_#t~post5_206|, main_~x~0=v_main_~x~0_1693, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {31796#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:27,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {31796#(< 60 main_~y~0)} [177] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31796#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:27,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {31796#(< 60 main_~y~0)} [176] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_190| |v_main_#t~post4_189|)) (.cse1 (= v_main_~x~0_1692 v_main_~x~0_1691))) (or (and (< v_main_~x~0_1692 v_main_~x~0_1691) (< v_main_~x~0_1691 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1692) .cse1))) InVars {main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} OutVars{main_~x~0=v_main_~x~0_1691, main_#t~post4=|v_main_#t~post4_189|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {31796#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:27,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {31492#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {31796#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:27,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {31492#true} call #t~ret9 := main(); {31492#true} is VALID [2022-04-15 06:53:27,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31492#true} {31492#true} #52#return; {31492#true} is VALID [2022-04-15 06:53:27,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {31492#true} assume true; {31492#true} is VALID [2022-04-15 06:53:27,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {31492#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(17, 2);call #Ultimate.allocInit(12, 3); {31492#true} is VALID [2022-04-15 06:53:27,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {31492#true} call ULTIMATE.init(); {31492#true} is VALID [2022-04-15 06:53:27,498 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:27,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612619249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:27,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:27,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 65 [2022-04-15 06:53:29,837 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:29,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [299258078] [2022-04-15 06:53:29,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [299258078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:29,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:29,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-15 06:53:29,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140062951] [2022-04-15 06:53:29,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:29,838 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 150 [2022-04-15 06:53:29,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:29,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 06:53:29,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:29,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-15 06:53:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:29,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-15 06:53:29,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5592, Invalid=8688, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 06:53:29,945 INFO L87 Difference]: Start difference. First operand 151 states and 154 transitions. Second operand has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 06:53:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:42,455 INFO L93 Difference]: Finished difference Result 299 states and 310 transitions. [2022-04-15 06:53:42,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-15 06:53:42,455 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 150 [2022-04-15 06:53:42,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:53:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 06:53:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 172 transitions. [2022-04-15 06:53:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 06:53:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 172 transitions. [2022-04-15 06:53:42,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 172 transitions. [2022-04-15 06:53:42,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:42,598 INFO L225 Difference]: With dead ends: 299 [2022-04-15 06:53:42,598 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 06:53:42,600 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=13050, Invalid=29180, Unknown=0, NotChecked=0, Total=42230 [2022-04-15 06:53:42,601 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 515 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6107 mSolverCounterSat, 559 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 6666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 559 IncrementalHoareTripleChecker+Valid, 6107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:53:42,601 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [515 Valid, 49 Invalid, 6666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [559 Valid, 6107 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-04-15 06:53:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 06:53:42,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-04-15 06:53:42,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:53:42,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 06:53:42,847 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 06:53:42,847 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 06:53:42,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:42,852 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2022-04-15 06:53:42,852 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2022-04-15 06:53:42,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:42,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:42,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 156 states. [2022-04-15 06:53:42,853 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 156 states. [2022-04-15 06:53:42,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:53:42,855 INFO L93 Difference]: Finished difference Result 156 states and 159 transitions. [2022-04-15 06:53:42,855 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2022-04-15 06:53:42,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:53:42,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:53:42,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:53:42,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:53:42,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.0264900662251655) internal successors, (155), 151 states have internal predecessors, (155), 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 06:53:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 159 transitions. [2022-04-15 06:53:42,858 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 159 transitions. Word has length 150 [2022-04-15 06:53:42,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:53:42,858 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 159 transitions. [2022-04-15 06:53:42,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 88 states have internal predecessors, (146), 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 06:53:42,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 159 transitions. [2022-04-15 06:53:43,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 159 transitions. [2022-04-15 06:53:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 06:53:43,001 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:53:43,001 INFO L499 BasicCegarLoop]: trace histogram [56, 55, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:53:43,018 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 06:53:43,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 06:53:43,203 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:53:43,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:53:43,204 INFO L85 PathProgramCache]: Analyzing trace with hash 504372054, now seen corresponding path program 31 times [2022-04-15 06:53:43,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:43,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1774959561] [2022-04-15 06:53:45,927 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:46,173 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:53:46,174 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:53:46,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1152441694, now seen corresponding path program 1 times [2022-04-15 06:53:46,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:53:46,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762244274] [2022-04-15 06:53:46,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:46,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:53:46,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:53:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {33315#(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(17, 2);call #Ultimate.allocInit(12, 3); {33278#true} is VALID [2022-04-15 06:53:46,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {33278#true} assume true; {33278#true} is VALID [2022-04-15 06:53:46,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33278#true} {33278#true} #52#return; {33278#true} is VALID [2022-04-15 06:53:46,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {33278#true} call ULTIMATE.init(); {33315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:53:46,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {33315#(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(17, 2);call #Ultimate.allocInit(12, 3); {33278#true} is VALID [2022-04-15 06:53:46,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {33278#true} assume true; {33278#true} is VALID [2022-04-15 06:53:46,810 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33278#true} {33278#true} #52#return; {33278#true} is VALID [2022-04-15 06:53:46,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {33278#true} call #t~ret9 := main(); {33278#true} is VALID [2022-04-15 06:53:46,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {33278#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:46,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {33283#(<= 500000 main_~y~0)} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1792 v_main_~x~0_1791))) (or (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1792) .cse1) (and (< v_main_~x~0_1792 v_main_~x~0_1791) (< v_main_~x~0_1791 500001)))) InVars {main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1791, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:46,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {33283#(<= 500000 main_~y~0)} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:46,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {33283#(<= 500000 main_~y~0)} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= v_main_~x~0_1794 v_main_~x~0_1793)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1794))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1794 1000000)) (not .cse4))) (and (< v_main_~x~0_1793 1000001) (= (+ v_main_~x~0_1793 v_main_~y~0_1997) (+ v_main_~x~0_1794 v_main_~y~0_1996)) .cse4 (< v_main_~x~0_1794 v_main_~x~0_1793)))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1794, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1996, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1793, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:46,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {33283#(<= 500000 main_~y~0)} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:46,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {33283#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33284#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:46,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {33284#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33285#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:46,815 INFO L290 TraceCheckUtils]: 12: Hoare triple {33285#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33286#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:46,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {33286#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33287#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:46,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {33287#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33288#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:46,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {33288#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33289#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:46,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {33289#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33290#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:46,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {33290#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33291#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:46,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {33291#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33292#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:46,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {33292#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33293#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:46,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {33293#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33294#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:46,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {33294#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33295#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:46,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {33295#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33296#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:46,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {33296#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33297#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:46,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {33297#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33298#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:46,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {33298#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33299#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:46,827 INFO L290 TraceCheckUtils]: 26: Hoare triple {33299#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33300#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:46,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {33300#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33301#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:46,829 INFO L290 TraceCheckUtils]: 28: Hoare triple {33301#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33302#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:46,830 INFO L290 TraceCheckUtils]: 29: Hoare triple {33302#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33303#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:46,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {33303#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33304#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:46,831 INFO L290 TraceCheckUtils]: 31: Hoare triple {33304#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33305#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:46,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {33305#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33306#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:46,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {33306#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33307#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:46,833 INFO L290 TraceCheckUtils]: 34: Hoare triple {33307#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33308#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:46,833 INFO L290 TraceCheckUtils]: 35: Hoare triple {33308#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33309#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:46,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {33309#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33310#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:46,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {33310#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33311#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:46,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {33311#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33312#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:46,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {33312#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33313#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:53:46,836 INFO L290 TraceCheckUtils]: 40: Hoare triple {33313#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33314#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:53:46,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {33314#(<= 499938 main_~y~0)} assume !(~y~0 > 0); {33279#false} is VALID [2022-04-15 06:53:46,837 INFO L272 TraceCheckUtils]: 42: Hoare triple {33279#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33279#false} is VALID [2022-04-15 06:53:46,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {33279#false} ~cond := #in~cond; {33279#false} is VALID [2022-04-15 06:53:46,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {33279#false} assume 0 == ~cond; {33279#false} is VALID [2022-04-15 06:53:46,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {33279#false} assume !false; {33279#false} is VALID [2022-04-15 06:53:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:46,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:53:46,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762244274] [2022-04-15 06:53:46,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762244274] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:53:46,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343821973] [2022-04-15 06:53:46,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:53:46,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:53:46,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:53:46,839 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:53:46,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 06:53:46,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-15 06:53:46,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:53:46,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:53:47,351 INFO L272 TraceCheckUtils]: 0: Hoare triple {33278#true} call ULTIMATE.init(); {33278#true} is VALID [2022-04-15 06:53:47,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {33278#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(17, 2);call #Ultimate.allocInit(12, 3); {33278#true} is VALID [2022-04-15 06:53:47,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {33278#true} assume true; {33278#true} is VALID [2022-04-15 06:53:47,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33278#true} {33278#true} #52#return; {33278#true} is VALID [2022-04-15 06:53:47,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {33278#true} call #t~ret9 := main(); {33278#true} is VALID [2022-04-15 06:53:47,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {33278#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:47,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {33283#(<= 500000 main_~y~0)} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1792 v_main_~x~0_1791))) (or (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1792) .cse1) (and (< v_main_~x~0_1792 v_main_~x~0_1791) (< v_main_~x~0_1791 500001)))) InVars {main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1791, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:47,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {33283#(<= 500000 main_~y~0)} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:47,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {33283#(<= 500000 main_~y~0)} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= v_main_~x~0_1794 v_main_~x~0_1793)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1794))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1794 1000000)) (not .cse4))) (and (< v_main_~x~0_1793 1000001) (= (+ v_main_~x~0_1793 v_main_~y~0_1997) (+ v_main_~x~0_1794 v_main_~y~0_1996)) .cse4 (< v_main_~x~0_1794 v_main_~x~0_1793)))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1794, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1996, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1793, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:47,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {33283#(<= 500000 main_~y~0)} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33283#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:53:47,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {33283#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33284#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:53:47,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {33284#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33285#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:53:47,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {33285#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33286#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:53:47,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {33286#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33287#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:53:47,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {33287#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33288#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:53:47,357 INFO L290 TraceCheckUtils]: 15: Hoare triple {33288#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33289#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:53:47,357 INFO L290 TraceCheckUtils]: 16: Hoare triple {33289#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33290#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:53:47,358 INFO L290 TraceCheckUtils]: 17: Hoare triple {33290#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33291#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:53:47,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {33291#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33292#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:53:47,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {33292#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33293#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:53:47,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {33293#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33294#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:53:47,360 INFO L290 TraceCheckUtils]: 21: Hoare triple {33294#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33295#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:53:47,360 INFO L290 TraceCheckUtils]: 22: Hoare triple {33295#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33296#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:53:47,361 INFO L290 TraceCheckUtils]: 23: Hoare triple {33296#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33297#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:53:47,361 INFO L290 TraceCheckUtils]: 24: Hoare triple {33297#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33298#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:53:47,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {33298#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33299#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:53:47,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {33299#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33300#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:53:47,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {33300#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33301#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:53:47,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {33301#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33302#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:53:47,363 INFO L290 TraceCheckUtils]: 29: Hoare triple {33302#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33303#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:53:47,364 INFO L290 TraceCheckUtils]: 30: Hoare triple {33303#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33304#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:53:47,364 INFO L290 TraceCheckUtils]: 31: Hoare triple {33304#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33305#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:53:47,365 INFO L290 TraceCheckUtils]: 32: Hoare triple {33305#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33306#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:53:47,365 INFO L290 TraceCheckUtils]: 33: Hoare triple {33306#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33307#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:53:47,366 INFO L290 TraceCheckUtils]: 34: Hoare triple {33307#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33308#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:53:47,366 INFO L290 TraceCheckUtils]: 35: Hoare triple {33308#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33309#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:53:47,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {33309#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33310#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:53:47,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {33310#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33311#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:53:47,368 INFO L290 TraceCheckUtils]: 38: Hoare triple {33311#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33312#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:53:47,368 INFO L290 TraceCheckUtils]: 39: Hoare triple {33312#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33313#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:53:47,369 INFO L290 TraceCheckUtils]: 40: Hoare triple {33313#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33314#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:53:47,369 INFO L290 TraceCheckUtils]: 41: Hoare triple {33314#(<= 499938 main_~y~0)} assume !(~y~0 > 0); {33279#false} is VALID [2022-04-15 06:53:47,369 INFO L272 TraceCheckUtils]: 42: Hoare triple {33279#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33279#false} is VALID [2022-04-15 06:53:47,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {33279#false} ~cond := #in~cond; {33279#false} is VALID [2022-04-15 06:53:47,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {33279#false} assume 0 == ~cond; {33279#false} is VALID [2022-04-15 06:53:47,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {33279#false} assume !false; {33279#false} is VALID [2022-04-15 06:53:47,370 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:47,370 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:53:48,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {33279#false} assume !false; {33279#false} is VALID [2022-04-15 06:53:48,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {33279#false} assume 0 == ~cond; {33279#false} is VALID [2022-04-15 06:53:48,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {33279#false} ~cond := #in~cond; {33279#false} is VALID [2022-04-15 06:53:48,794 INFO L272 TraceCheckUtils]: 42: Hoare triple {33279#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {33279#false} is VALID [2022-04-15 06:53:48,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {33466#(< 0 main_~y~0)} assume !(~y~0 > 0); {33279#false} is VALID [2022-04-15 06:53:48,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {33470#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33466#(< 0 main_~y~0)} is VALID [2022-04-15 06:53:48,795 INFO L290 TraceCheckUtils]: 39: Hoare triple {33474#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33470#(< 2 main_~y~0)} is VALID [2022-04-15 06:53:48,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {33478#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33474#(< 4 main_~y~0)} is VALID [2022-04-15 06:53:48,796 INFO L290 TraceCheckUtils]: 37: Hoare triple {33482#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33478#(< 6 main_~y~0)} is VALID [2022-04-15 06:53:48,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {33486#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33482#(< 8 main_~y~0)} is VALID [2022-04-15 06:53:48,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {33490#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33486#(< 10 main_~y~0)} is VALID [2022-04-15 06:53:48,798 INFO L290 TraceCheckUtils]: 34: Hoare triple {33494#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33490#(< 12 main_~y~0)} is VALID [2022-04-15 06:53:48,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {33498#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33494#(< 14 main_~y~0)} is VALID [2022-04-15 06:53:48,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {33502#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33498#(< 16 main_~y~0)} is VALID [2022-04-15 06:53:48,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {33506#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33502#(< 18 main_~y~0)} is VALID [2022-04-15 06:53:48,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {33510#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33506#(< 20 main_~y~0)} is VALID [2022-04-15 06:53:48,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {33514#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33510#(< 22 main_~y~0)} is VALID [2022-04-15 06:53:48,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {33518#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33514#(< 24 main_~y~0)} is VALID [2022-04-15 06:53:48,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {33522#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33518#(< 26 main_~y~0)} is VALID [2022-04-15 06:53:48,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {33526#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33522#(< 28 main_~y~0)} is VALID [2022-04-15 06:53:48,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {33530#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33526#(< 30 main_~y~0)} is VALID [2022-04-15 06:53:48,802 INFO L290 TraceCheckUtils]: 24: Hoare triple {33534#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33530#(< 32 main_~y~0)} is VALID [2022-04-15 06:53:48,803 INFO L290 TraceCheckUtils]: 23: Hoare triple {33538#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33534#(< 34 main_~y~0)} is VALID [2022-04-15 06:53:48,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {33542#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33538#(< 36 main_~y~0)} is VALID [2022-04-15 06:53:48,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {33546#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33542#(< 38 main_~y~0)} is VALID [2022-04-15 06:53:48,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {33550#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33546#(< 40 main_~y~0)} is VALID [2022-04-15 06:53:48,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {33554#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33550#(< 42 main_~y~0)} is VALID [2022-04-15 06:53:48,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {33558#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33554#(< 44 main_~y~0)} is VALID [2022-04-15 06:53:48,806 INFO L290 TraceCheckUtils]: 17: Hoare triple {33562#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33558#(< 46 main_~y~0)} is VALID [2022-04-15 06:53:48,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {33566#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33562#(< 48 main_~y~0)} is VALID [2022-04-15 06:53:48,807 INFO L290 TraceCheckUtils]: 15: Hoare triple {33570#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33566#(< 50 main_~y~0)} is VALID [2022-04-15 06:53:48,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {33574#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33570#(< 52 main_~y~0)} is VALID [2022-04-15 06:53:48,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {33578#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33574#(< 54 main_~y~0)} is VALID [2022-04-15 06:53:48,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {33582#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33578#(< 56 main_~y~0)} is VALID [2022-04-15 06:53:48,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {33586#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33582#(< 58 main_~y~0)} is VALID [2022-04-15 06:53:48,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {33590#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {33586#(< 60 main_~y~0)} is VALID [2022-04-15 06:53:48,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {33590#(< 62 main_~y~0)} [179] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {33590#(< 62 main_~y~0)} is VALID [2022-04-15 06:53:48,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {33590#(< 62 main_~y~0)} [182] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= v_main_~x~0_1794 v_main_~x~0_1793)) (.cse2 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1794))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1794 1000000)) (not .cse4))) (and (< v_main_~x~0_1793 1000001) (= (+ v_main_~x~0_1793 v_main_~y~0_1997) (+ v_main_~x~0_1794 v_main_~y~0_1996)) .cse4 (< v_main_~x~0_1794 v_main_~x~0_1793)))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1794, main_#t~post6=|v_main_#t~post6_214|} OutVars{main_~y~0=v_main_~y~0_1996, main_#t~post5=|v_main_#t~post5_213|, main_~x~0=v_main_~x~0_1793, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33590#(< 62 main_~y~0)} is VALID [2022-04-15 06:53:48,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {33590#(< 62 main_~y~0)} [181] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33590#(< 62 main_~y~0)} is VALID [2022-04-15 06:53:48,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {33590#(< 62 main_~y~0)} [180] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_196| |v_main_#t~post4_195|)) (.cse1 (= v_main_~x~0_1792 v_main_~x~0_1791))) (or (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_1792) .cse1) (and (< v_main_~x~0_1792 v_main_~x~0_1791) (< v_main_~x~0_1791 500001)))) InVars {main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} OutVars{main_~x~0=v_main_~x~0_1791, main_#t~post4=|v_main_#t~post4_195|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33590#(< 62 main_~y~0)} is VALID [2022-04-15 06:53:48,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {33278#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33590#(< 62 main_~y~0)} is VALID [2022-04-15 06:53:48,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {33278#true} call #t~ret9 := main(); {33278#true} is VALID [2022-04-15 06:53:48,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33278#true} {33278#true} #52#return; {33278#true} is VALID [2022-04-15 06:53:48,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {33278#true} assume true; {33278#true} is VALID [2022-04-15 06:53:48,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {33278#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(17, 2);call #Ultimate.allocInit(12, 3); {33278#true} is VALID [2022-04-15 06:53:48,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {33278#true} call ULTIMATE.init(); {33278#true} is VALID [2022-04-15 06:53:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:53:48,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343821973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:53:48,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:53:48,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 67 [2022-04-15 06:53:51,332 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:53:51,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1774959561] [2022-04-15 06:53:51,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1774959561] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:53:51,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:53:51,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-15 06:53:51,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317728338] [2022-04-15 06:53:51,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:53:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 155 [2022-04-15 06:53:51,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:53:51,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 06:53:51,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:53:51,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-15 06:53:51,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:53:51,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-15 06:53:51,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5965, Invalid=9287, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 06:53:51,455 INFO L87 Difference]: Start difference. First operand 156 states and 159 transitions. Second operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 06:54:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:04,473 INFO L93 Difference]: Finished difference Result 309 states and 320 transitions. [2022-04-15 06:54:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-15 06:54:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 155 [2022-04-15 06:54:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:04,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 06:54:04,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 177 transitions. [2022-04-15 06:54:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 06:54:04,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 177 transitions. [2022-04-15 06:54:04,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 177 transitions. [2022-04-15 06:54:04,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:04,623 INFO L225 Difference]: With dead ends: 309 [2022-04-15 06:54:04,623 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 06:54:04,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13141 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=13921, Invalid=31235, Unknown=0, NotChecked=0, Total=45156 [2022-04-15 06:54:04,626 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 302 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6499 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 6894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 6499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:04,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 34 Invalid, 6894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 6499 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-15 06:54:04,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 06:54:04,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-04-15 06:54:04,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:04,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 06:54:04,877 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 06:54:04,877 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 06:54:04,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:04,878 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2022-04-15 06:54:04,879 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2022-04-15 06:54:04,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:04,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:04,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 161 states. [2022-04-15 06:54:04,879 INFO L87 Difference]: Start difference. First operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 161 states. [2022-04-15 06:54:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:04,881 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2022-04-15 06:54:04,881 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2022-04-15 06:54:04,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:04,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:04,881 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:04,881 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 156 states have (on average 1.0256410256410255) internal successors, (160), 156 states have internal predecessors, (160), 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 06:54:04,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 164 transitions. [2022-04-15 06:54:04,883 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 164 transitions. Word has length 155 [2022-04-15 06:54:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:04,883 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 164 transitions. [2022-04-15 06:54:04,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 1.641304347826087) internal successors, (151), 91 states have internal predecessors, (151), 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 06:54:04,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 164 transitions. [2022-04-15 06:54:05,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:05,027 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 164 transitions. [2022-04-15 06:54:05,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-15 06:54:05,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:05,028 INFO L499 BasicCegarLoop]: trace histogram [58, 57, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:05,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:05,228 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:05,228 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 176608663, now seen corresponding path program 32 times [2022-04-15 06:54:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:05,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1791390434] [2022-04-15 06:54:09,288 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:09,335 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:09,534 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:09,535 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:09,539 INFO L85 PathProgramCache]: Analyzing trace with hash -386255871, now seen corresponding path program 1 times [2022-04-15 06:54:09,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:09,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245369470] [2022-04-15 06:54:09,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:09,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:10,205 INFO L290 TraceCheckUtils]: 0: Hoare triple {35158#(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(17, 2);call #Ultimate.allocInit(12, 3); {35120#true} is VALID [2022-04-15 06:54:10,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {35120#true} assume true; {35120#true} is VALID [2022-04-15 06:54:10,205 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35120#true} {35120#true} #52#return; {35120#true} is VALID [2022-04-15 06:54:10,205 INFO L272 TraceCheckUtils]: 0: Hoare triple {35120#true} call ULTIMATE.init(); {35158#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:10,205 INFO L290 TraceCheckUtils]: 1: Hoare triple {35158#(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(17, 2);call #Ultimate.allocInit(12, 3); {35120#true} is VALID [2022-04-15 06:54:10,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {35120#true} assume true; {35120#true} is VALID [2022-04-15 06:54:10,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35120#true} {35120#true} #52#return; {35120#true} is VALID [2022-04-15 06:54:10,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {35120#true} call #t~ret9 := main(); {35120#true} is VALID [2022-04-15 06:54:10,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {35120#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {35125#(<= 500000 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_202| |v_main_#t~post4_201|)) (.cse1 (= v_main_~x~0_1895 v_main_~x~0_1894))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1895 500000))) (and (< v_main_~x~0_1895 v_main_~x~0_1894) (< v_main_~x~0_1894 500001)))) InVars {main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} OutVars{main_~x~0=v_main_~x~0_1894, main_#t~post4=|v_main_#t~post4_201|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,207 INFO L290 TraceCheckUtils]: 7: Hoare triple {35125#(<= 500000 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,207 INFO L290 TraceCheckUtils]: 8: Hoare triple {35125#(<= 500000 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse4 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse5 (= v_main_~x~0_1897 v_main_~x~0_1896)) (.cse0 (<= 500000 v_main_~x~0_1897))) (or (let ((.cse1 (+ v_main_~x~0_1897 v_main_~y~0_2122))) (and .cse0 (= .cse1 (+ v_main_~x~0_1896 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) (< .cse1 (+ 1000001 v_main_~y~0_2123)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_1897 1000000)))))) InVars {main_~y~0=v_main_~y~0_2123, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1897, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2122, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1896, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {35125#(<= 500000 main_~y~0)} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {35125#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35126#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:54:10,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {35126#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35127#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:54:10,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {35127#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35128#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:54:10,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {35128#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35129#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:54:10,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {35129#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35130#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:54:10,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {35130#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35131#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:54:10,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {35131#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35132#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:54:10,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {35132#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35133#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:54:10,212 INFO L290 TraceCheckUtils]: 18: Hoare triple {35133#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35134#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:54:10,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {35134#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35135#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:54:10,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {35135#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35136#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:54:10,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {35136#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35137#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:54:10,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {35137#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35138#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:54:10,215 INFO L290 TraceCheckUtils]: 23: Hoare triple {35138#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35139#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:54:10,215 INFO L290 TraceCheckUtils]: 24: Hoare triple {35139#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35140#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:54:10,216 INFO L290 TraceCheckUtils]: 25: Hoare triple {35140#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35141#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:54:10,216 INFO L290 TraceCheckUtils]: 26: Hoare triple {35141#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35142#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:54:10,217 INFO L290 TraceCheckUtils]: 27: Hoare triple {35142#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35143#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:54:10,217 INFO L290 TraceCheckUtils]: 28: Hoare triple {35143#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35144#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:54:10,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {35144#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35145#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:54:10,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {35145#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35146#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:54:10,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {35146#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35147#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:54:10,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {35147#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35148#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:54:10,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {35148#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35149#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:54:10,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {35149#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35150#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:54:10,221 INFO L290 TraceCheckUtils]: 35: Hoare triple {35150#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35151#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:54:10,221 INFO L290 TraceCheckUtils]: 36: Hoare triple {35151#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35152#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:54:10,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {35152#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35153#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:54:10,222 INFO L290 TraceCheckUtils]: 38: Hoare triple {35153#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35154#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:54:10,223 INFO L290 TraceCheckUtils]: 39: Hoare triple {35154#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35155#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:54:10,223 INFO L290 TraceCheckUtils]: 40: Hoare triple {35155#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35156#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:54:10,223 INFO L290 TraceCheckUtils]: 41: Hoare triple {35156#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35157#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:54:10,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {35157#(<= 499936 main_~y~0)} assume !(~y~0 > 0); {35121#false} is VALID [2022-04-15 06:54:10,224 INFO L272 TraceCheckUtils]: 43: Hoare triple {35121#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35121#false} is VALID [2022-04-15 06:54:10,224 INFO L290 TraceCheckUtils]: 44: Hoare triple {35121#false} ~cond := #in~cond; {35121#false} is VALID [2022-04-15 06:54:10,224 INFO L290 TraceCheckUtils]: 45: Hoare triple {35121#false} assume 0 == ~cond; {35121#false} is VALID [2022-04-15 06:54:10,224 INFO L290 TraceCheckUtils]: 46: Hoare triple {35121#false} assume !false; {35121#false} is VALID [2022-04-15 06:54:10,224 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:10,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:10,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245369470] [2022-04-15 06:54:10,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245369470] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:10,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241628130] [2022-04-15 06:54:10,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:10,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:10,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:10,227 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:10,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 06:54:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:10,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 06:54:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:10,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:10,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {35120#true} call ULTIMATE.init(); {35120#true} is VALID [2022-04-15 06:54:10,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {35120#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(17, 2);call #Ultimate.allocInit(12, 3); {35120#true} is VALID [2022-04-15 06:54:10,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {35120#true} assume true; {35120#true} is VALID [2022-04-15 06:54:10,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35120#true} {35120#true} #52#return; {35120#true} is VALID [2022-04-15 06:54:10,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {35120#true} call #t~ret9 := main(); {35120#true} is VALID [2022-04-15 06:54:10,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {35120#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {35125#(<= 500000 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_202| |v_main_#t~post4_201|)) (.cse1 (= v_main_~x~0_1895 v_main_~x~0_1894))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1895 500000))) (and (< v_main_~x~0_1895 v_main_~x~0_1894) (< v_main_~x~0_1894 500001)))) InVars {main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} OutVars{main_~x~0=v_main_~x~0_1894, main_#t~post4=|v_main_#t~post4_201|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {35125#(<= 500000 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {35125#(<= 500000 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse4 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse5 (= v_main_~x~0_1897 v_main_~x~0_1896)) (.cse0 (<= 500000 v_main_~x~0_1897))) (or (let ((.cse1 (+ v_main_~x~0_1897 v_main_~y~0_2122))) (and .cse0 (= .cse1 (+ v_main_~x~0_1896 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) (< .cse1 (+ 1000001 v_main_~y~0_2123)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_1897 1000000)))))) InVars {main_~y~0=v_main_~y~0_2123, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1897, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2122, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1896, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {35125#(<= 500000 main_~y~0)} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35125#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:10,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {35125#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35126#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:54:10,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {35126#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35127#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:54:10,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {35127#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35128#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:54:10,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {35128#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35129#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:54:10,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {35129#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35130#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:54:10,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {35130#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35131#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:54:10,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {35131#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35132#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:54:10,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {35132#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35133#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:54:10,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {35133#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35134#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:54:10,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {35134#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35135#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:54:10,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {35135#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35136#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:54:10,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {35136#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35137#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:54:10,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {35137#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35138#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:54:10,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {35138#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35139#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:54:10,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {35139#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35140#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:54:10,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {35140#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35141#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:54:10,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {35141#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35142#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:54:10,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {35142#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35143#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:54:10,708 INFO L290 TraceCheckUtils]: 28: Hoare triple {35143#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35144#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:54:10,708 INFO L290 TraceCheckUtils]: 29: Hoare triple {35144#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35145#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:54:10,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {35145#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35146#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:54:10,709 INFO L290 TraceCheckUtils]: 31: Hoare triple {35146#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35147#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:54:10,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {35147#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35148#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:54:10,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {35148#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35149#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:54:10,711 INFO L290 TraceCheckUtils]: 34: Hoare triple {35149#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35150#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:54:10,711 INFO L290 TraceCheckUtils]: 35: Hoare triple {35150#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35151#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:54:10,712 INFO L290 TraceCheckUtils]: 36: Hoare triple {35151#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35152#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:54:10,712 INFO L290 TraceCheckUtils]: 37: Hoare triple {35152#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35153#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:54:10,713 INFO L290 TraceCheckUtils]: 38: Hoare triple {35153#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35154#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:54:10,713 INFO L290 TraceCheckUtils]: 39: Hoare triple {35154#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35155#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:54:10,713 INFO L290 TraceCheckUtils]: 40: Hoare triple {35155#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35156#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:54:10,714 INFO L290 TraceCheckUtils]: 41: Hoare triple {35156#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35157#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:54:10,714 INFO L290 TraceCheckUtils]: 42: Hoare triple {35157#(<= 499936 main_~y~0)} assume !(~y~0 > 0); {35121#false} is VALID [2022-04-15 06:54:10,714 INFO L272 TraceCheckUtils]: 43: Hoare triple {35121#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35121#false} is VALID [2022-04-15 06:54:10,714 INFO L290 TraceCheckUtils]: 44: Hoare triple {35121#false} ~cond := #in~cond; {35121#false} is VALID [2022-04-15 06:54:10,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {35121#false} assume 0 == ~cond; {35121#false} is VALID [2022-04-15 06:54:10,715 INFO L290 TraceCheckUtils]: 46: Hoare triple {35121#false} assume !false; {35121#false} is VALID [2022-04-15 06:54:10,715 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:10,715 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:12,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {35121#false} assume !false; {35121#false} is VALID [2022-04-15 06:54:12,216 INFO L290 TraceCheckUtils]: 45: Hoare triple {35121#false} assume 0 == ~cond; {35121#false} is VALID [2022-04-15 06:54:12,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {35121#false} ~cond := #in~cond; {35121#false} is VALID [2022-04-15 06:54:12,216 INFO L272 TraceCheckUtils]: 43: Hoare triple {35121#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {35121#false} is VALID [2022-04-15 06:54:12,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {35312#(< 0 main_~y~0)} assume !(~y~0 > 0); {35121#false} is VALID [2022-04-15 06:54:12,217 INFO L290 TraceCheckUtils]: 41: Hoare triple {35316#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35312#(< 0 main_~y~0)} is VALID [2022-04-15 06:54:12,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {35320#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35316#(< 2 main_~y~0)} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 39: Hoare triple {35324#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35320#(< 4 main_~y~0)} is VALID [2022-04-15 06:54:12,218 INFO L290 TraceCheckUtils]: 38: Hoare triple {35328#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35324#(< 6 main_~y~0)} is VALID [2022-04-15 06:54:12,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {35332#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35328#(< 8 main_~y~0)} is VALID [2022-04-15 06:54:12,219 INFO L290 TraceCheckUtils]: 36: Hoare triple {35336#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35332#(< 10 main_~y~0)} is VALID [2022-04-15 06:54:12,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {35340#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35336#(< 12 main_~y~0)} is VALID [2022-04-15 06:54:12,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {35344#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35340#(< 14 main_~y~0)} is VALID [2022-04-15 06:54:12,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {35348#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35344#(< 16 main_~y~0)} is VALID [2022-04-15 06:54:12,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {35352#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35348#(< 18 main_~y~0)} is VALID [2022-04-15 06:54:12,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {35356#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35352#(< 20 main_~y~0)} is VALID [2022-04-15 06:54:12,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {35360#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35356#(< 22 main_~y~0)} is VALID [2022-04-15 06:54:12,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {35364#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35360#(< 24 main_~y~0)} is VALID [2022-04-15 06:54:12,223 INFO L290 TraceCheckUtils]: 28: Hoare triple {35368#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35364#(< 26 main_~y~0)} is VALID [2022-04-15 06:54:12,223 INFO L290 TraceCheckUtils]: 27: Hoare triple {35372#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35368#(< 28 main_~y~0)} is VALID [2022-04-15 06:54:12,224 INFO L290 TraceCheckUtils]: 26: Hoare triple {35376#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35372#(< 30 main_~y~0)} is VALID [2022-04-15 06:54:12,224 INFO L290 TraceCheckUtils]: 25: Hoare triple {35380#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35376#(< 32 main_~y~0)} is VALID [2022-04-15 06:54:12,225 INFO L290 TraceCheckUtils]: 24: Hoare triple {35384#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35380#(< 34 main_~y~0)} is VALID [2022-04-15 06:54:12,225 INFO L290 TraceCheckUtils]: 23: Hoare triple {35388#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35384#(< 36 main_~y~0)} is VALID [2022-04-15 06:54:12,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {35392#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35388#(< 38 main_~y~0)} is VALID [2022-04-15 06:54:12,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {35396#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35392#(< 40 main_~y~0)} is VALID [2022-04-15 06:54:12,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {35400#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35396#(< 42 main_~y~0)} is VALID [2022-04-15 06:54:12,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {35404#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35400#(< 44 main_~y~0)} is VALID [2022-04-15 06:54:12,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {35408#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35404#(< 46 main_~y~0)} is VALID [2022-04-15 06:54:12,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {35412#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35408#(< 48 main_~y~0)} is VALID [2022-04-15 06:54:12,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {35416#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35412#(< 50 main_~y~0)} is VALID [2022-04-15 06:54:12,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {35420#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35416#(< 52 main_~y~0)} is VALID [2022-04-15 06:54:12,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {35424#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35420#(< 54 main_~y~0)} is VALID [2022-04-15 06:54:12,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {35428#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35424#(< 56 main_~y~0)} is VALID [2022-04-15 06:54:12,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {35432#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35428#(< 58 main_~y~0)} is VALID [2022-04-15 06:54:12,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {35436#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35432#(< 60 main_~y~0)} is VALID [2022-04-15 06:54:12,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {35440#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {35436#(< 62 main_~y~0)} is VALID [2022-04-15 06:54:12,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {35440#(< 64 main_~y~0)} [183] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {35440#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:12,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {35440#(< 64 main_~y~0)} [186] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse3 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse4 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse5 (= v_main_~x~0_1897 v_main_~x~0_1896)) (.cse0 (<= 500000 v_main_~x~0_1897))) (or (let ((.cse1 (+ v_main_~x~0_1897 v_main_~y~0_2122))) (and .cse0 (= .cse1 (+ v_main_~x~0_1896 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) (< .cse1 (+ 1000001 v_main_~y~0_2123)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_1897 1000000)))))) InVars {main_~y~0=v_main_~y~0_2123, main_#t~post5=|v_main_#t~post5_221|, main_~x~0=v_main_~x~0_1897, main_#t~post6=|v_main_#t~post6_221|} OutVars{main_~y~0=v_main_~y~0_2122, main_#t~post5=|v_main_#t~post5_220|, main_~x~0=v_main_~x~0_1896, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35440#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:12,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {35440#(< 64 main_~y~0)} [185] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35440#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:12,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {35440#(< 64 main_~y~0)} [184] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_202| |v_main_#t~post4_201|)) (.cse1 (= v_main_~x~0_1895 v_main_~x~0_1894))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1895 500000))) (and (< v_main_~x~0_1895 v_main_~x~0_1894) (< v_main_~x~0_1894 500001)))) InVars {main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} OutVars{main_~x~0=v_main_~x~0_1894, main_#t~post4=|v_main_#t~post4_201|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35440#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:12,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {35120#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35440#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:12,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {35120#true} call #t~ret9 := main(); {35120#true} is VALID [2022-04-15 06:54:12,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35120#true} {35120#true} #52#return; {35120#true} is VALID [2022-04-15 06:54:12,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {35120#true} assume true; {35120#true} is VALID [2022-04-15 06:54:12,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {35120#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(17, 2);call #Ultimate.allocInit(12, 3); {35120#true} is VALID [2022-04-15 06:54:12,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {35120#true} call ULTIMATE.init(); {35120#true} is VALID [2022-04-15 06:54:12,235 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:12,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241628130] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:12,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:12,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 69 [2022-04-15 06:54:14,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:14,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1791390434] [2022-04-15 06:54:14,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1791390434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:14,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:14,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2022-04-15 06:54:14,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301461003] [2022-04-15 06:54:14,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:14,865 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 160 [2022-04-15 06:54:14,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:14,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 06:54:14,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:14,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-04-15 06:54:14,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:14,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-04-15 06:54:14,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6350, Invalid=9906, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:54:14,981 INFO L87 Difference]: Start difference. First operand 161 states and 164 transitions. Second operand has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 06:54:28,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,543 INFO L93 Difference]: Finished difference Result 319 states and 330 transitions. [2022-04-15 06:54:28,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-04-15 06:54:28,543 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 160 [2022-04-15 06:54:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:28,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 06:54:28,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 182 transitions. [2022-04-15 06:54:28,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 06:54:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 182 transitions. [2022-04-15 06:54:28,546 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 182 transitions. [2022-04-15 06:54:28,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:28,699 INFO L225 Difference]: With dead ends: 319 [2022-04-15 06:54:28,699 INFO L226 Difference]: Without dead ends: 166 [2022-04-15 06:54:28,702 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14029 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=14820, Invalid=33360, Unknown=0, NotChecked=0, Total=48180 [2022-04-15 06:54:28,703 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 190 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 6919 mSolverCounterSat, 225 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 7144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 225 IncrementalHoareTripleChecker+Valid, 6919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:28,703 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 29 Invalid, 7144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [225 Valid, 6919 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-04-15 06:54:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-15 06:54:28,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-04-15 06:54:28,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:28,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 06:54:28,961 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 06:54:28,961 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 06:54:28,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,963 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2022-04-15 06:54:28,963 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2022-04-15 06:54:28,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:28,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:28,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 166 states. [2022-04-15 06:54:28,963 INFO L87 Difference]: Start difference. First operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 166 states. [2022-04-15 06:54:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:28,965 INFO L93 Difference]: Finished difference Result 166 states and 169 transitions. [2022-04-15 06:54:28,965 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2022-04-15 06:54:28,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:28,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:28,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:28,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:28,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 161 states have (on average 1.0248447204968945) internal successors, (165), 161 states have internal predecessors, (165), 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 06:54:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 169 transitions. [2022-04-15 06:54:28,967 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 169 transitions. Word has length 160 [2022-04-15 06:54:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:28,968 INFO L478 AbstractCegarLoop]: Abstraction has 166 states and 169 transitions. [2022-04-15 06:54:28,968 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 1.6421052631578947) internal successors, (156), 94 states have internal predecessors, (156), 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 06:54:28,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 166 states and 169 transitions. [2022-04-15 06:54:29,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:29,129 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 169 transitions. [2022-04-15 06:54:29,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-15 06:54:29,130 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:29,130 INFO L499 BasicCegarLoop]: trace histogram [60, 59, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:29,146 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:29,330 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:29,331 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:29,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:29,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1571359778, now seen corresponding path program 33 times [2022-04-15 06:54:29,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:29,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2036157880] [2022-04-15 06:54:29,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:29,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:29,668 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:29,670 INFO L85 PathProgramCache]: Analyzing trace with hash 150712450, now seen corresponding path program 1 times [2022-04-15 06:54:29,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:29,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334406007] [2022-04-15 06:54:29,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:29,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {37057#(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(17, 2);call #Ultimate.allocInit(12, 3); {37018#true} is VALID [2022-04-15 06:54:30,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {37018#true} assume true; {37018#true} is VALID [2022-04-15 06:54:30,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37018#true} {37018#true} #52#return; {37018#true} is VALID [2022-04-15 06:54:30,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {37018#true} call ULTIMATE.init(); {37057#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:30,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {37057#(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(17, 2);call #Ultimate.allocInit(12, 3); {37018#true} is VALID [2022-04-15 06:54:30,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {37018#true} assume true; {37018#true} is VALID [2022-04-15 06:54:30,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37018#true} {37018#true} #52#return; {37018#true} is VALID [2022-04-15 06:54:30,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {37018#true} call #t~ret9 := main(); {37018#true} is VALID [2022-04-15 06:54:30,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {37018#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {37023#(<= 500000 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_208| |v_main_#t~post4_207|)) (.cse1 (= v_main_~x~0_2001 v_main_~x~0_2000))) (or (and .cse0 (not (< v_main_~x~0_2001 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 v_main_~x~0_2000) (< v_main_~x~0_2000 500001)))) InVars {main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} OutVars{main_~x~0=v_main_~x~0_2000, main_#t~post4=|v_main_#t~post4_207|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {37023#(<= 500000 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {37023#(<= 500000 main_~y~0)} [190] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2003 v_main_~x~0_2002)) (.cse1 (<= 500000 v_main_~x~0_2003)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse0 (+ v_main_~x~0_2003 v_main_~y~0_2252))) (and (< .cse0 (+ 1000001 v_main_~y~0_2253)) .cse1 (= .cse0 (+ v_main_~x~0_2002 v_main_~y~0_2253)) (< v_main_~y~0_2253 v_main_~y~0_2252))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_2003 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2253, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2003, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2252, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2002, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {37023#(<= 500000 main_~y~0)} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {37023#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37024#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:54:30,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {37024#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37025#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:54:30,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {37025#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37026#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:54:30,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {37026#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37027#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:54:30,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {37027#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37028#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:54:30,298 INFO L290 TraceCheckUtils]: 15: Hoare triple {37028#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37029#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:54:30,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {37029#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37030#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:54:30,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {37030#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37031#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:54:30,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {37031#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37032#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:54:30,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {37032#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37033#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:54:30,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {37033#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37034#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:54:30,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {37034#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37035#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:54:30,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {37035#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37036#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:54:30,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {37036#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37037#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:54:30,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {37037#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37038#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:54:30,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {37038#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37039#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:54:30,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {37039#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37040#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:54:30,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {37040#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37041#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:54:30,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {37041#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37042#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:54:30,305 INFO L290 TraceCheckUtils]: 29: Hoare triple {37042#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37043#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:54:30,305 INFO L290 TraceCheckUtils]: 30: Hoare triple {37043#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37044#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:54:30,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {37044#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37045#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:54:30,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {37045#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37046#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:54:30,307 INFO L290 TraceCheckUtils]: 33: Hoare triple {37046#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37047#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:54:30,307 INFO L290 TraceCheckUtils]: 34: Hoare triple {37047#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37048#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:54:30,308 INFO L290 TraceCheckUtils]: 35: Hoare triple {37048#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37049#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:54:30,308 INFO L290 TraceCheckUtils]: 36: Hoare triple {37049#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37050#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:54:30,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {37050#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37051#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:54:30,309 INFO L290 TraceCheckUtils]: 38: Hoare triple {37051#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37052#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:54:30,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {37052#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37053#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:54:30,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {37053#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37054#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:54:30,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {37054#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37055#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:54:30,311 INFO L290 TraceCheckUtils]: 42: Hoare triple {37055#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37056#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:54:30,311 INFO L290 TraceCheckUtils]: 43: Hoare triple {37056#(<= 499934 main_~y~0)} assume !(~y~0 > 0); {37019#false} is VALID [2022-04-15 06:54:30,311 INFO L272 TraceCheckUtils]: 44: Hoare triple {37019#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37019#false} is VALID [2022-04-15 06:54:30,312 INFO L290 TraceCheckUtils]: 45: Hoare triple {37019#false} ~cond := #in~cond; {37019#false} is VALID [2022-04-15 06:54:30,312 INFO L290 TraceCheckUtils]: 46: Hoare triple {37019#false} assume 0 == ~cond; {37019#false} is VALID [2022-04-15 06:54:30,312 INFO L290 TraceCheckUtils]: 47: Hoare triple {37019#false} assume !false; {37019#false} is VALID [2022-04-15 06:54:30,312 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:30,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334406007] [2022-04-15 06:54:30,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334406007] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:30,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286407107] [2022-04-15 06:54:30,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:30,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:30,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:30,314 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:30,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 06:54:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 06:54:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:30,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:30,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {37018#true} call ULTIMATE.init(); {37018#true} is VALID [2022-04-15 06:54:30,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {37018#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(17, 2);call #Ultimate.allocInit(12, 3); {37018#true} is VALID [2022-04-15 06:54:30,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {37018#true} assume true; {37018#true} is VALID [2022-04-15 06:54:30,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37018#true} {37018#true} #52#return; {37018#true} is VALID [2022-04-15 06:54:30,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {37018#true} call #t~ret9 := main(); {37018#true} is VALID [2022-04-15 06:54:30,797 INFO L290 TraceCheckUtils]: 5: Hoare triple {37018#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {37023#(<= 500000 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_208| |v_main_#t~post4_207|)) (.cse1 (= v_main_~x~0_2001 v_main_~x~0_2000))) (or (and .cse0 (not (< v_main_~x~0_2001 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 v_main_~x~0_2000) (< v_main_~x~0_2000 500001)))) InVars {main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} OutVars{main_~x~0=v_main_~x~0_2000, main_#t~post4=|v_main_#t~post4_207|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,798 INFO L290 TraceCheckUtils]: 7: Hoare triple {37023#(<= 500000 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {37023#(<= 500000 main_~y~0)} [190] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2003 v_main_~x~0_2002)) (.cse1 (<= 500000 v_main_~x~0_2003)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse0 (+ v_main_~x~0_2003 v_main_~y~0_2252))) (and (< .cse0 (+ 1000001 v_main_~y~0_2253)) .cse1 (= .cse0 (+ v_main_~x~0_2002 v_main_~y~0_2253)) (< v_main_~y~0_2253 v_main_~y~0_2252))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_2003 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2253, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2003, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2252, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2002, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {37023#(<= 500000 main_~y~0)} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37023#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:30,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {37023#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37024#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:54:30,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {37024#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37025#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:54:30,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {37025#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37026#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:54:30,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {37026#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37027#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:54:30,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {37027#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37028#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:54:30,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {37028#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37029#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:54:30,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {37029#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37030#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:54:30,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {37030#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37031#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:54:30,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {37031#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37032#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:54:30,804 INFO L290 TraceCheckUtils]: 19: Hoare triple {37032#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37033#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:54:30,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {37033#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37034#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:54:30,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {37034#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37035#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:54:30,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {37035#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37036#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:54:30,806 INFO L290 TraceCheckUtils]: 23: Hoare triple {37036#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37037#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:54:30,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {37037#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37038#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:54:30,807 INFO L290 TraceCheckUtils]: 25: Hoare triple {37038#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37039#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:54:30,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {37039#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37040#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:54:30,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {37040#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37041#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:54:30,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {37041#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37042#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:54:30,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {37042#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37043#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:54:30,809 INFO L290 TraceCheckUtils]: 30: Hoare triple {37043#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37044#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:54:30,810 INFO L290 TraceCheckUtils]: 31: Hoare triple {37044#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37045#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:54:30,810 INFO L290 TraceCheckUtils]: 32: Hoare triple {37045#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37046#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:54:30,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {37046#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37047#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:54:30,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {37047#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37048#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:54:30,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {37048#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37049#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:54:30,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {37049#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37050#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:54:30,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {37050#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37051#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:54:30,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {37051#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37052#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:54:30,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {37052#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37053#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:54:30,815 INFO L290 TraceCheckUtils]: 40: Hoare triple {37053#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37054#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:54:30,816 INFO L290 TraceCheckUtils]: 41: Hoare triple {37054#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37055#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:54:30,817 INFO L290 TraceCheckUtils]: 42: Hoare triple {37055#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37056#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:54:30,817 INFO L290 TraceCheckUtils]: 43: Hoare triple {37056#(<= 499934 main_~y~0)} assume !(~y~0 > 0); {37019#false} is VALID [2022-04-15 06:54:30,817 INFO L272 TraceCheckUtils]: 44: Hoare triple {37019#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37019#false} is VALID [2022-04-15 06:54:30,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {37019#false} ~cond := #in~cond; {37019#false} is VALID [2022-04-15 06:54:30,817 INFO L290 TraceCheckUtils]: 46: Hoare triple {37019#false} assume 0 == ~cond; {37019#false} is VALID [2022-04-15 06:54:30,817 INFO L290 TraceCheckUtils]: 47: Hoare triple {37019#false} assume !false; {37019#false} is VALID [2022-04-15 06:54:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:30,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:32,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {37019#false} assume !false; {37019#false} is VALID [2022-04-15 06:54:32,391 INFO L290 TraceCheckUtils]: 46: Hoare triple {37019#false} assume 0 == ~cond; {37019#false} is VALID [2022-04-15 06:54:32,391 INFO L290 TraceCheckUtils]: 45: Hoare triple {37019#false} ~cond := #in~cond; {37019#false} is VALID [2022-04-15 06:54:32,391 INFO L272 TraceCheckUtils]: 44: Hoare triple {37019#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {37019#false} is VALID [2022-04-15 06:54:32,392 INFO L290 TraceCheckUtils]: 43: Hoare triple {37214#(< 0 main_~y~0)} assume !(~y~0 > 0); {37019#false} is VALID [2022-04-15 06:54:32,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {37218#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37214#(< 0 main_~y~0)} is VALID [2022-04-15 06:54:32,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {37222#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37218#(< 2 main_~y~0)} is VALID [2022-04-15 06:54:32,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {37226#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37222#(< 4 main_~y~0)} is VALID [2022-04-15 06:54:32,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {37230#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37226#(< 6 main_~y~0)} is VALID [2022-04-15 06:54:32,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {37234#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37230#(< 8 main_~y~0)} is VALID [2022-04-15 06:54:32,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {37238#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37234#(< 10 main_~y~0)} is VALID [2022-04-15 06:54:32,397 INFO L290 TraceCheckUtils]: 36: Hoare triple {37242#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37238#(< 12 main_~y~0)} is VALID [2022-04-15 06:54:32,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {37246#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37242#(< 14 main_~y~0)} is VALID [2022-04-15 06:54:32,399 INFO L290 TraceCheckUtils]: 34: Hoare triple {37250#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37246#(< 16 main_~y~0)} is VALID [2022-04-15 06:54:32,399 INFO L290 TraceCheckUtils]: 33: Hoare triple {37254#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37250#(< 18 main_~y~0)} is VALID [2022-04-15 06:54:32,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {37258#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37254#(< 20 main_~y~0)} is VALID [2022-04-15 06:54:32,400 INFO L290 TraceCheckUtils]: 31: Hoare triple {37262#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37258#(< 22 main_~y~0)} is VALID [2022-04-15 06:54:32,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {37266#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37262#(< 24 main_~y~0)} is VALID [2022-04-15 06:54:32,402 INFO L290 TraceCheckUtils]: 29: Hoare triple {37270#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37266#(< 26 main_~y~0)} is VALID [2022-04-15 06:54:32,402 INFO L290 TraceCheckUtils]: 28: Hoare triple {37274#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37270#(< 28 main_~y~0)} is VALID [2022-04-15 06:54:32,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {37278#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37274#(< 30 main_~y~0)} is VALID [2022-04-15 06:54:32,404 INFO L290 TraceCheckUtils]: 26: Hoare triple {37282#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37278#(< 32 main_~y~0)} is VALID [2022-04-15 06:54:32,404 INFO L290 TraceCheckUtils]: 25: Hoare triple {37286#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37282#(< 34 main_~y~0)} is VALID [2022-04-15 06:54:32,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {37290#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37286#(< 36 main_~y~0)} is VALID [2022-04-15 06:54:32,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {37294#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37290#(< 38 main_~y~0)} is VALID [2022-04-15 06:54:32,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {37298#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37294#(< 40 main_~y~0)} is VALID [2022-04-15 06:54:32,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {37302#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37298#(< 42 main_~y~0)} is VALID [2022-04-15 06:54:32,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {37306#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37302#(< 44 main_~y~0)} is VALID [2022-04-15 06:54:32,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {37310#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37306#(< 46 main_~y~0)} is VALID [2022-04-15 06:54:32,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {37314#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37310#(< 48 main_~y~0)} is VALID [2022-04-15 06:54:32,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {37318#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37314#(< 50 main_~y~0)} is VALID [2022-04-15 06:54:32,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {37322#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37318#(< 52 main_~y~0)} is VALID [2022-04-15 06:54:32,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {37326#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37322#(< 54 main_~y~0)} is VALID [2022-04-15 06:54:32,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {37330#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37326#(< 56 main_~y~0)} is VALID [2022-04-15 06:54:32,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {37334#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37330#(< 58 main_~y~0)} is VALID [2022-04-15 06:54:32,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {37338#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37334#(< 60 main_~y~0)} is VALID [2022-04-15 06:54:32,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {37342#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37338#(< 62 main_~y~0)} is VALID [2022-04-15 06:54:32,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {37346#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {37342#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:32,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {37346#(< 66 main_~y~0)} [187] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {37346#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:32,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {37346#(< 66 main_~y~0)} [190] L11-2-->L18-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2003 v_main_~x~0_2002)) (.cse1 (<= 500000 v_main_~x~0_2003)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse0 (+ v_main_~x~0_2003 v_main_~y~0_2252))) (and (< .cse0 (+ 1000001 v_main_~y~0_2253)) .cse1 (= .cse0 (+ v_main_~x~0_2002 v_main_~y~0_2253)) (< v_main_~y~0_2253 v_main_~y~0_2252))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not (< v_main_~x~0_2003 1000000)) (not .cse1)) .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2253, main_#t~post5=|v_main_#t~post5_228|, main_~x~0=v_main_~x~0_2003, main_#t~post6=|v_main_#t~post6_228|} OutVars{main_~y~0=v_main_~y~0_2252, main_#t~post5=|v_main_#t~post5_227|, main_~x~0=v_main_~x~0_2002, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37346#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:32,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {37346#(< 66 main_~y~0)} [189] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37346#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:32,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {37346#(< 66 main_~y~0)} [188] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_208| |v_main_#t~post4_207|)) (.cse1 (= v_main_~x~0_2001 v_main_~x~0_2000))) (or (and .cse0 (not (< v_main_~x~0_2001 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 v_main_~x~0_2000) (< v_main_~x~0_2000 500001)))) InVars {main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} OutVars{main_~x~0=v_main_~x~0_2000, main_#t~post4=|v_main_#t~post4_207|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37346#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:32,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {37018#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {37346#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:32,416 INFO L272 TraceCheckUtils]: 4: Hoare triple {37018#true} call #t~ret9 := main(); {37018#true} is VALID [2022-04-15 06:54:32,416 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37018#true} {37018#true} #52#return; {37018#true} is VALID [2022-04-15 06:54:32,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {37018#true} assume true; {37018#true} is VALID [2022-04-15 06:54:32,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {37018#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(17, 2);call #Ultimate.allocInit(12, 3); {37018#true} is VALID [2022-04-15 06:54:32,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {37018#true} call ULTIMATE.init(); {37018#true} is VALID [2022-04-15 06:54:32,417 INFO L134 CoverageAnalysis]: Checked inductivity of 563 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:32,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286407107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:32,417 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:32,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 71 [2022-04-15 06:54:35,211 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:54:35,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2036157880] [2022-04-15 06:54:35,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2036157880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:54:35,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:54:35,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2022-04-15 06:54:35,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760871859] [2022-04-15 06:54:35,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:54:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 165 [2022-04-15 06:54:35,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:54:35,212 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 06:54:35,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:35,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-15 06:54:35,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:35,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-15 06:54:35,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6747, Invalid=10545, Unknown=0, NotChecked=0, Total=17292 [2022-04-15 06:54:35,339 INFO L87 Difference]: Start difference. First operand 166 states and 169 transitions. Second operand has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 06:54:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,251 INFO L93 Difference]: Finished difference Result 329 states and 340 transitions. [2022-04-15 06:54:50,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-15 06:54:50,251 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 165 [2022-04-15 06:54:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:54:50,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 06:54:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2022-04-15 06:54:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 06:54:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 187 transitions. [2022-04-15 06:54:50,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 187 transitions. [2022-04-15 06:54:50,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,409 INFO L225 Difference]: With dead ends: 329 [2022-04-15 06:54:50,409 INFO L226 Difference]: Without dead ends: 171 [2022-04-15 06:54:50,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14946 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=15747, Invalid=35555, Unknown=0, NotChecked=0, Total=51302 [2022-04-15 06:54:50,413 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 322 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7475 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 7896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 7475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:54:50,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [322 Valid, 44 Invalid, 7896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 7475 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-04-15 06:54:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-15 06:54:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-04-15 06:54:50,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:54:50,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 06:54:50,691 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 06:54:50,691 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 06:54:50,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,693 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2022-04-15 06:54:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2022-04-15 06:54:50,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 171 states. [2022-04-15 06:54:50,694 INFO L87 Difference]: Start difference. First operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 171 states. [2022-04-15 06:54:50,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:54:50,695 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2022-04-15 06:54:50,695 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2022-04-15 06:54:50,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:54:50,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:54:50,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:54:50,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:54:50,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 166 states have (on average 1.0240963855421688) internal successors, (170), 166 states have internal predecessors, (170), 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 06:54:50,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 174 transitions. [2022-04-15 06:54:50,697 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 174 transitions. Word has length 165 [2022-04-15 06:54:50,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:54:50,698 INFO L478 AbstractCegarLoop]: Abstraction has 171 states and 174 transitions. [2022-04-15 06:54:50,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 1.6428571428571428) internal successors, (161), 97 states have internal predecessors, (161), 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 06:54:50,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 171 states and 174 transitions. [2022-04-15 06:54:50,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:54:50,843 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 174 transitions. [2022-04-15 06:54:50,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-15 06:54:50,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:54:50,844 INFO L499 BasicCegarLoop]: trace histogram [62, 61, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:54:50,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 06:54:51,044 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 06:54:51,045 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:54:51,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:54:51,045 INFO L85 PathProgramCache]: Analyzing trace with hash -497645109, now seen corresponding path program 34 times [2022-04-15 06:54:51,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:54:51,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [971843156] [2022-04-15 06:54:51,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:55,305 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:54:55,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:54:55,424 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:54:55,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1512808993, now seen corresponding path program 1 times [2022-04-15 06:54:55,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:54:55,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155462521] [2022-04-15 06:54:55,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:55,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:54:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:56,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:54:56,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:56,070 INFO L290 TraceCheckUtils]: 0: Hoare triple {39012#(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(17, 2);call #Ultimate.allocInit(12, 3); {38972#true} is VALID [2022-04-15 06:54:56,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {38972#true} assume true; {38972#true} is VALID [2022-04-15 06:54:56,070 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38972#true} {38972#true} #52#return; {38972#true} is VALID [2022-04-15 06:54:56,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {38972#true} call ULTIMATE.init(); {39012#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:54:56,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {39012#(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(17, 2);call #Ultimate.allocInit(12, 3); {38972#true} is VALID [2022-04-15 06:54:56,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {38972#true} assume true; {38972#true} is VALID [2022-04-15 06:54:56,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38972#true} {38972#true} #52#return; {38972#true} is VALID [2022-04-15 06:54:56,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {38972#true} call #t~ret9 := main(); {38972#true} is VALID [2022-04-15 06:54:56,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {38972#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {38977#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:56,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {38977#(<= 500000 main_~y~0)} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_214| |v_main_#t~post4_213|))) (or (and .cse0 (= v_main_~x~0_2110 v_main_~x~0_2109)) (and (< v_main_~x~0_2110 v_main_~x~0_2109) (< v_main_~x~0_2109 500001)) (and (not (< v_main_~x~0_2110 500000)) .cse0 (= v_main_~x~0_2109 v_main_~x~0_2110)))) InVars {main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} OutVars{main_~x~0=v_main_~x~0_2109, main_#t~post4=|v_main_#t~post4_213|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {38977#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:56,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {38977#(<= 500000 main_~y~0)} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38977#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:56,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {38977#(<= 500000 main_~y~0)} [194] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse2 (= v_main_~x~0_2112 v_main_~x~0_2111)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (<= 500000 v_main_~x~0_2112))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_2112 1000000))) .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_2112 v_main_~y~0_2386) (+ v_main_~x~0_2111 v_main_~y~0_2387)) (< v_main_~x~0_2112 v_main_~x~0_2111) (< v_main_~x~0_2111 1000001)))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2112, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2386, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2111, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38977#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:56,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {38977#(<= 500000 main_~y~0)} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {38977#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:54:56,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {38977#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38978#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:54:56,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {38978#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38979#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:54:56,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {38979#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38980#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:54:56,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {38980#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38981#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:54:56,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {38981#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38982#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:54:56,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {38982#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38983#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:54:56,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {38983#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38984#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:54:56,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {38984#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38985#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:54:56,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {38985#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38986#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:54:56,085 INFO L290 TraceCheckUtils]: 19: Hoare triple {38986#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38987#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:54:56,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {38987#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38988#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:54:56,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {38988#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38989#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:54:56,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {38989#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38990#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:54:56,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {38990#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38991#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:54:56,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {38991#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38992#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:54:56,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {38992#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38993#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:54:56,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {38993#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38994#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:54:56,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {38994#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38995#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:54:56,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {38995#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38996#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:54:56,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {38996#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38997#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:54:56,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {38997#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38998#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:54:56,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {38998#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {38999#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:54:56,095 INFO L290 TraceCheckUtils]: 32: Hoare triple {38999#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39000#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:54:56,095 INFO L290 TraceCheckUtils]: 33: Hoare triple {39000#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39001#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:54:56,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {39001#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39002#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:54:56,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {39002#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39003#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:54:56,097 INFO L290 TraceCheckUtils]: 36: Hoare triple {39003#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39004#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:54:56,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {39004#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39005#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:54:56,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {39005#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39006#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:54:56,099 INFO L290 TraceCheckUtils]: 39: Hoare triple {39006#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39007#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:54:56,099 INFO L290 TraceCheckUtils]: 40: Hoare triple {39007#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39008#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:54:56,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {39008#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39009#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:54:56,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {39009#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39010#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:54:56,101 INFO L290 TraceCheckUtils]: 43: Hoare triple {39010#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39011#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:54:56,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {39011#(<= 499932 main_~y~0)} assume !(~y~0 > 0); {38973#false} is VALID [2022-04-15 06:54:56,102 INFO L272 TraceCheckUtils]: 45: Hoare triple {38973#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {38973#false} is VALID [2022-04-15 06:54:56,102 INFO L290 TraceCheckUtils]: 46: Hoare triple {38973#false} ~cond := #in~cond; {38973#false} is VALID [2022-04-15 06:54:56,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {38973#false} assume 0 == ~cond; {38973#false} is VALID [2022-04-15 06:54:56,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {38973#false} assume !false; {38973#false} is VALID [2022-04-15 06:54:56,102 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:54:56,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:54:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155462521] [2022-04-15 06:54:56,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155462521] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:54:56,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578797852] [2022-04-15 06:54:56,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:54:56,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:54:56,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:54:56,103 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:54:56,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 06:54:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:56,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:54:56,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:54:56,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:54:57,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {38972#true} call ULTIMATE.init(); {38972#true} is VALID [2022-04-15 06:54:57,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {38972#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(17, 2);call #Ultimate.allocInit(12, 3); {38972#true} is VALID [2022-04-15 06:54:57,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {38972#true} assume true; {38972#true} is VALID [2022-04-15 06:54:57,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38972#true} {38972#true} #52#return; {38972#true} is VALID [2022-04-15 06:54:57,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {38972#true} call #t~ret9 := main(); {38972#true} is VALID [2022-04-15 06:54:57,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {38972#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {39031#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:54:57,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {39031#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_214| |v_main_#t~post4_213|))) (or (and .cse0 (= v_main_~x~0_2110 v_main_~x~0_2109)) (and (< v_main_~x~0_2110 v_main_~x~0_2109) (< v_main_~x~0_2109 500001)) (and (not (< v_main_~x~0_2110 500000)) .cse0 (= v_main_~x~0_2109 v_main_~x~0_2110)))) InVars {main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} OutVars{main_~x~0=v_main_~x~0_2109, main_#t~post4=|v_main_#t~post4_213|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39035#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:57,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {39035#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39035#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:54:57,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {39035#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse2 (= v_main_~x~0_2112 v_main_~x~0_2111)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (<= 500000 v_main_~x~0_2112))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_2112 1000000))) .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_2112 v_main_~y~0_2386) (+ v_main_~x~0_2111 v_main_~y~0_2387)) (< v_main_~x~0_2112 v_main_~x~0_2111) (< v_main_~x~0_2111 1000001)))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2112, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2386, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2111, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39042#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:54:57,268 INFO L290 TraceCheckUtils]: 9: Hoare triple {39042#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {39046#(< 999999 main_~y~0)} is VALID [2022-04-15 06:54:57,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {39046#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39050#(< 999997 main_~y~0)} is VALID [2022-04-15 06:54:57,269 INFO L290 TraceCheckUtils]: 11: Hoare triple {39050#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39054#(< 999995 main_~y~0)} is VALID [2022-04-15 06:54:57,269 INFO L290 TraceCheckUtils]: 12: Hoare triple {39054#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39058#(< 999993 main_~y~0)} is VALID [2022-04-15 06:54:57,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {39058#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39062#(< 999991 main_~y~0)} is VALID [2022-04-15 06:54:57,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {39062#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39066#(< 999989 main_~y~0)} is VALID [2022-04-15 06:54:57,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {39066#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39070#(< 999987 main_~y~0)} is VALID [2022-04-15 06:54:57,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {39070#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39074#(< 999985 main_~y~0)} is VALID [2022-04-15 06:54:57,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {39074#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39078#(< 999983 main_~y~0)} is VALID [2022-04-15 06:54:57,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {39078#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39082#(< 999981 main_~y~0)} is VALID [2022-04-15 06:54:57,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {39082#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39086#(< 999979 main_~y~0)} is VALID [2022-04-15 06:54:57,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {39086#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39090#(< 999977 main_~y~0)} is VALID [2022-04-15 06:54:57,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {39090#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39094#(< 999975 main_~y~0)} is VALID [2022-04-15 06:54:57,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {39094#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39098#(< 999973 main_~y~0)} is VALID [2022-04-15 06:54:57,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {39098#(< 999973 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39102#(< 999971 main_~y~0)} is VALID [2022-04-15 06:54:57,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {39102#(< 999971 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39106#(< 999969 main_~y~0)} is VALID [2022-04-15 06:54:57,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {39106#(< 999969 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39110#(< 999967 main_~y~0)} is VALID [2022-04-15 06:54:57,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {39110#(< 999967 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39114#(< 999965 main_~y~0)} is VALID [2022-04-15 06:54:57,285 INFO L290 TraceCheckUtils]: 27: Hoare triple {39114#(< 999965 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39118#(< 999963 main_~y~0)} is VALID [2022-04-15 06:54:57,285 INFO L290 TraceCheckUtils]: 28: Hoare triple {39118#(< 999963 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39122#(< 999961 main_~y~0)} is VALID [2022-04-15 06:54:57,286 INFO L290 TraceCheckUtils]: 29: Hoare triple {39122#(< 999961 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39126#(< 999959 main_~y~0)} is VALID [2022-04-15 06:54:57,286 INFO L290 TraceCheckUtils]: 30: Hoare triple {39126#(< 999959 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39130#(< 999957 main_~y~0)} is VALID [2022-04-15 06:54:57,287 INFO L290 TraceCheckUtils]: 31: Hoare triple {39130#(< 999957 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39134#(< 999955 main_~y~0)} is VALID [2022-04-15 06:54:57,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {39134#(< 999955 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39138#(< 999953 main_~y~0)} is VALID [2022-04-15 06:54:57,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {39138#(< 999953 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39142#(< 999951 main_~y~0)} is VALID [2022-04-15 06:54:57,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {39142#(< 999951 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39146#(< 999949 main_~y~0)} is VALID [2022-04-15 06:54:57,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {39146#(< 999949 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39150#(< 999947 main_~y~0)} is VALID [2022-04-15 06:54:57,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {39150#(< 999947 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39154#(< 999945 main_~y~0)} is VALID [2022-04-15 06:54:57,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {39154#(< 999945 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39158#(< 999943 main_~y~0)} is VALID [2022-04-15 06:54:57,291 INFO L290 TraceCheckUtils]: 38: Hoare triple {39158#(< 999943 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39162#(< 999941 main_~y~0)} is VALID [2022-04-15 06:54:57,291 INFO L290 TraceCheckUtils]: 39: Hoare triple {39162#(< 999941 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39166#(< 999939 main_~y~0)} is VALID [2022-04-15 06:54:57,292 INFO L290 TraceCheckUtils]: 40: Hoare triple {39166#(< 999939 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39170#(< 999937 main_~y~0)} is VALID [2022-04-15 06:54:57,292 INFO L290 TraceCheckUtils]: 41: Hoare triple {39170#(< 999937 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39174#(< 999935 main_~y~0)} is VALID [2022-04-15 06:54:57,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {39174#(< 999935 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39178#(< 999933 main_~y~0)} is VALID [2022-04-15 06:54:57,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {39178#(< 999933 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39182#(< 999931 main_~y~0)} is VALID [2022-04-15 06:54:57,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {39182#(< 999931 main_~y~0)} assume !(~y~0 > 0); {38973#false} is VALID [2022-04-15 06:54:57,294 INFO L272 TraceCheckUtils]: 45: Hoare triple {38973#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {38973#false} is VALID [2022-04-15 06:54:57,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {38973#false} ~cond := #in~cond; {38973#false} is VALID [2022-04-15 06:54:57,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {38973#false} assume 0 == ~cond; {38973#false} is VALID [2022-04-15 06:54:57,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {38973#false} assume !false; {38973#false} is VALID [2022-04-15 06:54:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:54:57,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:54:59,354 INFO L290 TraceCheckUtils]: 48: Hoare triple {38973#false} assume !false; {38973#false} is VALID [2022-04-15 06:54:59,354 INFO L290 TraceCheckUtils]: 47: Hoare triple {38973#false} assume 0 == ~cond; {38973#false} is VALID [2022-04-15 06:54:59,354 INFO L290 TraceCheckUtils]: 46: Hoare triple {38973#false} ~cond := #in~cond; {38973#false} is VALID [2022-04-15 06:54:59,354 INFO L272 TraceCheckUtils]: 45: Hoare triple {38973#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {38973#false} is VALID [2022-04-15 06:54:59,363 INFO L290 TraceCheckUtils]: 44: Hoare triple {39210#(< 0 main_~y~0)} assume !(~y~0 > 0); {38973#false} is VALID [2022-04-15 06:54:59,364 INFO L290 TraceCheckUtils]: 43: Hoare triple {39214#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39210#(< 0 main_~y~0)} is VALID [2022-04-15 06:54:59,364 INFO L290 TraceCheckUtils]: 42: Hoare triple {39218#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39214#(< 2 main_~y~0)} is VALID [2022-04-15 06:54:59,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {39222#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39218#(< 4 main_~y~0)} is VALID [2022-04-15 06:54:59,365 INFO L290 TraceCheckUtils]: 40: Hoare triple {39226#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39222#(< 6 main_~y~0)} is VALID [2022-04-15 06:54:59,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {39230#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39226#(< 8 main_~y~0)} is VALID [2022-04-15 06:54:59,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {39234#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39230#(< 10 main_~y~0)} is VALID [2022-04-15 06:54:59,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {39238#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39234#(< 12 main_~y~0)} is VALID [2022-04-15 06:54:59,367 INFO L290 TraceCheckUtils]: 36: Hoare triple {39242#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39238#(< 14 main_~y~0)} is VALID [2022-04-15 06:54:59,367 INFO L290 TraceCheckUtils]: 35: Hoare triple {39246#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39242#(< 16 main_~y~0)} is VALID [2022-04-15 06:54:59,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {39250#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39246#(< 18 main_~y~0)} is VALID [2022-04-15 06:54:59,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {39254#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39250#(< 20 main_~y~0)} is VALID [2022-04-15 06:54:59,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {39258#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39254#(< 22 main_~y~0)} is VALID [2022-04-15 06:54:59,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {39262#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39258#(< 24 main_~y~0)} is VALID [2022-04-15 06:54:59,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {39266#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39262#(< 26 main_~y~0)} is VALID [2022-04-15 06:54:59,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {39270#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39266#(< 28 main_~y~0)} is VALID [2022-04-15 06:54:59,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {39274#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39270#(< 30 main_~y~0)} is VALID [2022-04-15 06:54:59,371 INFO L290 TraceCheckUtils]: 27: Hoare triple {39278#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39274#(< 32 main_~y~0)} is VALID [2022-04-15 06:54:59,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {39282#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39278#(< 34 main_~y~0)} is VALID [2022-04-15 06:54:59,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {39286#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39282#(< 36 main_~y~0)} is VALID [2022-04-15 06:54:59,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {39290#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39286#(< 38 main_~y~0)} is VALID [2022-04-15 06:54:59,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {39294#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39290#(< 40 main_~y~0)} is VALID [2022-04-15 06:54:59,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {39298#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39294#(< 42 main_~y~0)} is VALID [2022-04-15 06:54:59,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {39302#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39298#(< 44 main_~y~0)} is VALID [2022-04-15 06:54:59,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {39306#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39302#(< 46 main_~y~0)} is VALID [2022-04-15 06:54:59,375 INFO L290 TraceCheckUtils]: 19: Hoare triple {39310#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39306#(< 48 main_~y~0)} is VALID [2022-04-15 06:54:59,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {39314#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39310#(< 50 main_~y~0)} is VALID [2022-04-15 06:54:59,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {39318#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39314#(< 52 main_~y~0)} is VALID [2022-04-15 06:54:59,377 INFO L290 TraceCheckUtils]: 16: Hoare triple {39322#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39318#(< 54 main_~y~0)} is VALID [2022-04-15 06:54:59,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {39326#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39322#(< 56 main_~y~0)} is VALID [2022-04-15 06:54:59,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {39330#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39326#(< 58 main_~y~0)} is VALID [2022-04-15 06:54:59,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {39334#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39330#(< 60 main_~y~0)} is VALID [2022-04-15 06:54:59,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {39338#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39334#(< 62 main_~y~0)} is VALID [2022-04-15 06:54:59,379 INFO L290 TraceCheckUtils]: 11: Hoare triple {39342#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39338#(< 64 main_~y~0)} is VALID [2022-04-15 06:54:59,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {39346#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {39342#(< 66 main_~y~0)} is VALID [2022-04-15 06:54:59,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {39350#(or (< 68 main_~y~0) (< main_~x~0 1000000))} [191] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {39346#(< 68 main_~y~0)} is VALID [2022-04-15 06:54:59,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {39354#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 500000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} [194] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse1 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse2 (= v_main_~x~0_2112 v_main_~x~0_2111)) (.cse3 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse4 (<= 500000 v_main_~x~0_2112))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (or (not .cse4) (not (< v_main_~x~0_2112 1000000))) .cse2 .cse3) (and .cse4 (= (+ v_main_~x~0_2112 v_main_~y~0_2386) (+ v_main_~x~0_2111 v_main_~y~0_2387)) (< v_main_~x~0_2112 v_main_~x~0_2111) (< v_main_~x~0_2111 1000001)))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2112, main_#t~post6=|v_main_#t~post6_235|} OutVars{main_~y~0=v_main_~y~0_2386, main_#t~post5=|v_main_#t~post5_234|, main_~x~0=v_main_~x~0_2111, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39350#(or (< 68 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-15 06:54:59,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {39354#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 500000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} [193] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39354#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 500000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-15 06:54:59,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {39361#(and (or (< 68 main_~y~0) (< main_~x~0 1000000)) (or (<= 68 main_~y~0) (and (< main_~x~0 (+ main_~y~0 999932)) (<= 0 (+ 499931 main_~y~0)))))} [192] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_214| |v_main_#t~post4_213|))) (or (and .cse0 (= v_main_~x~0_2110 v_main_~x~0_2109)) (and (< v_main_~x~0_2110 v_main_~x~0_2109) (< v_main_~x~0_2109 500001)) (and (not (< v_main_~x~0_2110 500000)) .cse0 (= v_main_~x~0_2109 v_main_~x~0_2110)))) InVars {main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} OutVars{main_~x~0=v_main_~x~0_2109, main_#t~post4=|v_main_#t~post4_213|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39354#(and (or (< main_~x~0 (+ main_~y~0 999932)) (<= 68 main_~y~0) (not (<= 500000 main_~x~0))) (or (< 68 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-15 06:54:59,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {38972#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {39361#(and (or (< 68 main_~y~0) (< main_~x~0 1000000)) (or (<= 68 main_~y~0) (and (< main_~x~0 (+ main_~y~0 999932)) (<= 0 (+ 499931 main_~y~0)))))} is VALID [2022-04-15 06:54:59,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {38972#true} call #t~ret9 := main(); {38972#true} is VALID [2022-04-15 06:54:59,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38972#true} {38972#true} #52#return; {38972#true} is VALID [2022-04-15 06:54:59,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {38972#true} assume true; {38972#true} is VALID [2022-04-15 06:54:59,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {38972#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(17, 2);call #Ultimate.allocInit(12, 3); {38972#true} is VALID [2022-04-15 06:54:59,383 INFO L272 TraceCheckUtils]: 0: Hoare triple {38972#true} call ULTIMATE.init(); {38972#true} is VALID [2022-04-15 06:54:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:54:59,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578797852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:54:59,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:54:59,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40, 40] total 114 [2022-04-15 06:55:03,217 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:03,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [971843156] [2022-04-15 06:55:03,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [971843156] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:03,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:03,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2022-04-15 06:55:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59722942] [2022-04-15 06:55:03,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:03,218 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 170 [2022-04-15 06:55:03,219 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:03,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 06:55:03,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:03,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-04-15 06:55:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:03,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-04-15 06:55:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10897, Invalid=19903, Unknown=0, NotChecked=0, Total=30800 [2022-04-15 06:55:03,352 INFO L87 Difference]: Start difference. First operand 171 states and 174 transitions. Second operand has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 06:55:20,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:20,015 INFO L93 Difference]: Finished difference Result 339 states and 350 transitions. [2022-04-15 06:55:20,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-15 06:55:20,015 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 170 [2022-04-15 06:55:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 06:55:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 192 transitions. [2022-04-15 06:55:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 06:55:20,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 192 transitions. [2022-04-15 06:55:20,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 192 transitions. [2022-04-15 06:55:20,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:20,183 INFO L225 Difference]: With dead ends: 339 [2022-04-15 06:55:20,183 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 06:55:20,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25463 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=20799, Invalid=54003, Unknown=0, NotChecked=0, Total=74802 [2022-04-15 06:55:20,188 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 202 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7916 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 8220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 7916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:20,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 54 Invalid, 8220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 7916 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-04-15 06:55:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 06:55:20,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-04-15 06:55:20,470 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:20,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 06:55:20,470 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 06:55:20,470 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 06:55:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:20,472 INFO L93 Difference]: Finished difference Result 176 states and 179 transitions. [2022-04-15 06:55:20,472 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2022-04-15 06:55:20,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:20,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:20,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 176 states. [2022-04-15 06:55:20,472 INFO L87 Difference]: Start difference. First operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 176 states. [2022-04-15 06:55:20,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:20,474 INFO L93 Difference]: Finished difference Result 176 states and 179 transitions. [2022-04-15 06:55:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2022-04-15 06:55:20,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:20,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:20,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:20,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:20,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 171 states have (on average 1.023391812865497) internal successors, (175), 171 states have internal predecessors, (175), 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 06:55:20,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 179 transitions. [2022-04-15 06:55:20,477 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 179 transitions. Word has length 170 [2022-04-15 06:55:20,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:20,478 INFO L478 AbstractCegarLoop]: Abstraction has 176 states and 179 transitions. [2022-04-15 06:55:20,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 1.6435643564356435) internal successors, (166), 100 states have internal predecessors, (166), 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 06:55:20,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 176 states and 179 transitions. [2022-04-15 06:55:20,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 179 transitions. [2022-04-15 06:55:20,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 06:55:20,627 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:20,627 INFO L499 BasicCegarLoop]: trace histogram [64, 63, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:20,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 06:55:20,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 06:55:20,831 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:20,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2049932562, now seen corresponding path program 35 times [2022-04-15 06:55:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1973731252] [2022-04-15 06:55:20,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:25,085 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:55:25,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:25,210 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -567032222, now seen corresponding path program 1 times [2022-04-15 06:55:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:25,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249048621] [2022-04-15 06:55:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:25,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:25,970 INFO L290 TraceCheckUtils]: 0: Hoare triple {41063#(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(17, 2);call #Ultimate.allocInit(12, 3); {41022#true} is VALID [2022-04-15 06:55:25,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {41022#true} assume true; {41022#true} is VALID [2022-04-15 06:55:25,970 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41022#true} {41022#true} #52#return; {41022#true} is VALID [2022-04-15 06:55:25,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {41022#true} call ULTIMATE.init(); {41063#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:25,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {41063#(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(17, 2);call #Ultimate.allocInit(12, 3); {41022#true} is VALID [2022-04-15 06:55:25,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {41022#true} assume true; {41022#true} is VALID [2022-04-15 06:55:25,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41022#true} {41022#true} #52#return; {41022#true} is VALID [2022-04-15 06:55:25,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {41022#true} call #t~ret9 := main(); {41022#true} is VALID [2022-04-15 06:55:25,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {41022#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:25,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {41027#(<= 500000 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_221| |v_main_#t~post4_220|)) (.cse1 (= v_main_~x~0_2223 v_main_~x~0_2222))) (or (and (< v_main_~x~0_2222 500001) (< v_main_~x~0_2223 v_main_~x~0_2222)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2223)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} OutVars{main_~x~0=v_main_~x~0_2222, main_#t~post4=|v_main_#t~post4_220|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:25,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {41027#(<= 500000 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:25,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {41027#(<= 500000 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2225)) (.cse2 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse3 (= v_main_~x~0_2225 v_main_~x~0_2224)) (.cse4 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse5 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (let ((.cse1 (+ v_main_~x~0_2225 v_main_~y~0_2524))) (and .cse0 (< v_main_~y~0_2525 v_main_~y~0_2524) (= .cse1 (+ v_main_~x~0_2224 v_main_~y~0_2525)) (< .cse1 (+ 1000001 v_main_~y~0_2525)))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_2225 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2225, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2524, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2224, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:25,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {41027#(<= 500000 main_~y~0)} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:25,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {41027#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41028#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:55:25,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {41028#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41029#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:55:25,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {41029#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41030#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:55:25,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {41030#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41031#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:55:25,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {41031#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41032#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:55:25,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {41032#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41033#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:55:25,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {41033#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41034#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:55:25,977 INFO L290 TraceCheckUtils]: 17: Hoare triple {41034#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41035#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:55:25,977 INFO L290 TraceCheckUtils]: 18: Hoare triple {41035#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41036#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:55:25,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {41036#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41037#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:55:25,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {41037#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41038#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:55:25,979 INFO L290 TraceCheckUtils]: 21: Hoare triple {41038#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41039#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:55:25,979 INFO L290 TraceCheckUtils]: 22: Hoare triple {41039#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41040#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:55:25,980 INFO L290 TraceCheckUtils]: 23: Hoare triple {41040#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41041#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:55:25,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {41041#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41042#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:55:25,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {41042#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41043#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:55:25,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {41043#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41044#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:55:25,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {41044#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41045#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:55:25,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {41045#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41046#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:55:25,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {41046#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41047#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:55:25,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {41047#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41048#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:55:25,984 INFO L290 TraceCheckUtils]: 31: Hoare triple {41048#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41049#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:55:25,984 INFO L290 TraceCheckUtils]: 32: Hoare triple {41049#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41050#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:55:25,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {41050#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41051#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:55:25,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {41051#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41052#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:55:25,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {41052#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41053#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:55:25,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {41053#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41054#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:55:25,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {41054#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41055#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:55:25,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {41055#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41056#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:55:25,988 INFO L290 TraceCheckUtils]: 39: Hoare triple {41056#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41057#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:55:25,988 INFO L290 TraceCheckUtils]: 40: Hoare triple {41057#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41058#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:55:25,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {41058#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41059#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:55:25,989 INFO L290 TraceCheckUtils]: 42: Hoare triple {41059#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41060#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:55:25,989 INFO L290 TraceCheckUtils]: 43: Hoare triple {41060#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41061#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:55:25,990 INFO L290 TraceCheckUtils]: 44: Hoare triple {41061#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41062#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:55:25,990 INFO L290 TraceCheckUtils]: 45: Hoare triple {41062#(<= 499930 main_~y~0)} assume !(~y~0 > 0); {41023#false} is VALID [2022-04-15 06:55:25,990 INFO L272 TraceCheckUtils]: 46: Hoare triple {41023#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41023#false} is VALID [2022-04-15 06:55:25,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {41023#false} ~cond := #in~cond; {41023#false} is VALID [2022-04-15 06:55:25,991 INFO L290 TraceCheckUtils]: 48: Hoare triple {41023#false} assume 0 == ~cond; {41023#false} is VALID [2022-04-15 06:55:25,991 INFO L290 TraceCheckUtils]: 49: Hoare triple {41023#false} assume !false; {41023#false} is VALID [2022-04-15 06:55:25,991 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:25,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:25,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249048621] [2022-04-15 06:55:25,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249048621] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:25,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [309832890] [2022-04-15 06:55:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:25,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:25,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:25,992 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:25,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 06:55:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 06:55:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:26,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:26,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {41022#true} call ULTIMATE.init(); {41022#true} is VALID [2022-04-15 06:55:26,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {41022#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(17, 2);call #Ultimate.allocInit(12, 3); {41022#true} is VALID [2022-04-15 06:55:26,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {41022#true} assume true; {41022#true} is VALID [2022-04-15 06:55:26,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41022#true} {41022#true} #52#return; {41022#true} is VALID [2022-04-15 06:55:26,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {41022#true} call #t~ret9 := main(); {41022#true} is VALID [2022-04-15 06:55:26,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {41022#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:26,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {41027#(<= 500000 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_221| |v_main_#t~post4_220|)) (.cse1 (= v_main_~x~0_2223 v_main_~x~0_2222))) (or (and (< v_main_~x~0_2222 500001) (< v_main_~x~0_2223 v_main_~x~0_2222)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2223)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} OutVars{main_~x~0=v_main_~x~0_2222, main_#t~post4=|v_main_#t~post4_220|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:26,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {41027#(<= 500000 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:26,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {41027#(<= 500000 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2225)) (.cse2 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse3 (= v_main_~x~0_2225 v_main_~x~0_2224)) (.cse4 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse5 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (let ((.cse1 (+ v_main_~x~0_2225 v_main_~y~0_2524))) (and .cse0 (< v_main_~y~0_2525 v_main_~y~0_2524) (= .cse1 (+ v_main_~x~0_2224 v_main_~y~0_2525)) (< .cse1 (+ 1000001 v_main_~y~0_2525)))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_2225 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2225, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2524, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2224, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:26,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {41027#(<= 500000 main_~y~0)} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41027#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:26,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {41027#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41028#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:55:26,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {41028#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41029#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:55:26,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {41029#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41030#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:55:26,566 INFO L290 TraceCheckUtils]: 13: Hoare triple {41030#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41031#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:55:26,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {41031#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41032#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:55:26,567 INFO L290 TraceCheckUtils]: 15: Hoare triple {41032#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41033#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:55:26,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {41033#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41034#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:55:26,568 INFO L290 TraceCheckUtils]: 17: Hoare triple {41034#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41035#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:55:26,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {41035#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41036#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:55:26,569 INFO L290 TraceCheckUtils]: 19: Hoare triple {41036#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41037#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:55:26,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {41037#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41038#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:55:26,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {41038#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41039#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:55:26,570 INFO L290 TraceCheckUtils]: 22: Hoare triple {41039#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41040#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:55:26,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {41040#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41041#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:55:26,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {41041#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41042#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:55:26,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {41042#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41043#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:55:26,572 INFO L290 TraceCheckUtils]: 26: Hoare triple {41043#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41044#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:55:26,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {41044#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41045#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:55:26,573 INFO L290 TraceCheckUtils]: 28: Hoare triple {41045#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41046#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:55:26,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {41046#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41047#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:55:26,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {41047#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41048#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:55:26,574 INFO L290 TraceCheckUtils]: 31: Hoare triple {41048#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41049#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:55:26,575 INFO L290 TraceCheckUtils]: 32: Hoare triple {41049#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41050#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:55:26,575 INFO L290 TraceCheckUtils]: 33: Hoare triple {41050#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41051#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:55:26,576 INFO L290 TraceCheckUtils]: 34: Hoare triple {41051#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41052#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:55:26,576 INFO L290 TraceCheckUtils]: 35: Hoare triple {41052#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41053#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:55:26,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {41053#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41054#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:55:26,577 INFO L290 TraceCheckUtils]: 37: Hoare triple {41054#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41055#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:55:26,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {41055#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41056#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:55:26,578 INFO L290 TraceCheckUtils]: 39: Hoare triple {41056#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41057#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:55:26,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {41057#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41058#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:55:26,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {41058#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41059#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:55:26,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {41059#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41060#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:55:26,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {41060#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41061#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:55:26,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {41061#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41062#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:55:26,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {41062#(<= 499930 main_~y~0)} assume !(~y~0 > 0); {41023#false} is VALID [2022-04-15 06:55:26,581 INFO L272 TraceCheckUtils]: 46: Hoare triple {41023#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41023#false} is VALID [2022-04-15 06:55:26,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {41023#false} ~cond := #in~cond; {41023#false} is VALID [2022-04-15 06:55:26,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {41023#false} assume 0 == ~cond; {41023#false} is VALID [2022-04-15 06:55:26,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {41023#false} assume !false; {41023#false} is VALID [2022-04-15 06:55:26,582 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:26,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:28,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {41023#false} assume !false; {41023#false} is VALID [2022-04-15 06:55:28,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {41023#false} assume 0 == ~cond; {41023#false} is VALID [2022-04-15 06:55:28,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {41023#false} ~cond := #in~cond; {41023#false} is VALID [2022-04-15 06:55:28,374 INFO L272 TraceCheckUtils]: 46: Hoare triple {41023#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {41023#false} is VALID [2022-04-15 06:55:28,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {41226#(< 0 main_~y~0)} assume !(~y~0 > 0); {41023#false} is VALID [2022-04-15 06:55:28,375 INFO L290 TraceCheckUtils]: 44: Hoare triple {41230#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41226#(< 0 main_~y~0)} is VALID [2022-04-15 06:55:28,375 INFO L290 TraceCheckUtils]: 43: Hoare triple {41234#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41230#(< 2 main_~y~0)} is VALID [2022-04-15 06:55:28,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {41238#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41234#(< 4 main_~y~0)} is VALID [2022-04-15 06:55:28,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {41242#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41238#(< 6 main_~y~0)} is VALID [2022-04-15 06:55:28,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {41246#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41242#(< 8 main_~y~0)} is VALID [2022-04-15 06:55:28,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {41250#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41246#(< 10 main_~y~0)} is VALID [2022-04-15 06:55:28,378 INFO L290 TraceCheckUtils]: 38: Hoare triple {41254#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41250#(< 12 main_~y~0)} is VALID [2022-04-15 06:55:28,378 INFO L290 TraceCheckUtils]: 37: Hoare triple {41258#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41254#(< 14 main_~y~0)} is VALID [2022-04-15 06:55:28,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {41262#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41258#(< 16 main_~y~0)} is VALID [2022-04-15 06:55:28,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {41266#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41262#(< 18 main_~y~0)} is VALID [2022-04-15 06:55:28,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {41270#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41266#(< 20 main_~y~0)} is VALID [2022-04-15 06:55:28,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {41274#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41270#(< 22 main_~y~0)} is VALID [2022-04-15 06:55:28,381 INFO L290 TraceCheckUtils]: 32: Hoare triple {41278#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41274#(< 24 main_~y~0)} is VALID [2022-04-15 06:55:28,381 INFO L290 TraceCheckUtils]: 31: Hoare triple {41282#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41278#(< 26 main_~y~0)} is VALID [2022-04-15 06:55:28,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {41286#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41282#(< 28 main_~y~0)} is VALID [2022-04-15 06:55:28,382 INFO L290 TraceCheckUtils]: 29: Hoare triple {41290#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41286#(< 30 main_~y~0)} is VALID [2022-04-15 06:55:28,383 INFO L290 TraceCheckUtils]: 28: Hoare triple {41294#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41290#(< 32 main_~y~0)} is VALID [2022-04-15 06:55:28,383 INFO L290 TraceCheckUtils]: 27: Hoare triple {41298#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41294#(< 34 main_~y~0)} is VALID [2022-04-15 06:55:28,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {41302#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41298#(< 36 main_~y~0)} is VALID [2022-04-15 06:55:28,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {41306#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41302#(< 38 main_~y~0)} is VALID [2022-04-15 06:55:28,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {41310#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41306#(< 40 main_~y~0)} is VALID [2022-04-15 06:55:28,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {41314#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41310#(< 42 main_~y~0)} is VALID [2022-04-15 06:55:28,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {41318#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41314#(< 44 main_~y~0)} is VALID [2022-04-15 06:55:28,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {41322#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41318#(< 46 main_~y~0)} is VALID [2022-04-15 06:55:28,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {41326#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41322#(< 48 main_~y~0)} is VALID [2022-04-15 06:55:28,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {41330#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41326#(< 50 main_~y~0)} is VALID [2022-04-15 06:55:28,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {41334#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41330#(< 52 main_~y~0)} is VALID [2022-04-15 06:55:28,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {41338#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41334#(< 54 main_~y~0)} is VALID [2022-04-15 06:55:28,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {41342#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41338#(< 56 main_~y~0)} is VALID [2022-04-15 06:55:28,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {41346#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41342#(< 58 main_~y~0)} is VALID [2022-04-15 06:55:28,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {41350#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41346#(< 60 main_~y~0)} is VALID [2022-04-15 06:55:28,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {41354#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41350#(< 62 main_~y~0)} is VALID [2022-04-15 06:55:28,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {41358#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41354#(< 64 main_~y~0)} is VALID [2022-04-15 06:55:28,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {41362#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41358#(< 66 main_~y~0)} is VALID [2022-04-15 06:55:28,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {41366#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {41362#(< 68 main_~y~0)} is VALID [2022-04-15 06:55:28,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {41366#(< 70 main_~y~0)} [195] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {41366#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:28,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {41366#(< 70 main_~y~0)} [198] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2225)) (.cse2 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse3 (= v_main_~x~0_2225 v_main_~x~0_2224)) (.cse4 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse5 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (let ((.cse1 (+ v_main_~x~0_2225 v_main_~y~0_2524))) (and .cse0 (< v_main_~y~0_2525 v_main_~y~0_2524) (= .cse1 (+ v_main_~x~0_2224 v_main_~y~0_2525)) (< .cse1 (+ 1000001 v_main_~y~0_2525)))) (and .cse2 .cse3 .cse4 .cse5 (or (not .cse0) (not (< v_main_~x~0_2225 1000000)))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2225, main_#t~post6=|v_main_#t~post6_242|} OutVars{main_~y~0=v_main_~y~0_2524, main_#t~post5=|v_main_#t~post5_241|, main_~x~0=v_main_~x~0_2224, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41366#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:28,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {41366#(< 70 main_~y~0)} [197] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41366#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:28,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {41366#(< 70 main_~y~0)} [196] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_221| |v_main_#t~post4_220|)) (.cse1 (= v_main_~x~0_2223 v_main_~x~0_2222))) (or (and (< v_main_~x~0_2222 500001) (< v_main_~x~0_2223 v_main_~x~0_2222)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2223)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} OutVars{main_~x~0=v_main_~x~0_2222, main_#t~post4=|v_main_#t~post4_220|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41366#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:28,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {41022#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {41366#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:28,393 INFO L272 TraceCheckUtils]: 4: Hoare triple {41022#true} call #t~ret9 := main(); {41022#true} is VALID [2022-04-15 06:55:28,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41022#true} {41022#true} #52#return; {41022#true} is VALID [2022-04-15 06:55:28,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {41022#true} assume true; {41022#true} is VALID [2022-04-15 06:55:28,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {41022#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(17, 2);call #Ultimate.allocInit(12, 3); {41022#true} is VALID [2022-04-15 06:55:28,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {41022#true} call ULTIMATE.init(); {41022#true} is VALID [2022-04-15 06:55:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [309832890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:28,394 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 75 [2022-04-15 06:55:31,457 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:31,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1973731252] [2022-04-15 06:55:31,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1973731252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:31,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:31,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2022-04-15 06:55:31,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017998740] [2022-04-15 06:55:31,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:31,458 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 175 [2022-04-15 06:55:31,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:31,459 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 06:55:31,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:31,585 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-04-15 06:55:31,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:31,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-04-15 06:55:31,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7577, Invalid=11883, Unknown=0, NotChecked=0, Total=19460 [2022-04-15 06:55:31,588 INFO L87 Difference]: Start difference. First operand 176 states and 179 transitions. Second operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 06:55:48,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:48,673 INFO L93 Difference]: Finished difference Result 349 states and 360 transitions. [2022-04-15 06:55:48,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-04-15 06:55:48,673 INFO L78 Accepts]: Start accepts. Automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 175 [2022-04-15 06:55:48,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:55:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 06:55:48,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 197 transitions. [2022-04-15 06:55:48,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 06:55:48,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 197 transitions. [2022-04-15 06:55:48,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 197 transitions. [2022-04-15 06:55:48,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:48,840 INFO L225 Difference]: With dead ends: 349 [2022-04-15 06:55:48,840 INFO L226 Difference]: Without dead ends: 181 [2022-04-15 06:55:48,843 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 133 SyntacticMatches, 2 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16867 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=17685, Invalid=40155, Unknown=0, NotChecked=0, Total=57840 [2022-04-15 06:55:48,844 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 606 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 8414 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 606 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 8934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 8414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:55:48,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [606 Valid, 29 Invalid, 8934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 8414 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2022-04-15 06:55:48,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-04-15 06:55:49,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-04-15 06:55:49,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:55:49,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 06:55:49,127 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 06:55:49,128 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 06:55:49,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:49,129 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2022-04-15 06:55:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2022-04-15 06:55:49,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:49,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:49,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 181 states. [2022-04-15 06:55:49,130 INFO L87 Difference]: Start difference. First operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 181 states. [2022-04-15 06:55:49,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:55:49,131 INFO L93 Difference]: Finished difference Result 181 states and 184 transitions. [2022-04-15 06:55:49,131 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2022-04-15 06:55:49,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:55:49,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:55:49,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:55:49,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:55:49,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 176 states have (on average 1.0227272727272727) internal successors, (180), 176 states have internal predecessors, (180), 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 06:55:49,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 184 transitions. [2022-04-15 06:55:49,135 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 184 transitions. Word has length 175 [2022-04-15 06:55:49,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:55:49,135 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 184 transitions. [2022-04-15 06:55:49,135 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 104 states, 104 states have (on average 1.6442307692307692) internal successors, (171), 103 states have internal predecessors, (171), 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 06:55:49,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 184 transitions. [2022-04-15 06:55:49,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:49,285 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 184 transitions. [2022-04-15 06:55:49,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-15 06:55:49,285 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:55:49,285 INFO L499 BasicCegarLoop]: trace histogram [66, 65, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:55:49,301 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 06:55:49,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 06:55:49,486 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:55:49,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:55:49,486 INFO L85 PathProgramCache]: Analyzing trace with hash 777000959, now seen corresponding path program 36 times [2022-04-15 06:55:49,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:49,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1126952880] [2022-04-15 06:55:49,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:49,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:55:49,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:55:49,858 INFO L85 PathProgramCache]: Analyzing trace with hash 322078785, now seen corresponding path program 1 times [2022-04-15 06:55:49,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:55:49,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911463096] [2022-04-15 06:55:49,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:49,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:55:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:50,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:55:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:50,699 INFO L290 TraceCheckUtils]: 0: Hoare triple {43130#(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(17, 2);call #Ultimate.allocInit(12, 3); {43088#true} is VALID [2022-04-15 06:55:50,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {43088#true} assume true; {43088#true} is VALID [2022-04-15 06:55:50,699 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43088#true} {43088#true} #52#return; {43088#true} is VALID [2022-04-15 06:55:50,700 INFO L272 TraceCheckUtils]: 0: Hoare triple {43088#true} call ULTIMATE.init(); {43130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:55:50,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {43130#(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(17, 2);call #Ultimate.allocInit(12, 3); {43088#true} is VALID [2022-04-15 06:55:50,700 INFO L290 TraceCheckUtils]: 2: Hoare triple {43088#true} assume true; {43088#true} is VALID [2022-04-15 06:55:50,700 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43088#true} {43088#true} #52#return; {43088#true} is VALID [2022-04-15 06:55:50,700 INFO L272 TraceCheckUtils]: 4: Hoare triple {43088#true} call #t~ret9 := main(); {43088#true} is VALID [2022-04-15 06:55:50,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {43088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {43093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:50,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {43093#(<= 500000 main_~y~0)} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_227| |v_main_#t~post4_226|)) (.cse1 (= v_main_~x~0_2338 v_main_~x~0_2337))) (or (and .cse0 (not (< v_main_~x~0_2338 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2338 v_main_~x~0_2337) (< v_main_~x~0_2337 500001)))) InVars {main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} OutVars{main_~x~0=v_main_~x~0_2337, main_#t~post4=|v_main_#t~post4_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:50,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {43093#(<= 500000 main_~y~0)} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:50,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {43093#(<= 500000 main_~y~0)} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse2 (= v_main_~y~0_2667 v_main_~y~0_2666)) (.cse3 (= v_main_~x~0_2340 v_main_~x~0_2339)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|)) (.cse0 (<= 500000 v_main_~x~0_2340))) (or (and (or (not (< v_main_~x~0_2340 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2340 v_main_~x~0_2339) .cse0 (< v_main_~x~0_2339 1000001) (= (+ v_main_~x~0_2340 v_main_~y~0_2666) (+ v_main_~x~0_2339 v_main_~y~0_2667))))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2340, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2666, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2339, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:50,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {43093#(<= 500000 main_~y~0)} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {43093#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:55:50,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {43093#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43094#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:55:50,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {43094#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43095#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:55:50,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {43095#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43096#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:55:50,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {43096#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43097#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:55:50,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {43097#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43098#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:55:50,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {43098#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43099#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:55:50,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {43099#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43100#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:55:50,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {43100#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43101#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:55:50,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {43101#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43102#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:55:50,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {43102#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43103#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:55:50,709 INFO L290 TraceCheckUtils]: 20: Hoare triple {43103#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43104#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:55:50,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {43104#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43105#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:55:50,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {43105#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43106#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:55:50,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {43106#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43107#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:55:50,712 INFO L290 TraceCheckUtils]: 24: Hoare triple {43107#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43108#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:55:50,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {43108#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43109#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:55:50,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {43109#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43110#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:55:50,714 INFO L290 TraceCheckUtils]: 27: Hoare triple {43110#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43111#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:55:50,715 INFO L290 TraceCheckUtils]: 28: Hoare triple {43111#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43112#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:55:50,715 INFO L290 TraceCheckUtils]: 29: Hoare triple {43112#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43113#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:55:50,716 INFO L290 TraceCheckUtils]: 30: Hoare triple {43113#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43114#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:55:50,717 INFO L290 TraceCheckUtils]: 31: Hoare triple {43114#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43115#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:55:50,717 INFO L290 TraceCheckUtils]: 32: Hoare triple {43115#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43116#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:55:50,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {43116#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43117#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:55:50,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {43117#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43118#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:55:50,719 INFO L290 TraceCheckUtils]: 35: Hoare triple {43118#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43119#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:55:50,720 INFO L290 TraceCheckUtils]: 36: Hoare triple {43119#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43120#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:55:50,720 INFO L290 TraceCheckUtils]: 37: Hoare triple {43120#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43121#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:55:50,721 INFO L290 TraceCheckUtils]: 38: Hoare triple {43121#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43122#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:55:50,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {43122#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43123#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:55:50,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {43123#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43124#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:55:50,723 INFO L290 TraceCheckUtils]: 41: Hoare triple {43124#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43125#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:55:50,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {43125#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43126#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:55:50,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {43126#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43127#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:55:50,725 INFO L290 TraceCheckUtils]: 44: Hoare triple {43127#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43128#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:55:50,725 INFO L290 TraceCheckUtils]: 45: Hoare triple {43128#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43129#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:55:50,726 INFO L290 TraceCheckUtils]: 46: Hoare triple {43129#(<= 499928 main_~y~0)} assume !(~y~0 > 0); {43089#false} is VALID [2022-04-15 06:55:50,726 INFO L272 TraceCheckUtils]: 47: Hoare triple {43089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43089#false} is VALID [2022-04-15 06:55:50,726 INFO L290 TraceCheckUtils]: 48: Hoare triple {43089#false} ~cond := #in~cond; {43089#false} is VALID [2022-04-15 06:55:50,726 INFO L290 TraceCheckUtils]: 49: Hoare triple {43089#false} assume 0 == ~cond; {43089#false} is VALID [2022-04-15 06:55:50,726 INFO L290 TraceCheckUtils]: 50: Hoare triple {43089#false} assume !false; {43089#false} is VALID [2022-04-15 06:55:50,726 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:55:50,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:55:50,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911463096] [2022-04-15 06:55:50,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911463096] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:55:50,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189170190] [2022-04-15 06:55:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:55:50,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:55:50,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:55:50,728 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:55:50,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 06:55:50,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:50,803 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 06:55:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:55:50,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:55:52,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {43088#true} call ULTIMATE.init(); {43088#true} is VALID [2022-04-15 06:55:52,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {43088#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(17, 2);call #Ultimate.allocInit(12, 3); {43088#true} is VALID [2022-04-15 06:55:52,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {43088#true} assume true; {43088#true} is VALID [2022-04-15 06:55:52,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43088#true} {43088#true} #52#return; {43088#true} is VALID [2022-04-15 06:55:52,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {43088#true} call #t~ret9 := main(); {43088#true} is VALID [2022-04-15 06:55:52,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {43088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {43149#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:55:52,061 INFO L290 TraceCheckUtils]: 6: Hoare triple {43149#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_227| |v_main_#t~post4_226|)) (.cse1 (= v_main_~x~0_2338 v_main_~x~0_2337))) (or (and .cse0 (not (< v_main_~x~0_2338 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2338 v_main_~x~0_2337) (< v_main_~x~0_2337 500001)))) InVars {main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} OutVars{main_~x~0=v_main_~x~0_2337, main_#t~post4=|v_main_#t~post4_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43153#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:52,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {43153#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43153#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:55:52,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {43153#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse2 (= v_main_~y~0_2667 v_main_~y~0_2666)) (.cse3 (= v_main_~x~0_2340 v_main_~x~0_2339)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|)) (.cse0 (<= 500000 v_main_~x~0_2340))) (or (and (or (not (< v_main_~x~0_2340 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2340 v_main_~x~0_2339) .cse0 (< v_main_~x~0_2339 1000001) (= (+ v_main_~x~0_2340 v_main_~y~0_2666) (+ v_main_~x~0_2339 v_main_~y~0_2667))))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2340, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2666, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2339, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43160#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:55:52,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {43160#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {43164#(< 999999 main_~y~0)} is VALID [2022-04-15 06:55:52,063 INFO L290 TraceCheckUtils]: 10: Hoare triple {43164#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43168#(< 999997 main_~y~0)} is VALID [2022-04-15 06:55:52,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {43168#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43172#(< 999995 main_~y~0)} is VALID [2022-04-15 06:55:52,064 INFO L290 TraceCheckUtils]: 12: Hoare triple {43172#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43176#(< 999993 main_~y~0)} is VALID [2022-04-15 06:55:52,064 INFO L290 TraceCheckUtils]: 13: Hoare triple {43176#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43180#(< 999991 main_~y~0)} is VALID [2022-04-15 06:55:52,065 INFO L290 TraceCheckUtils]: 14: Hoare triple {43180#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43184#(< 999989 main_~y~0)} is VALID [2022-04-15 06:55:52,065 INFO L290 TraceCheckUtils]: 15: Hoare triple {43184#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43188#(< 999987 main_~y~0)} is VALID [2022-04-15 06:55:52,066 INFO L290 TraceCheckUtils]: 16: Hoare triple {43188#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43192#(< 999985 main_~y~0)} is VALID [2022-04-15 06:55:52,066 INFO L290 TraceCheckUtils]: 17: Hoare triple {43192#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43196#(< 999983 main_~y~0)} is VALID [2022-04-15 06:55:52,067 INFO L290 TraceCheckUtils]: 18: Hoare triple {43196#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43200#(< 999981 main_~y~0)} is VALID [2022-04-15 06:55:52,067 INFO L290 TraceCheckUtils]: 19: Hoare triple {43200#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43204#(< 999979 main_~y~0)} is VALID [2022-04-15 06:55:52,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {43204#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43208#(< 999977 main_~y~0)} is VALID [2022-04-15 06:55:52,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {43208#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43212#(< 999975 main_~y~0)} is VALID [2022-04-15 06:55:52,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {43212#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43216#(< 999973 main_~y~0)} is VALID [2022-04-15 06:55:52,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {43216#(< 999973 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43220#(< 999971 main_~y~0)} is VALID [2022-04-15 06:55:52,070 INFO L290 TraceCheckUtils]: 24: Hoare triple {43220#(< 999971 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43224#(< 999969 main_~y~0)} is VALID [2022-04-15 06:55:52,070 INFO L290 TraceCheckUtils]: 25: Hoare triple {43224#(< 999969 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43228#(< 999967 main_~y~0)} is VALID [2022-04-15 06:55:52,071 INFO L290 TraceCheckUtils]: 26: Hoare triple {43228#(< 999967 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43232#(< 999965 main_~y~0)} is VALID [2022-04-15 06:55:52,071 INFO L290 TraceCheckUtils]: 27: Hoare triple {43232#(< 999965 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43236#(< 999963 main_~y~0)} is VALID [2022-04-15 06:55:52,072 INFO L290 TraceCheckUtils]: 28: Hoare triple {43236#(< 999963 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43240#(< 999961 main_~y~0)} is VALID [2022-04-15 06:55:52,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {43240#(< 999961 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43244#(< 999959 main_~y~0)} is VALID [2022-04-15 06:55:52,073 INFO L290 TraceCheckUtils]: 30: Hoare triple {43244#(< 999959 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43248#(< 999957 main_~y~0)} is VALID [2022-04-15 06:55:52,073 INFO L290 TraceCheckUtils]: 31: Hoare triple {43248#(< 999957 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43252#(< 999955 main_~y~0)} is VALID [2022-04-15 06:55:52,074 INFO L290 TraceCheckUtils]: 32: Hoare triple {43252#(< 999955 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43256#(< 999953 main_~y~0)} is VALID [2022-04-15 06:55:52,074 INFO L290 TraceCheckUtils]: 33: Hoare triple {43256#(< 999953 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43260#(< 999951 main_~y~0)} is VALID [2022-04-15 06:55:52,075 INFO L290 TraceCheckUtils]: 34: Hoare triple {43260#(< 999951 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43264#(< 999949 main_~y~0)} is VALID [2022-04-15 06:55:52,075 INFO L290 TraceCheckUtils]: 35: Hoare triple {43264#(< 999949 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43268#(< 999947 main_~y~0)} is VALID [2022-04-15 06:55:52,076 INFO L290 TraceCheckUtils]: 36: Hoare triple {43268#(< 999947 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43272#(< 999945 main_~y~0)} is VALID [2022-04-15 06:55:52,076 INFO L290 TraceCheckUtils]: 37: Hoare triple {43272#(< 999945 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43276#(< 999943 main_~y~0)} is VALID [2022-04-15 06:55:52,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {43276#(< 999943 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43280#(< 999941 main_~y~0)} is VALID [2022-04-15 06:55:52,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {43280#(< 999941 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43284#(< 999939 main_~y~0)} is VALID [2022-04-15 06:55:52,078 INFO L290 TraceCheckUtils]: 40: Hoare triple {43284#(< 999939 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43288#(< 999937 main_~y~0)} is VALID [2022-04-15 06:55:52,078 INFO L290 TraceCheckUtils]: 41: Hoare triple {43288#(< 999937 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43292#(< 999935 main_~y~0)} is VALID [2022-04-15 06:55:52,079 INFO L290 TraceCheckUtils]: 42: Hoare triple {43292#(< 999935 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43296#(< 999933 main_~y~0)} is VALID [2022-04-15 06:55:52,079 INFO L290 TraceCheckUtils]: 43: Hoare triple {43296#(< 999933 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43300#(< 999931 main_~y~0)} is VALID [2022-04-15 06:55:52,080 INFO L290 TraceCheckUtils]: 44: Hoare triple {43300#(< 999931 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43304#(< 999929 main_~y~0)} is VALID [2022-04-15 06:55:52,080 INFO L290 TraceCheckUtils]: 45: Hoare triple {43304#(< 999929 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43308#(< 999927 main_~y~0)} is VALID [2022-04-15 06:55:52,080 INFO L290 TraceCheckUtils]: 46: Hoare triple {43308#(< 999927 main_~y~0)} assume !(~y~0 > 0); {43089#false} is VALID [2022-04-15 06:55:52,080 INFO L272 TraceCheckUtils]: 47: Hoare triple {43089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43089#false} is VALID [2022-04-15 06:55:52,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {43089#false} ~cond := #in~cond; {43089#false} is VALID [2022-04-15 06:55:52,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {43089#false} assume 0 == ~cond; {43089#false} is VALID [2022-04-15 06:55:52,081 INFO L290 TraceCheckUtils]: 50: Hoare triple {43089#false} assume !false; {43089#false} is VALID [2022-04-15 06:55:52,081 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:55:52,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:55:54,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {43089#false} assume !false; {43089#false} is VALID [2022-04-15 06:55:54,344 INFO L290 TraceCheckUtils]: 49: Hoare triple {43089#false} assume 0 == ~cond; {43089#false} is VALID [2022-04-15 06:55:54,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {43089#false} ~cond := #in~cond; {43089#false} is VALID [2022-04-15 06:55:54,344 INFO L272 TraceCheckUtils]: 47: Hoare triple {43089#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {43089#false} is VALID [2022-04-15 06:55:54,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {43336#(< 0 main_~y~0)} assume !(~y~0 > 0); {43089#false} is VALID [2022-04-15 06:55:54,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {43340#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43336#(< 0 main_~y~0)} is VALID [2022-04-15 06:55:54,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {43344#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43340#(< 2 main_~y~0)} is VALID [2022-04-15 06:55:54,346 INFO L290 TraceCheckUtils]: 43: Hoare triple {43348#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43344#(< 4 main_~y~0)} is VALID [2022-04-15 06:55:54,347 INFO L290 TraceCheckUtils]: 42: Hoare triple {43352#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43348#(< 6 main_~y~0)} is VALID [2022-04-15 06:55:54,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {43356#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43352#(< 8 main_~y~0)} is VALID [2022-04-15 06:55:54,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {43360#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43356#(< 10 main_~y~0)} is VALID [2022-04-15 06:55:54,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {43364#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43360#(< 12 main_~y~0)} is VALID [2022-04-15 06:55:54,349 INFO L290 TraceCheckUtils]: 38: Hoare triple {43368#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43364#(< 14 main_~y~0)} is VALID [2022-04-15 06:55:54,349 INFO L290 TraceCheckUtils]: 37: Hoare triple {43372#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43368#(< 16 main_~y~0)} is VALID [2022-04-15 06:55:54,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {43376#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43372#(< 18 main_~y~0)} is VALID [2022-04-15 06:55:54,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {43380#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43376#(< 20 main_~y~0)} is VALID [2022-04-15 06:55:54,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {43384#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43380#(< 22 main_~y~0)} is VALID [2022-04-15 06:55:54,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {43388#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43384#(< 24 main_~y~0)} is VALID [2022-04-15 06:55:54,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {43392#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43388#(< 26 main_~y~0)} is VALID [2022-04-15 06:55:54,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {43396#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43392#(< 28 main_~y~0)} is VALID [2022-04-15 06:55:54,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {43400#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43396#(< 30 main_~y~0)} is VALID [2022-04-15 06:55:54,353 INFO L290 TraceCheckUtils]: 29: Hoare triple {43404#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43400#(< 32 main_~y~0)} is VALID [2022-04-15 06:55:54,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {43408#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43404#(< 34 main_~y~0)} is VALID [2022-04-15 06:55:54,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {43412#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43408#(< 36 main_~y~0)} is VALID [2022-04-15 06:55:54,355 INFO L290 TraceCheckUtils]: 26: Hoare triple {43416#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43412#(< 38 main_~y~0)} is VALID [2022-04-15 06:55:54,355 INFO L290 TraceCheckUtils]: 25: Hoare triple {43420#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43416#(< 40 main_~y~0)} is VALID [2022-04-15 06:55:54,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {43424#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43420#(< 42 main_~y~0)} is VALID [2022-04-15 06:55:54,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {43428#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43424#(< 44 main_~y~0)} is VALID [2022-04-15 06:55:54,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {43432#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43428#(< 46 main_~y~0)} is VALID [2022-04-15 06:55:54,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {43436#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43432#(< 48 main_~y~0)} is VALID [2022-04-15 06:55:54,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {43440#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43436#(< 50 main_~y~0)} is VALID [2022-04-15 06:55:54,358 INFO L290 TraceCheckUtils]: 19: Hoare triple {43444#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43440#(< 52 main_~y~0)} is VALID [2022-04-15 06:55:54,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {43448#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43444#(< 54 main_~y~0)} is VALID [2022-04-15 06:55:54,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {43452#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43448#(< 56 main_~y~0)} is VALID [2022-04-15 06:55:54,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {43456#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43452#(< 58 main_~y~0)} is VALID [2022-04-15 06:55:54,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {43460#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43456#(< 60 main_~y~0)} is VALID [2022-04-15 06:55:54,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {43464#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43460#(< 62 main_~y~0)} is VALID [2022-04-15 06:55:54,361 INFO L290 TraceCheckUtils]: 13: Hoare triple {43468#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43464#(< 64 main_~y~0)} is VALID [2022-04-15 06:55:54,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {43472#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43468#(< 66 main_~y~0)} is VALID [2022-04-15 06:55:54,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {43476#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43472#(< 68 main_~y~0)} is VALID [2022-04-15 06:55:54,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {43480#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {43476#(< 70 main_~y~0)} is VALID [2022-04-15 06:55:54,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {43484#(or (< 72 main_~y~0) (< main_~x~0 1000000))} [199] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {43480#(< 72 main_~y~0)} is VALID [2022-04-15 06:55:54,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {43488#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928)) (not (<= 500000 main_~x~0))))} [202] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_249| |v_main_#t~post6_248|)) (.cse2 (= v_main_~y~0_2667 v_main_~y~0_2666)) (.cse3 (= v_main_~x~0_2340 v_main_~x~0_2339)) (.cse4 (= |v_main_#t~post5_249| |v_main_#t~post5_248|)) (.cse0 (<= 500000 v_main_~x~0_2340))) (or (and (or (not (< v_main_~x~0_2340 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2340 v_main_~x~0_2339) .cse0 (< v_main_~x~0_2339 1000001) (= (+ v_main_~x~0_2340 v_main_~y~0_2666) (+ v_main_~x~0_2339 v_main_~y~0_2667))))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2340, main_#t~post6=|v_main_#t~post6_249|} OutVars{main_~y~0=v_main_~y~0_2666, main_#t~post5=|v_main_#t~post5_248|, main_~x~0=v_main_~x~0_2339, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43484#(or (< 72 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-15 06:55:54,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {43488#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928)) (not (<= 500000 main_~x~0))))} [201] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43488#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928)) (not (<= 500000 main_~x~0))))} is VALID [2022-04-15 06:55:54,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {43495#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (<= 0 (+ 499927 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928))))} [200] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_227| |v_main_#t~post4_226|)) (.cse1 (= v_main_~x~0_2338 v_main_~x~0_2337))) (or (and .cse0 (not (< v_main_~x~0_2338 500000)) .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2338 v_main_~x~0_2337) (< v_main_~x~0_2337 500001)))) InVars {main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} OutVars{main_~x~0=v_main_~x~0_2337, main_#t~post4=|v_main_#t~post4_226|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43488#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928)) (not (<= 500000 main_~x~0))))} is VALID [2022-04-15 06:55:54,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {43088#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {43495#(and (or (< 72 main_~y~0) (< main_~x~0 1000000)) (<= 0 (+ 499927 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999928))))} is VALID [2022-04-15 06:55:54,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {43088#true} call #t~ret9 := main(); {43088#true} is VALID [2022-04-15 06:55:54,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43088#true} {43088#true} #52#return; {43088#true} is VALID [2022-04-15 06:55:54,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {43088#true} assume true; {43088#true} is VALID [2022-04-15 06:55:54,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {43088#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(17, 2);call #Ultimate.allocInit(12, 3); {43088#true} is VALID [2022-04-15 06:55:54,366 INFO L272 TraceCheckUtils]: 0: Hoare triple {43088#true} call ULTIMATE.init(); {43088#true} is VALID [2022-04-15 06:55:54,366 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 0 proven. 668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:55:54,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189170190] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:55:54,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:55:54,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 42, 42] total 120 [2022-04-15 06:55:58,609 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:55:58,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1126952880] [2022-04-15 06:55:58,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1126952880] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:55:58,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:55:58,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [107] imperfect sequences [] total 107 [2022-04-15 06:55:58,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940168679] [2022-04-15 06:55:58,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:55:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 180 [2022-04-15 06:55:58,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:55:58,610 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 06:55:58,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:55:58,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-04-15 06:55:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:55:58,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-04-15 06:55:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12150, Invalid=22260, Unknown=0, NotChecked=0, Total=34410 [2022-04-15 06:55:58,754 INFO L87 Difference]: Start difference. First operand 181 states and 184 transitions. Second operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 06:56:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:17,808 INFO L93 Difference]: Finished difference Result 359 states and 370 transitions. [2022-04-15 06:56:17,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-04-15 06:56:17,809 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 180 [2022-04-15 06:56:17,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 06:56:17,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 202 transitions. [2022-04-15 06:56:17,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 06:56:17,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 202 transitions. [2022-04-15 06:56:17,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 202 transitions. [2022-04-15 06:56:17,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:17,990 INFO L225 Difference]: With dead ends: 359 [2022-04-15 06:56:17,990 INFO L226 Difference]: Without dead ends: 186 [2022-04-15 06:56:17,995 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28510 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=23214, Invalid=60596, Unknown=0, NotChecked=0, Total=83810 [2022-04-15 06:56:17,996 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 350 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 8990 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 9314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 8990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:17,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 44 Invalid, 9314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 8990 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-04-15 06:56:17,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-15 06:56:18,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-15 06:56:18,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:18,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 06:56:18,285 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 06:56:18,285 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 06:56:18,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:18,287 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2022-04-15 06:56:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-15 06:56:18,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:18,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:18,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 186 states. [2022-04-15 06:56:18,288 INFO L87 Difference]: Start difference. First operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 186 states. [2022-04-15 06:56:18,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:18,291 INFO L93 Difference]: Finished difference Result 186 states and 189 transitions. [2022-04-15 06:56:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-15 06:56:18,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:18,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:18,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:18,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:18,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 181 states have (on average 1.022099447513812) internal successors, (185), 181 states have internal predecessors, (185), 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 06:56:18,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2022-04-15 06:56:18,294 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 180 [2022-04-15 06:56:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:18,294 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2022-04-15 06:56:18,294 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 107 states have (on average 1.644859813084112) internal successors, (176), 106 states have internal predecessors, (176), 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 06:56:18,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 189 transitions. [2022-04-15 06:56:18,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2022-04-15 06:56:18,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-15 06:56:18,476 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:18,476 INFO L499 BasicCegarLoop]: trace histogram [68, 67, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:18,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 06:56:18,676 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 06:56:18,676 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:18,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:18,677 INFO L85 PathProgramCache]: Analyzing trace with hash 870694842, now seen corresponding path program 37 times [2022-04-15 06:56:18,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:18,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29659922] [2022-04-15 06:56:21,609 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:21,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:21,873 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:21,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1180001346, now seen corresponding path program 1 times [2022-04-15 06:56:21,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:21,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514431019] [2022-04-15 06:56:21,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:21,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:21,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:22,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:22,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {45295#(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(17, 2);call #Ultimate.allocInit(12, 3); {45252#true} is VALID [2022-04-15 06:56:22,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {45252#true} assume true; {45252#true} is VALID [2022-04-15 06:56:22,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45252#true} {45252#true} #52#return; {45252#true} is VALID [2022-04-15 06:56:22,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {45252#true} call ULTIMATE.init(); {45295#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:22,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {45295#(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(17, 2);call #Ultimate.allocInit(12, 3); {45252#true} is VALID [2022-04-15 06:56:22,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {45252#true} assume true; {45252#true} is VALID [2022-04-15 06:56:22,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45252#true} {45252#true} #52#return; {45252#true} is VALID [2022-04-15 06:56:22,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {45252#true} call #t~ret9 := main(); {45252#true} is VALID [2022-04-15 06:56:22,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {45252#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:22,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {45257#(<= 500000 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2457 500000))) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (< v_main_~x~0_2456 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2457, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2456, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:22,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {45257#(<= 500000 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:22,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {45257#(<= 500000 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2813 v_main_~y~0_2812)) (.cse1 (= v_main_~x~0_2459 v_main_~x~0_2458)) (.cse5 (<= 500000 v_main_~x~0_2459)) (.cse2 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse3 (= |v_main_#t~post5_256| |v_main_#t~post5_255|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2459 v_main_~y~0_2812))) (and (< v_main_~y~0_2813 v_main_~y~0_2812) (= .cse4 (+ v_main_~x~0_2458 v_main_~y~0_2813)) .cse5 (< .cse4 (+ 1000001 v_main_~y~0_2813)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_2459 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2813, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2459, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2812, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2458, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:22,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {45257#(<= 500000 main_~y~0)} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:22,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {45257#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45258#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:56:22,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {45258#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45259#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:56:22,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {45259#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45260#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:56:22,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {45260#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45261#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:56:22,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {45261#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45262#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:56:22,618 INFO L290 TraceCheckUtils]: 15: Hoare triple {45262#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45263#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:56:22,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {45263#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45264#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:56:22,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {45264#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45265#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:56:22,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {45265#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45266#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:56:22,620 INFO L290 TraceCheckUtils]: 19: Hoare triple {45266#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45267#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:56:22,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {45267#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45268#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:56:22,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {45268#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45269#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:56:22,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {45269#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45270#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:56:22,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {45270#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45271#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:56:22,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {45271#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45272#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:56:22,623 INFO L290 TraceCheckUtils]: 25: Hoare triple {45272#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45273#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:56:22,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {45273#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45274#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:56:22,624 INFO L290 TraceCheckUtils]: 27: Hoare triple {45274#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45275#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:56:22,624 INFO L290 TraceCheckUtils]: 28: Hoare triple {45275#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45276#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:56:22,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {45276#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45277#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:56:22,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {45277#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45278#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:56:22,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {45278#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45279#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:56:22,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {45279#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45280#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:56:22,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {45280#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45281#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:56:22,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {45281#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45282#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:56:22,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {45282#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45283#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:56:22,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {45283#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45284#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:56:22,628 INFO L290 TraceCheckUtils]: 37: Hoare triple {45284#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45285#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:56:22,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {45285#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45286#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:56:22,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {45286#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45287#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:56:22,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {45287#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45288#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:56:22,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {45288#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45289#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:56:22,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {45289#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45290#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:56:22,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {45290#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45291#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:56:22,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {45291#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45292#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:56:22,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {45292#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45293#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:56:22,633 INFO L290 TraceCheckUtils]: 46: Hoare triple {45293#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45294#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:56:22,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {45294#(<= 499926 main_~y~0)} assume !(~y~0 > 0); {45253#false} is VALID [2022-04-15 06:56:22,633 INFO L272 TraceCheckUtils]: 48: Hoare triple {45253#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {45253#false} is VALID [2022-04-15 06:56:22,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {45253#false} ~cond := #in~cond; {45253#false} is VALID [2022-04-15 06:56:22,633 INFO L290 TraceCheckUtils]: 50: Hoare triple {45253#false} assume 0 == ~cond; {45253#false} is VALID [2022-04-15 06:56:22,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {45253#false} assume !false; {45253#false} is VALID [2022-04-15 06:56:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:22,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514431019] [2022-04-15 06:56:22,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514431019] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:22,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358293553] [2022-04-15 06:56:22,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:22,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:22,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:22,635 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:22,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 06:56:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:22,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-15 06:56:22,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:22,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:23,155 INFO L272 TraceCheckUtils]: 0: Hoare triple {45252#true} call ULTIMATE.init(); {45252#true} is VALID [2022-04-15 06:56:23,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {45252#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(17, 2);call #Ultimate.allocInit(12, 3); {45252#true} is VALID [2022-04-15 06:56:23,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {45252#true} assume true; {45252#true} is VALID [2022-04-15 06:56:23,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45252#true} {45252#true} #52#return; {45252#true} is VALID [2022-04-15 06:56:23,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {45252#true} call #t~ret9 := main(); {45252#true} is VALID [2022-04-15 06:56:23,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {45252#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:23,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {45257#(<= 500000 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2457 500000))) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (< v_main_~x~0_2456 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2457, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2456, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:23,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {45257#(<= 500000 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:23,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {45257#(<= 500000 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2813 v_main_~y~0_2812)) (.cse1 (= v_main_~x~0_2459 v_main_~x~0_2458)) (.cse5 (<= 500000 v_main_~x~0_2459)) (.cse2 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse3 (= |v_main_#t~post5_256| |v_main_#t~post5_255|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2459 v_main_~y~0_2812))) (and (< v_main_~y~0_2813 v_main_~y~0_2812) (= .cse4 (+ v_main_~x~0_2458 v_main_~y~0_2813)) .cse5 (< .cse4 (+ 1000001 v_main_~y~0_2813)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_2459 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2813, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2459, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2812, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2458, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:23,157 INFO L290 TraceCheckUtils]: 9: Hoare triple {45257#(<= 500000 main_~y~0)} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {45257#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:23,158 INFO L290 TraceCheckUtils]: 10: Hoare triple {45257#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45258#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:56:23,158 INFO L290 TraceCheckUtils]: 11: Hoare triple {45258#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45259#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:56:23,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {45259#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45260#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:56:23,159 INFO L290 TraceCheckUtils]: 13: Hoare triple {45260#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45261#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:56:23,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {45261#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45262#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:56:23,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {45262#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45263#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:56:23,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {45263#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45264#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:56:23,161 INFO L290 TraceCheckUtils]: 17: Hoare triple {45264#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45265#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:56:23,161 INFO L290 TraceCheckUtils]: 18: Hoare triple {45265#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45266#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:56:23,162 INFO L290 TraceCheckUtils]: 19: Hoare triple {45266#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45267#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:56:23,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {45267#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45268#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:56:23,163 INFO L290 TraceCheckUtils]: 21: Hoare triple {45268#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45269#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:56:23,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {45269#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45270#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:56:23,175 INFO L290 TraceCheckUtils]: 23: Hoare triple {45270#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45271#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:56:23,175 INFO L290 TraceCheckUtils]: 24: Hoare triple {45271#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45272#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:56:23,176 INFO L290 TraceCheckUtils]: 25: Hoare triple {45272#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45273#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:56:23,176 INFO L290 TraceCheckUtils]: 26: Hoare triple {45273#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45274#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:56:23,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {45274#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45275#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:56:23,177 INFO L290 TraceCheckUtils]: 28: Hoare triple {45275#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45276#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:56:23,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {45276#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45277#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:56:23,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {45277#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45278#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:56:23,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {45278#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45279#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:56:23,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {45279#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45280#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:56:23,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {45280#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45281#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:56:23,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {45281#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45282#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:56:23,181 INFO L290 TraceCheckUtils]: 35: Hoare triple {45282#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45283#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:56:23,181 INFO L290 TraceCheckUtils]: 36: Hoare triple {45283#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45284#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:56:23,182 INFO L290 TraceCheckUtils]: 37: Hoare triple {45284#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45285#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:56:23,182 INFO L290 TraceCheckUtils]: 38: Hoare triple {45285#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45286#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:56:23,183 INFO L290 TraceCheckUtils]: 39: Hoare triple {45286#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45287#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:56:23,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {45287#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45288#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:56:23,184 INFO L290 TraceCheckUtils]: 41: Hoare triple {45288#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45289#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:56:23,184 INFO L290 TraceCheckUtils]: 42: Hoare triple {45289#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45290#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:56:23,185 INFO L290 TraceCheckUtils]: 43: Hoare triple {45290#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45291#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:56:23,185 INFO L290 TraceCheckUtils]: 44: Hoare triple {45291#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45292#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:56:23,186 INFO L290 TraceCheckUtils]: 45: Hoare triple {45292#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45293#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:56:23,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {45293#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45294#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:56:23,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {45294#(<= 499926 main_~y~0)} assume !(~y~0 > 0); {45253#false} is VALID [2022-04-15 06:56:23,187 INFO L272 TraceCheckUtils]: 48: Hoare triple {45253#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {45253#false} is VALID [2022-04-15 06:56:23,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {45253#false} ~cond := #in~cond; {45253#false} is VALID [2022-04-15 06:56:23,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {45253#false} assume 0 == ~cond; {45253#false} is VALID [2022-04-15 06:56:23,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {45253#false} assume !false; {45253#false} is VALID [2022-04-15 06:56:23,187 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:23,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:25,103 INFO L290 TraceCheckUtils]: 51: Hoare triple {45253#false} assume !false; {45253#false} is VALID [2022-04-15 06:56:25,103 INFO L290 TraceCheckUtils]: 50: Hoare triple {45253#false} assume 0 == ~cond; {45253#false} is VALID [2022-04-15 06:56:25,103 INFO L290 TraceCheckUtils]: 49: Hoare triple {45253#false} ~cond := #in~cond; {45253#false} is VALID [2022-04-15 06:56:25,103 INFO L272 TraceCheckUtils]: 48: Hoare triple {45253#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {45253#false} is VALID [2022-04-15 06:56:25,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {45464#(< 0 main_~y~0)} assume !(~y~0 > 0); {45253#false} is VALID [2022-04-15 06:56:25,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {45468#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45464#(< 0 main_~y~0)} is VALID [2022-04-15 06:56:25,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {45472#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45468#(< 2 main_~y~0)} is VALID [2022-04-15 06:56:25,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {45476#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45472#(< 4 main_~y~0)} is VALID [2022-04-15 06:56:25,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {45480#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45476#(< 6 main_~y~0)} is VALID [2022-04-15 06:56:25,106 INFO L290 TraceCheckUtils]: 42: Hoare triple {45484#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45480#(< 8 main_~y~0)} is VALID [2022-04-15 06:56:25,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {45488#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45484#(< 10 main_~y~0)} is VALID [2022-04-15 06:56:25,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {45492#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45488#(< 12 main_~y~0)} is VALID [2022-04-15 06:56:25,108 INFO L290 TraceCheckUtils]: 39: Hoare triple {45496#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45492#(< 14 main_~y~0)} is VALID [2022-04-15 06:56:25,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {45500#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45496#(< 16 main_~y~0)} is VALID [2022-04-15 06:56:25,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {45504#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45500#(< 18 main_~y~0)} is VALID [2022-04-15 06:56:25,109 INFO L290 TraceCheckUtils]: 36: Hoare triple {45508#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45504#(< 20 main_~y~0)} is VALID [2022-04-15 06:56:25,110 INFO L290 TraceCheckUtils]: 35: Hoare triple {45512#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45508#(< 22 main_~y~0)} is VALID [2022-04-15 06:56:25,110 INFO L290 TraceCheckUtils]: 34: Hoare triple {45516#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45512#(< 24 main_~y~0)} is VALID [2022-04-15 06:56:25,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {45520#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45516#(< 26 main_~y~0)} is VALID [2022-04-15 06:56:25,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {45524#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45520#(< 28 main_~y~0)} is VALID [2022-04-15 06:56:25,112 INFO L290 TraceCheckUtils]: 31: Hoare triple {45528#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45524#(< 30 main_~y~0)} is VALID [2022-04-15 06:56:25,112 INFO L290 TraceCheckUtils]: 30: Hoare triple {45532#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45528#(< 32 main_~y~0)} is VALID [2022-04-15 06:56:25,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {45536#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45532#(< 34 main_~y~0)} is VALID [2022-04-15 06:56:25,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {45540#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45536#(< 36 main_~y~0)} is VALID [2022-04-15 06:56:25,114 INFO L290 TraceCheckUtils]: 27: Hoare triple {45544#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45540#(< 38 main_~y~0)} is VALID [2022-04-15 06:56:25,114 INFO L290 TraceCheckUtils]: 26: Hoare triple {45548#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45544#(< 40 main_~y~0)} is VALID [2022-04-15 06:56:25,115 INFO L290 TraceCheckUtils]: 25: Hoare triple {45552#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45548#(< 42 main_~y~0)} is VALID [2022-04-15 06:56:25,115 INFO L290 TraceCheckUtils]: 24: Hoare triple {45556#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45552#(< 44 main_~y~0)} is VALID [2022-04-15 06:56:25,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {45560#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45556#(< 46 main_~y~0)} is VALID [2022-04-15 06:56:25,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {45564#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45560#(< 48 main_~y~0)} is VALID [2022-04-15 06:56:25,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {45568#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45564#(< 50 main_~y~0)} is VALID [2022-04-15 06:56:25,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {45572#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45568#(< 52 main_~y~0)} is VALID [2022-04-15 06:56:25,118 INFO L290 TraceCheckUtils]: 19: Hoare triple {45576#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45572#(< 54 main_~y~0)} is VALID [2022-04-15 06:56:25,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {45580#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45576#(< 56 main_~y~0)} is VALID [2022-04-15 06:56:25,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {45584#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45580#(< 58 main_~y~0)} is VALID [2022-04-15 06:56:25,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {45588#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45584#(< 60 main_~y~0)} is VALID [2022-04-15 06:56:25,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {45592#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45588#(< 62 main_~y~0)} is VALID [2022-04-15 06:56:25,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {45596#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45592#(< 64 main_~y~0)} is VALID [2022-04-15 06:56:25,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {45600#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45596#(< 66 main_~y~0)} is VALID [2022-04-15 06:56:25,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {45604#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45600#(< 68 main_~y~0)} is VALID [2022-04-15 06:56:25,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {45608#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45604#(< 70 main_~y~0)} is VALID [2022-04-15 06:56:25,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {45612#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {45608#(< 72 main_~y~0)} is VALID [2022-04-15 06:56:25,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {45612#(< 74 main_~y~0)} [203] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {45612#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:25,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {45612#(< 74 main_~y~0)} [206] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_2813 v_main_~y~0_2812)) (.cse1 (= v_main_~x~0_2459 v_main_~x~0_2458)) (.cse5 (<= 500000 v_main_~x~0_2459)) (.cse2 (= |v_main_#t~post6_256| |v_main_#t~post6_255|)) (.cse3 (= |v_main_#t~post5_256| |v_main_#t~post5_255|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2459 v_main_~y~0_2812))) (and (< v_main_~y~0_2813 v_main_~y~0_2812) (= .cse4 (+ v_main_~x~0_2458 v_main_~y~0_2813)) .cse5 (< .cse4 (+ 1000001 v_main_~y~0_2813)))) (and .cse0 .cse1 (or (not (< v_main_~x~0_2459 1000000)) (not .cse5)) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2813, main_#t~post5=|v_main_#t~post5_256|, main_~x~0=v_main_~x~0_2459, main_#t~post6=|v_main_#t~post6_256|} OutVars{main_~y~0=v_main_~y~0_2812, main_#t~post5=|v_main_#t~post5_255|, main_~x~0=v_main_~x~0_2458, main_#t~post6=|v_main_#t~post6_255|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {45612#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:25,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {45612#(< 74 main_~y~0)} [205] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {45612#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:25,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {45612#(< 74 main_~y~0)} [204] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2457 v_main_~x~0_2456)) (.cse1 (= |v_main_#t~post4_234| |v_main_#t~post4_233|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2457 500000))) (and (< v_main_~x~0_2457 v_main_~x~0_2456) (< v_main_~x~0_2456 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2457, main_#t~post4=|v_main_#t~post4_234|} OutVars{main_~x~0=v_main_~x~0_2456, main_#t~post4=|v_main_#t~post4_233|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {45612#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:25,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {45252#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {45612#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:25,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {45252#true} call #t~ret9 := main(); {45252#true} is VALID [2022-04-15 06:56:25,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45252#true} {45252#true} #52#return; {45252#true} is VALID [2022-04-15 06:56:25,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {45252#true} assume true; {45252#true} is VALID [2022-04-15 06:56:25,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {45252#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(17, 2);call #Ultimate.allocInit(12, 3); {45252#true} is VALID [2022-04-15 06:56:25,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {45252#true} call ULTIMATE.init(); {45252#true} is VALID [2022-04-15 06:56:25,124 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:25,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358293553] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:25,125 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:25,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 79 [2022-04-15 06:56:28,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:28,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29659922] [2022-04-15 06:56:28,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29659922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:28,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:28,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2022-04-15 06:56:28,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913804213] [2022-04-15 06:56:28,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 185 [2022-04-15 06:56:28,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:28,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 06:56:28,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:28,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-04-15 06:56:28,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:28,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-04-15 06:56:28,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8455, Invalid=13301, Unknown=0, NotChecked=0, Total=21756 [2022-04-15 06:56:28,670 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 06:56:47,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:47,657 INFO L93 Difference]: Finished difference Result 369 states and 380 transitions. [2022-04-15 06:56:47,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-04-15 06:56:47,657 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 185 [2022-04-15 06:56:47,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:56:47,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 06:56:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 207 transitions. [2022-04-15 06:56:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 06:56:47,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 207 transitions. [2022-04-15 06:56:47,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 207 transitions. [2022-04-15 06:56:47,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:47,848 INFO L225 Difference]: With dead ends: 369 [2022-04-15 06:56:47,848 INFO L226 Difference]: Without dead ends: 191 [2022-04-15 06:56:47,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18904 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=19735, Invalid=45035, Unknown=0, NotChecked=0, Total=64770 [2022-04-15 06:56:47,852 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 433 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9497 mSolverCounterSat, 404 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 9901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 404 IncrementalHoareTripleChecker+Valid, 9497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:56:47,852 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [433 Valid, 34 Invalid, 9901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [404 Valid, 9497 Invalid, 0 Unknown, 0 Unchecked, 7.7s Time] [2022-04-15 06:56:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-15 06:56:48,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-15 06:56:48,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:56:48,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 06:56:48,159 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 06:56:48,159 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 06:56:48,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:48,161 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-15 06:56:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-15 06:56:48,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:48,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:48,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 191 states. [2022-04-15 06:56:48,162 INFO L87 Difference]: Start difference. First operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 191 states. [2022-04-15 06:56:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:56:48,163 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-15 06:56:48,163 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-15 06:56:48,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:56:48,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:56:48,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:56:48,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:56:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 186 states have (on average 1.021505376344086) internal successors, (190), 186 states have internal predecessors, (190), 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 06:56:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 194 transitions. [2022-04-15 06:56:48,166 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 194 transitions. Word has length 185 [2022-04-15 06:56:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:56:48,166 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 194 transitions. [2022-04-15 06:56:48,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 110 states have (on average 1.6454545454545455) internal successors, (181), 109 states have internal predecessors, (181), 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 06:56:48,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 194 transitions. [2022-04-15 06:56:48,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:48,325 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 194 transitions. [2022-04-15 06:56:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-15 06:56:48,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:56:48,325 INFO L499 BasicCegarLoop]: trace histogram [70, 69, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:56:48,341 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-04-15 06:56:48,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 06:56:48,526 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:56:48,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:56:48,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1208729549, now seen corresponding path program 38 times [2022-04-15 06:56:48,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:48,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [510920371] [2022-04-15 06:56:48,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:48,891 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:56:48,892 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:56:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1200560543, now seen corresponding path program 1 times [2022-04-15 06:56:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:56:48,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401451285] [2022-04-15 06:56:48,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:48,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:56:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:49,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:56:49,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:49,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {47474#(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(17, 2);call #Ultimate.allocInit(12, 3); {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {47430#true} assume true; {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {47430#true} {47430#true} #52#return; {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {47430#true} call ULTIMATE.init(); {47474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:56:49,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {47474#(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(17, 2);call #Ultimate.allocInit(12, 3); {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {47430#true} assume true; {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47430#true} {47430#true} #52#return; {47430#true} is VALID [2022-04-15 06:56:49,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {47430#true} call #t~ret9 := main(); {47430#true} is VALID [2022-04-15 06:56:49,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {47430#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {47435#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:49,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {47435#(<= 500000 main_~y~0)} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2578 v_main_~x~0_2577))) (or (and (= |v_main_#t~post4_240| |v_main_#t~post4_239|) .cse0) (and (<= 500000 v_main_~x~0_2578) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and (< v_main_~x~0_2577 500001) (< v_main_~x~0_2578 v_main_~x~0_2577)))) InVars {main_~x~0=v_main_~x~0_2578, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2577, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {47435#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:49,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {47435#(<= 500000 main_~y~0)} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47435#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:49,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {47435#(<= 500000 main_~y~0)} [210] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2580)) (.cse1 (= v_main_~y~0_2963 v_main_~y~0_2962)) (.cse2 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse3 (= v_main_~x~0_2580 v_main_~x~0_2579)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and (< v_main_~x~0_2579 1000001) (< v_main_~x~0_2580 v_main_~x~0_2579) (= (+ v_main_~x~0_2580 v_main_~y~0_2962) (+ v_main_~x~0_2579 v_main_~y~0_2963)) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_2580 1000000)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2963, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2580, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2962, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2579, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47435#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:49,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {47435#(<= 500000 main_~y~0)} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {47435#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:56:49,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {47435#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47436#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:56:49,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {47436#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47437#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:56:49,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {47437#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47438#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:56:49,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {47438#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47439#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:56:49,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {47439#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47440#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:56:49,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {47440#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47441#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:56:49,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {47441#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47442#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:56:49,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {47442#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47443#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:56:49,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {47443#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47444#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:56:49,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {47444#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47445#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:56:49,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {47445#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47446#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:56:49,636 INFO L290 TraceCheckUtils]: 21: Hoare triple {47446#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47447#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:56:49,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {47447#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47448#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:56:49,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {47448#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47449#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:56:49,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {47449#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47450#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:56:49,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {47450#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47451#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:56:49,639 INFO L290 TraceCheckUtils]: 26: Hoare triple {47451#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47452#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:56:49,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {47452#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47453#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:56:49,640 INFO L290 TraceCheckUtils]: 28: Hoare triple {47453#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47454#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:56:49,640 INFO L290 TraceCheckUtils]: 29: Hoare triple {47454#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47455#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:56:49,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {47455#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47456#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:56:49,643 INFO L290 TraceCheckUtils]: 31: Hoare triple {47456#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47457#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:56:49,644 INFO L290 TraceCheckUtils]: 32: Hoare triple {47457#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47458#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:56:49,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {47458#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47459#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:56:49,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {47459#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47460#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:56:49,646 INFO L290 TraceCheckUtils]: 35: Hoare triple {47460#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47461#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:56:49,647 INFO L290 TraceCheckUtils]: 36: Hoare triple {47461#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47462#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:56:49,647 INFO L290 TraceCheckUtils]: 37: Hoare triple {47462#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47463#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:56:49,648 INFO L290 TraceCheckUtils]: 38: Hoare triple {47463#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47464#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:56:49,648 INFO L290 TraceCheckUtils]: 39: Hoare triple {47464#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47465#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:56:49,649 INFO L290 TraceCheckUtils]: 40: Hoare triple {47465#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47466#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:56:49,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {47466#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47467#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:56:49,650 INFO L290 TraceCheckUtils]: 42: Hoare triple {47467#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47468#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:56:49,651 INFO L290 TraceCheckUtils]: 43: Hoare triple {47468#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47469#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:56:49,652 INFO L290 TraceCheckUtils]: 44: Hoare triple {47469#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47470#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:56:49,652 INFO L290 TraceCheckUtils]: 45: Hoare triple {47470#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47471#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:56:49,653 INFO L290 TraceCheckUtils]: 46: Hoare triple {47471#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47472#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:56:49,653 INFO L290 TraceCheckUtils]: 47: Hoare triple {47472#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47473#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:56:49,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {47473#(<= 499924 main_~y~0)} assume !(~y~0 > 0); {47431#false} is VALID [2022-04-15 06:56:49,663 INFO L272 TraceCheckUtils]: 49: Hoare triple {47431#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {47431#false} is VALID [2022-04-15 06:56:49,663 INFO L290 TraceCheckUtils]: 50: Hoare triple {47431#false} ~cond := #in~cond; {47431#false} is VALID [2022-04-15 06:56:49,663 INFO L290 TraceCheckUtils]: 51: Hoare triple {47431#false} assume 0 == ~cond; {47431#false} is VALID [2022-04-15 06:56:49,663 INFO L290 TraceCheckUtils]: 52: Hoare triple {47431#false} assume !false; {47431#false} is VALID [2022-04-15 06:56:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:56:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:56:49,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401451285] [2022-04-15 06:56:49,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401451285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:56:49,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988838387] [2022-04-15 06:56:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:56:49,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:56:49,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:56:49,667 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:56:49,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 06:56:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:49,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:56:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:56:49,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:56:51,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {47430#true} call ULTIMATE.init(); {47430#true} is VALID [2022-04-15 06:56:51,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {47430#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(17, 2);call #Ultimate.allocInit(12, 3); {47430#true} is VALID [2022-04-15 06:56:51,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {47430#true} assume true; {47430#true} is VALID [2022-04-15 06:56:51,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47430#true} {47430#true} #52#return; {47430#true} is VALID [2022-04-15 06:56:51,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {47430#true} call #t~ret9 := main(); {47430#true} is VALID [2022-04-15 06:56:51,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {47430#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {47493#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-15 06:56:51,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {47493#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2578 v_main_~x~0_2577))) (or (and (= |v_main_#t~post4_240| |v_main_#t~post4_239|) .cse0) (and (<= 500000 v_main_~x~0_2578) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and (< v_main_~x~0_2577 500001) (< v_main_~x~0_2578 v_main_~x~0_2577)))) InVars {main_~x~0=v_main_~x~0_2578, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2577, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {47497#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:51,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {47497#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47497#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-15 06:56:51,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {47497#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2580)) (.cse1 (= v_main_~y~0_2963 v_main_~y~0_2962)) (.cse2 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse3 (= v_main_~x~0_2580 v_main_~x~0_2579)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and (< v_main_~x~0_2579 1000001) (< v_main_~x~0_2580 v_main_~x~0_2579) (= (+ v_main_~x~0_2580 v_main_~y~0_2962) (+ v_main_~x~0_2579 v_main_~y~0_2963)) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_2580 1000000)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2963, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2580, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2962, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2579, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47504#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} is VALID [2022-04-15 06:56:51,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {47504#(or (and (< main_~x~0 (+ main_~y~0 1)) (< main_~x~0 1000001) (< 500000 main_~x~0)) (and (<= 500000 main_~y~0) (< main_~x~0 500001)))} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {47508#(< 999999 main_~y~0)} is VALID [2022-04-15 06:56:51,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {47508#(< 999999 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47512#(< 999997 main_~y~0)} is VALID [2022-04-15 06:56:51,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {47512#(< 999997 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47516#(< 999995 main_~y~0)} is VALID [2022-04-15 06:56:51,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {47516#(< 999995 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47520#(< 999993 main_~y~0)} is VALID [2022-04-15 06:56:51,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {47520#(< 999993 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47524#(< 999991 main_~y~0)} is VALID [2022-04-15 06:56:51,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {47524#(< 999991 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47528#(< 999989 main_~y~0)} is VALID [2022-04-15 06:56:51,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {47528#(< 999989 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47532#(< 999987 main_~y~0)} is VALID [2022-04-15 06:56:51,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {47532#(< 999987 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47536#(< 999985 main_~y~0)} is VALID [2022-04-15 06:56:51,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {47536#(< 999985 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47540#(< 999983 main_~y~0)} is VALID [2022-04-15 06:56:51,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {47540#(< 999983 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47544#(< 999981 main_~y~0)} is VALID [2022-04-15 06:56:51,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {47544#(< 999981 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47548#(< 999979 main_~y~0)} is VALID [2022-04-15 06:56:51,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {47548#(< 999979 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47552#(< 999977 main_~y~0)} is VALID [2022-04-15 06:56:51,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {47552#(< 999977 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47556#(< 999975 main_~y~0)} is VALID [2022-04-15 06:56:51,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {47556#(< 999975 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47560#(< 999973 main_~y~0)} is VALID [2022-04-15 06:56:51,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {47560#(< 999973 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47564#(< 999971 main_~y~0)} is VALID [2022-04-15 06:56:51,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {47564#(< 999971 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47568#(< 999969 main_~y~0)} is VALID [2022-04-15 06:56:51,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {47568#(< 999969 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47572#(< 999967 main_~y~0)} is VALID [2022-04-15 06:56:51,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {47572#(< 999967 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47576#(< 999965 main_~y~0)} is VALID [2022-04-15 06:56:51,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {47576#(< 999965 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47580#(< 999963 main_~y~0)} is VALID [2022-04-15 06:56:51,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {47580#(< 999963 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47584#(< 999961 main_~y~0)} is VALID [2022-04-15 06:56:51,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {47584#(< 999961 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47588#(< 999959 main_~y~0)} is VALID [2022-04-15 06:56:51,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {47588#(< 999959 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47592#(< 999957 main_~y~0)} is VALID [2022-04-15 06:56:51,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {47592#(< 999957 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47596#(< 999955 main_~y~0)} is VALID [2022-04-15 06:56:51,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {47596#(< 999955 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47600#(< 999953 main_~y~0)} is VALID [2022-04-15 06:56:51,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {47600#(< 999953 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47604#(< 999951 main_~y~0)} is VALID [2022-04-15 06:56:51,093 INFO L290 TraceCheckUtils]: 34: Hoare triple {47604#(< 999951 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47608#(< 999949 main_~y~0)} is VALID [2022-04-15 06:56:51,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {47608#(< 999949 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47612#(< 999947 main_~y~0)} is VALID [2022-04-15 06:56:51,094 INFO L290 TraceCheckUtils]: 36: Hoare triple {47612#(< 999947 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47616#(< 999945 main_~y~0)} is VALID [2022-04-15 06:56:51,094 INFO L290 TraceCheckUtils]: 37: Hoare triple {47616#(< 999945 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47620#(< 999943 main_~y~0)} is VALID [2022-04-15 06:56:51,095 INFO L290 TraceCheckUtils]: 38: Hoare triple {47620#(< 999943 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47624#(< 999941 main_~y~0)} is VALID [2022-04-15 06:56:51,095 INFO L290 TraceCheckUtils]: 39: Hoare triple {47624#(< 999941 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47628#(< 999939 main_~y~0)} is VALID [2022-04-15 06:56:51,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {47628#(< 999939 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47632#(< 999937 main_~y~0)} is VALID [2022-04-15 06:56:51,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {47632#(< 999937 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47636#(< 999935 main_~y~0)} is VALID [2022-04-15 06:56:51,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {47636#(< 999935 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47640#(< 999933 main_~y~0)} is VALID [2022-04-15 06:56:51,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {47640#(< 999933 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47644#(< 999931 main_~y~0)} is VALID [2022-04-15 06:56:51,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {47644#(< 999931 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47648#(< 999929 main_~y~0)} is VALID [2022-04-15 06:56:51,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {47648#(< 999929 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47652#(< 999927 main_~y~0)} is VALID [2022-04-15 06:56:51,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {47652#(< 999927 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47656#(< 999925 main_~y~0)} is VALID [2022-04-15 06:56:51,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {47656#(< 999925 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47660#(< 999923 main_~y~0)} is VALID [2022-04-15 06:56:51,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {47660#(< 999923 main_~y~0)} assume !(~y~0 > 0); {47431#false} is VALID [2022-04-15 06:56:51,100 INFO L272 TraceCheckUtils]: 49: Hoare triple {47431#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {47431#false} is VALID [2022-04-15 06:56:51,100 INFO L290 TraceCheckUtils]: 50: Hoare triple {47431#false} ~cond := #in~cond; {47431#false} is VALID [2022-04-15 06:56:51,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {47431#false} assume 0 == ~cond; {47431#false} is VALID [2022-04-15 06:56:51,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {47431#false} assume !false; {47431#false} is VALID [2022-04-15 06:56:51,100 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 743 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:56:51,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:56:53,539 INFO L290 TraceCheckUtils]: 52: Hoare triple {47431#false} assume !false; {47431#false} is VALID [2022-04-15 06:56:53,539 INFO L290 TraceCheckUtils]: 51: Hoare triple {47431#false} assume 0 == ~cond; {47431#false} is VALID [2022-04-15 06:56:53,539 INFO L290 TraceCheckUtils]: 50: Hoare triple {47431#false} ~cond := #in~cond; {47431#false} is VALID [2022-04-15 06:56:53,539 INFO L272 TraceCheckUtils]: 49: Hoare triple {47431#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {47431#false} is VALID [2022-04-15 06:56:53,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {47688#(< 0 main_~y~0)} assume !(~y~0 > 0); {47431#false} is VALID [2022-04-15 06:56:53,540 INFO L290 TraceCheckUtils]: 47: Hoare triple {47692#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47688#(< 0 main_~y~0)} is VALID [2022-04-15 06:56:53,540 INFO L290 TraceCheckUtils]: 46: Hoare triple {47696#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47692#(< 2 main_~y~0)} is VALID [2022-04-15 06:56:53,541 INFO L290 TraceCheckUtils]: 45: Hoare triple {47700#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47696#(< 4 main_~y~0)} is VALID [2022-04-15 06:56:53,541 INFO L290 TraceCheckUtils]: 44: Hoare triple {47704#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47700#(< 6 main_~y~0)} is VALID [2022-04-15 06:56:53,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {47708#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47704#(< 8 main_~y~0)} is VALID [2022-04-15 06:56:53,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {47712#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47708#(< 10 main_~y~0)} is VALID [2022-04-15 06:56:53,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {47716#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47712#(< 12 main_~y~0)} is VALID [2022-04-15 06:56:53,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {47720#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47716#(< 14 main_~y~0)} is VALID [2022-04-15 06:56:53,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {47724#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47720#(< 16 main_~y~0)} is VALID [2022-04-15 06:56:53,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {47728#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47724#(< 18 main_~y~0)} is VALID [2022-04-15 06:56:53,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {47732#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47728#(< 20 main_~y~0)} is VALID [2022-04-15 06:56:53,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {47736#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47732#(< 22 main_~y~0)} is VALID [2022-04-15 06:56:53,546 INFO L290 TraceCheckUtils]: 35: Hoare triple {47740#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47736#(< 24 main_~y~0)} is VALID [2022-04-15 06:56:53,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {47744#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47740#(< 26 main_~y~0)} is VALID [2022-04-15 06:56:53,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {47748#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47744#(< 28 main_~y~0)} is VALID [2022-04-15 06:56:53,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {47752#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47748#(< 30 main_~y~0)} is VALID [2022-04-15 06:56:53,548 INFO L290 TraceCheckUtils]: 31: Hoare triple {47756#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47752#(< 32 main_~y~0)} is VALID [2022-04-15 06:56:53,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {47760#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47756#(< 34 main_~y~0)} is VALID [2022-04-15 06:56:53,549 INFO L290 TraceCheckUtils]: 29: Hoare triple {47764#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47760#(< 36 main_~y~0)} is VALID [2022-04-15 06:56:53,549 INFO L290 TraceCheckUtils]: 28: Hoare triple {47768#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47764#(< 38 main_~y~0)} is VALID [2022-04-15 06:56:53,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {47772#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47768#(< 40 main_~y~0)} is VALID [2022-04-15 06:56:53,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {47776#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47772#(< 42 main_~y~0)} is VALID [2022-04-15 06:56:53,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {47780#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47776#(< 44 main_~y~0)} is VALID [2022-04-15 06:56:53,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {47784#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47780#(< 46 main_~y~0)} is VALID [2022-04-15 06:56:53,552 INFO L290 TraceCheckUtils]: 23: Hoare triple {47788#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47784#(< 48 main_~y~0)} is VALID [2022-04-15 06:56:53,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {47792#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47788#(< 50 main_~y~0)} is VALID [2022-04-15 06:56:53,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {47796#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47792#(< 52 main_~y~0)} is VALID [2022-04-15 06:56:53,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {47800#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47796#(< 54 main_~y~0)} is VALID [2022-04-15 06:56:53,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {47804#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47800#(< 56 main_~y~0)} is VALID [2022-04-15 06:56:53,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {47808#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47804#(< 58 main_~y~0)} is VALID [2022-04-15 06:56:53,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {47812#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47808#(< 60 main_~y~0)} is VALID [2022-04-15 06:56:53,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {47816#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47812#(< 62 main_~y~0)} is VALID [2022-04-15 06:56:53,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {47820#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47816#(< 64 main_~y~0)} is VALID [2022-04-15 06:56:53,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {47824#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47820#(< 66 main_~y~0)} is VALID [2022-04-15 06:56:53,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {47828#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47824#(< 68 main_~y~0)} is VALID [2022-04-15 06:56:53,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {47832#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47828#(< 70 main_~y~0)} is VALID [2022-04-15 06:56:53,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {47836#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47832#(< 72 main_~y~0)} is VALID [2022-04-15 06:56:53,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {47840#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {47836#(< 74 main_~y~0)} is VALID [2022-04-15 06:56:53,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {47844#(or (< main_~x~0 1000000) (< 76 main_~y~0))} [207] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {47840#(< 76 main_~y~0)} is VALID [2022-04-15 06:56:53,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {47848#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (< main_~x~0 (+ 999924 main_~y~0)) (not (<= 500000 main_~x~0)) (<= 76 main_~y~0)))} [210] L11-2-->L18-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_2580)) (.cse1 (= v_main_~y~0_2963 v_main_~y~0_2962)) (.cse2 (= |v_main_#t~post6_263| |v_main_#t~post6_262|)) (.cse3 (= v_main_~x~0_2580 v_main_~x~0_2579)) (.cse4 (= |v_main_#t~post5_263| |v_main_#t~post5_262|))) (or (and (< v_main_~x~0_2579 1000001) (< v_main_~x~0_2580 v_main_~x~0_2579) (= (+ v_main_~x~0_2580 v_main_~y~0_2962) (+ v_main_~x~0_2579 v_main_~y~0_2963)) .cse0) (and .cse1 .cse2 (or (not (< v_main_~x~0_2580 1000000)) (not .cse0)) .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_2963, main_#t~post5=|v_main_#t~post5_263|, main_~x~0=v_main_~x~0_2580, main_#t~post6=|v_main_#t~post6_263|} OutVars{main_~y~0=v_main_~y~0_2962, main_#t~post5=|v_main_#t~post5_262|, main_~x~0=v_main_~x~0_2579, main_#t~post6=|v_main_#t~post6_262|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {47844#(or (< main_~x~0 1000000) (< 76 main_~y~0))} is VALID [2022-04-15 06:56:53,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {47848#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (< main_~x~0 (+ 999924 main_~y~0)) (not (<= 500000 main_~x~0)) (<= 76 main_~y~0)))} [209] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {47848#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (< main_~x~0 (+ 999924 main_~y~0)) (not (<= 500000 main_~x~0)) (<= 76 main_~y~0)))} is VALID [2022-04-15 06:56:53,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {47855#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (<= 76 main_~y~0) (and (<= 0 (+ main_~y~0 499923)) (< main_~x~0 (+ 999924 main_~y~0)))))} [208] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2578 v_main_~x~0_2577))) (or (and (= |v_main_#t~post4_240| |v_main_#t~post4_239|) .cse0) (and (<= 500000 v_main_~x~0_2578) .cse0 (= |v_main_#t~post4_239| |v_main_#t~post4_240|)) (and (< v_main_~x~0_2577 500001) (< v_main_~x~0_2578 v_main_~x~0_2577)))) InVars {main_~x~0=v_main_~x~0_2578, main_#t~post4=|v_main_#t~post4_240|} OutVars{main_~x~0=v_main_~x~0_2577, main_#t~post4=|v_main_#t~post4_239|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {47848#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (< main_~x~0 (+ 999924 main_~y~0)) (not (<= 500000 main_~x~0)) (<= 76 main_~y~0)))} is VALID [2022-04-15 06:56:53,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {47430#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {47855#(and (or (< main_~x~0 1000000) (< 76 main_~y~0)) (or (<= 76 main_~y~0) (and (<= 0 (+ main_~y~0 499923)) (< main_~x~0 (+ 999924 main_~y~0)))))} is VALID [2022-04-15 06:56:53,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {47430#true} call #t~ret9 := main(); {47430#true} is VALID [2022-04-15 06:56:53,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47430#true} {47430#true} #52#return; {47430#true} is VALID [2022-04-15 06:56:53,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {47430#true} assume true; {47430#true} is VALID [2022-04-15 06:56:53,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {47430#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(17, 2);call #Ultimate.allocInit(12, 3); {47430#true} is VALID [2022-04-15 06:56:53,563 INFO L272 TraceCheckUtils]: 0: Hoare triple {47430#true} call ULTIMATE.init(); {47430#true} is VALID [2022-04-15 06:56:53,563 INFO L134 CoverageAnalysis]: Checked inductivity of 743 backedges. 0 proven. 743 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:56:53,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988838387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:56:53,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:56:53,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 44, 44] total 126 [2022-04-15 06:56:58,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:56:58,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [510920371] [2022-04-15 06:56:58,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [510920371] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:56:58,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:56:58,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [113] imperfect sequences [] total 113 [2022-04-15 06:56:58,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432917393] [2022-04-15 06:56:58,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:56:58,316 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 190 [2022-04-15 06:56:58,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:56:58,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 06:56:58,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:56:58,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-04-15 06:56:58,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:56:58,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-04-15 06:56:58,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13471, Invalid=24749, Unknown=0, NotChecked=0, Total=38220 [2022-04-15 06:56:58,463 INFO L87 Difference]: Start difference. First operand 191 states and 194 transitions. Second operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 06:57:19,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:19,921 INFO L93 Difference]: Finished difference Result 379 states and 390 transitions. [2022-04-15 06:57:19,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-04-15 06:57:19,921 INFO L78 Accepts]: Start accepts. Automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 190 [2022-04-15 06:57:19,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:19,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 06:57:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 212 transitions. [2022-04-15 06:57:19,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 06:57:19,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 212 transitions. [2022-04-15 06:57:19,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 212 transitions. [2022-04-15 06:57:20,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:20,104 INFO L225 Difference]: With dead ends: 379 [2022-04-15 06:57:20,104 INFO L226 Difference]: Without dead ends: 196 [2022-04-15 06:57:20,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31729 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=25761, Invalid=67569, Unknown=0, NotChecked=0, Total=93330 [2022-04-15 06:57:20,109 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 297 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 10078 mSolverCounterSat, 340 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 10418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 340 IncrementalHoareTripleChecker+Valid, 10078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:20,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 54 Invalid, 10418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [340 Valid, 10078 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-04-15 06:57:20,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-04-15 06:57:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-04-15 06:57:20,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:20,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 06:57:20,426 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 06:57:20,426 INFO L87 Difference]: Start difference. First operand 196 states. Second operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 06:57:20,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:20,428 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2022-04-15 06:57:20,428 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2022-04-15 06:57:20,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:20,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:20,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 196 states. [2022-04-15 06:57:20,428 INFO L87 Difference]: Start difference. First operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 196 states. [2022-04-15 06:57:20,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:20,430 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2022-04-15 06:57:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2022-04-15 06:57:20,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:20,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:20,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:20,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:20,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 191 states have (on average 1.0209424083769634) internal successors, (195), 191 states have internal predecessors, (195), 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 06:57:20,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 199 transitions. [2022-04-15 06:57:20,433 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 199 transitions. Word has length 190 [2022-04-15 06:57:20,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:20,433 INFO L478 AbstractCegarLoop]: Abstraction has 196 states and 199 transitions. [2022-04-15 06:57:20,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 113 states, 113 states have (on average 1.6460176991150441) internal successors, (186), 112 states have internal predecessors, (186), 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 06:57:20,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 196 states and 199 transitions. [2022-04-15 06:57:20,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:20,601 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 199 transitions. [2022-04-15 06:57:20,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-15 06:57:20,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:20,601 INFO L499 BasicCegarLoop]: trace histogram [72, 71, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:20,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:20,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-04-15 06:57:20,802 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:20,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:20,802 INFO L85 PathProgramCache]: Analyzing trace with hash 780665478, now seen corresponding path program 39 times [2022-04-15 06:57:20,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:20,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1982542471] [2022-04-15 06:57:20,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:21,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:21,175 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:21,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1698597410, now seen corresponding path program 1 times [2022-04-15 06:57:21,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:21,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558765957] [2022-04-15 06:57:21,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:21,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:21,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:21,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {49753#(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(17, 2);call #Ultimate.allocInit(12, 3); {49708#true} is VALID [2022-04-15 06:57:21,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {49708#true} assume true; {49708#true} is VALID [2022-04-15 06:57:21,964 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49708#true} {49708#true} #52#return; {49708#true} is VALID [2022-04-15 06:57:21,965 INFO L272 TraceCheckUtils]: 0: Hoare triple {49708#true} call ULTIMATE.init(); {49753#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:21,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {49753#(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(17, 2);call #Ultimate.allocInit(12, 3); {49708#true} is VALID [2022-04-15 06:57:21,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {49708#true} assume true; {49708#true} is VALID [2022-04-15 06:57:21,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49708#true} {49708#true} #52#return; {49708#true} is VALID [2022-04-15 06:57:21,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {49708#true} call #t~ret9 := main(); {49708#true} is VALID [2022-04-15 06:57:21,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {49708#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:21,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {49713#(<= 500000 main_~y~0)} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2703 v_main_~x~0_2702)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_2703)) (and .cse0 .cse1) (and (< v_main_~x~0_2702 500001) (< v_main_~x~0_2703 v_main_~x~0_2702)))) InVars {main_~x~0=v_main_~x~0_2703, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:21,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {49713#(<= 500000 main_~y~0)} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:21,968 INFO L290 TraceCheckUtils]: 8: Hoare triple {49713#(<= 500000 main_~y~0)} [214] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse2 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse3 (= v_main_~y~0_3117 v_main_~y~0_3116)) (.cse0 (<= 500000 v_main_~x~0_2705))) (or (and (or (not .cse0) (not (< v_main_~x~0_2705 1000000))) (= v_main_~x~0_2704 v_main_~x~0_2705) .cse1 .cse2 .cse3) (and (= v_main_~x~0_2705 v_main_~x~0_2704) .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2705 v_main_~y~0_3116))) (and (< v_main_~y~0_3117 v_main_~y~0_3116) (< .cse4 (+ 1000001 v_main_~y~0_3117)) .cse0 (= .cse4 (+ v_main_~x~0_2704 v_main_~y~0_3117)))))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2705, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3116, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2704, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:21,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {49713#(<= 500000 main_~y~0)} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:21,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {49713#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49714#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:57:21,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {49714#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49715#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:57:21,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {49715#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49716#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:57:21,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {49716#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49717#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:57:21,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {49717#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49718#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:57:21,987 INFO L290 TraceCheckUtils]: 15: Hoare triple {49718#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49719#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:57:21,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {49719#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49720#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:57:21,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {49720#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49721#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:57:21,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {49721#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49722#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:57:21,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {49722#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49723#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:57:21,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {49723#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49724#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:57:21,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {49724#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49725#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:57:21,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {49725#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49726#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:57:21,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {49726#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49727#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:57:21,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {49727#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49728#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:57:21,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {49728#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49729#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:57:21,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {49729#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49730#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:57:21,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {49730#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49731#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:57:21,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {49731#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49732#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:57:21,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {49732#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49733#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:57:21,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {49733#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49734#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:57:21,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {49734#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49735#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:57:21,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {49735#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49736#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:57:21,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {49736#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49737#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:57:21,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {49737#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49738#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:57:21,998 INFO L290 TraceCheckUtils]: 35: Hoare triple {49738#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49739#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:57:21,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {49739#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49740#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:57:21,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {49740#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49741#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:57:21,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {49741#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49742#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:57:22,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {49742#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49743#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:57:22,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {49743#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49744#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:57:22,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {49744#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49745#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:57:22,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {49745#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49746#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:57:22,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {49746#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49747#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:57:22,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {49747#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49748#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:57:22,003 INFO L290 TraceCheckUtils]: 45: Hoare triple {49748#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49749#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:57:22,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {49749#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49750#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:57:22,004 INFO L290 TraceCheckUtils]: 47: Hoare triple {49750#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49751#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:57:22,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {49751#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49752#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:57:22,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {49752#(<= 499922 main_~y~0)} assume !(~y~0 > 0); {49709#false} is VALID [2022-04-15 06:57:22,004 INFO L272 TraceCheckUtils]: 50: Hoare triple {49709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {49709#false} is VALID [2022-04-15 06:57:22,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {49709#false} ~cond := #in~cond; {49709#false} is VALID [2022-04-15 06:57:22,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {49709#false} assume 0 == ~cond; {49709#false} is VALID [2022-04-15 06:57:22,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {49709#false} assume !false; {49709#false} is VALID [2022-04-15 06:57:22,005 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:22,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:22,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558765957] [2022-04-15 06:57:22,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558765957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:22,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945138653] [2022-04-15 06:57:22,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:22,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:22,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:22,007 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:22,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 06:57:22,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:22,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 06:57:22,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:22,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:22,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {49708#true} call ULTIMATE.init(); {49708#true} is VALID [2022-04-15 06:57:22,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {49708#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(17, 2);call #Ultimate.allocInit(12, 3); {49708#true} is VALID [2022-04-15 06:57:22,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {49708#true} assume true; {49708#true} is VALID [2022-04-15 06:57:22,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49708#true} {49708#true} #52#return; {49708#true} is VALID [2022-04-15 06:57:22,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {49708#true} call #t~ret9 := main(); {49708#true} is VALID [2022-04-15 06:57:22,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {49708#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:22,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {49713#(<= 500000 main_~y~0)} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2703 v_main_~x~0_2702)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_2703)) (and .cse0 .cse1) (and (< v_main_~x~0_2702 500001) (< v_main_~x~0_2703 v_main_~x~0_2702)))) InVars {main_~x~0=v_main_~x~0_2703, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:22,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {49713#(<= 500000 main_~y~0)} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:22,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {49713#(<= 500000 main_~y~0)} [214] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse2 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse3 (= v_main_~y~0_3117 v_main_~y~0_3116)) (.cse0 (<= 500000 v_main_~x~0_2705))) (or (and (or (not .cse0) (not (< v_main_~x~0_2705 1000000))) (= v_main_~x~0_2704 v_main_~x~0_2705) .cse1 .cse2 .cse3) (and (= v_main_~x~0_2705 v_main_~x~0_2704) .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2705 v_main_~y~0_3116))) (and (< v_main_~y~0_3117 v_main_~y~0_3116) (< .cse4 (+ 1000001 v_main_~y~0_3117)) .cse0 (= .cse4 (+ v_main_~x~0_2704 v_main_~y~0_3117)))))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2705, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3116, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2704, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:22,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {49713#(<= 500000 main_~y~0)} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {49713#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:22,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {49713#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49714#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:57:22,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {49714#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49715#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:57:22,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {49715#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49716#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:57:22,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {49716#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49717#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:57:22,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {49717#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49718#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:57:22,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {49718#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49719#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:57:22,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {49719#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49720#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:57:22,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {49720#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49721#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:57:22,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {49721#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49722#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:57:22,593 INFO L290 TraceCheckUtils]: 19: Hoare triple {49722#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49723#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:57:22,594 INFO L290 TraceCheckUtils]: 20: Hoare triple {49723#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49724#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:57:22,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {49724#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49725#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:57:22,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {49725#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49726#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:57:22,595 INFO L290 TraceCheckUtils]: 23: Hoare triple {49726#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49727#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:57:22,596 INFO L290 TraceCheckUtils]: 24: Hoare triple {49727#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49728#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:57:22,596 INFO L290 TraceCheckUtils]: 25: Hoare triple {49728#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49729#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:57:22,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {49729#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49730#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:57:22,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {49730#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49731#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:57:22,598 INFO L290 TraceCheckUtils]: 28: Hoare triple {49731#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49732#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:57:22,598 INFO L290 TraceCheckUtils]: 29: Hoare triple {49732#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49733#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:57:22,599 INFO L290 TraceCheckUtils]: 30: Hoare triple {49733#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49734#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:57:22,599 INFO L290 TraceCheckUtils]: 31: Hoare triple {49734#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49735#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:57:22,600 INFO L290 TraceCheckUtils]: 32: Hoare triple {49735#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49736#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:57:22,600 INFO L290 TraceCheckUtils]: 33: Hoare triple {49736#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49737#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:57:22,601 INFO L290 TraceCheckUtils]: 34: Hoare triple {49737#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49738#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:57:22,601 INFO L290 TraceCheckUtils]: 35: Hoare triple {49738#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49739#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:57:22,602 INFO L290 TraceCheckUtils]: 36: Hoare triple {49739#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49740#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:57:22,602 INFO L290 TraceCheckUtils]: 37: Hoare triple {49740#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49741#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:57:22,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {49741#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49742#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:57:22,603 INFO L290 TraceCheckUtils]: 39: Hoare triple {49742#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49743#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:57:22,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {49743#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49744#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:57:22,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {49744#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49745#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:57:22,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {49745#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49746#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:57:22,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {49746#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49747#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:57:22,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {49747#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49748#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:57:22,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {49748#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49749#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:57:22,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {49749#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49750#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:57:22,607 INFO L290 TraceCheckUtils]: 47: Hoare triple {49750#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49751#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:57:22,607 INFO L290 TraceCheckUtils]: 48: Hoare triple {49751#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49752#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:57:22,608 INFO L290 TraceCheckUtils]: 49: Hoare triple {49752#(<= 499922 main_~y~0)} assume !(~y~0 > 0); {49709#false} is VALID [2022-04-15 06:57:22,608 INFO L272 TraceCheckUtils]: 50: Hoare triple {49709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {49709#false} is VALID [2022-04-15 06:57:22,608 INFO L290 TraceCheckUtils]: 51: Hoare triple {49709#false} ~cond := #in~cond; {49709#false} is VALID [2022-04-15 06:57:22,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {49709#false} assume 0 == ~cond; {49709#false} is VALID [2022-04-15 06:57:22,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {49709#false} assume !false; {49709#false} is VALID [2022-04-15 06:57:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:22,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:24,798 INFO L290 TraceCheckUtils]: 53: Hoare triple {49709#false} assume !false; {49709#false} is VALID [2022-04-15 06:57:24,799 INFO L290 TraceCheckUtils]: 52: Hoare triple {49709#false} assume 0 == ~cond; {49709#false} is VALID [2022-04-15 06:57:24,799 INFO L290 TraceCheckUtils]: 51: Hoare triple {49709#false} ~cond := #in~cond; {49709#false} is VALID [2022-04-15 06:57:24,799 INFO L272 TraceCheckUtils]: 50: Hoare triple {49709#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {49709#false} is VALID [2022-04-15 06:57:24,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {49928#(< 0 main_~y~0)} assume !(~y~0 > 0); {49709#false} is VALID [2022-04-15 06:57:24,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {49932#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49928#(< 0 main_~y~0)} is VALID [2022-04-15 06:57:24,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {49936#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49932#(< 2 main_~y~0)} is VALID [2022-04-15 06:57:24,801 INFO L290 TraceCheckUtils]: 46: Hoare triple {49940#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49936#(< 4 main_~y~0)} is VALID [2022-04-15 06:57:24,801 INFO L290 TraceCheckUtils]: 45: Hoare triple {49944#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49940#(< 6 main_~y~0)} is VALID [2022-04-15 06:57:24,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {49948#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49944#(< 8 main_~y~0)} is VALID [2022-04-15 06:57:24,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {49952#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49948#(< 10 main_~y~0)} is VALID [2022-04-15 06:57:24,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {49956#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49952#(< 12 main_~y~0)} is VALID [2022-04-15 06:57:24,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {49960#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49956#(< 14 main_~y~0)} is VALID [2022-04-15 06:57:24,804 INFO L290 TraceCheckUtils]: 40: Hoare triple {49964#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49960#(< 16 main_~y~0)} is VALID [2022-04-15 06:57:24,804 INFO L290 TraceCheckUtils]: 39: Hoare triple {49968#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49964#(< 18 main_~y~0)} is VALID [2022-04-15 06:57:24,805 INFO L290 TraceCheckUtils]: 38: Hoare triple {49972#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49968#(< 20 main_~y~0)} is VALID [2022-04-15 06:57:24,805 INFO L290 TraceCheckUtils]: 37: Hoare triple {49976#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49972#(< 22 main_~y~0)} is VALID [2022-04-15 06:57:24,806 INFO L290 TraceCheckUtils]: 36: Hoare triple {49980#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49976#(< 24 main_~y~0)} is VALID [2022-04-15 06:57:24,806 INFO L290 TraceCheckUtils]: 35: Hoare triple {49984#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49980#(< 26 main_~y~0)} is VALID [2022-04-15 06:57:24,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {49988#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49984#(< 28 main_~y~0)} is VALID [2022-04-15 06:57:24,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {49992#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49988#(< 30 main_~y~0)} is VALID [2022-04-15 06:57:24,807 INFO L290 TraceCheckUtils]: 32: Hoare triple {49996#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49992#(< 32 main_~y~0)} is VALID [2022-04-15 06:57:24,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {50000#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {49996#(< 34 main_~y~0)} is VALID [2022-04-15 06:57:24,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {50004#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50000#(< 36 main_~y~0)} is VALID [2022-04-15 06:57:24,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {50008#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50004#(< 38 main_~y~0)} is VALID [2022-04-15 06:57:24,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {50012#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50008#(< 40 main_~y~0)} is VALID [2022-04-15 06:57:24,810 INFO L290 TraceCheckUtils]: 27: Hoare triple {50016#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50012#(< 42 main_~y~0)} is VALID [2022-04-15 06:57:24,810 INFO L290 TraceCheckUtils]: 26: Hoare triple {50020#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50016#(< 44 main_~y~0)} is VALID [2022-04-15 06:57:24,811 INFO L290 TraceCheckUtils]: 25: Hoare triple {50024#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50020#(< 46 main_~y~0)} is VALID [2022-04-15 06:57:24,811 INFO L290 TraceCheckUtils]: 24: Hoare triple {50028#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50024#(< 48 main_~y~0)} is VALID [2022-04-15 06:57:24,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {50032#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50028#(< 50 main_~y~0)} is VALID [2022-04-15 06:57:24,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {50036#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50032#(< 52 main_~y~0)} is VALID [2022-04-15 06:57:24,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {50040#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50036#(< 54 main_~y~0)} is VALID [2022-04-15 06:57:24,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {50044#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50040#(< 56 main_~y~0)} is VALID [2022-04-15 06:57:24,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {50048#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50044#(< 58 main_~y~0)} is VALID [2022-04-15 06:57:24,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {50052#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50048#(< 60 main_~y~0)} is VALID [2022-04-15 06:57:24,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {50056#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50052#(< 62 main_~y~0)} is VALID [2022-04-15 06:57:24,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {50060#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50056#(< 64 main_~y~0)} is VALID [2022-04-15 06:57:24,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {50064#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50060#(< 66 main_~y~0)} is VALID [2022-04-15 06:57:24,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {50068#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50064#(< 68 main_~y~0)} is VALID [2022-04-15 06:57:24,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {50072#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50068#(< 70 main_~y~0)} is VALID [2022-04-15 06:57:24,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {50076#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50072#(< 72 main_~y~0)} is VALID [2022-04-15 06:57:24,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {50080#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50076#(< 74 main_~y~0)} is VALID [2022-04-15 06:57:24,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {50084#(< 78 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {50080#(< 76 main_~y~0)} is VALID [2022-04-15 06:57:24,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {50084#(< 78 main_~y~0)} [211] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {50084#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:24,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {50084#(< 78 main_~y~0)} [214] L11-2-->L18-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse2 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse3 (= v_main_~y~0_3117 v_main_~y~0_3116)) (.cse0 (<= 500000 v_main_~x~0_2705))) (or (and (or (not .cse0) (not (< v_main_~x~0_2705 1000000))) (= v_main_~x~0_2704 v_main_~x~0_2705) .cse1 .cse2 .cse3) (and (= v_main_~x~0_2705 v_main_~x~0_2704) .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2705 v_main_~y~0_3116))) (and (< v_main_~y~0_3117 v_main_~y~0_3116) (< .cse4 (+ 1000001 v_main_~y~0_3117)) .cse0 (= .cse4 (+ v_main_~x~0_2704 v_main_~y~0_3117)))))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2705, main_#t~post6=|v_main_#t~post6_270|} OutVars{main_~y~0=v_main_~y~0_3116, main_#t~post5=|v_main_#t~post5_269|, main_~x~0=v_main_~x~0_2704, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50084#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:24,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {50084#(< 78 main_~y~0)} [213] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50084#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:24,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {50084#(< 78 main_~y~0)} [212] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2703 v_main_~x~0_2702)) (.cse1 (= |v_main_#t~post4_247| |v_main_#t~post4_246|))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_2703)) (and .cse0 .cse1) (and (< v_main_~x~0_2702 500001) (< v_main_~x~0_2703 v_main_~x~0_2702)))) InVars {main_~x~0=v_main_~x~0_2703, main_#t~post4=|v_main_#t~post4_247|} OutVars{main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50084#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:24,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {49708#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {50084#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:24,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {49708#true} call #t~ret9 := main(); {49708#true} is VALID [2022-04-15 06:57:24,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49708#true} {49708#true} #52#return; {49708#true} is VALID [2022-04-15 06:57:24,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {49708#true} assume true; {49708#true} is VALID [2022-04-15 06:57:24,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {49708#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(17, 2);call #Ultimate.allocInit(12, 3); {49708#true} is VALID [2022-04-15 06:57:24,821 INFO L272 TraceCheckUtils]: 0: Hoare triple {49708#true} call ULTIMATE.init(); {49708#true} is VALID [2022-04-15 06:57:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:24,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945138653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:24,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:24,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 83 [2022-04-15 06:57:28,585 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:57:28,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1982542471] [2022-04-15 06:57:28,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1982542471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:57:28,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:57:28,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2022-04-15 06:57:28,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892629753] [2022-04-15 06:57:28,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:57:28,586 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 195 [2022-04-15 06:57:28,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:57:28,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 06:57:28,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:28,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-04-15 06:57:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-04-15 06:57:28,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9381, Invalid=14799, Unknown=0, NotChecked=0, Total=24180 [2022-04-15 06:57:28,734 INFO L87 Difference]: Start difference. First operand 196 states and 199 transitions. Second operand has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 06:57:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:50,264 INFO L93 Difference]: Finished difference Result 389 states and 400 transitions. [2022-04-15 06:57:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-04-15 06:57:50,264 INFO L78 Accepts]: Start accepts. Automaton has has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 195 [2022-04-15 06:57:50,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:57:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 06:57:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 217 transitions. [2022-04-15 06:57:50,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 06:57:50,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 217 transitions. [2022-04-15 06:57:50,267 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 217 transitions. [2022-04-15 06:57:50,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:50,446 INFO L225 Difference]: With dead ends: 389 [2022-04-15 06:57:50,446 INFO L226 Difference]: Without dead ends: 201 [2022-04-15 06:57:50,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21057 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=21897, Invalid=50195, Unknown=0, NotChecked=0, Total=72092 [2022-04-15 06:57:50,450 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 232 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 10625 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 10975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 10625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:57:50,450 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [232 Valid, 39 Invalid, 10975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 10625 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-15 06:57:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-15 06:57:50,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-04-15 06:57:50,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:57:50,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 06:57:50,763 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 06:57:50,763 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 06:57:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:50,765 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2022-04-15 06:57:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2022-04-15 06:57:50,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:50,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:50,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 201 states. [2022-04-15 06:57:50,766 INFO L87 Difference]: Start difference. First operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 201 states. [2022-04-15 06:57:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:57:50,768 INFO L93 Difference]: Finished difference Result 201 states and 204 transitions. [2022-04-15 06:57:50,768 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2022-04-15 06:57:50,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:57:50,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:57:50,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:57:50,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:57:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0204081632653061) internal successors, (200), 196 states have internal predecessors, (200), 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 06:57:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2022-04-15 06:57:50,772 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 195 [2022-04-15 06:57:50,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:57:50,773 INFO L478 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2022-04-15 06:57:50,773 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 116 states, 116 states have (on average 1.646551724137931) internal successors, (191), 115 states have internal predecessors, (191), 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 06:57:50,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 201 states and 204 transitions. [2022-04-15 06:57:50,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:57:50,982 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2022-04-15 06:57:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-15 06:57:50,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:57:50,983 INFO L499 BasicCegarLoop]: trace histogram [74, 73, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:57:51,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 06:57:51,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 06:57:51,183 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:57:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:57:51,184 INFO L85 PathProgramCache]: Analyzing trace with hash -243023257, now seen corresponding path program 40 times [2022-04-15 06:57:51,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:57:51,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439205050] [2022-04-15 06:57:51,285 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:55,412 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 06:57:55,530 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:57:55,531 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:57:55,533 INFO L85 PathProgramCache]: Analyzing trace with hash -439829375, now seen corresponding path program 1 times [2022-04-15 06:57:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:57:55,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275737326] [2022-04-15 06:57:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:55,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:57:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:57:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:56,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {52044#(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(17, 2);call #Ultimate.allocInit(12, 3); {51998#true} is VALID [2022-04-15 06:57:56,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {51998#true} assume true; {51998#true} is VALID [2022-04-15 06:57:56,488 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51998#true} {51998#true} #52#return; {51998#true} is VALID [2022-04-15 06:57:56,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {51998#true} call ULTIMATE.init(); {52044#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:57:56,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {52044#(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(17, 2);call #Ultimate.allocInit(12, 3); {51998#true} is VALID [2022-04-15 06:57:56,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {51998#true} assume true; {51998#true} is VALID [2022-04-15 06:57:56,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51998#true} {51998#true} #52#return; {51998#true} is VALID [2022-04-15 06:57:56,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {51998#true} call #t~ret9 := main(); {51998#true} is VALID [2022-04-15 06:57:56,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {51998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:56,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {52003#(<= 500000 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2830 v_main_~x~0_2829) .cse0) (and (not (< v_main_~x~0_2830 500000)) .cse0 (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829)))) InVars {main_~x~0=v_main_~x~0_2830, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:56,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {52003#(<= 500000 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:56,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {52003#(<= 500000 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_2832)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse2 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse3 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2832 1000000)))) (let ((.cse5 (+ v_main_~x~0_2832 v_main_~y~0_3274))) (and (< v_main_~y~0_3275 v_main_~y~0_3274) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_3275)) (= (+ v_main_~x~0_2831 v_main_~y~0_3275) .cse5))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2832, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3274, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2831, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:56,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {52003#(<= 500000 main_~y~0)} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:56,492 INFO L290 TraceCheckUtils]: 10: Hoare triple {52003#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52004#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:57:56,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {52004#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52005#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:57:56,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {52005#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52006#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:57:56,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {52006#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52007#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:57:56,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {52007#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52008#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:57:56,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {52008#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52009#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:57:56,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {52009#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52010#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:57:56,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {52010#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52011#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:57:56,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {52011#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52012#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:57:56,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {52012#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52013#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:57:56,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {52013#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52014#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:57:56,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {52014#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52015#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:57:56,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {52015#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52016#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:57:56,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {52016#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52017#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:57:56,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {52017#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52018#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:57:56,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {52018#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52019#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:57:56,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {52019#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52020#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:57:56,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {52020#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52021#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:57:56,504 INFO L290 TraceCheckUtils]: 28: Hoare triple {52021#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52022#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:57:56,504 INFO L290 TraceCheckUtils]: 29: Hoare triple {52022#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52023#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:57:56,505 INFO L290 TraceCheckUtils]: 30: Hoare triple {52023#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52024#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:57:56,505 INFO L290 TraceCheckUtils]: 31: Hoare triple {52024#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52025#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:57:56,506 INFO L290 TraceCheckUtils]: 32: Hoare triple {52025#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52026#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:57:56,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {52026#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52027#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:57:56,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {52027#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52028#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:57:56,508 INFO L290 TraceCheckUtils]: 35: Hoare triple {52028#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52029#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:57:56,509 INFO L290 TraceCheckUtils]: 36: Hoare triple {52029#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52030#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:57:56,509 INFO L290 TraceCheckUtils]: 37: Hoare triple {52030#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52031#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:57:56,510 INFO L290 TraceCheckUtils]: 38: Hoare triple {52031#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52032#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:57:56,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {52032#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52033#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:57:56,511 INFO L290 TraceCheckUtils]: 40: Hoare triple {52033#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52034#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:57:56,512 INFO L290 TraceCheckUtils]: 41: Hoare triple {52034#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52035#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:57:56,512 INFO L290 TraceCheckUtils]: 42: Hoare triple {52035#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52036#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:57:56,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {52036#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52037#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:57:56,514 INFO L290 TraceCheckUtils]: 44: Hoare triple {52037#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52038#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:57:56,514 INFO L290 TraceCheckUtils]: 45: Hoare triple {52038#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52039#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:57:56,515 INFO L290 TraceCheckUtils]: 46: Hoare triple {52039#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52040#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:57:56,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {52040#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52041#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:57:56,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {52041#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52042#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:57:56,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {52042#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52043#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:57:56,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {52043#(<= 499920 main_~y~0)} assume !(~y~0 > 0); {51999#false} is VALID [2022-04-15 06:57:56,517 INFO L272 TraceCheckUtils]: 51: Hoare triple {51999#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {51999#false} is VALID [2022-04-15 06:57:56,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {51999#false} ~cond := #in~cond; {51999#false} is VALID [2022-04-15 06:57:56,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {51999#false} assume 0 == ~cond; {51999#false} is VALID [2022-04-15 06:57:56,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {51999#false} assume !false; {51999#false} is VALID [2022-04-15 06:57:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:57:56,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275737326] [2022-04-15 06:57:56,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275737326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:57:56,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672772348] [2022-04-15 06:57:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:57:56,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:57:56,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:57:56,520 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:57:56,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 06:57:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:56,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 06:57:56,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:57:56,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:57:57,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {51998#true} call ULTIMATE.init(); {51998#true} is VALID [2022-04-15 06:57:57,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {51998#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(17, 2);call #Ultimate.allocInit(12, 3); {51998#true} is VALID [2022-04-15 06:57:57,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {51998#true} assume true; {51998#true} is VALID [2022-04-15 06:57:57,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51998#true} {51998#true} #52#return; {51998#true} is VALID [2022-04-15 06:57:57,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {51998#true} call #t~ret9 := main(); {51998#true} is VALID [2022-04-15 06:57:57,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {51998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:57,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {52003#(<= 500000 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2830 v_main_~x~0_2829) .cse0) (and (not (< v_main_~x~0_2830 500000)) .cse0 (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829)))) InVars {main_~x~0=v_main_~x~0_2830, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:57,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {52003#(<= 500000 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:57,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {52003#(<= 500000 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_2832)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse2 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse3 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2832 1000000)))) (let ((.cse5 (+ v_main_~x~0_2832 v_main_~y~0_3274))) (and (< v_main_~y~0_3275 v_main_~y~0_3274) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_3275)) (= (+ v_main_~x~0_2831 v_main_~y~0_3275) .cse5))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2832, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3274, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2831, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:57,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {52003#(<= 500000 main_~y~0)} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {52003#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:57:57,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {52003#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52004#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:57:57,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {52004#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52005#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:57:57,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {52005#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52006#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:57:57,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {52006#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52007#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:57:57,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {52007#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52008#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:57:57,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {52008#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52009#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:57:57,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {52009#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52010#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:57:57,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {52010#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52011#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:57:57,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {52011#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52012#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:57:57,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {52012#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52013#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:57:57,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {52013#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52014#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:57:57,117 INFO L290 TraceCheckUtils]: 21: Hoare triple {52014#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52015#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:57:57,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {52015#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52016#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:57:57,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {52016#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52017#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:57:57,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {52017#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52018#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:57:57,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {52018#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52019#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:57:57,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {52019#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52020#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:57:57,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {52020#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52021#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:57:57,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {52021#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52022#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:57:57,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {52022#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52023#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:57:57,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {52023#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52024#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:57:57,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {52024#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52025#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:57:57,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {52025#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52026#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:57:57,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {52026#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52027#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:57:57,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {52027#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52028#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:57:57,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {52028#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52029#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:57:57,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {52029#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52030#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:57:57,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {52030#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52031#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:57:57,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {52031#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52032#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:57:57,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {52032#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52033#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:57:57,127 INFO L290 TraceCheckUtils]: 40: Hoare triple {52033#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52034#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:57:57,127 INFO L290 TraceCheckUtils]: 41: Hoare triple {52034#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52035#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:57:57,128 INFO L290 TraceCheckUtils]: 42: Hoare triple {52035#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52036#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:57:57,128 INFO L290 TraceCheckUtils]: 43: Hoare triple {52036#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52037#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:57:57,129 INFO L290 TraceCheckUtils]: 44: Hoare triple {52037#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52038#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:57:57,129 INFO L290 TraceCheckUtils]: 45: Hoare triple {52038#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52039#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:57:57,130 INFO L290 TraceCheckUtils]: 46: Hoare triple {52039#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52040#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:57:57,130 INFO L290 TraceCheckUtils]: 47: Hoare triple {52040#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52041#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:57:57,131 INFO L290 TraceCheckUtils]: 48: Hoare triple {52041#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52042#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:57:57,131 INFO L290 TraceCheckUtils]: 49: Hoare triple {52042#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52043#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:57:57,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {52043#(<= 499920 main_~y~0)} assume !(~y~0 > 0); {51999#false} is VALID [2022-04-15 06:57:57,132 INFO L272 TraceCheckUtils]: 51: Hoare triple {51999#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {51999#false} is VALID [2022-04-15 06:57:57,132 INFO L290 TraceCheckUtils]: 52: Hoare triple {51999#false} ~cond := #in~cond; {51999#false} is VALID [2022-04-15 06:57:57,132 INFO L290 TraceCheckUtils]: 53: Hoare triple {51999#false} assume 0 == ~cond; {51999#false} is VALID [2022-04-15 06:57:57,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {51999#false} assume !false; {51999#false} is VALID [2022-04-15 06:57:57,132 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:57,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:57:59,385 INFO L290 TraceCheckUtils]: 54: Hoare triple {51999#false} assume !false; {51999#false} is VALID [2022-04-15 06:57:59,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {51999#false} assume 0 == ~cond; {51999#false} is VALID [2022-04-15 06:57:59,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {51999#false} ~cond := #in~cond; {51999#false} is VALID [2022-04-15 06:57:59,386 INFO L272 TraceCheckUtils]: 51: Hoare triple {51999#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {51999#false} is VALID [2022-04-15 06:57:59,386 INFO L290 TraceCheckUtils]: 50: Hoare triple {52222#(< 0 main_~y~0)} assume !(~y~0 > 0); {51999#false} is VALID [2022-04-15 06:57:59,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {52226#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52222#(< 0 main_~y~0)} is VALID [2022-04-15 06:57:59,387 INFO L290 TraceCheckUtils]: 48: Hoare triple {52230#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52226#(< 2 main_~y~0)} is VALID [2022-04-15 06:57:59,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {52234#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52230#(< 4 main_~y~0)} is VALID [2022-04-15 06:57:59,389 INFO L290 TraceCheckUtils]: 46: Hoare triple {52238#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52234#(< 6 main_~y~0)} is VALID [2022-04-15 06:57:59,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {52242#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52238#(< 8 main_~y~0)} is VALID [2022-04-15 06:57:59,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {52246#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52242#(< 10 main_~y~0)} is VALID [2022-04-15 06:57:59,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {52250#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52246#(< 12 main_~y~0)} is VALID [2022-04-15 06:57:59,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {52254#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52250#(< 14 main_~y~0)} is VALID [2022-04-15 06:57:59,391 INFO L290 TraceCheckUtils]: 41: Hoare triple {52258#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52254#(< 16 main_~y~0)} is VALID [2022-04-15 06:57:59,392 INFO L290 TraceCheckUtils]: 40: Hoare triple {52262#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52258#(< 18 main_~y~0)} is VALID [2022-04-15 06:57:59,392 INFO L290 TraceCheckUtils]: 39: Hoare triple {52266#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52262#(< 20 main_~y~0)} is VALID [2022-04-15 06:57:59,392 INFO L290 TraceCheckUtils]: 38: Hoare triple {52270#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52266#(< 22 main_~y~0)} is VALID [2022-04-15 06:57:59,393 INFO L290 TraceCheckUtils]: 37: Hoare triple {52274#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52270#(< 24 main_~y~0)} is VALID [2022-04-15 06:57:59,393 INFO L290 TraceCheckUtils]: 36: Hoare triple {52278#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52274#(< 26 main_~y~0)} is VALID [2022-04-15 06:57:59,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {52282#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52278#(< 28 main_~y~0)} is VALID [2022-04-15 06:57:59,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {52286#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52282#(< 30 main_~y~0)} is VALID [2022-04-15 06:57:59,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {52290#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52286#(< 32 main_~y~0)} is VALID [2022-04-15 06:57:59,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {52294#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52290#(< 34 main_~y~0)} is VALID [2022-04-15 06:57:59,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {52298#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52294#(< 36 main_~y~0)} is VALID [2022-04-15 06:57:59,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {52302#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52298#(< 38 main_~y~0)} is VALID [2022-04-15 06:57:59,397 INFO L290 TraceCheckUtils]: 29: Hoare triple {52306#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52302#(< 40 main_~y~0)} is VALID [2022-04-15 06:57:59,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {52310#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52306#(< 42 main_~y~0)} is VALID [2022-04-15 06:57:59,398 INFO L290 TraceCheckUtils]: 27: Hoare triple {52314#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52310#(< 44 main_~y~0)} is VALID [2022-04-15 06:57:59,398 INFO L290 TraceCheckUtils]: 26: Hoare triple {52318#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52314#(< 46 main_~y~0)} is VALID [2022-04-15 06:57:59,399 INFO L290 TraceCheckUtils]: 25: Hoare triple {52322#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52318#(< 48 main_~y~0)} is VALID [2022-04-15 06:57:59,399 INFO L290 TraceCheckUtils]: 24: Hoare triple {52326#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52322#(< 50 main_~y~0)} is VALID [2022-04-15 06:57:59,400 INFO L290 TraceCheckUtils]: 23: Hoare triple {52330#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52326#(< 52 main_~y~0)} is VALID [2022-04-15 06:57:59,400 INFO L290 TraceCheckUtils]: 22: Hoare triple {52334#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52330#(< 54 main_~y~0)} is VALID [2022-04-15 06:57:59,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {52338#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52334#(< 56 main_~y~0)} is VALID [2022-04-15 06:57:59,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {52342#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52338#(< 58 main_~y~0)} is VALID [2022-04-15 06:57:59,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {52346#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52342#(< 60 main_~y~0)} is VALID [2022-04-15 06:57:59,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {52350#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52346#(< 62 main_~y~0)} is VALID [2022-04-15 06:57:59,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {52354#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52350#(< 64 main_~y~0)} is VALID [2022-04-15 06:57:59,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {52358#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52354#(< 66 main_~y~0)} is VALID [2022-04-15 06:57:59,404 INFO L290 TraceCheckUtils]: 15: Hoare triple {52362#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52358#(< 68 main_~y~0)} is VALID [2022-04-15 06:57:59,404 INFO L290 TraceCheckUtils]: 14: Hoare triple {52366#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52362#(< 70 main_~y~0)} is VALID [2022-04-15 06:57:59,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {52370#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52366#(< 72 main_~y~0)} is VALID [2022-04-15 06:57:59,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {52374#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52370#(< 74 main_~y~0)} is VALID [2022-04-15 06:57:59,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {52378#(< 78 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52374#(< 76 main_~y~0)} is VALID [2022-04-15 06:57:59,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {52382#(< 80 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {52378#(< 78 main_~y~0)} is VALID [2022-04-15 06:57:59,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {52382#(< 80 main_~y~0)} [215] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {52382#(< 80 main_~y~0)} is VALID [2022-04-15 06:57:59,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {52382#(< 80 main_~y~0)} [218] L11-2-->L18-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_2832)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse1 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse2 (= |v_main_#t~post5_277| |v_main_#t~post5_276|)) (.cse3 (= v_main_~x~0_2832 v_main_~x~0_2831))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_2832 1000000)))) (let ((.cse5 (+ v_main_~x~0_2832 v_main_~y~0_3274))) (and (< v_main_~y~0_3275 v_main_~y~0_3274) .cse4 (< .cse5 (+ 1000001 v_main_~y~0_3275)) (= (+ v_main_~x~0_2831 v_main_~y~0_3275) .cse5))) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2832, main_#t~post6=|v_main_#t~post6_277|} OutVars{main_~y~0=v_main_~y~0_3274, main_#t~post5=|v_main_#t~post5_276|, main_~x~0=v_main_~x~0_2831, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {52382#(< 80 main_~y~0)} is VALID [2022-04-15 06:57:59,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {52382#(< 80 main_~y~0)} [217] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {52382#(< 80 main_~y~0)} is VALID [2022-04-15 06:57:59,408 INFO L290 TraceCheckUtils]: 6: Hoare triple {52382#(< 80 main_~y~0)} [216] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_253| |v_main_#t~post4_252|))) (or (and (= v_main_~x~0_2830 v_main_~x~0_2829) .cse0) (and (not (< v_main_~x~0_2830 500000)) .cse0 (= v_main_~x~0_2829 v_main_~x~0_2830)) (and (< v_main_~x~0_2829 500001) (< v_main_~x~0_2830 v_main_~x~0_2829)))) InVars {main_~x~0=v_main_~x~0_2830, main_#t~post4=|v_main_#t~post4_253|} OutVars{main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {52382#(< 80 main_~y~0)} is VALID [2022-04-15 06:57:59,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {51998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {52382#(< 80 main_~y~0)} is VALID [2022-04-15 06:57:59,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {51998#true} call #t~ret9 := main(); {51998#true} is VALID [2022-04-15 06:57:59,408 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51998#true} {51998#true} #52#return; {51998#true} is VALID [2022-04-15 06:57:59,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {51998#true} assume true; {51998#true} is VALID [2022-04-15 06:57:59,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {51998#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(17, 2);call #Ultimate.allocInit(12, 3); {51998#true} is VALID [2022-04-15 06:57:59,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {51998#true} call ULTIMATE.init(); {51998#true} is VALID [2022-04-15 06:57:59,409 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:57:59,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672772348] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:57:59,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:57:59,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 85 [2022-04-15 06:58:03,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:03,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439205050] [2022-04-15 06:58:03,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439205050] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:03,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:03,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [119] imperfect sequences [] total 119 [2022-04-15 06:58:03,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432271846] [2022-04-15 06:58:03,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:03,386 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 200 [2022-04-15 06:58:03,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:03,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 06:58:03,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 200 edges. 200 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:03,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 119 states [2022-04-15 06:58:03,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:03,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2022-04-15 06:58:03,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9862, Invalid=15578, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 06:58:03,535 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 06:58:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:26,729 INFO L93 Difference]: Finished difference Result 399 states and 410 transitions. [2022-04-15 06:58:26,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2022-04-15 06:58:26,729 INFO L78 Accepts]: Start accepts. Automaton has has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 200 [2022-04-15 06:58:26,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:58:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 06:58:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 222 transitions. [2022-04-15 06:58:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 06:58:26,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 222 transitions. [2022-04-15 06:58:26,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 222 transitions. [2022-04-15 06:58:26,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:26,917 INFO L225 Difference]: With dead ends: 399 [2022-04-15 06:58:26,917 INFO L226 Difference]: Without dead ends: 206 [2022-04-15 06:58:26,921 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22177 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=23020, Invalid=52880, Unknown=0, NotChecked=0, Total=75900 [2022-04-15 06:58:26,925 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 469 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11247 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 11762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 11247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:58:26,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 39 Invalid, 11762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 11247 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-04-15 06:58:26,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-04-15 06:58:27,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-04-15 06:58:27,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:58:27,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 06:58:27,258 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 06:58:27,260 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 06:58:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,263 INFO L93 Difference]: Finished difference Result 206 states and 209 transitions. [2022-04-15 06:58:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 209 transitions. [2022-04-15 06:58:27,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:27,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:27,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 206 states. [2022-04-15 06:58:27,274 INFO L87 Difference]: Start difference. First operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 206 states. [2022-04-15 06:58:27,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:58:27,276 INFO L93 Difference]: Finished difference Result 206 states and 209 transitions. [2022-04-15 06:58:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 209 transitions. [2022-04-15 06:58:27,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:58:27,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:58:27,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:58:27,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:58:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 201 states have (on average 1.0199004975124377) internal successors, (205), 201 states have internal predecessors, (205), 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 06:58:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 209 transitions. [2022-04-15 06:58:27,279 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 209 transitions. Word has length 200 [2022-04-15 06:58:27,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:58:27,279 INFO L478 AbstractCegarLoop]: Abstraction has 206 states and 209 transitions. [2022-04-15 06:58:27,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 119 states, 119 states have (on average 1.6470588235294117) internal successors, (196), 118 states have internal predecessors, (196), 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 06:58:27,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 206 states and 209 transitions. [2022-04-15 06:58:27,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 209 transitions. [2022-04-15 06:58:27,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-04-15 06:58:27,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:58:27,450 INFO L499 BasicCegarLoop]: trace histogram [76, 75, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:58:27,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Ended with exit code 0 [2022-04-15 06:58:27,650 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 06:58:27,650 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:58:27,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:58:27,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1100385106, now seen corresponding path program 41 times [2022-04-15 06:58:27,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:27,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [476307972] [2022-04-15 06:58:27,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:27,995 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:58:27,996 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:58:27,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1464678402, now seen corresponding path program 1 times [2022-04-15 06:58:27,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:58:27,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688272580] [2022-04-15 06:58:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:27,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:58:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:58:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:28,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {54391#(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(17, 2);call #Ultimate.allocInit(12, 3); {54344#true} is VALID [2022-04-15 06:58:28,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {54344#true} assume true; {54344#true} is VALID [2022-04-15 06:58:28,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54344#true} {54344#true} #52#return; {54344#true} is VALID [2022-04-15 06:58:28,888 INFO L272 TraceCheckUtils]: 0: Hoare triple {54344#true} call ULTIMATE.init(); {54391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:58:28,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {54391#(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(17, 2);call #Ultimate.allocInit(12, 3); {54344#true} is VALID [2022-04-15 06:58:28,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {54344#true} assume true; {54344#true} is VALID [2022-04-15 06:58:28,888 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54344#true} {54344#true} #52#return; {54344#true} is VALID [2022-04-15 06:58:28,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {54344#true} call #t~ret9 := main(); {54344#true} is VALID [2022-04-15 06:58:28,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {54344#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:28,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {54349#(<= 500000 main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 (= v_main_~x~0_2960 v_main_~x~0_2959)) (and (not (< v_main_~x~0_2960 500000)) .cse0 (= v_main_~x~0_2959 v_main_~x~0_2960)) (and (< v_main_~x~0_2959 500001) (< v_main_~x~0_2960 v_main_~x~0_2959)))) InVars {main_~x~0=v_main_~x~0_2960, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:28,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {54349#(<= 500000 main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:28,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {54349#(<= 500000 main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2962)) (.cse0 (= v_main_~y~0_3437 v_main_~y~0_3436)) (.cse1 (= v_main_~x~0_2962 v_main_~x~0_2961)) (.cse3 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse4 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2962 1000000))) .cse3 .cse4) (and (= (+ v_main_~x~0_2961 v_main_~y~0_3437) (+ v_main_~x~0_2962 v_main_~y~0_3436)) (< v_main_~x~0_2962 v_main_~x~0_2961) (< v_main_~x~0_2961 1000001) .cse2) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3437, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2962, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:28,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {54349#(<= 500000 main_~y~0)} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:28,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {54349#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54350#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:58:28,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {54350#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54351#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:58:28,891 INFO L290 TraceCheckUtils]: 12: Hoare triple {54351#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54352#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:58:28,892 INFO L290 TraceCheckUtils]: 13: Hoare triple {54352#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54353#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:58:28,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {54353#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54354#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:58:28,893 INFO L290 TraceCheckUtils]: 15: Hoare triple {54354#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54355#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:58:28,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {54355#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54356#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:58:28,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {54356#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54357#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:58:28,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {54357#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54358#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:58:28,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {54358#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54359#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:58:28,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {54359#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54360#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:58:28,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {54360#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54361#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:58:28,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {54361#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54362#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:58:28,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {54362#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54363#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:58:28,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {54363#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54364#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:58:28,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {54364#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54365#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:58:28,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {54365#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54366#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:58:28,899 INFO L290 TraceCheckUtils]: 27: Hoare triple {54366#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54367#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:58:28,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {54367#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54368#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:58:28,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {54368#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54369#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:58:28,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {54369#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54370#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:58:28,901 INFO L290 TraceCheckUtils]: 31: Hoare triple {54370#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54371#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:58:28,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {54371#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54372#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:58:28,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {54372#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54373#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:58:28,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {54373#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54374#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:58:28,903 INFO L290 TraceCheckUtils]: 35: Hoare triple {54374#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54375#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:58:28,903 INFO L290 TraceCheckUtils]: 36: Hoare triple {54375#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54376#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:58:28,904 INFO L290 TraceCheckUtils]: 37: Hoare triple {54376#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54377#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:58:28,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {54377#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54378#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:58:28,905 INFO L290 TraceCheckUtils]: 39: Hoare triple {54378#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54379#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:58:28,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {54379#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54380#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:58:28,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {54380#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54381#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:58:28,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {54381#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54382#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:58:28,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {54382#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54383#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:58:28,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {54383#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54384#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:58:28,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {54384#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54385#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:58:28,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {54385#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54386#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:58:28,909 INFO L290 TraceCheckUtils]: 47: Hoare triple {54386#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54387#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:58:28,909 INFO L290 TraceCheckUtils]: 48: Hoare triple {54387#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54388#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:58:28,910 INFO L290 TraceCheckUtils]: 49: Hoare triple {54388#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54389#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:58:28,910 INFO L290 TraceCheckUtils]: 50: Hoare triple {54389#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54390#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:58:28,910 INFO L290 TraceCheckUtils]: 51: Hoare triple {54390#(<= 499918 main_~y~0)} assume !(~y~0 > 0); {54345#false} is VALID [2022-04-15 06:58:28,910 INFO L272 TraceCheckUtils]: 52: Hoare triple {54345#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {54345#false} is VALID [2022-04-15 06:58:28,911 INFO L290 TraceCheckUtils]: 53: Hoare triple {54345#false} ~cond := #in~cond; {54345#false} is VALID [2022-04-15 06:58:28,911 INFO L290 TraceCheckUtils]: 54: Hoare triple {54345#false} assume 0 == ~cond; {54345#false} is VALID [2022-04-15 06:58:28,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {54345#false} assume !false; {54345#false} is VALID [2022-04-15 06:58:28,911 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:28,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:58:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688272580] [2022-04-15 06:58:28,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688272580] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:58:28,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101216737] [2022-04-15 06:58:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:58:28,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:58:28,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:58:28,913 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:58:28,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 06:58:29,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:29,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 06:58:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:58:29,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:58:29,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {54344#true} call ULTIMATE.init(); {54344#true} is VALID [2022-04-15 06:58:29,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {54344#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(17, 2);call #Ultimate.allocInit(12, 3); {54344#true} is VALID [2022-04-15 06:58:29,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {54344#true} assume true; {54344#true} is VALID [2022-04-15 06:58:29,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54344#true} {54344#true} #52#return; {54344#true} is VALID [2022-04-15 06:58:29,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {54344#true} call #t~ret9 := main(); {54344#true} is VALID [2022-04-15 06:58:29,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {54344#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:29,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {54349#(<= 500000 main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 (= v_main_~x~0_2960 v_main_~x~0_2959)) (and (not (< v_main_~x~0_2960 500000)) .cse0 (= v_main_~x~0_2959 v_main_~x~0_2960)) (and (< v_main_~x~0_2959 500001) (< v_main_~x~0_2960 v_main_~x~0_2959)))) InVars {main_~x~0=v_main_~x~0_2960, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:29,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {54349#(<= 500000 main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:29,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {54349#(<= 500000 main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2962)) (.cse0 (= v_main_~y~0_3437 v_main_~y~0_3436)) (.cse1 (= v_main_~x~0_2962 v_main_~x~0_2961)) (.cse3 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse4 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2962 1000000))) .cse3 .cse4) (and (= (+ v_main_~x~0_2961 v_main_~y~0_3437) (+ v_main_~x~0_2962 v_main_~y~0_3436)) (< v_main_~x~0_2962 v_main_~x~0_2961) (< v_main_~x~0_2961 1000001) .cse2) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3437, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2962, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:29,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {54349#(<= 500000 main_~y~0)} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {54349#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:58:29,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {54349#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54350#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:58:29,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {54350#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54351#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:58:29,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {54351#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54352#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:58:29,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {54352#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54353#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:58:29,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {54353#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54354#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:58:29,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {54354#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54355#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:58:29,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {54355#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54356#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:58:29,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {54356#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54357#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:58:29,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {54357#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54358#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:58:29,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {54358#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54359#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:58:29,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {54359#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54360#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:58:29,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {54360#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54361#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:58:29,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {54361#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54362#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:58:29,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {54362#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54363#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:58:29,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {54363#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54364#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:58:29,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {54364#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54365#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:58:29,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {54365#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54366#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:58:29,524 INFO L290 TraceCheckUtils]: 27: Hoare triple {54366#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54367#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:58:29,524 INFO L290 TraceCheckUtils]: 28: Hoare triple {54367#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54368#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:58:29,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {54368#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54369#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:58:29,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {54369#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54370#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:58:29,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {54370#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54371#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:58:29,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {54371#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54372#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:58:29,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {54372#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54373#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:58:29,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {54373#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54374#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:58:29,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {54374#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54375#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:58:29,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {54375#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54376#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:58:29,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {54376#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54377#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:58:29,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {54377#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54378#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:58:29,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {54378#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54379#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:58:29,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {54379#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54380#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:58:29,531 INFO L290 TraceCheckUtils]: 41: Hoare triple {54380#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54381#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:58:29,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {54381#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54382#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:58:29,532 INFO L290 TraceCheckUtils]: 43: Hoare triple {54382#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54383#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:58:29,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {54383#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54384#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:58:29,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {54384#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54385#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:58:29,533 INFO L290 TraceCheckUtils]: 46: Hoare triple {54385#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54386#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:58:29,534 INFO L290 TraceCheckUtils]: 47: Hoare triple {54386#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54387#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:58:29,534 INFO L290 TraceCheckUtils]: 48: Hoare triple {54387#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54388#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:58:29,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {54388#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54389#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:58:29,535 INFO L290 TraceCheckUtils]: 50: Hoare triple {54389#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54390#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:58:29,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {54390#(<= 499918 main_~y~0)} assume !(~y~0 > 0); {54345#false} is VALID [2022-04-15 06:58:29,536 INFO L272 TraceCheckUtils]: 52: Hoare triple {54345#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {54345#false} is VALID [2022-04-15 06:58:29,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {54345#false} ~cond := #in~cond; {54345#false} is VALID [2022-04-15 06:58:29,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {54345#false} assume 0 == ~cond; {54345#false} is VALID [2022-04-15 06:58:29,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {54345#false} assume !false; {54345#false} is VALID [2022-04-15 06:58:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:29,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:58:31,880 INFO L290 TraceCheckUtils]: 55: Hoare triple {54345#false} assume !false; {54345#false} is VALID [2022-04-15 06:58:31,881 INFO L290 TraceCheckUtils]: 54: Hoare triple {54345#false} assume 0 == ~cond; {54345#false} is VALID [2022-04-15 06:58:31,881 INFO L290 TraceCheckUtils]: 53: Hoare triple {54345#false} ~cond := #in~cond; {54345#false} is VALID [2022-04-15 06:58:31,881 INFO L272 TraceCheckUtils]: 52: Hoare triple {54345#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {54345#false} is VALID [2022-04-15 06:58:31,881 INFO L290 TraceCheckUtils]: 51: Hoare triple {54572#(< 0 main_~y~0)} assume !(~y~0 > 0); {54345#false} is VALID [2022-04-15 06:58:31,882 INFO L290 TraceCheckUtils]: 50: Hoare triple {54576#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54572#(< 0 main_~y~0)} is VALID [2022-04-15 06:58:31,882 INFO L290 TraceCheckUtils]: 49: Hoare triple {54580#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54576#(< 2 main_~y~0)} is VALID [2022-04-15 06:58:31,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {54584#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54580#(< 4 main_~y~0)} is VALID [2022-04-15 06:58:31,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {54588#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54584#(< 6 main_~y~0)} is VALID [2022-04-15 06:58:31,884 INFO L290 TraceCheckUtils]: 46: Hoare triple {54592#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54588#(< 8 main_~y~0)} is VALID [2022-04-15 06:58:31,884 INFO L290 TraceCheckUtils]: 45: Hoare triple {54596#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54592#(< 10 main_~y~0)} is VALID [2022-04-15 06:58:31,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {54600#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54596#(< 12 main_~y~0)} is VALID [2022-04-15 06:58:31,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {54604#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54600#(< 14 main_~y~0)} is VALID [2022-04-15 06:58:31,886 INFO L290 TraceCheckUtils]: 42: Hoare triple {54608#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54604#(< 16 main_~y~0)} is VALID [2022-04-15 06:58:31,886 INFO L290 TraceCheckUtils]: 41: Hoare triple {54612#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54608#(< 18 main_~y~0)} is VALID [2022-04-15 06:58:31,887 INFO L290 TraceCheckUtils]: 40: Hoare triple {54616#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54612#(< 20 main_~y~0)} is VALID [2022-04-15 06:58:31,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {54620#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54616#(< 22 main_~y~0)} is VALID [2022-04-15 06:58:31,888 INFO L290 TraceCheckUtils]: 38: Hoare triple {54624#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54620#(< 24 main_~y~0)} is VALID [2022-04-15 06:58:31,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {54628#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54624#(< 26 main_~y~0)} is VALID [2022-04-15 06:58:31,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {54632#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54628#(< 28 main_~y~0)} is VALID [2022-04-15 06:58:31,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {54636#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54632#(< 30 main_~y~0)} is VALID [2022-04-15 06:58:31,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {54640#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54636#(< 32 main_~y~0)} is VALID [2022-04-15 06:58:31,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {54644#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54640#(< 34 main_~y~0)} is VALID [2022-04-15 06:58:31,891 INFO L290 TraceCheckUtils]: 32: Hoare triple {54648#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54644#(< 36 main_~y~0)} is VALID [2022-04-15 06:58:31,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {54652#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54648#(< 38 main_~y~0)} is VALID [2022-04-15 06:58:31,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {54656#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54652#(< 40 main_~y~0)} is VALID [2022-04-15 06:58:31,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {54660#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54656#(< 42 main_~y~0)} is VALID [2022-04-15 06:58:31,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {54664#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54660#(< 44 main_~y~0)} is VALID [2022-04-15 06:58:31,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {54668#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54664#(< 46 main_~y~0)} is VALID [2022-04-15 06:58:31,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {54672#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54668#(< 48 main_~y~0)} is VALID [2022-04-15 06:58:31,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {54676#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54672#(< 50 main_~y~0)} is VALID [2022-04-15 06:58:31,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {54680#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54676#(< 52 main_~y~0)} is VALID [2022-04-15 06:58:31,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {54684#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54680#(< 54 main_~y~0)} is VALID [2022-04-15 06:58:31,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {54688#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54684#(< 56 main_~y~0)} is VALID [2022-04-15 06:58:31,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {54692#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54688#(< 58 main_~y~0)} is VALID [2022-04-15 06:58:31,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {54696#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54692#(< 60 main_~y~0)} is VALID [2022-04-15 06:58:31,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {54700#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54696#(< 62 main_~y~0)} is VALID [2022-04-15 06:58:31,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {54704#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54700#(< 64 main_~y~0)} is VALID [2022-04-15 06:58:31,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {54708#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54704#(< 66 main_~y~0)} is VALID [2022-04-15 06:58:31,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {54712#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54708#(< 68 main_~y~0)} is VALID [2022-04-15 06:58:31,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {54716#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54712#(< 70 main_~y~0)} is VALID [2022-04-15 06:58:31,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {54720#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54716#(< 72 main_~y~0)} is VALID [2022-04-15 06:58:31,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {54724#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54720#(< 74 main_~y~0)} is VALID [2022-04-15 06:58:31,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {54728#(< 78 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54724#(< 76 main_~y~0)} is VALID [2022-04-15 06:58:31,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {54732#(< 80 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54728#(< 78 main_~y~0)} is VALID [2022-04-15 06:58:31,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {54736#(< 82 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {54732#(< 80 main_~y~0)} is VALID [2022-04-15 06:58:31,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {54736#(< 82 main_~y~0)} [219] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {54736#(< 82 main_~y~0)} is VALID [2022-04-15 06:58:31,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {54736#(< 82 main_~y~0)} [222] L11-2-->L18-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_2962)) (.cse0 (= v_main_~y~0_3437 v_main_~y~0_3436)) (.cse1 (= v_main_~x~0_2962 v_main_~x~0_2961)) (.cse3 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse4 (= |v_main_#t~post6_284| |v_main_#t~post6_283|))) (or (and .cse0 .cse1 (or (not .cse2) (not (< v_main_~x~0_2962 1000000))) .cse3 .cse4) (and (= (+ v_main_~x~0_2961 v_main_~y~0_3437) (+ v_main_~x~0_2962 v_main_~y~0_3436)) (< v_main_~x~0_2962 v_main_~x~0_2961) (< v_main_~x~0_2961 1000001) .cse2) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3437, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2962, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54736#(< 82 main_~y~0)} is VALID [2022-04-15 06:58:31,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {54736#(< 82 main_~y~0)} [221] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54736#(< 82 main_~y~0)} is VALID [2022-04-15 06:58:31,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {54736#(< 82 main_~y~0)} [220] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 (= v_main_~x~0_2960 v_main_~x~0_2959)) (and (not (< v_main_~x~0_2960 500000)) .cse0 (= v_main_~x~0_2959 v_main_~x~0_2960)) (and (< v_main_~x~0_2959 500001) (< v_main_~x~0_2960 v_main_~x~0_2959)))) InVars {main_~x~0=v_main_~x~0_2960, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {54736#(< 82 main_~y~0)} is VALID [2022-04-15 06:58:31,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {54344#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {54736#(< 82 main_~y~0)} is VALID [2022-04-15 06:58:31,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {54344#true} call #t~ret9 := main(); {54344#true} is VALID [2022-04-15 06:58:31,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54344#true} {54344#true} #52#return; {54344#true} is VALID [2022-04-15 06:58:31,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {54344#true} assume true; {54344#true} is VALID [2022-04-15 06:58:31,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {54344#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(17, 2);call #Ultimate.allocInit(12, 3); {54344#true} is VALID [2022-04-15 06:58:31,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {54344#true} call ULTIMATE.init(); {54344#true} is VALID [2022-04-15 06:58:31,904 INFO L134 CoverageAnalysis]: Checked inductivity of 863 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:58:31,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101216737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:58:31,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:58:31,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 87 [2022-04-15 06:58:36,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:58:36,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [476307972] [2022-04-15 06:58:36,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [476307972] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:58:36,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:58:36,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [122] imperfect sequences [] total 122 [2022-04-15 06:58:36,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761953496] [2022-04-15 06:58:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:58:36,055 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 205 [2022-04-15 06:58:36,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:58:36,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 06:58:36,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:58:36,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 122 states [2022-04-15 06:58:36,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:58:36,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2022-04-15 06:58:36,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10355, Invalid=16377, Unknown=0, NotChecked=0, Total=26732 [2022-04-15 06:58:36,215 INFO L87 Difference]: Start difference. First operand 206 states and 209 transitions. Second operand has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 06:59:00,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:00,330 INFO L93 Difference]: Finished difference Result 409 states and 420 transitions. [2022-04-15 06:59:00,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-04-15 06:59:00,331 INFO L78 Accepts]: Start accepts. Automaton has has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 205 [2022-04-15 06:59:00,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:00,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 06:59:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 227 transitions. [2022-04-15 06:59:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 06:59:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 227 transitions. [2022-04-15 06:59:00,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 227 transitions. [2022-04-15 06:59:00,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 227 edges. 227 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:00,527 INFO L225 Difference]: With dead ends: 409 [2022-04-15 06:59:00,527 INFO L226 Difference]: Without dead ends: 211 [2022-04-15 06:59:00,532 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23326 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=24171, Invalid=55635, Unknown=0, NotChecked=0, Total=79806 [2022-04-15 06:59:00,532 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 402 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 11878 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 12326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 11878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:00,532 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [402 Valid, 69 Invalid, 12326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 11878 Invalid, 0 Unknown, 0 Unchecked, 9.9s Time] [2022-04-15 06:59:00,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-04-15 06:59:00,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2022-04-15 06:59:00,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:00,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 211 states. Second operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 06:59:00,882 INFO L74 IsIncluded]: Start isIncluded. First operand 211 states. Second operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 06:59:00,882 INFO L87 Difference]: Start difference. First operand 211 states. Second operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 06:59:00,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:00,884 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2022-04-15 06:59:00,884 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 214 transitions. [2022-04-15 06:59:00,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:00,884 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:00,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 211 states. [2022-04-15 06:59:00,884 INFO L87 Difference]: Start difference. First operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 211 states. [2022-04-15 06:59:00,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:00,886 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2022-04-15 06:59:00,886 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 214 transitions. [2022-04-15 06:59:00,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:00,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:00,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:00,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 206 states have (on average 1.0194174757281553) internal successors, (210), 206 states have internal predecessors, (210), 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 06:59:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 214 transitions. [2022-04-15 06:59:00,889 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 214 transitions. Word has length 205 [2022-04-15 06:59:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:00,889 INFO L478 AbstractCegarLoop]: Abstraction has 211 states and 214 transitions. [2022-04-15 06:59:00,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 122 states, 122 states have (on average 1.6475409836065573) internal successors, (201), 121 states have internal predecessors, (201), 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 06:59:00,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 211 states and 214 transitions. [2022-04-15 06:59:01,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:01,077 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 214 transitions. [2022-04-15 06:59:01,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-04-15 06:59:01,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:01,078 INFO L499 BasicCegarLoop]: trace histogram [78, 77, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:01,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:01,283 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:01,283 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash 436166299, now seen corresponding path program 42 times [2022-04-15 06:59:01,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:01,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [159490970] [2022-04-15 06:59:01,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:01,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:01,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:01,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1318849185, now seen corresponding path program 1 times [2022-04-15 06:59:01,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:01,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540768494] [2022-04-15 06:59:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:01,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:01,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:02,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {56794#(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(17, 2);call #Ultimate.allocInit(12, 3); {56746#true} is VALID [2022-04-15 06:59:02,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {56746#true} assume true; {56746#true} is VALID [2022-04-15 06:59:02,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56746#true} {56746#true} #52#return; {56746#true} is VALID [2022-04-15 06:59:02,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {56746#true} call ULTIMATE.init(); {56794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:02,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {56794#(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(17, 2);call #Ultimate.allocInit(12, 3); {56746#true} is VALID [2022-04-15 06:59:02,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {56746#true} assume true; {56746#true} is VALID [2022-04-15 06:59:02,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56746#true} {56746#true} #52#return; {56746#true} is VALID [2022-04-15 06:59:02,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {56746#true} call #t~ret9 := main(); {56746#true} is VALID [2022-04-15 06:59:02,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {56746#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:02,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {56751#(<= 500000 main_~y~0)} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_265| |v_main_#t~post4_264|)) (.cse1 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and (< v_main_~x~0_3093 v_main_~x~0_3092) (< v_main_~x~0_3092 500001)) (and (not (< v_main_~x~0_3093 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3093, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3092, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:02,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {56751#(<= 500000 main_~y~0)} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:02,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {56751#(<= 500000 main_~y~0)} [226] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3095)) (.cse0 (= v_main_~x~0_3095 v_main_~x~0_3094)) (.cse2 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse3 (= v_main_~y~0_3603 v_main_~y~0_3602))) (or (and .cse0 (= |v_main_#t~post5_290| |v_main_#t~post5_291|) (or (not (< v_main_~x~0_3095 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3095 v_main_~y~0_3602))) (and (= (+ v_main_~x~0_3094 v_main_~y~0_3603) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_3603)) (< v_main_~y~0_3603 v_main_~y~0_3602) .cse1)) (and .cse0 (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3603, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3095, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3602, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3094, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:02,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {56751#(<= 500000 main_~y~0)} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:02,597 INFO L290 TraceCheckUtils]: 10: Hoare triple {56751#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56752#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:59:02,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {56752#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56753#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:59:02,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {56753#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56754#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:59:02,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {56754#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56755#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:59:02,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {56755#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56756#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:59:02,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {56756#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56757#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:59:02,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {56757#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56758#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:59:02,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {56758#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56759#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:59:02,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {56759#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56760#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:59:02,602 INFO L290 TraceCheckUtils]: 19: Hoare triple {56760#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56761#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:59:02,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {56761#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56762#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:59:02,603 INFO L290 TraceCheckUtils]: 21: Hoare triple {56762#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56763#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:59:02,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {56763#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56764#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:59:02,604 INFO L290 TraceCheckUtils]: 23: Hoare triple {56764#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56765#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:59:02,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {56765#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56766#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:59:02,605 INFO L290 TraceCheckUtils]: 25: Hoare triple {56766#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56767#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:59:02,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {56767#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56768#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:59:02,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {56768#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56769#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:59:02,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {56769#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56770#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:59:02,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {56770#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56771#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:59:02,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {56771#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56772#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:59:02,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {56772#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56773#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:59:02,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {56773#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56774#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:59:02,609 INFO L290 TraceCheckUtils]: 33: Hoare triple {56774#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56775#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:59:02,609 INFO L290 TraceCheckUtils]: 34: Hoare triple {56775#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56776#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:59:02,610 INFO L290 TraceCheckUtils]: 35: Hoare triple {56776#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56777#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:59:02,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {56777#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56778#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:59:02,611 INFO L290 TraceCheckUtils]: 37: Hoare triple {56778#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56779#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:59:02,611 INFO L290 TraceCheckUtils]: 38: Hoare triple {56779#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56780#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:59:02,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {56780#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56781#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:59:02,612 INFO L290 TraceCheckUtils]: 40: Hoare triple {56781#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56782#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:59:02,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {56782#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56783#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:59:02,613 INFO L290 TraceCheckUtils]: 42: Hoare triple {56783#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56784#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:59:02,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {56784#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56785#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:59:02,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {56785#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56786#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:59:02,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {56786#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56787#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:59:02,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {56787#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56788#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:59:02,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {56788#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56789#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:59:02,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {56789#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56790#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:59:02,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {56790#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56791#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:59:02,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {56791#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56792#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:59:02,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {56792#(<= 499918 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56793#(<= 499916 main_~y~0)} is VALID [2022-04-15 06:59:02,618 INFO L290 TraceCheckUtils]: 52: Hoare triple {56793#(<= 499916 main_~y~0)} assume !(~y~0 > 0); {56747#false} is VALID [2022-04-15 06:59:02,618 INFO L272 TraceCheckUtils]: 53: Hoare triple {56747#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {56747#false} is VALID [2022-04-15 06:59:02,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {56747#false} ~cond := #in~cond; {56747#false} is VALID [2022-04-15 06:59:02,618 INFO L290 TraceCheckUtils]: 55: Hoare triple {56747#false} assume 0 == ~cond; {56747#false} is VALID [2022-04-15 06:59:02,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {56747#false} assume !false; {56747#false} is VALID [2022-04-15 06:59:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:02,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:02,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540768494] [2022-04-15 06:59:02,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540768494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:02,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889438216] [2022-04-15 06:59:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:02,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:02,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:02,620 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:59:02,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 06:59:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:02,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 06:59:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:02,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:03,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {56746#true} call ULTIMATE.init(); {56746#true} is VALID [2022-04-15 06:59:03,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {56746#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(17, 2);call #Ultimate.allocInit(12, 3); {56746#true} is VALID [2022-04-15 06:59:03,247 INFO L290 TraceCheckUtils]: 2: Hoare triple {56746#true} assume true; {56746#true} is VALID [2022-04-15 06:59:03,247 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56746#true} {56746#true} #52#return; {56746#true} is VALID [2022-04-15 06:59:03,247 INFO L272 TraceCheckUtils]: 4: Hoare triple {56746#true} call #t~ret9 := main(); {56746#true} is VALID [2022-04-15 06:59:03,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {56746#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:03,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {56751#(<= 500000 main_~y~0)} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_265| |v_main_#t~post4_264|)) (.cse1 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and (< v_main_~x~0_3093 v_main_~x~0_3092) (< v_main_~x~0_3092 500001)) (and (not (< v_main_~x~0_3093 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3093, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3092, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:03,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {56751#(<= 500000 main_~y~0)} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:03,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {56751#(<= 500000 main_~y~0)} [226] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3095)) (.cse0 (= v_main_~x~0_3095 v_main_~x~0_3094)) (.cse2 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse3 (= v_main_~y~0_3603 v_main_~y~0_3602))) (or (and .cse0 (= |v_main_#t~post5_290| |v_main_#t~post5_291|) (or (not (< v_main_~x~0_3095 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3095 v_main_~y~0_3602))) (and (= (+ v_main_~x~0_3094 v_main_~y~0_3603) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_3603)) (< v_main_~y~0_3603 v_main_~y~0_3602) .cse1)) (and .cse0 (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3603, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3095, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3602, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3094, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:03,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {56751#(<= 500000 main_~y~0)} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {56751#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:03,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {56751#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56752#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:59:03,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {56752#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56753#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:59:03,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {56753#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56754#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:59:03,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {56754#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56755#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:59:03,252 INFO L290 TraceCheckUtils]: 14: Hoare triple {56755#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56756#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:59:03,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {56756#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56757#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:59:03,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {56757#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56758#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:59:03,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {56758#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56759#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:59:03,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {56759#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56760#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:59:03,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {56760#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56761#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:59:03,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {56761#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56762#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:59:03,256 INFO L290 TraceCheckUtils]: 21: Hoare triple {56762#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56763#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:59:03,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {56763#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56764#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:59:03,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {56764#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56765#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:59:03,257 INFO L290 TraceCheckUtils]: 24: Hoare triple {56765#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56766#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:59:03,258 INFO L290 TraceCheckUtils]: 25: Hoare triple {56766#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56767#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:59:03,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {56767#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56768#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:59:03,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {56768#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56769#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:59:03,259 INFO L290 TraceCheckUtils]: 28: Hoare triple {56769#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56770#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:59:03,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {56770#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56771#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:59:03,260 INFO L290 TraceCheckUtils]: 30: Hoare triple {56771#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56772#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:59:03,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {56772#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56773#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:59:03,261 INFO L290 TraceCheckUtils]: 32: Hoare triple {56773#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56774#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:59:03,262 INFO L290 TraceCheckUtils]: 33: Hoare triple {56774#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56775#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:59:03,262 INFO L290 TraceCheckUtils]: 34: Hoare triple {56775#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56776#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:59:03,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {56776#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56777#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:59:03,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {56777#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56778#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:59:03,264 INFO L290 TraceCheckUtils]: 37: Hoare triple {56778#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56779#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:59:03,265 INFO L290 TraceCheckUtils]: 38: Hoare triple {56779#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56780#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:59:03,265 INFO L290 TraceCheckUtils]: 39: Hoare triple {56780#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56781#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:59:03,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {56781#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56782#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:59:03,266 INFO L290 TraceCheckUtils]: 41: Hoare triple {56782#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56783#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:59:03,267 INFO L290 TraceCheckUtils]: 42: Hoare triple {56783#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56784#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:59:03,267 INFO L290 TraceCheckUtils]: 43: Hoare triple {56784#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56785#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:59:03,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {56785#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56786#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:59:03,268 INFO L290 TraceCheckUtils]: 45: Hoare triple {56786#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56787#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:59:03,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {56787#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56788#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:59:03,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {56788#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56789#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:59:03,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {56789#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56790#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:59:03,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {56790#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56791#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:59:03,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {56791#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56792#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:59:03,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {56792#(<= 499918 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56793#(<= 499916 main_~y~0)} is VALID [2022-04-15 06:59:03,272 INFO L290 TraceCheckUtils]: 52: Hoare triple {56793#(<= 499916 main_~y~0)} assume !(~y~0 > 0); {56747#false} is VALID [2022-04-15 06:59:03,272 INFO L272 TraceCheckUtils]: 53: Hoare triple {56747#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {56747#false} is VALID [2022-04-15 06:59:03,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {56747#false} ~cond := #in~cond; {56747#false} is VALID [2022-04-15 06:59:03,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {56747#false} assume 0 == ~cond; {56747#false} is VALID [2022-04-15 06:59:03,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {56747#false} assume !false; {56747#false} is VALID [2022-04-15 06:59:03,272 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:03,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:05,713 INFO L290 TraceCheckUtils]: 56: Hoare triple {56747#false} assume !false; {56747#false} is VALID [2022-04-15 06:59:05,713 INFO L290 TraceCheckUtils]: 55: Hoare triple {56747#false} assume 0 == ~cond; {56747#false} is VALID [2022-04-15 06:59:05,713 INFO L290 TraceCheckUtils]: 54: Hoare triple {56747#false} ~cond := #in~cond; {56747#false} is VALID [2022-04-15 06:59:05,713 INFO L272 TraceCheckUtils]: 53: Hoare triple {56747#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {56747#false} is VALID [2022-04-15 06:59:05,713 INFO L290 TraceCheckUtils]: 52: Hoare triple {56978#(< 0 main_~y~0)} assume !(~y~0 > 0); {56747#false} is VALID [2022-04-15 06:59:05,714 INFO L290 TraceCheckUtils]: 51: Hoare triple {56982#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56978#(< 0 main_~y~0)} is VALID [2022-04-15 06:59:05,714 INFO L290 TraceCheckUtils]: 50: Hoare triple {56986#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56982#(< 2 main_~y~0)} is VALID [2022-04-15 06:59:05,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {56990#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56986#(< 4 main_~y~0)} is VALID [2022-04-15 06:59:05,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {56994#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56990#(< 6 main_~y~0)} is VALID [2022-04-15 06:59:05,716 INFO L290 TraceCheckUtils]: 47: Hoare triple {56998#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56994#(< 8 main_~y~0)} is VALID [2022-04-15 06:59:05,716 INFO L290 TraceCheckUtils]: 46: Hoare triple {57002#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {56998#(< 10 main_~y~0)} is VALID [2022-04-15 06:59:05,717 INFO L290 TraceCheckUtils]: 45: Hoare triple {57006#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57002#(< 12 main_~y~0)} is VALID [2022-04-15 06:59:05,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {57010#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57006#(< 14 main_~y~0)} is VALID [2022-04-15 06:59:05,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {57014#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57010#(< 16 main_~y~0)} is VALID [2022-04-15 06:59:05,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {57018#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57014#(< 18 main_~y~0)} is VALID [2022-04-15 06:59:05,719 INFO L290 TraceCheckUtils]: 41: Hoare triple {57022#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57018#(< 20 main_~y~0)} is VALID [2022-04-15 06:59:05,719 INFO L290 TraceCheckUtils]: 40: Hoare triple {57026#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57022#(< 22 main_~y~0)} is VALID [2022-04-15 06:59:05,720 INFO L290 TraceCheckUtils]: 39: Hoare triple {57030#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57026#(< 24 main_~y~0)} is VALID [2022-04-15 06:59:05,720 INFO L290 TraceCheckUtils]: 38: Hoare triple {57034#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57030#(< 26 main_~y~0)} is VALID [2022-04-15 06:59:05,721 INFO L290 TraceCheckUtils]: 37: Hoare triple {57038#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57034#(< 28 main_~y~0)} is VALID [2022-04-15 06:59:05,721 INFO L290 TraceCheckUtils]: 36: Hoare triple {57042#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57038#(< 30 main_~y~0)} is VALID [2022-04-15 06:59:05,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {57046#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57042#(< 32 main_~y~0)} is VALID [2022-04-15 06:59:05,722 INFO L290 TraceCheckUtils]: 34: Hoare triple {57050#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57046#(< 34 main_~y~0)} is VALID [2022-04-15 06:59:05,723 INFO L290 TraceCheckUtils]: 33: Hoare triple {57054#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57050#(< 36 main_~y~0)} is VALID [2022-04-15 06:59:05,723 INFO L290 TraceCheckUtils]: 32: Hoare triple {57058#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57054#(< 38 main_~y~0)} is VALID [2022-04-15 06:59:05,724 INFO L290 TraceCheckUtils]: 31: Hoare triple {57062#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57058#(< 40 main_~y~0)} is VALID [2022-04-15 06:59:05,724 INFO L290 TraceCheckUtils]: 30: Hoare triple {57066#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57062#(< 42 main_~y~0)} is VALID [2022-04-15 06:59:05,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {57070#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57066#(< 44 main_~y~0)} is VALID [2022-04-15 06:59:05,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {57074#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57070#(< 46 main_~y~0)} is VALID [2022-04-15 06:59:05,726 INFO L290 TraceCheckUtils]: 27: Hoare triple {57078#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57074#(< 48 main_~y~0)} is VALID [2022-04-15 06:59:05,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {57082#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57078#(< 50 main_~y~0)} is VALID [2022-04-15 06:59:05,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {57086#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57082#(< 52 main_~y~0)} is VALID [2022-04-15 06:59:05,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {57090#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57086#(< 54 main_~y~0)} is VALID [2022-04-15 06:59:05,728 INFO L290 TraceCheckUtils]: 23: Hoare triple {57094#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57090#(< 56 main_~y~0)} is VALID [2022-04-15 06:59:05,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {57098#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57094#(< 58 main_~y~0)} is VALID [2022-04-15 06:59:05,729 INFO L290 TraceCheckUtils]: 21: Hoare triple {57102#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57098#(< 60 main_~y~0)} is VALID [2022-04-15 06:59:05,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {57106#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57102#(< 62 main_~y~0)} is VALID [2022-04-15 06:59:05,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {57110#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57106#(< 64 main_~y~0)} is VALID [2022-04-15 06:59:05,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {57114#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57110#(< 66 main_~y~0)} is VALID [2022-04-15 06:59:05,731 INFO L290 TraceCheckUtils]: 17: Hoare triple {57118#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57114#(< 68 main_~y~0)} is VALID [2022-04-15 06:59:05,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {57122#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57118#(< 70 main_~y~0)} is VALID [2022-04-15 06:59:05,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {57126#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57122#(< 72 main_~y~0)} is VALID [2022-04-15 06:59:05,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {57130#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57126#(< 74 main_~y~0)} is VALID [2022-04-15 06:59:05,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {57134#(< 78 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57130#(< 76 main_~y~0)} is VALID [2022-04-15 06:59:05,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {57138#(< 80 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57134#(< 78 main_~y~0)} is VALID [2022-04-15 06:59:05,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {57142#(< 82 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57138#(< 80 main_~y~0)} is VALID [2022-04-15 06:59:05,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {57146#(< 84 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {57142#(< 82 main_~y~0)} is VALID [2022-04-15 06:59:05,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {57146#(< 84 main_~y~0)} [223] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {57146#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:05,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {57146#(< 84 main_~y~0)} [226] L11-2-->L18-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3095)) (.cse0 (= v_main_~x~0_3095 v_main_~x~0_3094)) (.cse2 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse3 (= v_main_~y~0_3603 v_main_~y~0_3602))) (or (and .cse0 (= |v_main_#t~post5_290| |v_main_#t~post5_291|) (or (not (< v_main_~x~0_3095 1000000)) (not .cse1)) .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3095 v_main_~y~0_3602))) (and (= (+ v_main_~x~0_3094 v_main_~y~0_3603) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_3603)) (< v_main_~y~0_3603 v_main_~y~0_3602) .cse1)) (and .cse0 (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3603, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3095, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3602, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3094, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {57146#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:05,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {57146#(< 84 main_~y~0)} [225] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {57146#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:05,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {57146#(< 84 main_~y~0)} [224] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_265| |v_main_#t~post4_264|)) (.cse1 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and (< v_main_~x~0_3093 v_main_~x~0_3092) (< v_main_~x~0_3092 500001)) (and (not (< v_main_~x~0_3093 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3093, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3092, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {57146#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:05,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {56746#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {57146#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:05,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {56746#true} call #t~ret9 := main(); {56746#true} is VALID [2022-04-15 06:59:05,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56746#true} {56746#true} #52#return; {56746#true} is VALID [2022-04-15 06:59:05,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {56746#true} assume true; {56746#true} is VALID [2022-04-15 06:59:05,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {56746#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(17, 2);call #Ultimate.allocInit(12, 3); {56746#true} is VALID [2022-04-15 06:59:05,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {56746#true} call ULTIMATE.init(); {56746#true} is VALID [2022-04-15 06:59:05,737 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:05,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889438216] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:05,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:05,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 89 [2022-04-15 06:59:10,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:10,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [159490970] [2022-04-15 06:59:10,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [159490970] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:10,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:10,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [125] imperfect sequences [] total 125 [2022-04-15 06:59:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007083700] [2022-04-15 06:59:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:10,162 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 210 [2022-04-15 06:59:10,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:10,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 06:59:10,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:10,328 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 125 states [2022-04-15 06:59:10,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2022-04-15 06:59:10,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10860, Invalid=17196, Unknown=0, NotChecked=0, Total=28056 [2022-04-15 06:59:10,331 INFO L87 Difference]: Start difference. First operand 211 states and 214 transitions. Second operand has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 06:59:35,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:35,644 INFO L93 Difference]: Finished difference Result 419 states and 430 transitions. [2022-04-15 06:59:35,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2022-04-15 06:59:35,645 INFO L78 Accepts]: Start accepts. Automaton has has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 210 [2022-04-15 06:59:35,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:59:35,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 06:59:35,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 232 transitions. [2022-04-15 06:59:35,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 06:59:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 232 transitions. [2022-04-15 06:59:35,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 232 transitions. [2022-04-15 06:59:35,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:35,859 INFO L225 Difference]: With dead ends: 419 [2022-04-15 06:59:35,860 INFO L226 Difference]: Without dead ends: 216 [2022-04-15 06:59:35,873 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 154 SyntacticMatches, 2 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24504 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=25350, Invalid=58460, Unknown=0, NotChecked=0, Total=83810 [2022-04-15 06:59:35,873 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 411 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 12514 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 12971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 12514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-15 06:59:35,874 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [411 Valid, 64 Invalid, 12971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 12514 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-04-15 06:59:35,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-04-15 06:59:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-04-15 06:59:36,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:59:36,261 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 06:59:36,261 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 06:59:36,261 INFO L87 Difference]: Start difference. First operand 216 states. Second operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 06:59:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:36,263 INFO L93 Difference]: Finished difference Result 216 states and 219 transitions. [2022-04-15 06:59:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2022-04-15 06:59:36,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:36,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:36,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 216 states. [2022-04-15 06:59:36,264 INFO L87 Difference]: Start difference. First operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 216 states. [2022-04-15 06:59:36,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:59:36,266 INFO L93 Difference]: Finished difference Result 216 states and 219 transitions. [2022-04-15 06:59:36,266 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2022-04-15 06:59:36,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:59:36,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:59:36,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:59:36,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:59:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 211 states have (on average 1.018957345971564) internal successors, (215), 211 states have internal predecessors, (215), 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 06:59:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2022-04-15 06:59:36,269 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 210 [2022-04-15 06:59:36,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:59:36,269 INFO L478 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2022-04-15 06:59:36,269 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 125 states, 125 states have (on average 1.648) internal successors, (206), 124 states have internal predecessors, (206), 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 06:59:36,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 216 states and 219 transitions. [2022-04-15 06:59:36,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2022-04-15 06:59:36,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-04-15 06:59:36,468 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:59:36,468 INFO L499 BasicCegarLoop]: trace histogram [80, 79, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:59:36,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 06:59:36,668 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:36,669 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:59:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:59:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash 439392798, now seen corresponding path program 43 times [2022-04-15 06:59:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:36,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520471214] [2022-04-15 06:59:36,765 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:36,973 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 06:59:36,974 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:59:36,976 INFO L85 PathProgramCache]: Analyzing trace with hash 291466722, now seen corresponding path program 1 times [2022-04-15 06:59:36,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:59:36,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803826451] [2022-04-15 06:59:36,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:36,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:59:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:59:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:37,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {59253#(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(17, 2);call #Ultimate.allocInit(12, 3); {59204#true} is VALID [2022-04-15 06:59:37,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {59204#true} assume true; {59204#true} is VALID [2022-04-15 06:59:37,977 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59204#true} {59204#true} #52#return; {59204#true} is VALID [2022-04-15 06:59:37,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {59204#true} call ULTIMATE.init(); {59253#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:59:37,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {59253#(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(17, 2);call #Ultimate.allocInit(12, 3); {59204#true} is VALID [2022-04-15 06:59:37,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {59204#true} assume true; {59204#true} is VALID [2022-04-15 06:59:37,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59204#true} {59204#true} #52#return; {59204#true} is VALID [2022-04-15 06:59:37,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {59204#true} call #t~ret9 := main(); {59204#true} is VALID [2022-04-15 06:59:37,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {59204#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:37,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {59209#(<= 500000 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_271| |v_main_#t~post4_270|)) (.cse1 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3229 v_main_~x~0_3228) (< v_main_~x~0_3228 500001)) (and (not (< v_main_~x~0_3229 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3229, main_#t~post4=|v_main_#t~post4_271|} OutVars{main_~x~0=v_main_~x~0_3228, main_#t~post4=|v_main_#t~post4_270|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:37,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {59209#(<= 500000 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:37,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {59209#(<= 500000 main_~y~0)} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~x~0_3231 v_main_~x~0_3230)) (.cse3 (= v_main_~y~0_3773 v_main_~y~0_3772)) (.cse5 (<= 500000 v_main_~x~0_3231))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3231 v_main_~y~0_3772))) (and (< v_main_~y~0_3773 v_main_~y~0_3772) (= .cse4 (+ v_main_~x~0_3230 v_main_~y~0_3773)) (< .cse4 (+ 1000001 v_main_~y~0_3773)) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3231 1000000)))))) InVars {main_~y~0=v_main_~y~0_3773, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3231, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3772, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3230, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:37,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {59209#(<= 500000 main_~y~0)} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:37,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {59209#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59210#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:59:37,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {59210#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59211#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:59:37,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {59211#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59212#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:59:37,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {59212#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59213#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:59:37,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {59213#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59214#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:59:37,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {59214#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59215#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:59:37,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {59215#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59216#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:59:37,984 INFO L290 TraceCheckUtils]: 17: Hoare triple {59216#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59217#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:59:37,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {59217#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59218#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:59:37,985 INFO L290 TraceCheckUtils]: 19: Hoare triple {59218#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59219#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:59:37,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {59219#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59220#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:59:37,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {59220#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59221#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:59:37,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {59221#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59222#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:59:37,987 INFO L290 TraceCheckUtils]: 23: Hoare triple {59222#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59223#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:59:37,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {59223#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59224#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:59:37,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {59224#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59225#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:59:37,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {59225#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59226#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:59:37,989 INFO L290 TraceCheckUtils]: 27: Hoare triple {59226#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59227#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:59:37,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {59227#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59228#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:59:37,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {59228#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59229#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:59:37,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {59229#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59230#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:59:37,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {59230#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59231#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:59:37,992 INFO L290 TraceCheckUtils]: 32: Hoare triple {59231#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59232#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:59:37,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {59232#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59233#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:59:37,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {59233#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59234#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:59:37,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {59234#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59235#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:59:37,994 INFO L290 TraceCheckUtils]: 36: Hoare triple {59235#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59236#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:59:37,994 INFO L290 TraceCheckUtils]: 37: Hoare triple {59236#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59237#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:59:37,995 INFO L290 TraceCheckUtils]: 38: Hoare triple {59237#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59238#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:59:37,995 INFO L290 TraceCheckUtils]: 39: Hoare triple {59238#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59239#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:59:37,996 INFO L290 TraceCheckUtils]: 40: Hoare triple {59239#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59240#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:59:37,996 INFO L290 TraceCheckUtils]: 41: Hoare triple {59240#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59241#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:59:37,996 INFO L290 TraceCheckUtils]: 42: Hoare triple {59241#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59242#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:59:37,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {59242#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59243#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:59:37,997 INFO L290 TraceCheckUtils]: 44: Hoare triple {59243#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59244#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:59:37,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {59244#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59245#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:59:37,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {59245#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59246#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:59:37,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {59246#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59247#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:59:37,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {59247#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59248#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:59:38,000 INFO L290 TraceCheckUtils]: 49: Hoare triple {59248#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59249#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:59:38,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {59249#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59250#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:59:38,001 INFO L290 TraceCheckUtils]: 51: Hoare triple {59250#(<= 499918 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59251#(<= 499916 main_~y~0)} is VALID [2022-04-15 06:59:38,001 INFO L290 TraceCheckUtils]: 52: Hoare triple {59251#(<= 499916 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59252#(<= 499914 main_~y~0)} is VALID [2022-04-15 06:59:38,002 INFO L290 TraceCheckUtils]: 53: Hoare triple {59252#(<= 499914 main_~y~0)} assume !(~y~0 > 0); {59205#false} is VALID [2022-04-15 06:59:38,002 INFO L272 TraceCheckUtils]: 54: Hoare triple {59205#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {59205#false} is VALID [2022-04-15 06:59:38,002 INFO L290 TraceCheckUtils]: 55: Hoare triple {59205#false} ~cond := #in~cond; {59205#false} is VALID [2022-04-15 06:59:38,002 INFO L290 TraceCheckUtils]: 56: Hoare triple {59205#false} assume 0 == ~cond; {59205#false} is VALID [2022-04-15 06:59:38,002 INFO L290 TraceCheckUtils]: 57: Hoare triple {59205#false} assume !false; {59205#false} is VALID [2022-04-15 06:59:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:38,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:59:38,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803826451] [2022-04-15 06:59:38,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803826451] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:59:38,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592436987] [2022-04-15 06:59:38,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:59:38,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:59:38,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:59:38,004 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:59:38,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 06:59:38,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:38,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-15 06:59:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:59:38,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:59:38,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {59204#true} call ULTIMATE.init(); {59204#true} is VALID [2022-04-15 06:59:38,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {59204#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(17, 2);call #Ultimate.allocInit(12, 3); {59204#true} is VALID [2022-04-15 06:59:38,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {59204#true} assume true; {59204#true} is VALID [2022-04-15 06:59:38,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59204#true} {59204#true} #52#return; {59204#true} is VALID [2022-04-15 06:59:38,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {59204#true} call #t~ret9 := main(); {59204#true} is VALID [2022-04-15 06:59:38,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {59204#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:38,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {59209#(<= 500000 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_271| |v_main_#t~post4_270|)) (.cse1 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3229 v_main_~x~0_3228) (< v_main_~x~0_3228 500001)) (and (not (< v_main_~x~0_3229 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3229, main_#t~post4=|v_main_#t~post4_271|} OutVars{main_~x~0=v_main_~x~0_3228, main_#t~post4=|v_main_#t~post4_270|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:38,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {59209#(<= 500000 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:38,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {59209#(<= 500000 main_~y~0)} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~x~0_3231 v_main_~x~0_3230)) (.cse3 (= v_main_~y~0_3773 v_main_~y~0_3772)) (.cse5 (<= 500000 v_main_~x~0_3231))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3231 v_main_~y~0_3772))) (and (< v_main_~y~0_3773 v_main_~y~0_3772) (= .cse4 (+ v_main_~x~0_3230 v_main_~y~0_3773)) (< .cse4 (+ 1000001 v_main_~y~0_3773)) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3231 1000000)))))) InVars {main_~y~0=v_main_~y~0_3773, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3231, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3772, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3230, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:38,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {59209#(<= 500000 main_~y~0)} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {59209#(<= 500000 main_~y~0)} is VALID [2022-04-15 06:59:38,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {59209#(<= 500000 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59210#(<= 499998 main_~y~0)} is VALID [2022-04-15 06:59:38,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {59210#(<= 499998 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59211#(<= 499996 main_~y~0)} is VALID [2022-04-15 06:59:38,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {59211#(<= 499996 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59212#(<= 499994 main_~y~0)} is VALID [2022-04-15 06:59:38,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {59212#(<= 499994 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59213#(<= 499992 main_~y~0)} is VALID [2022-04-15 06:59:38,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {59213#(<= 499992 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59214#(<= 499990 main_~y~0)} is VALID [2022-04-15 06:59:38,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {59214#(<= 499990 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59215#(<= 499988 main_~y~0)} is VALID [2022-04-15 06:59:38,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {59215#(<= 499988 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59216#(<= 499986 main_~y~0)} is VALID [2022-04-15 06:59:38,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {59216#(<= 499986 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59217#(<= 499984 main_~y~0)} is VALID [2022-04-15 06:59:38,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {59217#(<= 499984 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59218#(<= 499982 main_~y~0)} is VALID [2022-04-15 06:59:38,615 INFO L290 TraceCheckUtils]: 19: Hoare triple {59218#(<= 499982 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59219#(<= 499980 main_~y~0)} is VALID [2022-04-15 06:59:38,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {59219#(<= 499980 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59220#(<= 499978 main_~y~0)} is VALID [2022-04-15 06:59:38,616 INFO L290 TraceCheckUtils]: 21: Hoare triple {59220#(<= 499978 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59221#(<= 499976 main_~y~0)} is VALID [2022-04-15 06:59:38,616 INFO L290 TraceCheckUtils]: 22: Hoare triple {59221#(<= 499976 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59222#(<= 499974 main_~y~0)} is VALID [2022-04-15 06:59:38,617 INFO L290 TraceCheckUtils]: 23: Hoare triple {59222#(<= 499974 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59223#(<= 499972 main_~y~0)} is VALID [2022-04-15 06:59:38,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {59223#(<= 499972 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59224#(<= 499970 main_~y~0)} is VALID [2022-04-15 06:59:38,618 INFO L290 TraceCheckUtils]: 25: Hoare triple {59224#(<= 499970 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59225#(<= 499968 main_~y~0)} is VALID [2022-04-15 06:59:38,618 INFO L290 TraceCheckUtils]: 26: Hoare triple {59225#(<= 499968 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59226#(<= 499966 main_~y~0)} is VALID [2022-04-15 06:59:38,619 INFO L290 TraceCheckUtils]: 27: Hoare triple {59226#(<= 499966 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59227#(<= 499964 main_~y~0)} is VALID [2022-04-15 06:59:38,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {59227#(<= 499964 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59228#(<= 499962 main_~y~0)} is VALID [2022-04-15 06:59:38,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {59228#(<= 499962 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59229#(<= 499960 main_~y~0)} is VALID [2022-04-15 06:59:38,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {59229#(<= 499960 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59230#(<= 499958 main_~y~0)} is VALID [2022-04-15 06:59:38,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {59230#(<= 499958 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59231#(<= 499956 main_~y~0)} is VALID [2022-04-15 06:59:38,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {59231#(<= 499956 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59232#(<= 499954 main_~y~0)} is VALID [2022-04-15 06:59:38,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {59232#(<= 499954 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59233#(<= 499952 main_~y~0)} is VALID [2022-04-15 06:59:38,622 INFO L290 TraceCheckUtils]: 34: Hoare triple {59233#(<= 499952 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59234#(<= 499950 main_~y~0)} is VALID [2022-04-15 06:59:38,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {59234#(<= 499950 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59235#(<= 499948 main_~y~0)} is VALID [2022-04-15 06:59:38,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {59235#(<= 499948 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59236#(<= 499946 main_~y~0)} is VALID [2022-04-15 06:59:38,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {59236#(<= 499946 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59237#(<= 499944 main_~y~0)} is VALID [2022-04-15 06:59:38,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {59237#(<= 499944 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59238#(<= 499942 main_~y~0)} is VALID [2022-04-15 06:59:38,625 INFO L290 TraceCheckUtils]: 39: Hoare triple {59238#(<= 499942 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59239#(<= 499940 main_~y~0)} is VALID [2022-04-15 06:59:38,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {59239#(<= 499940 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59240#(<= 499938 main_~y~0)} is VALID [2022-04-15 06:59:38,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {59240#(<= 499938 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59241#(<= 499936 main_~y~0)} is VALID [2022-04-15 06:59:38,626 INFO L290 TraceCheckUtils]: 42: Hoare triple {59241#(<= 499936 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59242#(<= 499934 main_~y~0)} is VALID [2022-04-15 06:59:38,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {59242#(<= 499934 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59243#(<= 499932 main_~y~0)} is VALID [2022-04-15 06:59:38,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {59243#(<= 499932 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59244#(<= 499930 main_~y~0)} is VALID [2022-04-15 06:59:38,628 INFO L290 TraceCheckUtils]: 45: Hoare triple {59244#(<= 499930 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59245#(<= 499928 main_~y~0)} is VALID [2022-04-15 06:59:38,628 INFO L290 TraceCheckUtils]: 46: Hoare triple {59245#(<= 499928 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59246#(<= 499926 main_~y~0)} is VALID [2022-04-15 06:59:38,629 INFO L290 TraceCheckUtils]: 47: Hoare triple {59246#(<= 499926 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59247#(<= 499924 main_~y~0)} is VALID [2022-04-15 06:59:38,629 INFO L290 TraceCheckUtils]: 48: Hoare triple {59247#(<= 499924 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59248#(<= 499922 main_~y~0)} is VALID [2022-04-15 06:59:38,630 INFO L290 TraceCheckUtils]: 49: Hoare triple {59248#(<= 499922 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59249#(<= 499920 main_~y~0)} is VALID [2022-04-15 06:59:38,630 INFO L290 TraceCheckUtils]: 50: Hoare triple {59249#(<= 499920 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59250#(<= 499918 main_~y~0)} is VALID [2022-04-15 06:59:38,631 INFO L290 TraceCheckUtils]: 51: Hoare triple {59250#(<= 499918 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59251#(<= 499916 main_~y~0)} is VALID [2022-04-15 06:59:38,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {59251#(<= 499916 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59252#(<= 499914 main_~y~0)} is VALID [2022-04-15 06:59:38,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {59252#(<= 499914 main_~y~0)} assume !(~y~0 > 0); {59205#false} is VALID [2022-04-15 06:59:38,632 INFO L272 TraceCheckUtils]: 54: Hoare triple {59205#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {59205#false} is VALID [2022-04-15 06:59:38,632 INFO L290 TraceCheckUtils]: 55: Hoare triple {59205#false} ~cond := #in~cond; {59205#false} is VALID [2022-04-15 06:59:38,632 INFO L290 TraceCheckUtils]: 56: Hoare triple {59205#false} assume 0 == ~cond; {59205#false} is VALID [2022-04-15 06:59:38,632 INFO L290 TraceCheckUtils]: 57: Hoare triple {59205#false} assume !false; {59205#false} is VALID [2022-04-15 06:59:38,632 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:38,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:59:41,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {59205#false} assume !false; {59205#false} is VALID [2022-04-15 06:59:41,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {59205#false} assume 0 == ~cond; {59205#false} is VALID [2022-04-15 06:59:41,196 INFO L290 TraceCheckUtils]: 55: Hoare triple {59205#false} ~cond := #in~cond; {59205#false} is VALID [2022-04-15 06:59:41,196 INFO L272 TraceCheckUtils]: 54: Hoare triple {59205#false} call __VERIFIER_assert((if ~x~0 == ~z~0 then 1 else 0)); {59205#false} is VALID [2022-04-15 06:59:41,196 INFO L290 TraceCheckUtils]: 53: Hoare triple {59440#(< 0 main_~y~0)} assume !(~y~0 > 0); {59205#false} is VALID [2022-04-15 06:59:41,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {59444#(< 2 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59440#(< 0 main_~y~0)} is VALID [2022-04-15 06:59:41,198 INFO L290 TraceCheckUtils]: 51: Hoare triple {59448#(< 4 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59444#(< 2 main_~y~0)} is VALID [2022-04-15 06:59:41,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {59452#(< 6 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59448#(< 4 main_~y~0)} is VALID [2022-04-15 06:59:41,198 INFO L290 TraceCheckUtils]: 49: Hoare triple {59456#(< 8 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59452#(< 6 main_~y~0)} is VALID [2022-04-15 06:59:41,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {59460#(< 10 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59456#(< 8 main_~y~0)} is VALID [2022-04-15 06:59:41,199 INFO L290 TraceCheckUtils]: 47: Hoare triple {59464#(< 12 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59460#(< 10 main_~y~0)} is VALID [2022-04-15 06:59:41,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {59468#(< 14 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59464#(< 12 main_~y~0)} is VALID [2022-04-15 06:59:41,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {59472#(< 16 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59468#(< 14 main_~y~0)} is VALID [2022-04-15 06:59:41,201 INFO L290 TraceCheckUtils]: 44: Hoare triple {59476#(< 18 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59472#(< 16 main_~y~0)} is VALID [2022-04-15 06:59:41,201 INFO L290 TraceCheckUtils]: 43: Hoare triple {59480#(< 20 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59476#(< 18 main_~y~0)} is VALID [2022-04-15 06:59:41,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {59484#(< 22 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59480#(< 20 main_~y~0)} is VALID [2022-04-15 06:59:41,202 INFO L290 TraceCheckUtils]: 41: Hoare triple {59488#(< 24 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59484#(< 22 main_~y~0)} is VALID [2022-04-15 06:59:41,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {59492#(< 26 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59488#(< 24 main_~y~0)} is VALID [2022-04-15 06:59:41,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {59496#(< 28 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59492#(< 26 main_~y~0)} is VALID [2022-04-15 06:59:41,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {59500#(< 30 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59496#(< 28 main_~y~0)} is VALID [2022-04-15 06:59:41,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {59504#(< 32 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59500#(< 30 main_~y~0)} is VALID [2022-04-15 06:59:41,205 INFO L290 TraceCheckUtils]: 36: Hoare triple {59508#(< 34 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59504#(< 32 main_~y~0)} is VALID [2022-04-15 06:59:41,205 INFO L290 TraceCheckUtils]: 35: Hoare triple {59512#(< 36 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59508#(< 34 main_~y~0)} is VALID [2022-04-15 06:59:41,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {59516#(< 38 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59512#(< 36 main_~y~0)} is VALID [2022-04-15 06:59:41,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {59520#(< 40 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59516#(< 38 main_~y~0)} is VALID [2022-04-15 06:59:41,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {59524#(< 42 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59520#(< 40 main_~y~0)} is VALID [2022-04-15 06:59:41,207 INFO L290 TraceCheckUtils]: 31: Hoare triple {59528#(< 44 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59524#(< 42 main_~y~0)} is VALID [2022-04-15 06:59:41,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {59532#(< 46 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59528#(< 44 main_~y~0)} is VALID [2022-04-15 06:59:41,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {59536#(< 48 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59532#(< 46 main_~y~0)} is VALID [2022-04-15 06:59:41,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {59540#(< 50 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59536#(< 48 main_~y~0)} is VALID [2022-04-15 06:59:41,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {59544#(< 52 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59540#(< 50 main_~y~0)} is VALID [2022-04-15 06:59:41,210 INFO L290 TraceCheckUtils]: 26: Hoare triple {59548#(< 54 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59544#(< 52 main_~y~0)} is VALID [2022-04-15 06:59:41,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {59552#(< 56 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59548#(< 54 main_~y~0)} is VALID [2022-04-15 06:59:41,211 INFO L290 TraceCheckUtils]: 24: Hoare triple {59556#(< 58 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59552#(< 56 main_~y~0)} is VALID [2022-04-15 06:59:41,211 INFO L290 TraceCheckUtils]: 23: Hoare triple {59560#(< 60 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59556#(< 58 main_~y~0)} is VALID [2022-04-15 06:59:41,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {59564#(< 62 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59560#(< 60 main_~y~0)} is VALID [2022-04-15 06:59:41,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {59568#(< 64 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59564#(< 62 main_~y~0)} is VALID [2022-04-15 06:59:41,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {59572#(< 66 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59568#(< 64 main_~y~0)} is VALID [2022-04-15 06:59:41,213 INFO L290 TraceCheckUtils]: 19: Hoare triple {59576#(< 68 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59572#(< 66 main_~y~0)} is VALID [2022-04-15 06:59:41,214 INFO L290 TraceCheckUtils]: 18: Hoare triple {59580#(< 70 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59576#(< 68 main_~y~0)} is VALID [2022-04-15 06:59:41,214 INFO L290 TraceCheckUtils]: 17: Hoare triple {59584#(< 72 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59580#(< 70 main_~y~0)} is VALID [2022-04-15 06:59:41,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {59588#(< 74 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59584#(< 72 main_~y~0)} is VALID [2022-04-15 06:59:41,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {59592#(< 76 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59588#(< 74 main_~y~0)} is VALID [2022-04-15 06:59:41,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {59596#(< 78 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59592#(< 76 main_~y~0)} is VALID [2022-04-15 06:59:41,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {59600#(< 80 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59596#(< 78 main_~y~0)} is VALID [2022-04-15 06:59:41,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {59604#(< 82 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59600#(< 80 main_~y~0)} is VALID [2022-04-15 06:59:41,217 INFO L290 TraceCheckUtils]: 11: Hoare triple {59608#(< 84 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59604#(< 82 main_~y~0)} is VALID [2022-04-15 06:59:41,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {59612#(< 86 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {59608#(< 84 main_~y~0)} is VALID [2022-04-15 06:59:41,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {59612#(< 86 main_~y~0)} [227] L18-1_primed-->L18-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {59612#(< 86 main_~y~0)} is VALID [2022-04-15 06:59:41,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {59612#(< 86 main_~y~0)} [230] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse1 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse2 (= v_main_~x~0_3231 v_main_~x~0_3230)) (.cse3 (= v_main_~y~0_3773 v_main_~y~0_3772)) (.cse5 (<= 500000 v_main_~x~0_3231))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_3231 v_main_~y~0_3772))) (and (< v_main_~y~0_3773 v_main_~y~0_3772) (= .cse4 (+ v_main_~x~0_3230 v_main_~y~0_3773)) (< .cse4 (+ 1000001 v_main_~y~0_3773)) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_3231 1000000)))))) InVars {main_~y~0=v_main_~y~0_3773, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3231, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3772, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3230, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59612#(< 86 main_~y~0)} is VALID [2022-04-15 06:59:41,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {59612#(< 86 main_~y~0)} [229] L18-1_primed-->L11-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59612#(< 86 main_~y~0)} is VALID [2022-04-15 06:59:41,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {59612#(< 86 main_~y~0)} [228] L11-2-->L18-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_271| |v_main_#t~post4_270|)) (.cse1 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3229 v_main_~x~0_3228) (< v_main_~x~0_3228 500001)) (and (not (< v_main_~x~0_3229 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3229, main_#t~post4=|v_main_#t~post4_271|} OutVars{main_~x~0=v_main_~x~0_3228, main_#t~post4=|v_main_#t~post4_270|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59612#(< 86 main_~y~0)} is VALID [2022-04-15 06:59:41,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {59204#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59612#(< 86 main_~y~0)} is VALID [2022-04-15 06:59:41,220 INFO L272 TraceCheckUtils]: 4: Hoare triple {59204#true} call #t~ret9 := main(); {59204#true} is VALID [2022-04-15 06:59:41,220 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {59204#true} {59204#true} #52#return; {59204#true} is VALID [2022-04-15 06:59:41,220 INFO L290 TraceCheckUtils]: 2: Hoare triple {59204#true} assume true; {59204#true} is VALID [2022-04-15 06:59:41,220 INFO L290 TraceCheckUtils]: 1: Hoare triple {59204#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(17, 2);call #Ultimate.allocInit(12, 3); {59204#true} is VALID [2022-04-15 06:59:41,220 INFO L272 TraceCheckUtils]: 0: Hoare triple {59204#true} call ULTIMATE.init(); {59204#true} is VALID [2022-04-15 06:59:41,220 INFO L134 CoverageAnalysis]: Checked inductivity of 948 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 06:59:41,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592436987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:59:41,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:59:41,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 91 [2022-04-15 06:59:45,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:59:45,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520471214] [2022-04-15 06:59:45,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520471214] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:59:45,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:59:45,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [128] imperfect sequences [] total 128 [2022-04-15 06:59:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484106091] [2022-04-15 06:59:45,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:59:45,750 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 215 [2022-04-15 06:59:45,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:59:45,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 06:59:45,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:59:45,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2022-04-15 06:59:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:59:45,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2022-04-15 06:59:45,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11377, Invalid=18035, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:59:45,914 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 07:00:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:12,742 INFO L93 Difference]: Finished difference Result 429 states and 440 transitions. [2022-04-15 07:00:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2022-04-15 07:00:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 215 [2022-04-15 07:00:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:00:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 07:00:12,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 237 transitions. [2022-04-15 07:00:12,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 07:00:12,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 237 transitions. [2022-04-15 07:00:12,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 237 transitions. [2022-04-15 07:00:12,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:12,949 INFO L225 Difference]: With dead ends: 429 [2022-04-15 07:00:12,949 INFO L226 Difference]: Without dead ends: 221 [2022-04-15 07:00:12,955 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 454 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25711 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=26557, Invalid=61355, Unknown=0, NotChecked=0, Total=87912 [2022-04-15 07:00:12,955 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 586 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 13166 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 13638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 13166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:00:12,955 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [586 Valid, 79 Invalid, 13638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 13166 Invalid, 0 Unknown, 0 Unchecked, 11.0s Time] [2022-04-15 07:00:12,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-04-15 07:00:13,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2022-04-15 07:00:13,397 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:00:13,397 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 07:00:13,398 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 07:00:13,398 INFO L87 Difference]: Start difference. First operand 221 states. Second operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 07:00:13,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:13,401 INFO L93 Difference]: Finished difference Result 221 states and 224 transitions. [2022-04-15 07:00:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 224 transitions. [2022-04-15 07:00:13,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:13,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:13,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 221 states. [2022-04-15 07:00:13,402 INFO L87 Difference]: Start difference. First operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 221 states. [2022-04-15 07:00:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:00:13,405 INFO L93 Difference]: Finished difference Result 221 states and 224 transitions. [2022-04-15 07:00:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 224 transitions. [2022-04-15 07:00:13,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:00:13,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:00:13,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:00:13,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:00:13,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 216 states have (on average 1.0185185185185186) internal successors, (220), 216 states have internal predecessors, (220), 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 07:00:13,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 224 transitions. [2022-04-15 07:00:13,409 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 224 transitions. Word has length 215 [2022-04-15 07:00:13,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:00:13,409 INFO L478 AbstractCegarLoop]: Abstraction has 221 states and 224 transitions. [2022-04-15 07:00:13,409 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 128 states have (on average 1.6484375) internal successors, (211), 127 states have internal predecessors, (211), 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 07:00:13,409 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 221 states and 224 transitions. [2022-04-15 07:00:13,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:00:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 224 transitions. [2022-04-15 07:00:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-04-15 07:00:13,629 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:00:13,629 INFO L499 BasicCegarLoop]: trace histogram [82, 81, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:00:13,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 07:00:13,829 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 07:00:13,830 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:00:13,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:00:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1630000335, now seen corresponding path program 44 times [2022-04-15 07:00:13,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:00:13,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [501127084] [2022-04-15 07:00:16,337 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:16,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:19,108 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:00:19,219 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:00:19,220 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:00:19,222 INFO L85 PathProgramCache]: Analyzing trace with hash -573779775, now seen corresponding path program 1 times [2022-04-15 07:00:19,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:00:19,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197928328] [2022-04-15 07:00:19,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:00:19,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:00:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat