/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_14.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 03:48:34,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 03:48:34,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 03:48:34,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 03:48:34,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 03:48:34,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 03:48:34,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 03:48:34,423 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 03:48:34,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 03:48:34,432 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 03:48:34,433 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 03:48:34,434 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 03:48:34,434 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 03:48:34,436 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 03:48:34,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 03:48:34,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 03:48:34,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 03:48:34,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 03:48:34,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 03:48:34,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 03:48:34,450 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 03:48:34,452 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 03:48:34,454 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 03:48:34,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 03:48:34,456 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 03:48:34,462 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 03:48:34,463 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 03:48:34,463 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 03:48:34,464 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 03:48:34,465 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 03:48:34,466 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 03:48:34,466 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 03:48:34,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 03:48:34,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 03:48:34,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 03:48:34,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 03:48:34,470 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 03:48:34,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 03:48:34,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 03:48:34,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 03:48:34,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 03:48:34,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 03:48:34,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 03:48:34,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 03:48:34,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 03:48:34,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 03:48:34,488 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 03:48:34,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 03:48:34,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 03:48:34,489 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 03:48:34,489 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 03:48:34,489 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 03:48:34,490 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 03:48:34,490 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 03:48:34,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 03:48:34,490 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 03:48:34,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 03:48:34,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 03:48:34,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 03:48:34,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 03:48:34,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 03:48:34,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:48:34,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 03:48:34,492 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 03:48:34,492 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 03:48:34,492 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 03:48:34,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 03:48:34,492 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 03:48:34,492 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-28 03:48:34,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 03:48:34,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 03:48:34,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 03:48:34,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 03:48:34,758 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 03:48:34,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c [2022-04-28 03:48:34,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7666d794d/906ec4772e7c476ea358538c52485ddf/FLAG2653fdc3c [2022-04-28 03:48:35,212 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 03:48:35,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_14.c [2022-04-28 03:48:35,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7666d794d/906ec4772e7c476ea358538c52485ddf/FLAG2653fdc3c [2022-04-28 03:48:35,627 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7666d794d/906ec4772e7c476ea358538c52485ddf [2022-04-28 03:48:35,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 03:48:35,631 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 03:48:35,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 03:48:35,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 03:48:35,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 03:48:35,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ef4dcf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35, skipping insertion in model container [2022-04-28 03:48:35,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,647 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 03:48:35,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 03:48:35,827 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_14.c[319,332] [2022-04-28 03:48:35,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:48:35,848 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 03:48:35,859 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_14.c[319,332] [2022-04-28 03:48:35,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 03:48:35,875 INFO L208 MainTranslator]: Completed translation [2022-04-28 03:48:35,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35 WrapperNode [2022-04-28 03:48:35,876 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 03:48:35,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 03:48:35,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 03:48:35,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 03:48:35,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,894 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,895 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,905 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 03:48:35,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 03:48:35,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 03:48:35,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 03:48:35,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (1/1) ... [2022-04-28 03:48:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 03:48:35,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:35,949 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-28 03:48:35,952 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-28 03:48:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 03:48:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 03:48:35,994 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 03:48:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 03:48:35,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 03:48:35,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 03:48:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 03:48:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 03:48:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 03:48:35,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 03:48:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 03:48:35,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 03:48:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 03:48:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 03:48:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 03:48:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 03:48:35,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 03:48:36,062 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 03:48:36,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 03:48:36,273 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 03:48:36,279 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 03:48:36,279 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 03:48:36,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:48:36 BoogieIcfgContainer [2022-04-28 03:48:36,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 03:48:36,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 03:48:36,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 03:48:36,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 03:48:36,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 03:48:35" (1/3) ... [2022-04-28 03:48:36,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9df37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:48:36, skipping insertion in model container [2022-04-28 03:48:36,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 03:48:35" (2/3) ... [2022-04-28 03:48:36,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c9df37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 03:48:36, skipping insertion in model container [2022-04-28 03:48:36,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 03:48:36" (3/3) ... [2022-04-28 03:48:36,289 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_14.c [2022-04-28 03:48:36,303 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 03:48:36,304 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 03:48:36,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 03:48:36,377 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2b260c83, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4fa50f9f [2022-04-28 03:48:36,378 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 03:48:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 03:48:36,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:48:36,406 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:36,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:36,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:36,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:36,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1104150160, now seen corresponding path program 1 times [2022-04-28 03:48:36,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:36,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534885238] [2022-04-28 03:48:36,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:48:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1104150160, now seen corresponding path program 2 times [2022-04-28 03:48:36,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:36,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969531051] [2022-04-28 03:48:36,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:36,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:36,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(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(18, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 03:48:36,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:48:36,653 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #53#return; {25#true} is VALID [2022-04-28 03:48:36,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:36,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(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(18, 2);call #Ultimate.allocInit(12, 3); {25#true} is VALID [2022-04-28 03:48:36,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 03:48:36,656 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #53#return; {25#true} is VALID [2022-04-28 03:48:36,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret9 := main(); {25#true} is VALID [2022-04-28 03:48:36,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25#true} is VALID [2022-04-28 03:48:36,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 03:48:36,657 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#false} assume !true; {26#false} is VALID [2022-04-28 03:48:36,657 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {26#false} is VALID [2022-04-28 03:48:36,658 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 03:48:36,658 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 03:48:36,658 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 03:48:36,659 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-28 03:48:36,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:36,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969531051] [2022-04-28 03:48:36,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969531051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:36,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:36,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:48:36,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:36,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534885238] [2022-04-28 03:48:36,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534885238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:36,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:36,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 03:48:36,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956647078] [2022-04-28 03:48:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:36,669 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-28 03:48:36,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:36,678 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-28 03:48:36,694 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-28 03:48:36,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 03:48:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:36,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 03:48:36,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 03:48:36,716 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) 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-28 03:48:36,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:36,830 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-28 03:48:36,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 03:48:36,831 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-28 03:48:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:36,832 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-28 03:48:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 03:48:36,839 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-28 03:48:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-28 03:48:36,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-28 03:48:36,909 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-28 03:48:36,917 INFO L225 Difference]: With dead ends: 36 [2022-04-28 03:48:36,917 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 03:48:36,920 INFO L412 NwaCegarLoop]: 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-28 03:48:36,923 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:36,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:48:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 03:48:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 03:48:36,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:36,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:36,972 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:36,973 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:36,980 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:48:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:48:36,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:36,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:36,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 03:48:36,981 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-28 03:48:36,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:36,985 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 03:48:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:48:36,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:36,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:36,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:36,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:36,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-04-28 03:48:36,994 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 12 [2022-04-28 03:48:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:36,994 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-04-28 03:48:36,995 INFO L496 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-28 03:48:36,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 20 transitions. [2022-04-28 03:48:37,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 03:48:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 03:48:37,035 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:37,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:37,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 03:48:37,036 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:37,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:37,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1394135754, now seen corresponding path program 1 times [2022-04-28 03:48:37,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:37,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1574459235] [2022-04-28 03:48:37,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 03:48:37,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1394135754, now seen corresponding path program 2 times [2022-04-28 03:48:37,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:37,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599193083] [2022-04-28 03:48:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:37,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:37,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:37,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {179#(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(18, 2);call #Ultimate.allocInit(12, 3); {173#true} is VALID [2022-04-28 03:48:37,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 03:48:37,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173#true} {173#true} #53#return; {173#true} is VALID [2022-04-28 03:48:37,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {173#true} call ULTIMATE.init(); {179#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:37,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {179#(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(18, 2);call #Ultimate.allocInit(12, 3); {173#true} is VALID [2022-04-28 03:48:37,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#true} assume true; {173#true} is VALID [2022-04-28 03:48:37,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173#true} {173#true} #53#return; {173#true} is VALID [2022-04-28 03:48:37,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {173#true} call #t~ret9 := main(); {173#true} is VALID [2022-04-28 03:48:37,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {173#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {178#(= main_~x~0 0)} is VALID [2022-04-28 03:48:37,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {178#(= main_~x~0 0)} assume !(~x~0 < 1000000); {174#false} is VALID [2022-04-28 03:48:37,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#false} assume !(~y~0 > 0); {174#false} is VALID [2022-04-28 03:48:37,142 INFO L272 TraceCheckUtils]: 8: Hoare triple {174#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {174#false} is VALID [2022-04-28 03:48:37,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#false} ~cond := #in~cond; {174#false} is VALID [2022-04-28 03:48:37,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {174#false} assume 0 == ~cond; {174#false} is VALID [2022-04-28 03:48:37,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {174#false} assume !false; {174#false} is VALID [2022-04-28 03:48:37,143 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-28 03:48:37,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:37,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599193083] [2022-04-28 03:48:37,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599193083] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:37,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:37,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:48:37,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:37,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1574459235] [2022-04-28 03:48:37,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1574459235] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:37,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:37,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:48:37,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806348597] [2022-04-28 03:48:37,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:37,145 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-28 03:48:37,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:37,146 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-28 03:48:37,161 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-28 03:48:37,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 03:48:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:37,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 03:48:37,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 03:48:37,163 INFO L87 Difference]: Start difference. First operand 17 states and 20 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-28 03:48:37,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:37,267 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-04-28 03:48:37,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 03:48:37,268 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-28 03:48:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:37,269 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-28 03:48:37,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 03:48:37,274 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-28 03:48:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 03:48:37,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 03:48:37,332 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-28 03:48:37,334 INFO L225 Difference]: With dead ends: 30 [2022-04-28 03:48:37,335 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 03:48:37,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-28 03:48:37,338 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:37,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 03:48:37,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 03:48:37,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 03:48:37,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:37,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:37,349 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:37,350 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:37,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:37,352 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:48:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:48:37,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:37,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:37,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 03:48:37,354 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 03:48:37,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:37,357 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-28 03:48:37,357 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:48:37,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:37,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:37,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:37,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:37,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:37,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-28 03:48:37,362 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-28 03:48:37,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:37,362 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-28 03:48:37,363 INFO L496 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-28 03:48:37,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 22 transitions. [2022-04-28 03:48:37,389 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-28 03:48:37,389 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-28 03:48:37,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 03:48:37,390 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:37,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:37,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 03:48:37,393 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:37,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:37,394 INFO L85 PathProgramCache]: Analyzing trace with hash 479542393, now seen corresponding path program 1 times [2022-04-28 03:48:37,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:37,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012737098] [2022-04-28 03:48:37,658 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-28 03:48:37,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:37,663 INFO L85 PathProgramCache]: Analyzing trace with hash -697934047, now seen corresponding path program 1 times [2022-04-28 03:48:37,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:37,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873820035] [2022-04-28 03:48:37,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:37,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:37,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:37,709 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(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(18, 2);call #Ultimate.allocInit(12, 3); {320#true} is VALID [2022-04-28 03:48:37,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-28 03:48:37,709 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {320#true} {320#true} #53#return; {320#true} is VALID [2022-04-28 03:48:37,710 INFO L272 TraceCheckUtils]: 0: Hoare triple {320#true} call ULTIMATE.init(); {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:37,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(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(18, 2);call #Ultimate.allocInit(12, 3); {320#true} is VALID [2022-04-28 03:48:37,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#true} assume true; {320#true} is VALID [2022-04-28 03:48:37,711 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {320#true} {320#true} #53#return; {320#true} is VALID [2022-04-28 03:48:37,711 INFO L272 TraceCheckUtils]: 4: Hoare triple {320#true} call #t~ret9 := main(); {320#true} is VALID [2022-04-28 03:48:37,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {320#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {325#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:37,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {325#(<= 500000 main_~y~0)} [61] L10-2-->L17-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] {325#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:37,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(<= 500000 main_~y~0)} [60] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {325#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:37,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#(<= 500000 main_~y~0)} assume !(~y~0 > 0); {321#false} is VALID [2022-04-28 03:48:37,714 INFO L272 TraceCheckUtils]: 9: Hoare triple {321#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {321#false} is VALID [2022-04-28 03:48:37,714 INFO L290 TraceCheckUtils]: 10: Hoare triple {321#false} ~cond := #in~cond; {321#false} is VALID [2022-04-28 03:48:37,714 INFO L290 TraceCheckUtils]: 11: Hoare triple {321#false} assume 0 == ~cond; {321#false} is VALID [2022-04-28 03:48:37,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {321#false} assume !false; {321#false} is VALID [2022-04-28 03:48:37,715 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-28 03:48:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:37,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873820035] [2022-04-28 03:48:37,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873820035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:37,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:37,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 03:48:37,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:37,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012737098] [2022-04-28 03:48:37,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012737098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:37,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:37,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 03:48:37,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549578803] [2022-04-28 03:48:37,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:37,764 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-28 03:48:37,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:37,765 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-28 03:48:37,778 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-28 03:48:37,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 03:48:37,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:37,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 03:48:37,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 03:48:37,779 INFO L87 Difference]: Start difference. First operand 19 states and 22 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-28 03:48:37,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:37,951 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2022-04-28 03:48:37,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 03:48:37,951 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-28 03:48:37,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:37,951 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-28 03:48:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-28 03:48:37,954 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-28 03:48:37,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions. [2022-04-28 03:48:37,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 38 transitions. [2022-04-28 03:48:37,993 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-28 03:48:37,994 INFO L225 Difference]: With dead ends: 32 [2022-04-28 03:48:37,994 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 03:48:37,994 INFO L412 NwaCegarLoop]: 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-28 03:48:37,995 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 16 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:37,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:48:37,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 03:48:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 03:48:38,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:38,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:38,009 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:38,010 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:38,011 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:48:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:48:38,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:38,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:38,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 03:48:38,012 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-28 03:48:38,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:38,014 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-28 03:48:38,014 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:48:38,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:38,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:38,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:38,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:38,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:38,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-28 03:48:38,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 14 [2022-04-28 03:48:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:38,017 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-28 03:48:38,017 INFO L496 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-28 03:48:38,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-28 03:48:38,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:38,046 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 03:48:38,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 03:48:38,046 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:38,047 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:38,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 03:48:38,047 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:38,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:38,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1190018304, now seen corresponding path program 1 times [2022-04-28 03:48:38,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:38,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432986460] [2022-04-28 03:48:38,217 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-28 03:48:38,628 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-28 03:48:38,630 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:38,634 INFO L85 PathProgramCache]: Analyzing trace with hash 665939265, now seen corresponding path program 1 times [2022-04-28 03:48:38,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324103491] [2022-04-28 03:48:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:38,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:38,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:38,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {503#(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(18, 2);call #Ultimate.allocInit(12, 3); {493#true} is VALID [2022-04-28 03:48:38,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#true} assume true; {493#true} is VALID [2022-04-28 03:48:38,778 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {493#true} {493#true} #53#return; {493#true} is VALID [2022-04-28 03:48:38,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {503#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:38,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {503#(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(18, 2);call #Ultimate.allocInit(12, 3); {493#true} is VALID [2022-04-28 03:48:38,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2022-04-28 03:48:38,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #53#return; {493#true} is VALID [2022-04-28 03:48:38,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret9 := main(); {493#true} is VALID [2022-04-28 03:48:38,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {493#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {498#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:48:38,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [63] L10-2-->L17-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] {499#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:38,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {499#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [64] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:38,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {499#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [65] L10-2-->L17-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] {500#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:38,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {500#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [62] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:38,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(<= 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; {502#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:38,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(<= 499998 main_~y~0)} assume !(~y~0 > 0); {494#false} is VALID [2022-04-28 03:48:38,798 INFO L272 TraceCheckUtils]: 12: Hoare triple {494#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {494#false} is VALID [2022-04-28 03:48:38,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2022-04-28 03:48:38,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2022-04-28 03:48:38,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2022-04-28 03:48:38,799 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-28 03:48:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324103491] [2022-04-28 03:48:38,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324103491] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:38,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817014331] [2022-04-28 03:48:38,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:38,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:38,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:38,827 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-28 03:48:38,895 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-28 03:48:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:38,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-28 03:48:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:38,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:39,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2022-04-28 03:48:39,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#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(18, 2);call #Ultimate.allocInit(12, 3); {493#true} is VALID [2022-04-28 03:48:39,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2022-04-28 03:48:39,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #53#return; {493#true} is VALID [2022-04-28 03:48:39,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret9 := main(); {493#true} is VALID [2022-04-28 03:48:39,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {493#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:39,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {501#(<= 500000 main_~y~0)} [63] L10-2-->L17-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] {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:39,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {501#(<= 500000 main_~y~0)} [64] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:39,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {501#(<= 500000 main_~y~0)} [65] L10-2-->L17-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] {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:39,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {501#(<= 500000 main_~y~0)} [62] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {501#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:39,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {501#(<= 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; {502#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:39,336 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#(<= 499998 main_~y~0)} assume !(~y~0 > 0); {494#false} is VALID [2022-04-28 03:48:39,337 INFO L272 TraceCheckUtils]: 12: Hoare triple {494#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {494#false} is VALID [2022-04-28 03:48:39,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2022-04-28 03:48:39,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2022-04-28 03:48:39,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2022-04-28 03:48:39,338 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-28 03:48:39,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:39,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {494#false} assume !false; {494#false} is VALID [2022-04-28 03:48:39,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {494#false} assume 0 == ~cond; {494#false} is VALID [2022-04-28 03:48:39,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {494#false} ~cond := #in~cond; {494#false} is VALID [2022-04-28 03:48:39,617 INFO L272 TraceCheckUtils]: 12: Hoare triple {494#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {494#false} is VALID [2022-04-28 03:48:39,617 INFO L290 TraceCheckUtils]: 11: Hoare triple {564#(< 0 main_~y~0)} assume !(~y~0 > 0); {494#false} is VALID [2022-04-28 03:48:39,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#(< 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; {564#(< 0 main_~y~0)} is VALID [2022-04-28 03:48:39,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#(< 2 main_~y~0)} [62] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {568#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:39,619 INFO L290 TraceCheckUtils]: 8: Hoare triple {568#(< 2 main_~y~0)} [65] L10-2-->L17-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] {568#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:39,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {568#(< 2 main_~y~0)} [64] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {568#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:39,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {568#(< 2 main_~y~0)} [63] L10-2-->L17-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] {568#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:39,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {493#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {568#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:39,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {493#true} call #t~ret9 := main(); {493#true} is VALID [2022-04-28 03:48:39,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {493#true} {493#true} #53#return; {493#true} is VALID [2022-04-28 03:48:39,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {493#true} assume true; {493#true} is VALID [2022-04-28 03:48:39,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {493#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(18, 2);call #Ultimate.allocInit(12, 3); {493#true} is VALID [2022-04-28 03:48:39,622 INFO L272 TraceCheckUtils]: 0: Hoare triple {493#true} call ULTIMATE.init(); {493#true} is VALID [2022-04-28 03:48:39,622 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-28 03:48:39,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817014331] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:39,622 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:39,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 10 [2022-04-28 03:48:39,794 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:39,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432986460] [2022-04-28 03:48:39,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432986460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:39,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:39,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 03:48:39,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954247995] [2022-04-28 03:48:39,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:39,795 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-28 03:48:39,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:39,795 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-28 03:48:39,814 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-28 03:48:39,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 03:48:39,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:39,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 03:48:39,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2022-04-28 03:48:39,815 INFO L87 Difference]: Start difference. First operand 23 states and 27 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-28 03:48:40,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:40,117 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-28 03:48:40,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 03:48:40,117 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-28 03:48:40,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:40,129 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-28 03:48:40,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 03:48:40,134 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-28 03:48:40,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 49 transitions. [2022-04-28 03:48:40,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 49 transitions. [2022-04-28 03:48:40,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:40,184 INFO L225 Difference]: With dead ends: 45 [2022-04-28 03:48:40,185 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 03:48:40,186 INFO L412 NwaCegarLoop]: 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-28 03:48:40,188 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:40,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:48:40,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 03:48:40,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 03:48:40,222 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:40,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:40,223 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:40,224 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:40,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:40,229 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:48:40,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 03:48:40,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:40,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:40,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 03:48:40,234 INFO L87 Difference]: Start difference. First operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-04-28 03:48:40,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:40,238 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-28 03:48:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 03:48:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:40,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:40,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:40,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:40,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:40,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-04-28 03:48:40,242 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 19 [2022-04-28 03:48:40,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:40,243 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-04-28 03:48:40,243 INFO L496 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-28 03:48:40,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 35 transitions. [2022-04-28 03:48:40,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:40,281 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-04-28 03:48:40,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 03:48:40,283 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:40,283 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:40,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 03:48:40,499 WARN L477 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-28 03:48:40,500 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:40,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:40,500 INFO L85 PathProgramCache]: Analyzing trace with hash -95096280, now seen corresponding path program 2 times [2022-04-28 03:48:40,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:40,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [951215898] [2022-04-28 03:48:40,651 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-28 03:48:44,832 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:44,998 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-28 03:48:45,000 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash -438606398, now seen corresponding path program 1 times [2022-04-28 03:48:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048246465] [2022-04-28 03:48:45,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:45,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:45,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:45,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:45,123 INFO L290 TraceCheckUtils]: 0: Hoare triple {838#(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(18, 2);call #Ultimate.allocInit(12, 3); {827#true} is VALID [2022-04-28 03:48:45,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 03:48:45,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #53#return; {827#true} is VALID [2022-04-28 03:48:45,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:45,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(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(18, 2);call #Ultimate.allocInit(12, 3); {827#true} is VALID [2022-04-28 03:48:45,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 03:48:45,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #53#return; {827#true} is VALID [2022-04-28 03:48:45,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret9 := main(); {827#true} is VALID [2022-04-28 03:48:45,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {832#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:48:45,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [67] L10-2-->L17-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] {833#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:45,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {833#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [68] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {833#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:45,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {833#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [69] L10-2-->L17-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] {834#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:45,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {834#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [66] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {835#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {835#(<= 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; {836#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:45,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#(<= 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; {837#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:45,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#(<= 499996 main_~y~0)} assume !(~y~0 > 0); {828#false} is VALID [2022-04-28 03:48:45,131 INFO L272 TraceCheckUtils]: 13: Hoare triple {828#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {828#false} is VALID [2022-04-28 03:48:45,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-28 03:48:45,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-28 03:48:45,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-28 03:48:45,132 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-28 03:48:45,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:45,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048246465] [2022-04-28 03:48:45,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048246465] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:45,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535165886] [2022-04-28 03:48:45,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:45,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:45,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:45,134 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-28 03:48:45,159 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-28 03:48:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:45,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 03:48:45,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:45,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:45,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2022-04-28 03:48:45,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#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(18, 2);call #Ultimate.allocInit(12, 3); {827#true} is VALID [2022-04-28 03:48:45,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 03:48:45,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #53#return; {827#true} is VALID [2022-04-28 03:48:45,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret9 := main(); {827#true} is VALID [2022-04-28 03:48:45,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {835#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {835#(<= 500000 main_~y~0)} [67] L10-2-->L17-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#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {835#(<= 500000 main_~y~0)} [68] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {835#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {835#(<= 500000 main_~y~0)} [69] L10-2-->L17-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] {835#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {835#(<= 500000 main_~y~0)} [66] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {835#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:45,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {835#(<= 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; {836#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:45,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#(<= 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; {837#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:45,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#(<= 499996 main_~y~0)} assume !(~y~0 > 0); {828#false} is VALID [2022-04-28 03:48:45,456 INFO L272 TraceCheckUtils]: 13: Hoare triple {828#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {828#false} is VALID [2022-04-28 03:48:45,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-28 03:48:45,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-28 03:48:45,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-28 03:48:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:45,457 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:45,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-28 03:48:45,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {828#false} assume 0 == ~cond; {828#false} is VALID [2022-04-28 03:48:45,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#false} ~cond := #in~cond; {828#false} is VALID [2022-04-28 03:48:45,776 INFO L272 TraceCheckUtils]: 13: Hoare triple {828#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {828#false} is VALID [2022-04-28 03:48:45,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {902#(< 0 main_~y~0)} assume !(~y~0 > 0); {828#false} is VALID [2022-04-28 03:48:45,778 INFO L290 TraceCheckUtils]: 11: Hoare triple {906#(< 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; {902#(< 0 main_~y~0)} is VALID [2022-04-28 03:48:45,778 INFO L290 TraceCheckUtils]: 10: Hoare triple {910#(< 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; {906#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:45,778 INFO L290 TraceCheckUtils]: 9: Hoare triple {910#(< 4 main_~y~0)} [66] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {910#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:45,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {910#(< 4 main_~y~0)} [69] L10-2-->L17-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] {910#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:45,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {910#(< 4 main_~y~0)} [68] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {910#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:45,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {910#(< 4 main_~y~0)} [67] L10-2-->L17-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] {910#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:45,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {910#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:45,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret9 := main(); {827#true} is VALID [2022-04-28 03:48:45,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #53#return; {827#true} is VALID [2022-04-28 03:48:45,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-28 03:48:45,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#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(18, 2);call #Ultimate.allocInit(12, 3); {827#true} is VALID [2022-04-28 03:48:45,782 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {827#true} is VALID [2022-04-28 03:48:45,782 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:48:45,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535165886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:45,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:45,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2022-04-28 03:48:45,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:45,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [951215898] [2022-04-28 03:48:45,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [951215898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:45,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:45,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 03:48:45,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788449367] [2022-04-28 03:48:45,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:45,984 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-28 03:48:45,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:45,985 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-28 03:48:46,005 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-28 03:48:46,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 03:48:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 03:48:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=168, Unknown=0, NotChecked=0, Total=272 [2022-04-28 03:48:46,007 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-28 03:48:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:46,409 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-28 03:48:46,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 03:48:46,410 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-28 03:48:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:46,410 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-28 03:48:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 03:48:46,412 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-28 03:48:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2022-04-28 03:48:46,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2022-04-28 03:48:46,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:46,469 INFO L225 Difference]: With dead ends: 49 [2022-04-28 03:48:46,469 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 03:48:46,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2022-04-28 03:48:46,470 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:46,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 27 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:48:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 03:48:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 03:48:46,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:46,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:46,501 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:46,501 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:46,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:46,503 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 03:48:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 03:48:46,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:46,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:46,504 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 03:48:46,504 INFO L87 Difference]: Start difference. First operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 33 states. [2022-04-28 03:48:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:46,506 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 03:48:46,506 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 03:48:46,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:46,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:46,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:46,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:46,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-28 03:48:46,508 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 22 [2022-04-28 03:48:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:46,508 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-28 03:48:46,508 INFO L496 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-28 03:48:46,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 38 transitions. [2022-04-28 03:48:46,545 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-28 03:48:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 03:48:46,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 03:48:46,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:46,546 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:46,566 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-28 03:48:46,755 WARN L477 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-28 03:48:46,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:46,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 423498582, now seen corresponding path program 3 times [2022-04-28 03:48:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:46,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [829462849] [2022-04-28 03:48:50,873 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:48:50,935 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-28 03:48:51,249 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-28 03:48:51,250 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1815240545, now seen corresponding path program 1 times [2022-04-28 03:48:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:51,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343297134] [2022-04-28 03:48:51,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:51,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:51,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:51,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:51,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {1206#(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(18, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-28 03:48:51,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:48:51,386 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1194#true} {1194#true} #53#return; {1194#true} is VALID [2022-04-28 03:48:51,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1206#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:51,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {1206#(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(18, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-28 03:48:51,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:48:51,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #53#return; {1194#true} is VALID [2022-04-28 03:48:51,387 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret9 := main(); {1194#true} is VALID [2022-04-28 03:48:51,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1199#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:48:51,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {1199#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [71] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_62 500001) (< v_main_~x~0_63 v_main_~x~0_62)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_63)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1200#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:51,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {1200#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [72] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1200#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:51,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {1200#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [73] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_65)) (.cse1 (= |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_65 v_main_~x~0_64)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and (= (+ v_main_~x~0_65 v_main_~y~0_36) (+ v_main_~x~0_64 v_main_~y~0_37)) (< v_main_~x~0_65 v_main_~x~0_64) .cse0 (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .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_65, 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_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1201#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:48:51,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {1201#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [70] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1202#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:51,391 INFO L290 TraceCheckUtils]: 10: Hoare triple {1202#(<= 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; {1203#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:51,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {1203#(<= 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; {1204#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:51,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1204#(<= 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; {1205#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:48:51,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {1205#(<= 499994 main_~y~0)} assume !(~y~0 > 0); {1195#false} is VALID [2022-04-28 03:48:51,393 INFO L272 TraceCheckUtils]: 14: Hoare triple {1195#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1195#false} is VALID [2022-04-28 03:48:51,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:48:51,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:48:51,393 INFO L290 TraceCheckUtils]: 17: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:48:51,394 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-28 03:48:51,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343297134] [2022-04-28 03:48:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343297134] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703419104] [2022-04-28 03:48:51,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:51,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:51,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:51,396 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-28 03:48:51,424 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-28 03:48:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:51,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:48:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:51,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:51,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-28 03:48:51,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#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(18, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-28 03:48:51,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:48:51,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #53#return; {1194#true} is VALID [2022-04-28 03:48:51,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret9 := main(); {1194#true} is VALID [2022-04-28 03:48:51,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1225#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:48:51,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1225#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [71] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_62 500001) (< v_main_~x~0_63 v_main_~x~0_62)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_63)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1229#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:48:51,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1229#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [72] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1229#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:48:51,907 INFO L290 TraceCheckUtils]: 8: Hoare triple {1229#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [73] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_65)) (.cse1 (= |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_65 v_main_~x~0_64)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and (= (+ v_main_~x~0_65 v_main_~y~0_36) (+ v_main_~x~0_64 v_main_~y~0_37)) (< v_main_~x~0_65 v_main_~x~0_64) .cse0 (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .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_65, 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_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1236#(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-28 03:48:51,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1236#(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)))} [70] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1240#(< 999999 main_~y~0)} is VALID [2022-04-28 03:48:51,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {1240#(< 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; {1244#(< 999997 main_~y~0)} is VALID [2022-04-28 03:48:51,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {1244#(< 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; {1248#(< 999995 main_~y~0)} is VALID [2022-04-28 03:48:51,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(< 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; {1252#(< 999993 main_~y~0)} is VALID [2022-04-28 03:48:51,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#(< 999993 main_~y~0)} assume !(~y~0 > 0); {1195#false} is VALID [2022-04-28 03:48:51,910 INFO L272 TraceCheckUtils]: 14: Hoare triple {1195#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1195#false} is VALID [2022-04-28 03:48:51,910 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:48:51,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:48:51,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:48:51,911 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-28 03:48:51,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:52,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {1195#false} assume !false; {1195#false} is VALID [2022-04-28 03:48:52,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#false} assume 0 == ~cond; {1195#false} is VALID [2022-04-28 03:48:52,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {1195#false} ~cond := #in~cond; {1195#false} is VALID [2022-04-28 03:48:52,487 INFO L272 TraceCheckUtils]: 14: Hoare triple {1195#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1195#false} is VALID [2022-04-28 03:48:52,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#(< 0 main_~y~0)} assume !(~y~0 > 0); {1195#false} is VALID [2022-04-28 03:48:52,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {1284#(< 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; {1280#(< 0 main_~y~0)} is VALID [2022-04-28 03:48:52,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {1288#(< 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; {1284#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:52,490 INFO L290 TraceCheckUtils]: 10: Hoare triple {1292#(< 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; {1288#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:52,490 INFO L290 TraceCheckUtils]: 9: Hoare triple {1296#(or (< main_~x~0 1000000) (< 6 main_~y~0))} [70] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1292#(< 6 main_~y~0)} is VALID [2022-04-28 03:48:52,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {1300#(and (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (not (<= 500000 main_~x~0)) (<= 6 main_~y~0)))} [73] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_65)) (.cse1 (= |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_65 v_main_~x~0_64)) (.cse4 (= |v_main_#t~post6_18| |v_main_#t~post6_17|))) (or (and (= (+ v_main_~x~0_65 v_main_~y~0_36) (+ v_main_~x~0_64 v_main_~y~0_37)) (< v_main_~x~0_65 v_main_~x~0_64) .cse0 (< v_main_~x~0_64 1000001)) (and (or (not (< v_main_~x~0_65 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4) (and .cse1 .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_65, 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_64, main_#t~post6=|v_main_#t~post6_17|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1296#(or (< main_~x~0 1000000) (< 6 main_~y~0))} is VALID [2022-04-28 03:48:52,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {1300#(and (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (not (<= 500000 main_~x~0)) (<= 6 main_~y~0)))} [72] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1300#(and (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (not (<= 500000 main_~x~0)) (<= 6 main_~y~0)))} is VALID [2022-04-28 03:48:52,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {1307#(and (<= 0 (+ main_~y~0 499993)) (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (<= 6 main_~y~0)))} [71] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_63 v_main_~x~0_62)) (.cse1 (= |v_main_#t~post4_21| |v_main_#t~post4_20|))) (or (and (< v_main_~x~0_62 500001) (< v_main_~x~0_63 v_main_~x~0_62)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_63)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_63, main_#t~post4=|v_main_#t~post4_21|} OutVars{main_~x~0=v_main_~x~0_62, main_#t~post4=|v_main_#t~post4_20|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {1300#(and (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (not (<= 500000 main_~x~0)) (<= 6 main_~y~0)))} is VALID [2022-04-28 03:48:52,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {1194#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1307#(and (<= 0 (+ main_~y~0 499993)) (or (< main_~x~0 1000000) (< 6 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999994)) (<= 6 main_~y~0)))} is VALID [2022-04-28 03:48:52,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {1194#true} call #t~ret9 := main(); {1194#true} is VALID [2022-04-28 03:48:52,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1194#true} {1194#true} #53#return; {1194#true} is VALID [2022-04-28 03:48:52,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {1194#true} assume true; {1194#true} is VALID [2022-04-28 03:48:52,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {1194#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(18, 2);call #Ultimate.allocInit(12, 3); {1194#true} is VALID [2022-04-28 03:48:52,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {1194#true} call ULTIMATE.init(); {1194#true} is VALID [2022-04-28 03:48:52,498 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-28 03:48:52,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703419104] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:52,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:52,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 24 [2022-04-28 03:48:52,718 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:52,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [829462849] [2022-04-28 03:48:52,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [829462849] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:52,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:52,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 03:48:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906898763] [2022-04-28 03:48:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:52,719 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-28 03:48:52,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:52,719 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-28 03:48:52,743 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-28 03:48:52,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 03:48:52,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:52,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 03:48:52,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=552, Unknown=0, NotChecked=0, Total=870 [2022-04-28 03:48:52,745 INFO L87 Difference]: Start difference. First operand 33 states and 38 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-28 03:48:53,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:53,214 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2022-04-28 03:48:53,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 03:48:53,214 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-28 03:48:53,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:53,214 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-28 03:48:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 03:48:53,216 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-28 03:48:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 03:48:53,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-28 03:48:53,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:53,270 INFO L225 Difference]: With dead ends: 53 [2022-04-28 03:48:53,270 INFO L226 Difference]: Without dead ends: 36 [2022-04-28 03:48:53,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1049, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:48:53,271 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:53,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 22 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 03:48:53,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-28 03:48:53,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-28 03:48:53,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:53,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:53,314 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:53,314 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:53,316 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:48:53,316 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 03:48:53,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:53,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:53,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-28 03:48:53,317 INFO L87 Difference]: Start difference. First operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 36 states. [2022-04-28 03:48:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:53,318 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-28 03:48:53,318 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 03:48:53,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:53,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:53,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:53,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:53,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.206896551724138) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:53,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-04-28 03:48:53,320 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 25 [2022-04-28 03:48:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:53,320 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-04-28 03:48:53,320 INFO L496 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-28 03:48:53,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 41 transitions. [2022-04-28 03:48:53,361 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-28 03:48:53,361 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-28 03:48:53,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 03:48:53,362 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:53,362 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:53,382 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-28 03:48:53,575 WARN L477 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-28 03:48:53,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:53,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:53,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1925047506, now seen corresponding path program 4 times [2022-04-28 03:48:53,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:53,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1135612114] [2022-04-28 03:48:53,695 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-28 03:48:53,966 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-28 03:48:53,968 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:53,971 INFO L85 PathProgramCache]: Analyzing trace with hash 431290274, now seen corresponding path program 1 times [2022-04-28 03:48:53,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:53,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014869965] [2022-04-28 03:48:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:53,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:54,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:54,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {1614#(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(18, 2);call #Ultimate.allocInit(12, 3); {1604#true} is VALID [2022-04-28 03:48:54,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-04-28 03:48:54,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1604#true} {1604#true} #53#return; {1604#true} is VALID [2022-04-28 03:48:54,077 INFO L272 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1614#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:54,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {1614#(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(18, 2);call #Ultimate.allocInit(12, 3); {1604#true} is VALID [2022-04-28 03:48:54,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-04-28 03:48:54,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #53#return; {1604#true} is VALID [2022-04-28 03:48:54,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret9 := main(); {1604#true} is VALID [2022-04-28 03:48:54,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {1604#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {1609#(<= 500000 main_~y~0)} [75] L10-2-->L17-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] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= 500000 main_~y~0)} [76] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {1609#(<= 500000 main_~y~0)} [77] L10-2-->L17-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] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= 500000 main_~y~0)} [74] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= 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; {1610#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:54,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {1610#(<= 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; {1611#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:54,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {1611#(<= 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; {1612#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:48:54,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#(<= 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; {1613#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:48:54,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {1613#(<= 499992 main_~y~0)} assume !(~y~0 > 0); {1605#false} is VALID [2022-04-28 03:48:54,084 INFO L272 TraceCheckUtils]: 15: Hoare triple {1605#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1605#false} is VALID [2022-04-28 03:48:54,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#false} ~cond := #in~cond; {1605#false} is VALID [2022-04-28 03:48:54,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#false} assume 0 == ~cond; {1605#false} is VALID [2022-04-28 03:48:54,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2022-04-28 03:48:54,085 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-28 03:48:54,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:54,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014869965] [2022-04-28 03:48:54,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014869965] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:54,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182327960] [2022-04-28 03:48:54,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:54,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:54,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:54,092 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-28 03:48:54,094 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-28 03:48:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:54,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 03:48:54,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:54,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:54,430 INFO L272 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2022-04-28 03:48:54,430 INFO L290 TraceCheckUtils]: 1: Hoare triple {1604#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(18, 2);call #Ultimate.allocInit(12, 3); {1604#true} is VALID [2022-04-28 03:48:54,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-04-28 03:48:54,430 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #53#return; {1604#true} is VALID [2022-04-28 03:48:54,430 INFO L272 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret9 := main(); {1604#true} is VALID [2022-04-28 03:48:54,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {1604#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {1609#(<= 500000 main_~y~0)} [75] L10-2-->L17-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] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {1609#(<= 500000 main_~y~0)} [76] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {1609#(<= 500000 main_~y~0)} [77] L10-2-->L17-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] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {1609#(<= 500000 main_~y~0)} [74] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1609#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:54,433 INFO L290 TraceCheckUtils]: 10: Hoare triple {1609#(<= 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; {1610#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:54,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {1610#(<= 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; {1611#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:54,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {1611#(<= 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; {1612#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:48:54,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {1612#(<= 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; {1613#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:48:54,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {1613#(<= 499992 main_~y~0)} assume !(~y~0 > 0); {1605#false} is VALID [2022-04-28 03:48:54,436 INFO L272 TraceCheckUtils]: 15: Hoare triple {1605#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1605#false} is VALID [2022-04-28 03:48:54,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#false} ~cond := #in~cond; {1605#false} is VALID [2022-04-28 03:48:54,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#false} assume 0 == ~cond; {1605#false} is VALID [2022-04-28 03:48:54,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2022-04-28 03:48:54,436 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-28 03:48:54,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:54,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {1605#false} assume !false; {1605#false} is VALID [2022-04-28 03:48:54,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#false} assume 0 == ~cond; {1605#false} is VALID [2022-04-28 03:48:54,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#false} ~cond := #in~cond; {1605#false} is VALID [2022-04-28 03:48:54,778 INFO L272 TraceCheckUtils]: 15: Hoare triple {1605#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {1605#false} is VALID [2022-04-28 03:48:54,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {1684#(< 0 main_~y~0)} assume !(~y~0 > 0); {1605#false} is VALID [2022-04-28 03:48:54,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {1688#(< 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; {1684#(< 0 main_~y~0)} is VALID [2022-04-28 03:48:54,785 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(< 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; {1688#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:54,786 INFO L290 TraceCheckUtils]: 11: Hoare triple {1696#(< 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; {1692#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:54,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {1700#(< 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; {1696#(< 6 main_~y~0)} is VALID [2022-04-28 03:48:54,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {1700#(< 8 main_~y~0)} [74] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {1700#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:54,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1700#(< 8 main_~y~0)} [77] L10-2-->L17-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] {1700#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:54,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {1700#(< 8 main_~y~0)} [76] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1700#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:54,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {1700#(< 8 main_~y~0)} [75] L10-2-->L17-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] {1700#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:54,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {1604#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {1700#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:54,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {1604#true} call #t~ret9 := main(); {1604#true} is VALID [2022-04-28 03:48:54,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1604#true} {1604#true} #53#return; {1604#true} is VALID [2022-04-28 03:48:54,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {1604#true} assume true; {1604#true} is VALID [2022-04-28 03:48:54,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {1604#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(18, 2);call #Ultimate.allocInit(12, 3); {1604#true} is VALID [2022-04-28 03:48:54,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {1604#true} call ULTIMATE.init(); {1604#true} is VALID [2022-04-28 03:48:54,791 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-28 03:48:54,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182327960] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:54,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:54,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2022-04-28 03:48:55,015 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:55,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1135612114] [2022-04-28 03:48:55,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1135612114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:55,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:55,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 03:48:55,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038596875] [2022-04-28 03:48:55,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:55,016 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-28 03:48:55,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:55,017 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-28 03:48:55,039 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-28 03:48:55,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 03:48:55,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:55,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 03:48:55,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 03:48:55,040 INFO L87 Difference]: Start difference. First operand 36 states and 41 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-28 03:48:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:55,618 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-28 03:48:55,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 03:48:55,619 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-28 03:48:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:48:55,620 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-28 03:48:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 03:48:55,622 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-28 03:48:55,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 64 transitions. [2022-04-28 03:48:55,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 64 transitions. [2022-04-28 03:48:55,688 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:48:55,689 INFO L225 Difference]: With dead ends: 65 [2022-04-28 03:48:55,689 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:48:55,690 INFO L412 NwaCegarLoop]: 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-28 03:48:55,691 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:48:55,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 32 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 03:48:55,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:48:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-04-28 03:48:55,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:48:55,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:55,728 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:55,728 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:55,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:55,730 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 03:48:55,730 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-28 03:48:55,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:55,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:55,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 03:48:55,731 INFO L87 Difference]: Start difference. First operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 03:48:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:48:55,732 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-04-28 03:48:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2022-04-28 03:48:55,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:48:55,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:48:55,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:48:55,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:48:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 31 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:48:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-04-28 03:48:55,734 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 28 [2022-04-28 03:48:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:48:55,734 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-04-28 03:48:55,734 INFO L496 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-28 03:48:55,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 41 transitions. [2022-04-28 03:48:55,774 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-28 03:48:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 03:48:55,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-28 03:48:55,774 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:48:55,774 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:48:55,793 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-28 03:48:55,975 WARN L477 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-28 03:48:55,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:48:55,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:48:55,975 INFO L85 PathProgramCache]: Analyzing trace with hash 219815751, now seen corresponding path program 5 times [2022-04-28 03:48:55,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:55,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233310460] [2022-04-28 03:48:58,207 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-28 03:48:58,509 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-28 03:48:58,510 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:48:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -757675647, now seen corresponding path program 1 times [2022-04-28 03:48:58,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:48:58,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032497920] [2022-04-28 03:48:58,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:58,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:48:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:48:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {2073#(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(18, 2);call #Ultimate.allocInit(12, 3); {2062#true} is VALID [2022-04-28 03:48:58,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {2062#true} assume true; {2062#true} is VALID [2022-04-28 03:48:58,619 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2062#true} {2062#true} #53#return; {2062#true} is VALID [2022-04-28 03:48:58,620 INFO L272 TraceCheckUtils]: 0: Hoare triple {2062#true} call ULTIMATE.init(); {2073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:48:58,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {2073#(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(18, 2);call #Ultimate.allocInit(12, 3); {2062#true} is VALID [2022-04-28 03:48:58,620 INFO L290 TraceCheckUtils]: 2: Hoare triple {2062#true} assume true; {2062#true} is VALID [2022-04-28 03:48:58,620 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2062#true} {2062#true} #53#return; {2062#true} is VALID [2022-04-28 03:48:58,620 INFO L272 TraceCheckUtils]: 4: Hoare triple {2062#true} call #t~ret9 := main(); {2062#true} is VALID [2022-04-28 03:48:58,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {2062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {2067#(<= 500000 main_~y~0)} [79] L10-2-->L17-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] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {2067#(<= 500000 main_~y~0)} [80] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {2067#(<= 500000 main_~y~0)} [81] L10-2-->L17-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] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {2067#(<= 500000 main_~y~0)} [78] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#(<= 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; {2068#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:58,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {2068#(<= 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; {2069#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:58,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#(<= 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; {2070#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:48:58,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {2070#(<= 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; {2071#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:48:58,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#(<= 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; {2072#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:48:58,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {2072#(<= 499990 main_~y~0)} assume !(~y~0 > 0); {2063#false} is VALID [2022-04-28 03:48:58,627 INFO L272 TraceCheckUtils]: 16: Hoare triple {2063#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2063#false} is VALID [2022-04-28 03:48:58,627 INFO L290 TraceCheckUtils]: 17: Hoare triple {2063#false} ~cond := #in~cond; {2063#false} is VALID [2022-04-28 03:48:58,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#false} assume 0 == ~cond; {2063#false} is VALID [2022-04-28 03:48:58,627 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#false} assume !false; {2063#false} is VALID [2022-04-28 03:48:58,628 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-28 03:48:58,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:48:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032497920] [2022-04-28 03:48:58,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032497920] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:48:58,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519934596] [2022-04-28 03:48:58,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:48:58,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:48:58,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:48:58,629 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-28 03:48:58,655 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-28 03:48:58,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 03:48:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:48:58,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:48:58,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {2062#true} call ULTIMATE.init(); {2062#true} is VALID [2022-04-28 03:48:58,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {2062#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(18, 2);call #Ultimate.allocInit(12, 3); {2062#true} is VALID [2022-04-28 03:48:58,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2062#true} assume true; {2062#true} is VALID [2022-04-28 03:48:58,924 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2062#true} {2062#true} #53#return; {2062#true} is VALID [2022-04-28 03:48:58,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {2062#true} call #t~ret9 := main(); {2062#true} is VALID [2022-04-28 03:48:58,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {2062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {2067#(<= 500000 main_~y~0)} [79] L10-2-->L17-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] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {2067#(<= 500000 main_~y~0)} [80] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {2067#(<= 500000 main_~y~0)} [81] L10-2-->L17-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] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,926 INFO L290 TraceCheckUtils]: 9: Hoare triple {2067#(<= 500000 main_~y~0)} [78] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2067#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:48:58,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {2067#(<= 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; {2068#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:48:58,928 INFO L290 TraceCheckUtils]: 11: Hoare triple {2068#(<= 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; {2069#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:48:58,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {2069#(<= 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; {2070#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:48:58,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {2070#(<= 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; {2071#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:48:58,930 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#(<= 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; {2072#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:48:58,930 INFO L290 TraceCheckUtils]: 15: Hoare triple {2072#(<= 499990 main_~y~0)} assume !(~y~0 > 0); {2063#false} is VALID [2022-04-28 03:48:58,930 INFO L272 TraceCheckUtils]: 16: Hoare triple {2063#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2063#false} is VALID [2022-04-28 03:48:58,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {2063#false} ~cond := #in~cond; {2063#false} is VALID [2022-04-28 03:48:58,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#false} assume 0 == ~cond; {2063#false} is VALID [2022-04-28 03:48:58,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#false} assume !false; {2063#false} is VALID [2022-04-28 03:48:58,930 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-28 03:48:58,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:48:59,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {2063#false} assume !false; {2063#false} is VALID [2022-04-28 03:48:59,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {2063#false} assume 0 == ~cond; {2063#false} is VALID [2022-04-28 03:48:59,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {2063#false} ~cond := #in~cond; {2063#false} is VALID [2022-04-28 03:48:59,249 INFO L272 TraceCheckUtils]: 16: Hoare triple {2063#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2063#false} is VALID [2022-04-28 03:48:59,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {2146#(< 0 main_~y~0)} assume !(~y~0 > 0); {2063#false} is VALID [2022-04-28 03:48:59,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {2150#(< 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; {2146#(< 0 main_~y~0)} is VALID [2022-04-28 03:48:59,251 INFO L290 TraceCheckUtils]: 13: Hoare triple {2154#(< 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; {2150#(< 2 main_~y~0)} is VALID [2022-04-28 03:48:59,251 INFO L290 TraceCheckUtils]: 12: Hoare triple {2158#(< 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; {2154#(< 4 main_~y~0)} is VALID [2022-04-28 03:48:59,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {2162#(< 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; {2158#(< 6 main_~y~0)} is VALID [2022-04-28 03:48:59,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {2166#(< 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; {2162#(< 8 main_~y~0)} is VALID [2022-04-28 03:48:59,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {2166#(< 10 main_~y~0)} [78] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2166#(< 10 main_~y~0)} is VALID [2022-04-28 03:48:59,253 INFO L290 TraceCheckUtils]: 8: Hoare triple {2166#(< 10 main_~y~0)} [81] L10-2-->L17-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] {2166#(< 10 main_~y~0)} is VALID [2022-04-28 03:48:59,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {2166#(< 10 main_~y~0)} [80] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2166#(< 10 main_~y~0)} is VALID [2022-04-28 03:48:59,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {2166#(< 10 main_~y~0)} [79] L10-2-->L17-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] {2166#(< 10 main_~y~0)} is VALID [2022-04-28 03:48:59,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {2062#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2166#(< 10 main_~y~0)} is VALID [2022-04-28 03:48:59,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {2062#true} call #t~ret9 := main(); {2062#true} is VALID [2022-04-28 03:48:59,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2062#true} {2062#true} #53#return; {2062#true} is VALID [2022-04-28 03:48:59,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {2062#true} assume true; {2062#true} is VALID [2022-04-28 03:48:59,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {2062#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(18, 2);call #Ultimate.allocInit(12, 3); {2062#true} is VALID [2022-04-28 03:48:59,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {2062#true} call ULTIMATE.init(); {2062#true} is VALID [2022-04-28 03:48:59,255 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-28 03:48:59,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519934596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:48:59,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:48:59,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-28 03:48:59,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:48:59,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233310460] [2022-04-28 03:48:59,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233310460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:48:59,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:48:59,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 03:48:59,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338883450] [2022-04-28 03:48:59,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:48:59,572 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-28 03:48:59,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:48:59,572 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-28 03:48:59,604 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-28 03:48:59,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 03:48:59,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:48:59,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 03:48:59,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 03:48:59,605 INFO L87 Difference]: Start difference. First operand 37 states and 41 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-28 03:49:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:00,387 INFO L93 Difference]: Finished difference Result 71 states and 84 transitions. [2022-04-28 03:49:00,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 03:49:00,387 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-28 03:49:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:00,388 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-28 03:49:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-28 03:49:00,395 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-28 03:49:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-28 03:49:00,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 63 transitions. [2022-04-28 03:49:00,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:00,450 INFO L225 Difference]: With dead ends: 71 [2022-04-28 03:49:00,450 INFO L226 Difference]: Without dead ends: 42 [2022-04-28 03:49:00,451 INFO L412 NwaCegarLoop]: 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-28 03:49:00,451 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 53 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:00,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 32 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:49:00,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-28 03:49:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-28 03:49:00,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:00,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:00,510 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:00,510 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:00,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:00,511 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:49:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:49:00,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:00,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:00,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 03:49:00,512 INFO L87 Difference]: Start difference. First operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 42 states. [2022-04-28 03:49:00,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:00,513 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-28 03:49:00,513 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:49:00,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:00,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:00,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:00,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:00,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:00,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-28 03:49:00,515 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 33 [2022-04-28 03:49:00,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:00,516 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-28 03:49:00,516 INFO L496 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-28 03:49:00,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-28 03:49:00,563 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-28 03:49:00,564 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-28 03:49:00,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 03:49:00,564 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:00,564 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:00,586 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 03:49:00,765 WARN L477 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-28 03:49:00,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:00,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:00,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1014300998, now seen corresponding path program 6 times [2022-04-28 03:49:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:00,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993728942] [2022-04-28 03:49:02,880 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:02,944 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-28 03:49:07,093 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:07,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-28 03:49:07,254 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1372197250, now seen corresponding path program 1 times [2022-04-28 03:49:07,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:07,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217910600] [2022-04-28 03:49:07,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:07,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:07,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {2560#(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(18, 2);call #Ultimate.allocInit(12, 3); {2548#true} is VALID [2022-04-28 03:49:07,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 03:49:07,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2548#true} {2548#true} #53#return; {2548#true} is VALID [2022-04-28 03:49:07,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2560#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:07,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {2560#(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(18, 2);call #Ultimate.allocInit(12, 3); {2548#true} is VALID [2022-04-28 03:49:07,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 03:49:07,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #53#return; {2548#true} is VALID [2022-04-28 03:49:07,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret9 := main(); {2548#true} is VALID [2022-04-28 03:49:07,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {2553#(<= 500000 main_~y~0)} [83] L10-2-->L17-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] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {2553#(<= 500000 main_~y~0)} [84] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {2553#(<= 500000 main_~y~0)} [85] L10-2-->L17-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] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {2553#(<= 500000 main_~y~0)} [82] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(<= 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; {2554#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:07,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {2554#(<= 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; {2555#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:07,394 INFO L290 TraceCheckUtils]: 12: Hoare triple {2555#(<= 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; {2556#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:07,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= 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; {2557#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:07,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= 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; {2558#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:07,396 INFO L290 TraceCheckUtils]: 15: Hoare triple {2558#(<= 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; {2559#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:07,396 INFO L290 TraceCheckUtils]: 16: Hoare triple {2559#(<= 499988 main_~y~0)} assume !(~y~0 > 0); {2549#false} is VALID [2022-04-28 03:49:07,397 INFO L272 TraceCheckUtils]: 17: Hoare triple {2549#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2549#false} is VALID [2022-04-28 03:49:07,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 03:49:07,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 03:49:07,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 03:49:07,397 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-28 03:49:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217910600] [2022-04-28 03:49:07,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217910600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826343807] [2022-04-28 03:49:07,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:07,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:07,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:07,399 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-28 03:49:07,400 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-28 03:49:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:07,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 03:49:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:07,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:07,728 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 03:49:07,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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(18, 2);call #Ultimate.allocInit(12, 3); {2548#true} is VALID [2022-04-28 03:49:07,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 03:49:07,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #53#return; {2548#true} is VALID [2022-04-28 03:49:07,728 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret9 := main(); {2548#true} is VALID [2022-04-28 03:49:07,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {2553#(<= 500000 main_~y~0)} [83] L10-2-->L17-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] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {2553#(<= 500000 main_~y~0)} [84] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {2553#(<= 500000 main_~y~0)} [85] L10-2-->L17-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] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {2553#(<= 500000 main_~y~0)} [82] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2553#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:07,731 INFO L290 TraceCheckUtils]: 10: Hoare triple {2553#(<= 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; {2554#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:07,731 INFO L290 TraceCheckUtils]: 11: Hoare triple {2554#(<= 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; {2555#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:07,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {2555#(<= 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; {2556#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:07,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {2556#(<= 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; {2557#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:07,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {2557#(<= 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; {2558#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:07,733 INFO L290 TraceCheckUtils]: 15: Hoare triple {2558#(<= 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; {2559#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:07,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {2559#(<= 499988 main_~y~0)} assume !(~y~0 > 0); {2549#false} is VALID [2022-04-28 03:49:07,734 INFO L272 TraceCheckUtils]: 17: Hoare triple {2549#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2549#false} is VALID [2022-04-28 03:49:07,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 03:49:07,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 03:49:07,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 03:49:07,734 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-28 03:49:07,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:08,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {2549#false} assume !false; {2549#false} is VALID [2022-04-28 03:49:08,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {2549#false} assume 0 == ~cond; {2549#false} is VALID [2022-04-28 03:49:08,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {2549#false} ~cond := #in~cond; {2549#false} is VALID [2022-04-28 03:49:08,143 INFO L272 TraceCheckUtils]: 17: Hoare triple {2549#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {2549#false} is VALID [2022-04-28 03:49:08,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {2636#(< 0 main_~y~0)} assume !(~y~0 > 0); {2549#false} is VALID [2022-04-28 03:49:08,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {2640#(< 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; {2636#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:08,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {2644#(< 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; {2640#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:08,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {2648#(< 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; {2644#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:08,146 INFO L290 TraceCheckUtils]: 12: Hoare triple {2652#(< 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; {2648#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:08,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {2656#(< 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; {2652#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:08,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {2660#(< 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; {2656#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:08,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {2660#(< 12 main_~y~0)} [82] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {2660#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:08,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {2660#(< 12 main_~y~0)} [85] L10-2-->L17-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] {2660#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:08,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {2660#(< 12 main_~y~0)} [84] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2660#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:08,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {2660#(< 12 main_~y~0)} [83] L10-2-->L17-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] {2660#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:08,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {2548#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {2660#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:08,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {2548#true} call #t~ret9 := main(); {2548#true} is VALID [2022-04-28 03:49:08,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2548#true} {2548#true} #53#return; {2548#true} is VALID [2022-04-28 03:49:08,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {2548#true} assume true; {2548#true} is VALID [2022-04-28 03:49:08,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {2548#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(18, 2);call #Ultimate.allocInit(12, 3); {2548#true} is VALID [2022-04-28 03:49:08,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {2548#true} call ULTIMATE.init(); {2548#true} is VALID [2022-04-28 03:49:08,151 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-28 03:49:08,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826343807] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:08,151 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:08,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 17 [2022-04-28 03:49:08,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993728942] [2022-04-28 03:49:08,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993728942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:08,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 03:49:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771194746] [2022-04-28 03:49:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:08,483 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-28 03:49:08,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:08,483 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-28 03:49:08,512 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-28 03:49:08,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 03:49:08,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 03:49:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=448, Unknown=0, NotChecked=0, Total=756 [2022-04-28 03:49:08,514 INFO L87 Difference]: Start difference. First operand 42 states and 46 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-28 03:49:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:09,400 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2022-04-28 03:49:09,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 03:49:09,400 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-28 03:49:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:09,401 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-28 03:49:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 03:49:09,402 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-28 03:49:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 68 transitions. [2022-04-28 03:49:09,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 68 transitions. [2022-04-28 03:49:09,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:09,473 INFO L225 Difference]: With dead ends: 81 [2022-04-28 03:49:09,473 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 03:49:09,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=722, Invalid=1348, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 03:49:09,475 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:09,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 32 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 03:49:09,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 03:49:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 03:49:09,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:09,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:09,531 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:09,532 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:09,533 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 03:49:09,533 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 03:49:09,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:09,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:09,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 03:49:09,534 INFO L87 Difference]: Start difference. First operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 47 states. [2022-04-28 03:49:09,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:09,535 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 03:49:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 03:49:09,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:09,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:09,536 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:09,536 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:09,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.125) internal successors, (45), 41 states have internal predecessors, (45), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:09,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 03:49:09,537 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 38 [2022-04-28 03:49:09,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:09,537 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 03:49:09,537 INFO L496 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-28 03:49:09,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 03:49:09,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 03:49:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-28 03:49:09,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:09,598 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:09,615 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-28 03:49:09,799 WARN L477 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-28 03:49:09,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:09,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:09,800 INFO L85 PathProgramCache]: Analyzing trace with hash 987895251, now seen corresponding path program 7 times [2022-04-28 03:49:09,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:09,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665161246] [2022-04-28 03:49:09,918 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-28 03:49:10,180 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-28 03:49:10,182 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash 415280033, now seen corresponding path program 1 times [2022-04-28 03:49:10,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:10,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48823526] [2022-04-28 03:49:10,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:10,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:10,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:10,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:10,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {3103#(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(18, 2);call #Ultimate.allocInit(12, 3); {3090#true} is VALID [2022-04-28 03:49:10,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:49:10,303 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3090#true} {3090#true} #53#return; {3090#true} is VALID [2022-04-28 03:49:10,303 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:10,303 INFO L290 TraceCheckUtils]: 1: Hoare triple {3103#(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(18, 2);call #Ultimate.allocInit(12, 3); {3090#true} is VALID [2022-04-28 03:49:10,303 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:49:10,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #53#return; {3090#true} is VALID [2022-04-28 03:49:10,304 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret9 := main(); {3090#true} is VALID [2022-04-28 03:49:10,304 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,304 INFO L290 TraceCheckUtils]: 6: Hoare triple {3095#(<= 500000 main_~y~0)} [87] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_46| |v_main_#t~post4_45|)) (.cse1 (= v_main_~x~0_175 v_main_~x~0_174))) (or (and (< v_main_~x~0_175 v_main_~x~0_174) (< v_main_~x~0_174 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_175) .cse1))) InVars {main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} OutVars{main_~x~0=v_main_~x~0_174, main_#t~post4=|v_main_#t~post4_45|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {3095#(<= 500000 main_~y~0)} [88] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,306 INFO L290 TraceCheckUtils]: 8: Hoare triple {3095#(<= 500000 main_~y~0)} [89] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse3 (<= 500000 v_main_~x~0_177))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_177 1000000)) (not .cse3)) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_177 v_main_~y~0_133))) (and (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)) .cse3 (= .cse5 (+ v_main_~x~0_176 v_main_~y~0_134)))))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_177, 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_176, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {3095#(<= 500000 main_~y~0)} [86] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,307 INFO L290 TraceCheckUtils]: 10: Hoare triple {3095#(<= 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; {3096#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:10,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {3096#(<= 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; {3097#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:10,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {3097#(<= 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; {3098#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:10,309 INFO L290 TraceCheckUtils]: 13: Hoare triple {3098#(<= 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; {3099#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:10,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {3099#(<= 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; {3100#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:10,310 INFO L290 TraceCheckUtils]: 15: Hoare triple {3100#(<= 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; {3101#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:10,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {3101#(<= 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; {3102#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:10,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {3102#(<= 499986 main_~y~0)} assume !(~y~0 > 0); {3091#false} is VALID [2022-04-28 03:49:10,311 INFO L272 TraceCheckUtils]: 18: Hoare triple {3091#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3091#false} is VALID [2022-04-28 03:49:10,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {3091#false} ~cond := #in~cond; {3091#false} is VALID [2022-04-28 03:49:10,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {3091#false} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:49:10,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:49:10,312 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-28 03:49:10,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:10,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48823526] [2022-04-28 03:49:10,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48823526] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:10,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971118403] [2022-04-28 03:49:10,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:10,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:10,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:10,313 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-28 03:49:10,314 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-28 03:49:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:10,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 03:49:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:10,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:10,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3090#true} is VALID [2022-04-28 03:49:10,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#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(18, 2);call #Ultimate.allocInit(12, 3); {3090#true} is VALID [2022-04-28 03:49:10,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:49:10,626 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #53#return; {3090#true} is VALID [2022-04-28 03:49:10,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret9 := main(); {3090#true} is VALID [2022-04-28 03:49:10,627 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {3095#(<= 500000 main_~y~0)} [87] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_46| |v_main_#t~post4_45|)) (.cse1 (= v_main_~x~0_175 v_main_~x~0_174))) (or (and (< v_main_~x~0_175 v_main_~x~0_174) (< v_main_~x~0_174 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_175) .cse1))) InVars {main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} OutVars{main_~x~0=v_main_~x~0_174, main_#t~post4=|v_main_#t~post4_45|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {3095#(<= 500000 main_~y~0)} [88] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {3095#(<= 500000 main_~y~0)} [89] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse3 (<= 500000 v_main_~x~0_177))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_177 1000000)) (not .cse3)) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_177 v_main_~y~0_133))) (and (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)) .cse3 (= .cse5 (+ v_main_~x~0_176 v_main_~y~0_134)))))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_177, 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_176, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {3095#(<= 500000 main_~y~0)} [86] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3095#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:10,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {3095#(<= 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; {3096#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:10,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {3096#(<= 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; {3097#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:10,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {3097#(<= 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; {3098#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:10,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {3098#(<= 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; {3099#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:10,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {3099#(<= 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; {3100#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:10,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {3100#(<= 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; {3101#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:10,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {3101#(<= 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; {3102#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:10,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3102#(<= 499986 main_~y~0)} assume !(~y~0 > 0); {3091#false} is VALID [2022-04-28 03:49:10,634 INFO L272 TraceCheckUtils]: 18: Hoare triple {3091#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3091#false} is VALID [2022-04-28 03:49:10,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {3091#false} ~cond := #in~cond; {3091#false} is VALID [2022-04-28 03:49:10,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {3091#false} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:49:10,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:49:10,635 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-28 03:49:10,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:11,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {3091#false} assume !false; {3091#false} is VALID [2022-04-28 03:49:11,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {3091#false} assume 0 == ~cond; {3091#false} is VALID [2022-04-28 03:49:11,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {3091#false} ~cond := #in~cond; {3091#false} is VALID [2022-04-28 03:49:11,012 INFO L272 TraceCheckUtils]: 18: Hoare triple {3091#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3091#false} is VALID [2022-04-28 03:49:11,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {3182#(< 0 main_~y~0)} assume !(~y~0 > 0); {3091#false} is VALID [2022-04-28 03:49:11,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {3186#(< 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; {3182#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:11,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {3190#(< 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; {3186#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:11,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {3194#(< 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; {3190#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:11,014 INFO L290 TraceCheckUtils]: 13: Hoare triple {3198#(< 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; {3194#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:11,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {3202#(< 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; {3198#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:11,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {3206#(< 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; {3202#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:11,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {3210#(< 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; {3206#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:11,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {3210#(< 14 main_~y~0)} [86] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3210#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:11,017 INFO L290 TraceCheckUtils]: 8: Hoare triple {3210#(< 14 main_~y~0)} [89] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_177 v_main_~x~0_176)) (.cse1 (= v_main_~y~0_134 v_main_~y~0_133)) (.cse2 (= |v_main_#t~post5_46| |v_main_#t~post5_45|)) (.cse4 (= |v_main_#t~post6_46| |v_main_#t~post6_45|)) (.cse3 (<= 500000 v_main_~x~0_177))) (or (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_177 1000000)) (not .cse3)) .cse4) (and .cse0 .cse1 .cse2 .cse4) (let ((.cse5 (+ v_main_~x~0_177 v_main_~y~0_133))) (and (< v_main_~y~0_134 v_main_~y~0_133) (< .cse5 (+ v_main_~y~0_134 1000001)) .cse3 (= .cse5 (+ v_main_~x~0_176 v_main_~y~0_134)))))) InVars {main_~y~0=v_main_~y~0_134, main_#t~post5=|v_main_#t~post5_46|, main_~x~0=v_main_~x~0_177, 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_176, main_#t~post6=|v_main_#t~post6_45|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3210#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:11,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {3210#(< 14 main_~y~0)} [88] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3210#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:11,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {3210#(< 14 main_~y~0)} [87] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_46| |v_main_#t~post4_45|)) (.cse1 (= v_main_~x~0_175 v_main_~x~0_174))) (or (and (< v_main_~x~0_175 v_main_~x~0_174) (< v_main_~x~0_174 500001)) (and .cse0 .cse1) (and .cse0 (<= 500000 v_main_~x~0_175) .cse1))) InVars {main_~x~0=v_main_~x~0_175, main_#t~post4=|v_main_#t~post4_46|} OutVars{main_~x~0=v_main_~x~0_174, main_#t~post4=|v_main_#t~post4_45|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3210#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:11,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {3090#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3210#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:11,019 INFO L272 TraceCheckUtils]: 4: Hoare triple {3090#true} call #t~ret9 := main(); {3090#true} is VALID [2022-04-28 03:49:11,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3090#true} {3090#true} #53#return; {3090#true} is VALID [2022-04-28 03:49:11,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {3090#true} assume true; {3090#true} is VALID [2022-04-28 03:49:11,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {3090#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(18, 2);call #Ultimate.allocInit(12, 3); {3090#true} is VALID [2022-04-28 03:49:11,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {3090#true} call ULTIMATE.init(); {3090#true} is VALID [2022-04-28 03:49:11,019 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-28 03:49:11,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971118403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:11,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:11,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-04-28 03:49:11,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:11,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1665161246] [2022-04-28 03:49:11,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1665161246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:11,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:11,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 03:49:11,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333373556] [2022-04-28 03:49:11,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:11,402 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-28 03:49:11,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:11,402 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-28 03:49:11,435 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-28 03:49:11,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 03:49:11,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:11,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 03:49:11,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=591, Unknown=0, NotChecked=0, Total=992 [2022-04-28 03:49:11,436 INFO L87 Difference]: Start difference. First operand 47 states and 51 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-28 03:49:12,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:12,504 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-04-28 03:49:12,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 03:49:12,505 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-28 03:49:12,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:12,505 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-28 03:49:12,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-28 03:49:12,507 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-28 03:49:12,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 73 transitions. [2022-04-28 03:49:12,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 73 transitions. [2022-04-28 03:49:12,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:12,580 INFO L225 Difference]: With dead ends: 91 [2022-04-28 03:49:12,580 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 03:49:12,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=941, Invalid=1815, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 03:49:12,582 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 54 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:12,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 42 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:49:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 03:49:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-28 03:49:12,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:12,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:12,653 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:12,654 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:12,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:12,656 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 03:49:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:49:12,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:12,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:12,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-28 03:49:12,657 INFO L87 Difference]: Start difference. First operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 52 states. [2022-04-28 03:49:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:12,658 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 03:49:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:49:12,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:12,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:12,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:12,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:12,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 46 states have internal predecessors, (50), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-28 03:49:12,659 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 43 [2022-04-28 03:49:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:12,660 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-28 03:49:12,660 INFO L496 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-28 03:49:12,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-28 03:49:12,710 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-28 03:49:12,710 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 03:49:12,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-04-28 03:49:12,711 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:12,711 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:12,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 03:49:12,915 WARN L477 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-28 03:49:12,916 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:12,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:12,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1242507194, now seen corresponding path program 8 times [2022-04-28 03:49:12,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:12,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197866255] [2022-04-28 03:49:13,031 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-28 03:49:13,293 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-28 03:49:13,294 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1187466398, now seen corresponding path program 1 times [2022-04-28 03:49:13,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:13,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148288637] [2022-04-28 03:49:13,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:13,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:13,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:13,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:13,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:13,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {3702#(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(18, 2);call #Ultimate.allocInit(12, 3); {3688#true} is VALID [2022-04-28 03:49:13,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {3688#true} assume true; {3688#true} is VALID [2022-04-28 03:49:13,464 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3688#true} {3688#true} #53#return; {3688#true} is VALID [2022-04-28 03:49:13,464 INFO L272 TraceCheckUtils]: 0: Hoare triple {3688#true} call ULTIMATE.init(); {3702#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:13,464 INFO L290 TraceCheckUtils]: 1: Hoare triple {3702#(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(18, 2);call #Ultimate.allocInit(12, 3); {3688#true} is VALID [2022-04-28 03:49:13,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {3688#true} assume true; {3688#true} is VALID [2022-04-28 03:49:13,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3688#true} {3688#true} #53#return; {3688#true} is VALID [2022-04-28 03:49:13,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {3688#true} call #t~ret9 := main(); {3688#true} is VALID [2022-04-28 03:49:13,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {3688#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3693#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:13,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {3693#(<= 500000 main_~y~0)} [91] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_52| |v_main_#t~post4_51|))) (or (and (= v_main_~x~0_210 v_main_~x~0_209) .cse0) (and (< v_main_~x~0_209 500001) (< v_main_~x~0_210 v_main_~x~0_209)) (and (= v_main_~x~0_209 v_main_~x~0_210) .cse0 (<= 500000 v_main_~x~0_210)))) InVars {main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} OutVars{main_~x~0=v_main_~x~0_209, main_#t~post4=|v_main_#t~post4_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3693#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:13,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {3693#(<= 500000 main_~y~0)} [92] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3693#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:13,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {3693#(<= 500000 main_~y~0)} [93] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_212)) (.cse1 (= v_main_~x~0_212 v_main_~x~0_211)) (.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_212 v_main_~y~0_167) (+ v_main_~x~0_211 v_main_~y~0_168)) (< v_main_~x~0_211 1000001) (< v_main_~x~0_212 v_main_~x~0_211) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_212 1000000)))) (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_212, 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_211, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3693#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:13,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {3693#(<= 500000 main_~y~0)} [90] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3693#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:13,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {3693#(<= 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; {3694#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:13,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {3694#(<= 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; {3695#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:13,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {3695#(<= 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; {3696#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:13,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {3696#(<= 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; {3697#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:13,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {3697#(<= 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; {3698#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:13,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {3698#(<= 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; {3699#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:13,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {3699#(<= 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; {3700#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:13,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {3700#(<= 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; {3701#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:13,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {3701#(<= 499984 main_~y~0)} assume !(~y~0 > 0); {3689#false} is VALID [2022-04-28 03:49:13,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {3689#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3689#false} is VALID [2022-04-28 03:49:13,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {3689#false} ~cond := #in~cond; {3689#false} is VALID [2022-04-28 03:49:13,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {3689#false} assume 0 == ~cond; {3689#false} is VALID [2022-04-28 03:49:13,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {3689#false} assume !false; {3689#false} is VALID [2022-04-28 03:49:13,473 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-28 03:49:13,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148288637] [2022-04-28 03:49:13,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148288637] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:13,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168899720] [2022-04-28 03:49:13,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:13,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:13,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:13,476 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-28 03:49:13,494 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-28 03:49:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:13,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:49:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:13,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:14,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {3688#true} call ULTIMATE.init(); {3688#true} is VALID [2022-04-28 03:49:14,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {3688#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(18, 2);call #Ultimate.allocInit(12, 3); {3688#true} is VALID [2022-04-28 03:49:14,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {3688#true} assume true; {3688#true} is VALID [2022-04-28 03:49:14,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3688#true} {3688#true} #53#return; {3688#true} is VALID [2022-04-28 03:49:14,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {3688#true} call #t~ret9 := main(); {3688#true} is VALID [2022-04-28 03:49:14,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {3688#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3721#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:49:14,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {3721#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [91] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_52| |v_main_#t~post4_51|))) (or (and (= v_main_~x~0_210 v_main_~x~0_209) .cse0) (and (< v_main_~x~0_209 500001) (< v_main_~x~0_210 v_main_~x~0_209)) (and (= v_main_~x~0_209 v_main_~x~0_210) .cse0 (<= 500000 v_main_~x~0_210)))) InVars {main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} OutVars{main_~x~0=v_main_~x~0_209, main_#t~post4=|v_main_#t~post4_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3725#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:49:14,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {3725#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [92] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3725#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:49:14,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {3725#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [93] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_212)) (.cse1 (= v_main_~x~0_212 v_main_~x~0_211)) (.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_212 v_main_~y~0_167) (+ v_main_~x~0_211 v_main_~y~0_168)) (< v_main_~x~0_211 1000001) (< v_main_~x~0_212 v_main_~x~0_211) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_212 1000000)))) (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_212, 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_211, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3732#(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-28 03:49:14,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {3732#(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)))} [90] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3736#(< 999999 main_~y~0)} is VALID [2022-04-28 03:49:14,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {3736#(< 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; {3740#(< 999997 main_~y~0)} is VALID [2022-04-28 03:49:14,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {3740#(< 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; {3744#(< 999995 main_~y~0)} is VALID [2022-04-28 03:49:14,012 INFO L290 TraceCheckUtils]: 12: Hoare triple {3744#(< 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; {3748#(< 999993 main_~y~0)} is VALID [2022-04-28 03:49:14,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {3748#(< 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; {3752#(< 999991 main_~y~0)} is VALID [2022-04-28 03:49:14,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {3752#(< 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; {3756#(< 999989 main_~y~0)} is VALID [2022-04-28 03:49:14,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {3756#(< 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; {3760#(< 999987 main_~y~0)} is VALID [2022-04-28 03:49:14,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {3760#(< 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; {3764#(< 999985 main_~y~0)} is VALID [2022-04-28 03:49:14,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {3764#(< 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; {3768#(< 999983 main_~y~0)} is VALID [2022-04-28 03:49:14,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {3768#(< 999983 main_~y~0)} assume !(~y~0 > 0); {3689#false} is VALID [2022-04-28 03:49:14,015 INFO L272 TraceCheckUtils]: 19: Hoare triple {3689#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3689#false} is VALID [2022-04-28 03:49:14,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {3689#false} ~cond := #in~cond; {3689#false} is VALID [2022-04-28 03:49:14,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {3689#false} assume 0 == ~cond; {3689#false} is VALID [2022-04-28 03:49:14,015 INFO L290 TraceCheckUtils]: 22: Hoare triple {3689#false} assume !false; {3689#false} is VALID [2022-04-28 03:49:14,015 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-28 03:49:14,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:14,690 INFO L290 TraceCheckUtils]: 22: Hoare triple {3689#false} assume !false; {3689#false} is VALID [2022-04-28 03:49:14,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {3689#false} assume 0 == ~cond; {3689#false} is VALID [2022-04-28 03:49:14,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {3689#false} ~cond := #in~cond; {3689#false} is VALID [2022-04-28 03:49:14,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {3689#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {3689#false} is VALID [2022-04-28 03:49:14,690 INFO L290 TraceCheckUtils]: 18: Hoare triple {3796#(< 0 main_~y~0)} assume !(~y~0 > 0); {3689#false} is VALID [2022-04-28 03:49:14,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {3800#(< 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; {3796#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:14,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {3804#(< 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; {3800#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:14,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {3808#(< 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; {3804#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:14,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {3812#(< 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; {3808#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:14,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {3816#(< 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; {3812#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:14,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {3820#(< 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; {3816#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:14,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {3824#(< 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; {3820#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:14,694 INFO L290 TraceCheckUtils]: 10: Hoare triple {3828#(< 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; {3824#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:14,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {3832#(or (< main_~x~0 1000000) (< 16 main_~y~0))} [90] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {3828#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:14,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {3836#(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)))} [93] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_212)) (.cse1 (= v_main_~x~0_212 v_main_~x~0_211)) (.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_212 v_main_~y~0_167) (+ v_main_~x~0_211 v_main_~y~0_168)) (< v_main_~x~0_211 1000001) (< v_main_~x~0_212 v_main_~x~0_211) .cse0) (and .cse1 .cse2 .cse3 .cse4 (or (not .cse0) (not (< v_main_~x~0_212 1000000)))) (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_212, 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_211, main_#t~post6=|v_main_#t~post6_52|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {3832#(or (< main_~x~0 1000000) (< 16 main_~y~0))} is VALID [2022-04-28 03:49:14,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {3836#(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)))} [92] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3836#(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-28 03:49:14,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3843#(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)))} [91] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_52| |v_main_#t~post4_51|))) (or (and (= v_main_~x~0_210 v_main_~x~0_209) .cse0) (and (< v_main_~x~0_209 500001) (< v_main_~x~0_210 v_main_~x~0_209)) (and (= v_main_~x~0_209 v_main_~x~0_210) .cse0 (<= 500000 v_main_~x~0_210)))) InVars {main_~x~0=v_main_~x~0_210, main_#t~post4=|v_main_#t~post4_52|} OutVars{main_~x~0=v_main_~x~0_209, main_#t~post4=|v_main_#t~post4_51|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {3836#(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-28 03:49:14,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {3688#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {3843#(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-28 03:49:14,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {3688#true} call #t~ret9 := main(); {3688#true} is VALID [2022-04-28 03:49:14,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3688#true} {3688#true} #53#return; {3688#true} is VALID [2022-04-28 03:49:14,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {3688#true} assume true; {3688#true} is VALID [2022-04-28 03:49:14,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {3688#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(18, 2);call #Ultimate.allocInit(12, 3); {3688#true} is VALID [2022-04-28 03:49:14,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {3688#true} call ULTIMATE.init(); {3688#true} is VALID [2022-04-28 03:49:14,698 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-28 03:49:14,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168899720] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:14,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:14,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 36 [2022-04-28 03:49:15,200 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:15,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197866255] [2022-04-28 03:49:15,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197866255] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:15,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:15,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 03:49:15,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115737807] [2022-04-28 03:49:15,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:15,201 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-28 03:49:15,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:15,202 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-28 03:49:15,237 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-28 03:49:15,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 03:49:15,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:15,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 03:49:15,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=896, Invalid=1554, Unknown=0, NotChecked=0, Total=2450 [2022-04-28 03:49:15,238 INFO L87 Difference]: Start difference. First operand 52 states and 56 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-28 03:49:16,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:16,543 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-04-28 03:49:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 03:49:16,544 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-28 03:49:16,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:16,544 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-28 03:49:16,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2022-04-28 03:49:16,545 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-28 03:49:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 78 transitions. [2022-04-28 03:49:16,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 78 transitions. [2022-04-28 03:49:16,626 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-28 03:49:16,627 INFO L225 Difference]: With dead ends: 101 [2022-04-28 03:49:16,627 INFO L226 Difference]: Without dead ends: 57 [2022-04-28 03:49:16,629 INFO L412 NwaCegarLoop]: 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-28 03:49:16,629 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:16,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 32 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 03:49:16,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-28 03:49:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-28 03:49:16,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:16,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:16,705 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:16,705 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:16,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:16,707 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:49:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:49:16,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:16,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:16,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 03:49:16,708 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-04-28 03:49:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:16,709 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-28 03:49:16,709 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:49:16,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:16,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:16,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:16,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:16,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:16,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-04-28 03:49:16,711 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 48 [2022-04-28 03:49:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:16,712 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-04-28 03:49:16,712 INFO L496 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-28 03:49:16,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 61 transitions. [2022-04-28 03:49:16,786 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-28 03:49:16,786 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-04-28 03:49:16,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 03:49:16,787 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:16,787 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:16,816 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-28 03:49:17,001 WARN L477 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-28 03:49:17,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:17,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:17,001 INFO L85 PathProgramCache]: Analyzing trace with hash 971809375, now seen corresponding path program 9 times [2022-04-28 03:49:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:17,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1812524607] [2022-04-28 03:49:21,063 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:21,109 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-28 03:49:21,314 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-28 03:49:21,315 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1299053119, now seen corresponding path program 1 times [2022-04-28 03:49:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:21,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425891356] [2022-04-28 03:49:21,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:21,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:21,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {4371#(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(18, 2);call #Ultimate.allocInit(12, 3); {4356#true} is VALID [2022-04-28 03:49:21,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {4356#true} assume true; {4356#true} is VALID [2022-04-28 03:49:21,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4356#true} {4356#true} #53#return; {4356#true} is VALID [2022-04-28 03:49:21,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {4356#true} call ULTIMATE.init(); {4371#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:21,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {4371#(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(18, 2);call #Ultimate.allocInit(12, 3); {4356#true} is VALID [2022-04-28 03:49:21,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {4356#true} assume true; {4356#true} is VALID [2022-04-28 03:49:21,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4356#true} {4356#true} #53#return; {4356#true} is VALID [2022-04-28 03:49:21,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {4356#true} call #t~ret9 := main(); {4356#true} is VALID [2022-04-28 03:49:21,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {4356#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {4361#(<= 500000 main_~y~0)} [95] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_249 v_main_~x~0_248)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_249 v_main_~x~0_248) (< v_main_~x~0_248 500001)) (and .cse0 (not (< v_main_~x~0_249 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_248, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {4361#(<= 500000 main_~y~0)} [96] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {4361#(<= 500000 main_~y~0)} [97] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_251)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) .cse0 (< v_main_~x~0_250 1000001) (= (+ v_main_~x~0_250 v_main_~y~0_206) (+ v_main_~x~0_251 v_main_~y~0_205))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_251 1000000))) .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .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_251, 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_250, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {4361#(<= 500000 main_~y~0)} [94] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {4361#(<= 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; {4362#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:21,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {4362#(<= 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; {4363#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:21,446 INFO L290 TraceCheckUtils]: 12: Hoare triple {4363#(<= 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; {4364#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:21,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {4364#(<= 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; {4365#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:21,447 INFO L290 TraceCheckUtils]: 14: Hoare triple {4365#(<= 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; {4366#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:21,447 INFO L290 TraceCheckUtils]: 15: Hoare triple {4366#(<= 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; {4367#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:21,448 INFO L290 TraceCheckUtils]: 16: Hoare triple {4367#(<= 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; {4368#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:21,448 INFO L290 TraceCheckUtils]: 17: Hoare triple {4368#(<= 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; {4369#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:21,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {4369#(<= 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; {4370#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:21,449 INFO L290 TraceCheckUtils]: 19: Hoare triple {4370#(<= 499982 main_~y~0)} assume !(~y~0 > 0); {4357#false} is VALID [2022-04-28 03:49:21,449 INFO L272 TraceCheckUtils]: 20: Hoare triple {4357#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {4357#false} is VALID [2022-04-28 03:49:21,449 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#false} ~cond := #in~cond; {4357#false} is VALID [2022-04-28 03:49:21,449 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#false} assume 0 == ~cond; {4357#false} is VALID [2022-04-28 03:49:21,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#false} assume !false; {4357#false} is VALID [2022-04-28 03:49:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425891356] [2022-04-28 03:49:21,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425891356] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:21,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782860886] [2022-04-28 03:49:21,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:21,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:21,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:21,451 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-28 03:49:21,452 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-28 03:49:21,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:21,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 03:49:21,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:21,496 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:21,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {4356#true} call ULTIMATE.init(); {4356#true} is VALID [2022-04-28 03:49:21,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {4356#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(18, 2);call #Ultimate.allocInit(12, 3); {4356#true} is VALID [2022-04-28 03:49:21,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {4356#true} assume true; {4356#true} is VALID [2022-04-28 03:49:21,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4356#true} {4356#true} #53#return; {4356#true} is VALID [2022-04-28 03:49:21,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {4356#true} call #t~ret9 := main(); {4356#true} is VALID [2022-04-28 03:49:21,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {4356#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {4361#(<= 500000 main_~y~0)} [95] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_249 v_main_~x~0_248)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_249 v_main_~x~0_248) (< v_main_~x~0_248 500001)) (and .cse0 (not (< v_main_~x~0_249 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_248, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {4361#(<= 500000 main_~y~0)} [96] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {4361#(<= 500000 main_~y~0)} [97] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_251)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) .cse0 (< v_main_~x~0_250 1000001) (= (+ v_main_~x~0_250 v_main_~y~0_206) (+ v_main_~x~0_251 v_main_~y~0_205))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_251 1000000))) .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .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_251, 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_250, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {4361#(<= 500000 main_~y~0)} [94] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4361#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:21,772 INFO L290 TraceCheckUtils]: 10: Hoare triple {4361#(<= 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; {4362#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:21,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {4362#(<= 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; {4363#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:21,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {4363#(<= 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; {4364#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:21,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {4364#(<= 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; {4365#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:21,776 INFO L290 TraceCheckUtils]: 14: Hoare triple {4365#(<= 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; {4366#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:21,777 INFO L290 TraceCheckUtils]: 15: Hoare triple {4366#(<= 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; {4367#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:21,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {4367#(<= 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; {4368#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:21,778 INFO L290 TraceCheckUtils]: 17: Hoare triple {4368#(<= 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; {4369#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:21,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {4369#(<= 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; {4370#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:21,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {4370#(<= 499982 main_~y~0)} assume !(~y~0 > 0); {4357#false} is VALID [2022-04-28 03:49:21,779 INFO L272 TraceCheckUtils]: 20: Hoare triple {4357#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {4357#false} is VALID [2022-04-28 03:49:21,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#false} ~cond := #in~cond; {4357#false} is VALID [2022-04-28 03:49:21,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#false} assume 0 == ~cond; {4357#false} is VALID [2022-04-28 03:49:21,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#false} assume !false; {4357#false} is VALID [2022-04-28 03:49:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:21,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:22,227 INFO L290 TraceCheckUtils]: 23: Hoare triple {4357#false} assume !false; {4357#false} is VALID [2022-04-28 03:49:22,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {4357#false} assume 0 == ~cond; {4357#false} is VALID [2022-04-28 03:49:22,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {4357#false} ~cond := #in~cond; {4357#false} is VALID [2022-04-28 03:49:22,227 INFO L272 TraceCheckUtils]: 20: Hoare triple {4357#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {4357#false} is VALID [2022-04-28 03:49:22,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {4456#(< 0 main_~y~0)} assume !(~y~0 > 0); {4357#false} is VALID [2022-04-28 03:49:22,228 INFO L290 TraceCheckUtils]: 18: Hoare triple {4460#(< 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; {4456#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:22,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {4464#(< 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; {4460#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:22,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {4468#(< 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; {4464#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:22,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {4472#(< 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; {4468#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:22,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {4476#(< 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; {4472#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:22,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {4480#(< 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; {4476#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:22,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {4484#(< 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; {4480#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:22,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {4488#(< 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; {4484#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:22,232 INFO L290 TraceCheckUtils]: 10: Hoare triple {4492#(< 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; {4488#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:22,232 INFO L290 TraceCheckUtils]: 9: Hoare triple {4492#(< 18 main_~y~0)} [94] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {4492#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:22,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {4492#(< 18 main_~y~0)} [97] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_251)) (.cse1 (= |v_main_#t~post6_60| |v_main_#t~post6_59|)) (.cse2 (= v_main_~x~0_251 v_main_~x~0_250)) (.cse3 (= v_main_~y~0_206 v_main_~y~0_205))) (or (and (< v_main_~x~0_251 v_main_~x~0_250) .cse0 (< v_main_~x~0_250 1000001) (= (+ v_main_~x~0_250 v_main_~y~0_206) (+ v_main_~x~0_251 v_main_~y~0_205))) (and .cse1 (or (not .cse0) (not (< v_main_~x~0_251 1000000))) .cse2 (= |v_main_#t~post5_59| |v_main_#t~post5_60|) .cse3) (and (= |v_main_#t~post5_60| |v_main_#t~post5_59|) .cse1 .cse2 .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_251, 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_250, main_#t~post6=|v_main_#t~post6_59|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {4492#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:22,236 INFO L290 TraceCheckUtils]: 7: Hoare triple {4492#(< 18 main_~y~0)} [96] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4492#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:22,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {4492#(< 18 main_~y~0)} [95] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_249 v_main_~x~0_248)) (.cse1 (= |v_main_#t~post4_59| |v_main_#t~post4_58|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_249 v_main_~x~0_248) (< v_main_~x~0_248 500001)) (and .cse0 (not (< v_main_~x~0_249 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_249, main_#t~post4=|v_main_#t~post4_59|} OutVars{main_~x~0=v_main_~x~0_248, main_#t~post4=|v_main_#t~post4_58|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {4492#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:22,237 INFO L290 TraceCheckUtils]: 5: Hoare triple {4356#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {4492#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:22,237 INFO L272 TraceCheckUtils]: 4: Hoare triple {4356#true} call #t~ret9 := main(); {4356#true} is VALID [2022-04-28 03:49:22,237 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4356#true} {4356#true} #53#return; {4356#true} is VALID [2022-04-28 03:49:22,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {4356#true} assume true; {4356#true} is VALID [2022-04-28 03:49:22,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {4356#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(18, 2);call #Ultimate.allocInit(12, 3); {4356#true} is VALID [2022-04-28 03:49:22,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {4356#true} call ULTIMATE.init(); {4356#true} is VALID [2022-04-28 03:49:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:49:22,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782860886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:22,238 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:22,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 23 [2022-04-28 03:49:22,733 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:22,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1812524607] [2022-04-28 03:49:22,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1812524607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:22,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:22,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 03:49:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326656913] [2022-04-28 03:49:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:22,734 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-28 03:49:22,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:22,734 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-28 03:49:22,803 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-28 03:49:22,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 03:49:22,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:22,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 03:49:22,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=623, Invalid=937, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 03:49:22,804 INFO L87 Difference]: Start difference. First operand 57 states and 61 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-28 03:49:24,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:24,414 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2022-04-28 03:49:24,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 03:49:24,414 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-28 03:49:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:24,414 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-28 03:49:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 83 transitions. [2022-04-28 03:49:24,423 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-28 03:49:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 83 transitions. [2022-04-28 03:49:24,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 83 transitions. [2022-04-28 03:49:24,488 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-28 03:49:24,488 INFO L225 Difference]: With dead ends: 111 [2022-04-28 03:49:24,488 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 03:49:24,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1463, Invalid=2959, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 03:49:24,492 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 47 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:24,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 03:49:24,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 03:49:24,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-04-28 03:49:24,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:24,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:24,564 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:24,565 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:24,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:24,565 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-28 03:49:24,566 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 03:49:24,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:24,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:24,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-04-28 03:49:24,566 INFO L87 Difference]: Start difference. First operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 62 states. [2022-04-28 03:49:24,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:24,567 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-28 03:49:24,567 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 03:49:24,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:24,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:24,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:24,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 56 states have internal predecessors, (60), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-28 03:49:24,569 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 53 [2022-04-28 03:49:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:24,569 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-28 03:49:24,569 INFO L496 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-28 03:49:24,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-28 03:49:24,630 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-28 03:49:24,630 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 03:49:24,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 03:49:24,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:24,630 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:24,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:24,831 WARN L477 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-28 03:49:24,831 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:24,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:24,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1045358546, now seen corresponding path program 10 times [2022-04-28 03:49:24,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:24,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107756739] [2022-04-28 03:49:28,917 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:28,973 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-28 03:49:33,115 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:33,241 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-28 03:49:33,242 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:33,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1281434302, now seen corresponding path program 1 times [2022-04-28 03:49:33,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:33,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496833186] [2022-04-28 03:49:33,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:33,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:33,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:33,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:33,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {5082#(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(18, 2);call #Ultimate.allocInit(12, 3); {5066#true} is VALID [2022-04-28 03:49:33,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {5066#true} assume true; {5066#true} is VALID [2022-04-28 03:49:33,385 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5066#true} {5066#true} #53#return; {5066#true} is VALID [2022-04-28 03:49:33,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {5066#true} call ULTIMATE.init(); {5082#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:33,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {5082#(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(18, 2);call #Ultimate.allocInit(12, 3); {5066#true} is VALID [2022-04-28 03:49:33,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {5066#true} assume true; {5066#true} is VALID [2022-04-28 03:49:33,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5066#true} {5066#true} #53#return; {5066#true} is VALID [2022-04-28 03:49:33,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {5066#true} call #t~ret9 := main(); {5066#true} is VALID [2022-04-28 03:49:33,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {5066#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {5071#(<= 500000 main_~y~0)} [99] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and .cse0 (not (< v_main_~x~0_290 500000)) (= v_main_~x~0_289 v_main_~x~0_290)) (and .cse0 (= v_main_~x~0_290 v_main_~x~0_289)) (and (< v_main_~x~0_290 v_main_~x~0_289) (< v_main_~x~0_289 500001)))) InVars {main_~x~0=v_main_~x~0_290, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_289, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,387 INFO L290 TraceCheckUtils]: 7: Hoare triple {5071#(<= 500000 main_~y~0)} [100] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5071#(<= 500000 main_~y~0)} [101] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_292)) (.cse2 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse3 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse4 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse5 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (let ((.cse0 (+ v_main_~x~0_292 v_main_~y~0_247))) (and (= (+ v_main_~x~0_291 v_main_~y~0_248) .cse0) (< .cse0 (+ v_main_~y~0_248 1000001)) (< v_main_~y~0_248 v_main_~y~0_247) .cse1)) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_292 1000000))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_292, 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_291, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {5071#(<= 500000 main_~y~0)} [98] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {5071#(<= 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; {5072#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:33,389 INFO L290 TraceCheckUtils]: 11: Hoare triple {5072#(<= 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; {5073#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:33,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5073#(<= 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; {5074#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:33,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {5074#(<= 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; {5075#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:33,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {5075#(<= 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; {5076#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:33,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {5076#(<= 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; {5077#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:33,391 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= 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; {5078#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:33,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= 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; {5079#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:33,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= 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; {5080#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:33,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {5080#(<= 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; {5081#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:33,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {5081#(<= 499980 main_~y~0)} assume !(~y~0 > 0); {5067#false} is VALID [2022-04-28 03:49:33,393 INFO L272 TraceCheckUtils]: 21: Hoare triple {5067#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5067#false} is VALID [2022-04-28 03:49:33,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#false} ~cond := #in~cond; {5067#false} is VALID [2022-04-28 03:49:33,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {5067#false} assume 0 == ~cond; {5067#false} is VALID [2022-04-28 03:49:33,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {5067#false} assume !false; {5067#false} is VALID [2022-04-28 03:49:33,394 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-28 03:49:33,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496833186] [2022-04-28 03:49:33,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496833186] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:33,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856162801] [2022-04-28 03:49:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:33,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:33,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:33,395 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-28 03:49:33,400 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-28 03:49:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:33,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 03:49:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:33,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:33,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {5066#true} call ULTIMATE.init(); {5066#true} is VALID [2022-04-28 03:49:33,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {5066#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(18, 2);call #Ultimate.allocInit(12, 3); {5066#true} is VALID [2022-04-28 03:49:33,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {5066#true} assume true; {5066#true} is VALID [2022-04-28 03:49:33,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5066#true} {5066#true} #53#return; {5066#true} is VALID [2022-04-28 03:49:33,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {5066#true} call #t~ret9 := main(); {5066#true} is VALID [2022-04-28 03:49:33,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {5066#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {5071#(<= 500000 main_~y~0)} [99] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and .cse0 (not (< v_main_~x~0_290 500000)) (= v_main_~x~0_289 v_main_~x~0_290)) (and .cse0 (= v_main_~x~0_290 v_main_~x~0_289)) (and (< v_main_~x~0_290 v_main_~x~0_289) (< v_main_~x~0_289 500001)))) InVars {main_~x~0=v_main_~x~0_290, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_289, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {5071#(<= 500000 main_~y~0)} [100] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,768 INFO L290 TraceCheckUtils]: 8: Hoare triple {5071#(<= 500000 main_~y~0)} [101] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_292)) (.cse2 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse3 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse4 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse5 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (let ((.cse0 (+ v_main_~x~0_292 v_main_~y~0_247))) (and (= (+ v_main_~x~0_291 v_main_~y~0_248) .cse0) (< .cse0 (+ v_main_~y~0_248 1000001)) (< v_main_~y~0_248 v_main_~y~0_247) .cse1)) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_292 1000000))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_292, 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_291, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,768 INFO L290 TraceCheckUtils]: 9: Hoare triple {5071#(<= 500000 main_~y~0)} [98] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5071#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:33,769 INFO L290 TraceCheckUtils]: 10: Hoare triple {5071#(<= 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; {5072#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:33,769 INFO L290 TraceCheckUtils]: 11: Hoare triple {5072#(<= 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; {5073#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:33,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {5073#(<= 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; {5074#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:33,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {5074#(<= 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; {5075#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:33,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {5075#(<= 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; {5076#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:33,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {5076#(<= 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; {5077#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:33,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {5077#(<= 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; {5078#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:33,772 INFO L290 TraceCheckUtils]: 17: Hoare triple {5078#(<= 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; {5079#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:33,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {5079#(<= 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; {5080#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:33,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {5080#(<= 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; {5081#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:33,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {5081#(<= 499980 main_~y~0)} assume !(~y~0 > 0); {5067#false} is VALID [2022-04-28 03:49:33,774 INFO L272 TraceCheckUtils]: 21: Hoare triple {5067#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5067#false} is VALID [2022-04-28 03:49:33,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#false} ~cond := #in~cond; {5067#false} is VALID [2022-04-28 03:49:33,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {5067#false} assume 0 == ~cond; {5067#false} is VALID [2022-04-28 03:49:33,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {5067#false} assume !false; {5067#false} is VALID [2022-04-28 03:49:33,774 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-28 03:49:33,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:34,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {5067#false} assume !false; {5067#false} is VALID [2022-04-28 03:49:34,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {5067#false} assume 0 == ~cond; {5067#false} is VALID [2022-04-28 03:49:34,277 INFO L290 TraceCheckUtils]: 22: Hoare triple {5067#false} ~cond := #in~cond; {5067#false} is VALID [2022-04-28 03:49:34,277 INFO L272 TraceCheckUtils]: 21: Hoare triple {5067#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5067#false} is VALID [2022-04-28 03:49:34,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {5170#(< 0 main_~y~0)} assume !(~y~0 > 0); {5067#false} is VALID [2022-04-28 03:49:34,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {5174#(< 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; {5170#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:34,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {5178#(< 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; {5174#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:34,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {5182#(< 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; {5178#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:34,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {5186#(< 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; {5182#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:34,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {5190#(< 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; {5186#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:34,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {5194#(< 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; {5190#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:34,286 INFO L290 TraceCheckUtils]: 13: Hoare triple {5198#(< 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; {5194#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:34,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {5202#(< 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; {5198#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:34,289 INFO L290 TraceCheckUtils]: 11: Hoare triple {5206#(< 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; {5202#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:34,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {5210#(< 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; {5206#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:34,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {5210#(< 20 main_~y~0)} [98] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5210#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:34,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {5210#(< 20 main_~y~0)} [101] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_292)) (.cse2 (= v_main_~y~0_248 v_main_~y~0_247)) (.cse3 (= v_main_~x~0_292 v_main_~x~0_291)) (.cse4 (= |v_main_#t~post6_67| |v_main_#t~post6_66|)) (.cse5 (= |v_main_#t~post5_67| |v_main_#t~post5_66|))) (or (let ((.cse0 (+ v_main_~x~0_292 v_main_~y~0_247))) (and (= (+ v_main_~x~0_291 v_main_~y~0_248) .cse0) (< .cse0 (+ v_main_~y~0_248 1000001)) (< v_main_~y~0_248 v_main_~y~0_247) .cse1)) (and .cse2 (or (not .cse1) (not (< v_main_~x~0_292 1000000))) .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_248, main_#t~post5=|v_main_#t~post5_67|, main_~x~0=v_main_~x~0_292, 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_291, main_#t~post6=|v_main_#t~post6_66|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5210#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:34,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {5210#(< 20 main_~y~0)} [100] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5210#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:34,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {5210#(< 20 main_~y~0)} [99] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_65| |v_main_#t~post4_64|))) (or (and .cse0 (not (< v_main_~x~0_290 500000)) (= v_main_~x~0_289 v_main_~x~0_290)) (and .cse0 (= v_main_~x~0_290 v_main_~x~0_289)) (and (< v_main_~x~0_290 v_main_~x~0_289) (< v_main_~x~0_289 500001)))) InVars {main_~x~0=v_main_~x~0_290, main_#t~post4=|v_main_#t~post4_65|} OutVars{main_~x~0=v_main_~x~0_289, main_#t~post4=|v_main_#t~post4_64|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5210#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:34,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {5066#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5210#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:34,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {5066#true} call #t~ret9 := main(); {5066#true} is VALID [2022-04-28 03:49:34,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5066#true} {5066#true} #53#return; {5066#true} is VALID [2022-04-28 03:49:34,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5066#true} assume true; {5066#true} is VALID [2022-04-28 03:49:34,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5066#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(18, 2);call #Ultimate.allocInit(12, 3); {5066#true} is VALID [2022-04-28 03:49:34,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {5066#true} call ULTIMATE.init(); {5066#true} is VALID [2022-04-28 03:49:34,294 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-28 03:49:34,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856162801] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:34,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 25 [2022-04-28 03:49:34,859 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:34,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107756739] [2022-04-28 03:49:34,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107756739] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:34,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:34,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 03:49:34,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115620641] [2022-04-28 03:49:34,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:34,861 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 03:49:34,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:34,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:34,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:34,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 03:49:34,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:34,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 03:49:34,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=752, Invalid=1140, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 03:49:34,914 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:36,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:36,776 INFO L93 Difference]: Finished difference Result 121 states and 134 transitions. [2022-04-28 03:49:36,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 03:49:36,777 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 58 [2022-04-28 03:49:36,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:36,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:36,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 88 transitions. [2022-04-28 03:49:36,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 88 transitions. [2022-04-28 03:49:36,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 88 transitions. [2022-04-28 03:49:36,848 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-28 03:49:36,849 INFO L225 Difference]: With dead ends: 121 [2022-04-28 03:49:36,849 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 03:49:36,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1514 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1766, Invalid=3636, Unknown=0, NotChecked=0, Total=5402 [2022-04-28 03:49:36,851 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:36,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 42 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 03:49:36,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 03:49:36,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-28 03:49:36,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:36,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:36,954 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:36,954 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:36,955 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:49:36,955 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:49:36,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:36,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:36,956 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-28 03:49:36,956 INFO L87 Difference]: Start difference. First operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-04-28 03:49:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:36,957 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 03:49:36,957 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:49:36,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:36,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:36,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:36,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:36,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 61 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2022-04-28 03:49:36,959 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 58 [2022-04-28 03:49:36,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:36,959 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2022-04-28 03:49:36,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 32 states have internal predecessors, (54), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:36,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 71 transitions. [2022-04-28 03:49:37,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:37,083 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 03:49:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 03:49:37,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:37,084 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:37,111 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-28 03:49:37,284 WARN L477 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-28 03:49:37,285 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:37,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1186268395, now seen corresponding path program 11 times [2022-04-28 03:49:37,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:37,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026265592] [2022-04-28 03:49:41,350 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:41,397 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-28 03:49:41,647 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-28 03:49:41,649 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:41,652 INFO L85 PathProgramCache]: Analyzing trace with hash -328411167, now seen corresponding path program 1 times [2022-04-28 03:49:41,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:41,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265282562] [2022-04-28 03:49:41,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:41,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:41,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:41,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {5852#(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(18, 2);call #Ultimate.allocInit(12, 3); {5832#true} is VALID [2022-04-28 03:49:41,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {5832#true} assume true; {5832#true} is VALID [2022-04-28 03:49:41,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5832#true} {5832#true} #53#return; {5832#true} is VALID [2022-04-28 03:49:41,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {5832#true} call ULTIMATE.init(); {5852#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:41,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {5852#(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(18, 2);call #Ultimate.allocInit(12, 3); {5832#true} is VALID [2022-04-28 03:49:41,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {5832#true} assume true; {5832#true} is VALID [2022-04-28 03:49:41,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5832#true} {5832#true} #53#return; {5832#true} is VALID [2022-04-28 03:49:41,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {5832#true} call #t~ret9 := main(); {5832#true} is VALID [2022-04-28 03:49:41,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {5832#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5837#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:49:41,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {5837#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [103] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_334 v_main_~x~0_333)) (.cse1 (= |v_main_#t~post4_71| |v_main_#t~post4_70|))) (or (and (< v_main_~x~0_334 v_main_~x~0_333) (< v_main_~x~0_333 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_334) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_333, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5838#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:41,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {5838#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [104] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5838#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:41,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {5838#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [105] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_336)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse3 (= v_main_~x~0_336 v_main_~x~0_335)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= (+ v_main_~x~0_335 v_main_~y~0_294) (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~x~0_336 v_main_~x~0_335) (< v_main_~x~0_335 1000001) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_336 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_335, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5839#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:41,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {5839#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [102] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:41,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {5840#(<= 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; {5841#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:41,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {5841#(<= 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; {5842#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:41,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {5842#(<= 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; {5843#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:41,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {5843#(<= 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; {5844#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:41,864 INFO L290 TraceCheckUtils]: 14: Hoare triple {5844#(<= 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; {5845#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:41,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {5845#(<= 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; {5846#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:41,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {5846#(<= 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; {5847#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:41,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {5847#(<= 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; {5848#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:41,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#(<= 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; {5849#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:41,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {5849#(<= 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; {5850#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:41,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 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; {5851#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:49:41,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#(<= 499978 main_~y~0)} assume !(~y~0 > 0); {5833#false} is VALID [2022-04-28 03:49:41,875 INFO L272 TraceCheckUtils]: 22: Hoare triple {5833#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5833#false} is VALID [2022-04-28 03:49:41,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {5833#false} ~cond := #in~cond; {5833#false} is VALID [2022-04-28 03:49:41,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {5833#false} assume 0 == ~cond; {5833#false} is VALID [2022-04-28 03:49:41,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {5833#false} assume !false; {5833#false} is VALID [2022-04-28 03:49:41,876 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:49:41,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:41,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265282562] [2022-04-28 03:49:41,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265282562] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:41,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750242756] [2022-04-28 03:49:41,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:41,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:41,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:41,878 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-28 03:49:41,879 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-28 03:49:41,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:41,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 03:49:41,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:41,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:42,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {5832#true} call ULTIMATE.init(); {5832#true} is VALID [2022-04-28 03:49:42,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {5832#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(18, 2);call #Ultimate.allocInit(12, 3); {5832#true} is VALID [2022-04-28 03:49:42,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {5832#true} assume true; {5832#true} is VALID [2022-04-28 03:49:42,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5832#true} {5832#true} #53#return; {5832#true} is VALID [2022-04-28 03:49:42,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {5832#true} call #t~ret9 := main(); {5832#true} is VALID [2022-04-28 03:49:42,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {5832#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:42,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {5840#(<= 500000 main_~y~0)} [103] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_334 v_main_~x~0_333)) (.cse1 (= |v_main_#t~post4_71| |v_main_#t~post4_70|))) (or (and (< v_main_~x~0_334 v_main_~x~0_333) (< v_main_~x~0_333 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_334) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_333, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:42,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {5840#(<= 500000 main_~y~0)} [104] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:42,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {5840#(<= 500000 main_~y~0)} [105] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_336)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse3 (= v_main_~x~0_336 v_main_~x~0_335)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= (+ v_main_~x~0_335 v_main_~y~0_294) (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~x~0_336 v_main_~x~0_335) (< v_main_~x~0_335 1000001) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_336 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_335, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:42,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {5840#(<= 500000 main_~y~0)} [102] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5840#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:42,231 INFO L290 TraceCheckUtils]: 10: Hoare triple {5840#(<= 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; {5841#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:42,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {5841#(<= 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; {5842#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:42,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {5842#(<= 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; {5843#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:42,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {5843#(<= 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; {5844#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:42,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {5844#(<= 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; {5845#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:42,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {5845#(<= 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; {5846#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:42,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {5846#(<= 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; {5847#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:42,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {5847#(<= 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; {5848#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:42,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {5848#(<= 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; {5849#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:42,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {5849#(<= 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; {5850#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:42,237 INFO L290 TraceCheckUtils]: 20: Hoare triple {5850#(<= 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; {5851#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:49:42,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {5851#(<= 499978 main_~y~0)} assume !(~y~0 > 0); {5833#false} is VALID [2022-04-28 03:49:42,238 INFO L272 TraceCheckUtils]: 22: Hoare triple {5833#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5833#false} is VALID [2022-04-28 03:49:42,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {5833#false} ~cond := #in~cond; {5833#false} is VALID [2022-04-28 03:49:42,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {5833#false} assume 0 == ~cond; {5833#false} is VALID [2022-04-28 03:49:42,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {5833#false} assume !false; {5833#false} is VALID [2022-04-28 03:49:42,238 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-28 03:49:42,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:42,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {5833#false} assume !false; {5833#false} is VALID [2022-04-28 03:49:42,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {5833#false} assume 0 == ~cond; {5833#false} is VALID [2022-04-28 03:49:42,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {5833#false} ~cond := #in~cond; {5833#false} is VALID [2022-04-28 03:49:42,711 INFO L272 TraceCheckUtils]: 22: Hoare triple {5833#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {5833#false} is VALID [2022-04-28 03:49:42,718 INFO L290 TraceCheckUtils]: 21: Hoare triple {5943#(< 0 main_~y~0)} assume !(~y~0 > 0); {5833#false} is VALID [2022-04-28 03:49:42,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {5947#(< 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; {5943#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:42,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {5951#(< 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; {5947#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:42,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {5955#(< 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; {5951#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:42,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {5959#(< 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; {5955#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:42,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {5963#(< 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; {5959#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:42,722 INFO L290 TraceCheckUtils]: 15: Hoare triple {5967#(< 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; {5963#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:42,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {5971#(< 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; {5967#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:42,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {5975#(< 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; {5971#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:42,723 INFO L290 TraceCheckUtils]: 12: Hoare triple {5979#(< 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; {5975#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:42,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {5983#(< 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; {5979#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:42,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {5987#(< 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; {5983#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:42,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {5987#(< 22 main_~y~0)} [102] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {5987#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:42,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {5987#(< 22 main_~y~0)} [105] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_336)) (.cse1 (= |v_main_#t~post6_74| |v_main_#t~post6_73|)) (.cse2 (= v_main_~y~0_294 v_main_~y~0_293)) (.cse3 (= v_main_~x~0_336 v_main_~x~0_335)) (.cse4 (= |v_main_#t~post5_74| |v_main_#t~post5_73|))) (or (and (= (+ v_main_~x~0_335 v_main_~y~0_294) (+ v_main_~x~0_336 v_main_~y~0_293)) (< v_main_~x~0_336 v_main_~x~0_335) (< v_main_~x~0_335 1000001) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and (or (not (< v_main_~x~0_336 1000000)) (not .cse0)) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_294, main_#t~post5=|v_main_#t~post5_74|, main_~x~0=v_main_~x~0_336, main_#t~post6=|v_main_#t~post6_74|} OutVars{main_~y~0=v_main_~y~0_293, main_#t~post5=|v_main_#t~post5_73|, main_~x~0=v_main_~x~0_335, main_#t~post6=|v_main_#t~post6_73|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {5987#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:42,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {5987#(< 22 main_~y~0)} [104] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5987#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:42,726 INFO L290 TraceCheckUtils]: 6: Hoare triple {5987#(< 22 main_~y~0)} [103] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_334 v_main_~x~0_333)) (.cse1 (= |v_main_#t~post4_71| |v_main_#t~post4_70|))) (or (and (< v_main_~x~0_334 v_main_~x~0_333) (< v_main_~x~0_333 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_334) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_334, main_#t~post4=|v_main_#t~post4_71|} OutVars{main_~x~0=v_main_~x~0_333, main_#t~post4=|v_main_#t~post4_70|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {5987#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:42,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {5832#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {5987#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:42,726 INFO L272 TraceCheckUtils]: 4: Hoare triple {5832#true} call #t~ret9 := main(); {5832#true} is VALID [2022-04-28 03:49:42,726 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5832#true} {5832#true} #53#return; {5832#true} is VALID [2022-04-28 03:49:42,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {5832#true} assume true; {5832#true} is VALID [2022-04-28 03:49:42,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {5832#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(18, 2);call #Ultimate.allocInit(12, 3); {5832#true} is VALID [2022-04-28 03:49:42,726 INFO L272 TraceCheckUtils]: 0: Hoare triple {5832#true} call ULTIMATE.init(); {5832#true} is VALID [2022-04-28 03:49:42,727 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-28 03:49:42,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750242756] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:42,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:42,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 30 [2022-04-28 03:49:43,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026265592] [2022-04-28 03:49:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026265592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:43,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:43,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 03:49:43,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089261507] [2022-04-28 03:49:43,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:43,358 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 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 63 [2022-04-28 03:49:43,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:43,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:43,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:43,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 03:49:43,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:43,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 03:49:43,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 03:49:43,415 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:45,741 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-04-28 03:49:45,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 03:49:45,741 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 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 63 [2022-04-28 03:49:45,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:45,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 93 transitions. [2022-04-28 03:49:45,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 93 transitions. [2022-04-28 03:49:45,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 93 transitions. [2022-04-28 03:49:45,818 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-28 03:49:45,820 INFO L225 Difference]: With dead ends: 167 [2022-04-28 03:49:45,820 INFO L226 Difference]: Without dead ends: 108 [2022-04-28 03:49:45,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2184, Invalid=4788, Unknown=0, NotChecked=0, Total=6972 [2022-04-28 03:49:45,822 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:45,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 42 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 965 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 03:49:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-04-28 03:49:45,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2022-04-28 03:49:45,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:45,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:45,993 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:45,993 INFO L87 Difference]: Start difference. First operand 108 states. Second operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:45,995 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-28 03:49:45,995 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-28 03:49:45,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:45,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:45,995 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 108 states. [2022-04-28 03:49:45,995 INFO L87 Difference]: Start difference. First operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 108 states. [2022-04-28 03:49:45,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:45,997 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2022-04-28 03:49:45,997 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-28 03:49:45,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:45,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:45,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:45,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:45,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 101 states have (on average 1.0594059405940595) internal successors, (107), 102 states have internal predecessors, (107), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:46,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-04-28 03:49:46,000 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 63 [2022-04-28 03:49:46,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:46,000 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-04-28 03:49:46,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 35 states have internal predecessors, (59), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:46,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 113 transitions. [2022-04-28 03:49:46,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:46,114 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-28 03:49:46,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 03:49:46,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:46,115 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:46,132 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-28 03:49:46,319 WARN L477 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-28 03:49:46,319 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:46,320 INFO L85 PathProgramCache]: Analyzing trace with hash -661333475, now seen corresponding path program 12 times [2022-04-28 03:49:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:46,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1520598850] [2022-04-28 03:49:46,426 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-28 03:49:50,537 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:49:50,642 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-28 03:49:50,643 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:50,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1122332894, now seen corresponding path program 1 times [2022-04-28 03:49:50,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:50,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613733695] [2022-04-28 03:49:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:50,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:50,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:50,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {6891#(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(18, 2);call #Ultimate.allocInit(12, 3); {6873#true} is VALID [2022-04-28 03:49:50,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {6873#true} assume true; {6873#true} is VALID [2022-04-28 03:49:50,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6873#true} {6873#true} #53#return; {6873#true} is VALID [2022-04-28 03:49:50,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {6873#true} call ULTIMATE.init(); {6891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:50,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {6891#(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(18, 2);call #Ultimate.allocInit(12, 3); {6873#true} is VALID [2022-04-28 03:49:50,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {6873#true} assume true; {6873#true} is VALID [2022-04-28 03:49:50,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6873#true} {6873#true} #53#return; {6873#true} is VALID [2022-04-28 03:49:50,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {6873#true} call #t~ret9 := main(); {6873#true} is VALID [2022-04-28 03:49:50,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {6873#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6878#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:50,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {6878#(<= 500000 main_~y~0)} [107] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_77| |v_main_#t~post4_76|))) (or (and (<= 500000 v_main_~x~0_381) .cse0 .cse1) (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6878#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:50,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {6878#(<= 500000 main_~y~0)} [108] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6878#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:50,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {6878#(<= 500000 main_~y~0)} [109] L10-2-->L17-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_383)) (.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~y~0_344 v_main_~y~0_343)) (.cse2 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse3 (= |v_main_#t~post5_81| |v_main_#t~post5_80|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_383 1000000)) (not .cse4))) (and (< v_main_~x~0_382 1000001) (= (+ v_main_~x~0_383 v_main_~y~0_343) (+ v_main_~x~0_382 v_main_~y~0_344)) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_344, 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_343, 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] {6878#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:50,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {6878#(<= 500000 main_~y~0)} [106] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6878#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:50,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {6878#(<= 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; {6879#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:50,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {6879#(<= 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; {6880#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:50,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {6880#(<= 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; {6881#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:50,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {6881#(<= 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; {6882#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:50,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {6882#(<= 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; {6883#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:50,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {6883#(<= 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; {6884#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:50,831 INFO L290 TraceCheckUtils]: 16: Hoare triple {6884#(<= 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; {6885#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:50,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {6885#(<= 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; {6886#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:50,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {6886#(<= 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; {6887#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:50,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {6887#(<= 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; {6888#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:50,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {6888#(<= 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; {6889#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:49:50,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {6889#(<= 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; {6890#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:49:50,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {6890#(<= 499976 main_~y~0)} assume !(~y~0 > 0); {6874#false} is VALID [2022-04-28 03:49:50,834 INFO L272 TraceCheckUtils]: 23: Hoare triple {6874#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {6874#false} is VALID [2022-04-28 03:49:50,834 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#false} ~cond := #in~cond; {6874#false} is VALID [2022-04-28 03:49:50,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#false} assume 0 == ~cond; {6874#false} is VALID [2022-04-28 03:49:50,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2022-04-28 03:49:50,834 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-28 03:49:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613733695] [2022-04-28 03:49:50,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613733695] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:50,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573021901] [2022-04-28 03:49:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:50,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:50,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:50,844 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-28 03:49:50,845 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-28 03:49:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:50,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:49:50,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:50,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:51,413 INFO L272 TraceCheckUtils]: 0: Hoare triple {6873#true} call ULTIMATE.init(); {6873#true} is VALID [2022-04-28 03:49:51,413 INFO L290 TraceCheckUtils]: 1: Hoare triple {6873#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(18, 2);call #Ultimate.allocInit(12, 3); {6873#true} is VALID [2022-04-28 03:49:51,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {6873#true} assume true; {6873#true} is VALID [2022-04-28 03:49:51,413 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6873#true} {6873#true} #53#return; {6873#true} is VALID [2022-04-28 03:49:51,413 INFO L272 TraceCheckUtils]: 4: Hoare triple {6873#true} call #t~ret9 := main(); {6873#true} is VALID [2022-04-28 03:49:51,413 INFO L290 TraceCheckUtils]: 5: Hoare triple {6873#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {6910#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:49:51,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {6910#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [107] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_77| |v_main_#t~post4_76|))) (or (and (<= 500000 v_main_~x~0_381) .cse0 .cse1) (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {6914#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:49:51,414 INFO L290 TraceCheckUtils]: 7: Hoare triple {6914#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [108] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6914#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:49:51,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {6914#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [109] L10-2-->L17-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_383)) (.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~y~0_344 v_main_~y~0_343)) (.cse2 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse3 (= |v_main_#t~post5_81| |v_main_#t~post5_80|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_383 1000000)) (not .cse4))) (and (< v_main_~x~0_382 1000001) (= (+ v_main_~x~0_383 v_main_~y~0_343) (+ v_main_~x~0_382 v_main_~y~0_344)) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_344, 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_343, 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] {6921#(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-28 03:49:51,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {6921#(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)))} [106] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {6925#(< 999999 main_~y~0)} is VALID [2022-04-28 03:49:51,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {6925#(< 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; {6929#(< 999997 main_~y~0)} is VALID [2022-04-28 03:49:51,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {6929#(< 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; {6933#(< 999995 main_~y~0)} is VALID [2022-04-28 03:49:51,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {6933#(< 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; {6937#(< 999993 main_~y~0)} is VALID [2022-04-28 03:49:51,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {6937#(< 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; {6941#(< 999991 main_~y~0)} is VALID [2022-04-28 03:49:51,418 INFO L290 TraceCheckUtils]: 14: Hoare triple {6941#(< 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; {6945#(< 999989 main_~y~0)} is VALID [2022-04-28 03:49:51,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {6945#(< 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; {6949#(< 999987 main_~y~0)} is VALID [2022-04-28 03:49:51,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {6949#(< 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; {6953#(< 999985 main_~y~0)} is VALID [2022-04-28 03:49:51,420 INFO L290 TraceCheckUtils]: 17: Hoare triple {6953#(< 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; {6957#(< 999983 main_~y~0)} is VALID [2022-04-28 03:49:51,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {6957#(< 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; {6961#(< 999981 main_~y~0)} is VALID [2022-04-28 03:49:51,420 INFO L290 TraceCheckUtils]: 19: Hoare triple {6961#(< 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; {6965#(< 999979 main_~y~0)} is VALID [2022-04-28 03:49:51,421 INFO L290 TraceCheckUtils]: 20: Hoare triple {6965#(< 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; {6969#(< 999977 main_~y~0)} is VALID [2022-04-28 03:49:51,421 INFO L290 TraceCheckUtils]: 21: Hoare triple {6969#(< 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; {6973#(< 999975 main_~y~0)} is VALID [2022-04-28 03:49:51,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {6973#(< 999975 main_~y~0)} assume !(~y~0 > 0); {6874#false} is VALID [2022-04-28 03:49:51,422 INFO L272 TraceCheckUtils]: 23: Hoare triple {6874#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {6874#false} is VALID [2022-04-28 03:49:51,422 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#false} ~cond := #in~cond; {6874#false} is VALID [2022-04-28 03:49:51,422 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#false} assume 0 == ~cond; {6874#false} is VALID [2022-04-28 03:49:51,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2022-04-28 03:49:51,422 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-28 03:49:51,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:52,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {6874#false} assume !false; {6874#false} is VALID [2022-04-28 03:49:52,186 INFO L290 TraceCheckUtils]: 25: Hoare triple {6874#false} assume 0 == ~cond; {6874#false} is VALID [2022-04-28 03:49:52,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {6874#false} ~cond := #in~cond; {6874#false} is VALID [2022-04-28 03:49:52,187 INFO L272 TraceCheckUtils]: 23: Hoare triple {6874#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {6874#false} is VALID [2022-04-28 03:49:52,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {7001#(< 0 main_~y~0)} assume !(~y~0 > 0); {6874#false} is VALID [2022-04-28 03:49:52,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {7005#(< 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; {7001#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:52,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {7009#(< 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; {7005#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:52,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {7013#(< 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; {7009#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:52,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {7017#(< 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; {7013#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:52,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {7021#(< 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; {7017#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:52,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(< 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; {7021#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:52,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {7029#(< 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; {7025#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:52,191 INFO L290 TraceCheckUtils]: 14: Hoare triple {7033#(< 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; {7029#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:52,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {7037#(< 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; {7033#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:52,192 INFO L290 TraceCheckUtils]: 12: Hoare triple {7041#(< 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; {7037#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:52,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {7045#(< 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; {7041#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:52,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {7049#(< 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; {7045#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:52,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {7053#(or (< main_~x~0 1000000) (< 24 main_~y~0))} [106] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {7049#(< 24 main_~y~0)} is VALID [2022-04-28 03:49:52,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {7057#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} [109] L10-2-->L17-1_primed: Formula: (let ((.cse4 (<= 500000 v_main_~x~0_383)) (.cse0 (= |v_main_#t~post6_81| |v_main_#t~post6_80|)) (.cse1 (= v_main_~y~0_344 v_main_~y~0_343)) (.cse2 (= v_main_~x~0_383 v_main_~x~0_382)) (.cse3 (= |v_main_#t~post5_81| |v_main_#t~post5_80|))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_383 1000000)) (not .cse4))) (and (< v_main_~x~0_382 1000001) (= (+ v_main_~x~0_383 v_main_~y~0_343) (+ v_main_~x~0_382 v_main_~y~0_344)) (< v_main_~x~0_383 v_main_~x~0_382) .cse4) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_344, 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_343, 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] {7053#(or (< main_~x~0 1000000) (< 24 main_~y~0))} is VALID [2022-04-28 03:49:52,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {7057#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} [108] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7057#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} is VALID [2022-04-28 03:49:52,195 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0)) (<= 0 (+ 499975 main_~y~0)) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} [107] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_381 v_main_~x~0_380)) (.cse1 (= |v_main_#t~post4_77| |v_main_#t~post4_76|))) (or (and (<= 500000 v_main_~x~0_381) .cse0 .cse1) (and (< v_main_~x~0_381 v_main_~x~0_380) (< v_main_~x~0_380 500001)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_381, main_#t~post4=|v_main_#t~post4_77|} OutVars{main_~x~0=v_main_~x~0_380, main_#t~post4=|v_main_#t~post4_76|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7057#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} is VALID [2022-04-28 03:49:52,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {6873#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7064#(and (or (< main_~x~0 (+ main_~y~0 999976)) (<= 1000000 main_~x~0)) (<= 0 (+ 499975 main_~y~0)) (or (< main_~x~0 1000000) (< 24 main_~y~0)))} is VALID [2022-04-28 03:49:52,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {6873#true} call #t~ret9 := main(); {6873#true} is VALID [2022-04-28 03:49:52,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6873#true} {6873#true} #53#return; {6873#true} is VALID [2022-04-28 03:49:52,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {6873#true} assume true; {6873#true} is VALID [2022-04-28 03:49:52,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {6873#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(18, 2);call #Ultimate.allocInit(12, 3); {6873#true} is VALID [2022-04-28 03:49:52,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {6873#true} call ULTIMATE.init(); {6873#true} is VALID [2022-04-28 03:49:52,196 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-28 03:49:52,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573021901] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:52,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:52,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 48 [2022-04-28 03:49:52,960 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:52,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1520598850] [2022-04-28 03:49:52,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1520598850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:52,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:52,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 03:49:52,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433056043] [2022-04-28 03:49:52,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:52,961 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-28 03:49:52,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:52,961 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-28 03:49:53,011 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-28 03:49:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 03:49:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:53,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 03:49:53,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2991, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:49:53,013 INFO L87 Difference]: Start difference. First operand 108 states and 113 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-28 03:49:55,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:55,728 INFO L93 Difference]: Finished difference Result 175 states and 191 transitions. [2022-04-28 03:49:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 03:49:55,729 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-28 03:49:55,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:49:55,729 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-28 03:49:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 98 transitions. [2022-04-28 03:49:55,730 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-28 03:49:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 98 transitions. [2022-04-28 03:49:55,731 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 98 transitions. [2022-04-28 03:49:55,810 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-28 03:49:55,811 INFO L225 Difference]: With dead ends: 175 [2022-04-28 03:49:55,811 INFO L226 Difference]: Without dead ends: 115 [2022-04-28 03:49:55,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3192, Invalid=7520, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:49:55,814 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 104 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:49:55,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 37 Invalid, 1139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 1019 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 03:49:55,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-28 03:49:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 75. [2022-04-28 03:49:55,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:49:55,914 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:55,914 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:55,914 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:55,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:55,916 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-28 03:49:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-28 03:49:55,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:55,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:55,917 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 115 states. [2022-04-28 03:49:55,917 INFO L87 Difference]: Start difference. First operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 115 states. [2022-04-28 03:49:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:49:55,919 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2022-04-28 03:49:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 120 transitions. [2022-04-28 03:49:55,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:49:55,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:49:55,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:49:55,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:49:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 68 states have (on average 1.0735294117647058) internal successors, (73), 69 states have internal predecessors, (73), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:49:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2022-04-28 03:49:55,921 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 66 [2022-04-28 03:49:55,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:49:55,921 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2022-04-28 03:49:55,921 INFO L496 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-28 03:49:55,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 79 transitions. [2022-04-28 03:49:56,022 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-28 03:49:56,022 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 03:49:56,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-28 03:49:56,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:49:56,023 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:49:56,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 03:49:56,223 WARN L477 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-28 03:49:56,224 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:49:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:49:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash -474371364, now seen corresponding path program 13 times [2022-04-28 03:49:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:56,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [640144237] [2022-04-28 03:49:56,323 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-28 03:49:56,550 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-28 03:49:56,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:49:56,554 INFO L85 PathProgramCache]: Analyzing trace with hash 166928897, now seen corresponding path program 1 times [2022-04-28 03:49:56,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:49:56,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111569279] [2022-04-28 03:49:56,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:56,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:49:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:56,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:49:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:56,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {7928#(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(18, 2);call #Ultimate.allocInit(12, 3); {7906#true} is VALID [2022-04-28 03:49:56,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {7906#true} assume true; {7906#true} is VALID [2022-04-28 03:49:56,825 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7906#true} {7906#true} #53#return; {7906#true} is VALID [2022-04-28 03:49:56,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {7906#true} call ULTIMATE.init(); {7928#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:49:56,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7928#(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(18, 2);call #Ultimate.allocInit(12, 3); {7906#true} is VALID [2022-04-28 03:49:56,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {7906#true} assume true; {7906#true} is VALID [2022-04-28 03:49:56,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7906#true} {7906#true} #53#return; {7906#true} is VALID [2022-04-28 03:49:56,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {7906#true} call #t~ret9 := main(); {7906#true} is VALID [2022-04-28 03:49:56,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {7906#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7911#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:49:56,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {7911#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [111] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|)) (.cse1 (= v_main_~x~0_431 v_main_~x~0_430))) (or (and (< v_main_~x~0_431 v_main_~x~0_430) (< v_main_~x~0_430 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_431 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_431, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7912#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:56,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {7912#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [112] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7912#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:56,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {7912#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [113] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_433 v_main_~x~0_432)) (.cse4 (<= 500000 v_main_~x~0_433))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_433 1000000))) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_432 v_main_~y~0_397) (+ v_main_~x~0_433 v_main_~y~0_396)) .cse4 (< v_main_~x~0_432 1000001) (< v_main_~x~0_433 v_main_~x~0_432)))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7913#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:49:56,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {7913#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [110] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:56,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {7914#(<= 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; {7915#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:56,833 INFO L290 TraceCheckUtils]: 11: Hoare triple {7915#(<= 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; {7916#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:56,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {7916#(<= 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; {7917#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:56,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {7917#(<= 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; {7918#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:56,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {7918#(<= 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; {7919#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:56,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {7919#(<= 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; {7920#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:56,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {7920#(<= 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; {7921#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:56,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {7921#(<= 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; {7922#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:56,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {7922#(<= 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; {7923#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:56,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {7923#(<= 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; {7924#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:56,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {7924#(<= 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; {7925#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:49:56,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {7925#(<= 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; {7926#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:49:56,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {7926#(<= 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; {7927#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:49:56,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {7927#(<= 499974 main_~y~0)} assume !(~y~0 > 0); {7907#false} is VALID [2022-04-28 03:49:56,840 INFO L272 TraceCheckUtils]: 24: Hoare triple {7907#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {7907#false} is VALID [2022-04-28 03:49:56,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {7907#false} ~cond := #in~cond; {7907#false} is VALID [2022-04-28 03:49:56,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {7907#false} assume 0 == ~cond; {7907#false} is VALID [2022-04-28 03:49:56,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {7907#false} assume !false; {7907#false} is VALID [2022-04-28 03:49:56,841 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-28 03:49:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:49:56,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111569279] [2022-04-28 03:49:56,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111569279] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:49:56,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087383075] [2022-04-28 03:49:56,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:49:56,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:49:56,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:49:56,842 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-28 03:49:56,869 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-28 03:49:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:56,899 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 03:49:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:49:56,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:49:57,252 INFO L272 TraceCheckUtils]: 0: Hoare triple {7906#true} call ULTIMATE.init(); {7906#true} is VALID [2022-04-28 03:49:57,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {7906#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(18, 2);call #Ultimate.allocInit(12, 3); {7906#true} is VALID [2022-04-28 03:49:57,253 INFO L290 TraceCheckUtils]: 2: Hoare triple {7906#true} assume true; {7906#true} is VALID [2022-04-28 03:49:57,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7906#true} {7906#true} #53#return; {7906#true} is VALID [2022-04-28 03:49:57,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {7906#true} call #t~ret9 := main(); {7906#true} is VALID [2022-04-28 03:49:57,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {7906#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:57,254 INFO L290 TraceCheckUtils]: 6: Hoare triple {7914#(<= 500000 main_~y~0)} [111] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|)) (.cse1 (= v_main_~x~0_431 v_main_~x~0_430))) (or (and (< v_main_~x~0_431 v_main_~x~0_430) (< v_main_~x~0_430 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_431 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_431, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:57,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(<= 500000 main_~y~0)} [112] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:57,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {7914#(<= 500000 main_~y~0)} [113] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_433 v_main_~x~0_432)) (.cse4 (<= 500000 v_main_~x~0_433))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_433 1000000))) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_432 v_main_~y~0_397) (+ v_main_~x~0_433 v_main_~y~0_396)) .cse4 (< v_main_~x~0_432 1000001) (< v_main_~x~0_433 v_main_~x~0_432)))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:57,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {7914#(<= 500000 main_~y~0)} [110] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {7914#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:49:57,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {7914#(<= 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; {7915#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:49:57,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {7915#(<= 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; {7916#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:49:57,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {7916#(<= 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; {7917#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:49:57,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {7917#(<= 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; {7918#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:49:57,259 INFO L290 TraceCheckUtils]: 14: Hoare triple {7918#(<= 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; {7919#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:49:57,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {7919#(<= 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; {7920#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:49:57,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {7920#(<= 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; {7921#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:49:57,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {7921#(<= 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; {7922#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:49:57,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {7922#(<= 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; {7923#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:49:57,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {7923#(<= 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; {7924#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:49:57,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {7924#(<= 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; {7925#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:49:57,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {7925#(<= 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; {7926#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:49:57,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {7926#(<= 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; {7927#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:49:57,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {7927#(<= 499974 main_~y~0)} assume !(~y~0 > 0); {7907#false} is VALID [2022-04-28 03:49:57,264 INFO L272 TraceCheckUtils]: 24: Hoare triple {7907#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {7907#false} is VALID [2022-04-28 03:49:57,264 INFO L290 TraceCheckUtils]: 25: Hoare triple {7907#false} ~cond := #in~cond; {7907#false} is VALID [2022-04-28 03:49:57,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {7907#false} assume 0 == ~cond; {7907#false} is VALID [2022-04-28 03:49:57,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {7907#false} assume !false; {7907#false} is VALID [2022-04-28 03:49:57,265 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-28 03:49:57,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:49:57,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {7907#false} assume !false; {7907#false} is VALID [2022-04-28 03:49:57,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {7907#false} assume 0 == ~cond; {7907#false} is VALID [2022-04-28 03:49:57,817 INFO L290 TraceCheckUtils]: 25: Hoare triple {7907#false} ~cond := #in~cond; {7907#false} is VALID [2022-04-28 03:49:57,818 INFO L272 TraceCheckUtils]: 24: Hoare triple {7907#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {7907#false} is VALID [2022-04-28 03:49:57,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {8025#(< 0 main_~y~0)} assume !(~y~0 > 0); {7907#false} is VALID [2022-04-28 03:49:57,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {8029#(< 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; {8025#(< 0 main_~y~0)} is VALID [2022-04-28 03:49:57,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {8033#(< 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; {8029#(< 2 main_~y~0)} is VALID [2022-04-28 03:49:57,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {8037#(< 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; {8033#(< 4 main_~y~0)} is VALID [2022-04-28 03:49:57,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {8041#(< 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; {8037#(< 6 main_~y~0)} is VALID [2022-04-28 03:49:57,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {8045#(< 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; {8041#(< 8 main_~y~0)} is VALID [2022-04-28 03:49:57,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {8049#(< 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; {8045#(< 10 main_~y~0)} is VALID [2022-04-28 03:49:57,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {8053#(< 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; {8049#(< 12 main_~y~0)} is VALID [2022-04-28 03:49:57,822 INFO L290 TraceCheckUtils]: 15: Hoare triple {8057#(< 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; {8053#(< 14 main_~y~0)} is VALID [2022-04-28 03:49:57,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {8061#(< 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; {8057#(< 16 main_~y~0)} is VALID [2022-04-28 03:49:57,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {8065#(< 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; {8061#(< 18 main_~y~0)} is VALID [2022-04-28 03:49:57,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {8069#(< 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; {8065#(< 20 main_~y~0)} is VALID [2022-04-28 03:49:57,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {8073#(< 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; {8069#(< 22 main_~y~0)} is VALID [2022-04-28 03:49:57,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {8077#(< 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; {8073#(< 24 main_~y~0)} is VALID [2022-04-28 03:49:57,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {8077#(< 26 main_~y~0)} [110] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {8077#(< 26 main_~y~0)} is VALID [2022-04-28 03:49:57,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {8077#(< 26 main_~y~0)} [113] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_88| |v_main_#t~post6_87|)) (.cse1 (= v_main_~y~0_397 v_main_~y~0_396)) (.cse2 (= |v_main_#t~post5_88| |v_main_#t~post5_87|)) (.cse3 (= v_main_~x~0_433 v_main_~x~0_432)) (.cse4 (<= 500000 v_main_~x~0_433))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_433 1000000))) .cse0 .cse1 .cse2 .cse3) (and (= (+ v_main_~x~0_432 v_main_~y~0_397) (+ v_main_~x~0_433 v_main_~y~0_396)) .cse4 (< v_main_~x~0_432 1000001) (< v_main_~x~0_433 v_main_~x~0_432)))) InVars {main_~y~0=v_main_~y~0_397, main_#t~post5=|v_main_#t~post5_88|, main_~x~0=v_main_~x~0_433, main_#t~post6=|v_main_#t~post6_88|} OutVars{main_~y~0=v_main_~y~0_396, main_#t~post5=|v_main_#t~post5_87|, main_~x~0=v_main_~x~0_432, main_#t~post6=|v_main_#t~post6_87|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {8077#(< 26 main_~y~0)} is VALID [2022-04-28 03:49:57,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {8077#(< 26 main_~y~0)} [112] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8077#(< 26 main_~y~0)} is VALID [2022-04-28 03:49:57,826 INFO L290 TraceCheckUtils]: 6: Hoare triple {8077#(< 26 main_~y~0)} [111] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_84| |v_main_#t~post4_83|)) (.cse1 (= v_main_~x~0_431 v_main_~x~0_430))) (or (and (< v_main_~x~0_431 v_main_~x~0_430) (< v_main_~x~0_430 500001)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_431 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_431, main_#t~post4=|v_main_#t~post4_84|} OutVars{main_~x~0=v_main_~x~0_430, main_#t~post4=|v_main_#t~post4_83|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {8077#(< 26 main_~y~0)} is VALID [2022-04-28 03:49:57,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {7906#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {8077#(< 26 main_~y~0)} is VALID [2022-04-28 03:49:57,826 INFO L272 TraceCheckUtils]: 4: Hoare triple {7906#true} call #t~ret9 := main(); {7906#true} is VALID [2022-04-28 03:49:57,826 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7906#true} {7906#true} #53#return; {7906#true} is VALID [2022-04-28 03:49:57,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {7906#true} assume true; {7906#true} is VALID [2022-04-28 03:49:57,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7906#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(18, 2);call #Ultimate.allocInit(12, 3); {7906#true} is VALID [2022-04-28 03:49:57,826 INFO L272 TraceCheckUtils]: 0: Hoare triple {7906#true} call ULTIMATE.init(); {7906#true} is VALID [2022-04-28 03:49:57,826 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-28 03:49:57,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087383075] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:49:57,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:49:57,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 34 [2022-04-28 03:49:58,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:49:58,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [640144237] [2022-04-28 03:49:58,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [640144237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:49:58,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:49:58,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 03:49:58,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963620025] [2022-04-28 03:49:58,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:49:58,556 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 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 71 [2022-04-28 03:49:58,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:49:58,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:49:58,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:49:58,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 03:49:58,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:49:58,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 03:49:58,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=2033, Unknown=0, NotChecked=0, Total=3306 [2022-04-28 03:49:58,613 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:01,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:01,723 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2022-04-28 03:50:01,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 03:50:01,724 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 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 71 [2022-04-28 03:50:01,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:50:01,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:01,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 101 transitions. [2022-04-28 03:50:01,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 101 transitions. [2022-04-28 03:50:01,814 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-28 03:50:01,816 INFO L225 Difference]: With dead ends: 189 [2022-04-28 03:50:01,816 INFO L226 Difference]: Without dead ends: 122 [2022-04-28 03:50:01,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2649 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2862, Invalid=6258, Unknown=0, NotChecked=0, Total=9120 [2022-04-28 03:50:01,818 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 139 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1291 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:01,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 37 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1291 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:50:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-28 03:50:02,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-04-28 03:50:02,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:02,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:02,015 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:02,015 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:02,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:02,017 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-04-28 03:50:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-04-28 03:50:02,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:02,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:02,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 122 states. [2022-04-28 03:50:02,017 INFO L87 Difference]: Start difference. First operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 122 states. [2022-04-28 03:50:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:02,019 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2022-04-28 03:50:02,020 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-04-28 03:50:02,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:02,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:02,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:02,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:02,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 116 states have internal predecessors, (121), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:02,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-04-28 03:50:02,022 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 71 [2022-04-28 03:50:02,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:02,023 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-04-28 03:50:02,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 40 states have internal predecessors, (67), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:02,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 127 transitions. [2022-04-28 03:50:02,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:02,131 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-04-28 03:50:02,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-28 03:50:02,131 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:02,132 INFO L195 NwaCegarLoop]: trace histogram [24, 23, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:02,149 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-28 03:50:02,339 WARN L477 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-28 03:50:02,339 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:02,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -387359412, now seen corresponding path program 14 times [2022-04-28 03:50:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:02,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2048490436] [2022-04-28 03:50:02,448 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-28 03:50:02,644 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-28 03:50:02,645 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:02,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1246349570, now seen corresponding path program 1 times [2022-04-28 03:50:02,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:02,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578761929] [2022-04-28 03:50:02,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:02,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:02,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {9099#(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(18, 2);call #Ultimate.allocInit(12, 3); {9076#true} is VALID [2022-04-28 03:50:02,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {9076#true} assume true; {9076#true} is VALID [2022-04-28 03:50:02,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9076#true} {9076#true} #53#return; {9076#true} is VALID [2022-04-28 03:50:02,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {9076#true} call ULTIMATE.init(); {9099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:02,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {9099#(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(18, 2);call #Ultimate.allocInit(12, 3); {9076#true} is VALID [2022-04-28 03:50:02,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {9076#true} assume true; {9076#true} is VALID [2022-04-28 03:50:02,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9076#true} {9076#true} #53#return; {9076#true} is VALID [2022-04-28 03:50:02,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {9076#true} call #t~ret9 := main(); {9076#true} is VALID [2022-04-28 03:50:02,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {9076#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9081#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:50:02,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {9081#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [115] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (not (< v_main_~x~0_483 500000)) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9082#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:50:02,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {9082#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [116] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9082#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:50:02,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {9082#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [117] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse0 (<= 500000 v_main_~x~0_485)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= v_main_~x~0_485 v_main_~x~0_484))) (or (and (= (+ v_main_~x~0_485 v_main_~y~0_453) (+ v_main_~x~0_484 v_main_~y~0_454)) (< v_main_~x~0_484 1000001) .cse0 (< v_main_~x~0_485 v_main_~x~0_484)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not (< v_main_~x~0_485 1000000)) (not .cse0)) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9083#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:50:02,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {9083#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [114] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:02,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {9084#(<= 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; {9085#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:02,904 INFO L290 TraceCheckUtils]: 11: Hoare triple {9085#(<= 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; {9086#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:02,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {9086#(<= 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; {9087#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:02,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {9087#(<= 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; {9088#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:02,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {9088#(<= 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; {9089#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:02,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {9089#(<= 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; {9090#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:02,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {9090#(<= 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; {9091#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:02,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {9091#(<= 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; {9092#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:02,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {9092#(<= 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; {9093#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:02,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {9093#(<= 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; {9094#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:02,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {9094#(<= 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; {9095#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:02,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {9095#(<= 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; {9096#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:02,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {9096#(<= 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; {9097#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:02,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {9097#(<= 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; {9098#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:02,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {9098#(<= 499972 main_~y~0)} assume !(~y~0 > 0); {9077#false} is VALID [2022-04-28 03:50:02,910 INFO L272 TraceCheckUtils]: 25: Hoare triple {9077#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {9077#false} is VALID [2022-04-28 03:50:02,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {9077#false} ~cond := #in~cond; {9077#false} is VALID [2022-04-28 03:50:02,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {9077#false} assume 0 == ~cond; {9077#false} is VALID [2022-04-28 03:50:02,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#false} assume !false; {9077#false} is VALID [2022-04-28 03:50:02,910 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:02,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:02,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578761929] [2022-04-28 03:50:02,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578761929] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:02,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851988015] [2022-04-28 03:50:02,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:02,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:02,913 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-28 03:50:02,914 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-28 03:50:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:02,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 03:50:02,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:02,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:03,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {9076#true} call ULTIMATE.init(); {9076#true} is VALID [2022-04-28 03:50:03,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {9076#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(18, 2);call #Ultimate.allocInit(12, 3); {9076#true} is VALID [2022-04-28 03:50:03,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {9076#true} assume true; {9076#true} is VALID [2022-04-28 03:50:03,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9076#true} {9076#true} #53#return; {9076#true} is VALID [2022-04-28 03:50:03,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {9076#true} call #t~ret9 := main(); {9076#true} is VALID [2022-04-28 03:50:03,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {9076#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:03,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {9084#(<= 500000 main_~y~0)} [115] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (not (< v_main_~x~0_483 500000)) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:03,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {9084#(<= 500000 main_~y~0)} [116] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:03,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {9084#(<= 500000 main_~y~0)} [117] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse0 (<= 500000 v_main_~x~0_485)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= v_main_~x~0_485 v_main_~x~0_484))) (or (and (= (+ v_main_~x~0_485 v_main_~y~0_453) (+ v_main_~x~0_484 v_main_~y~0_454)) (< v_main_~x~0_484 1000001) .cse0 (< v_main_~x~0_485 v_main_~x~0_484)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not (< v_main_~x~0_485 1000000)) (not .cse0)) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:03,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {9084#(<= 500000 main_~y~0)} [114] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {9084#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:03,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {9084#(<= 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; {9085#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:03,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {9085#(<= 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; {9086#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:03,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {9086#(<= 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; {9087#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:03,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {9087#(<= 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; {9088#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:03,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {9088#(<= 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; {9089#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:03,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {9089#(<= 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; {9090#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:03,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {9090#(<= 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; {9091#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:03,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {9091#(<= 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; {9092#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:03,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {9092#(<= 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; {9093#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:03,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {9093#(<= 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; {9094#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:03,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {9094#(<= 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; {9095#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:03,289 INFO L290 TraceCheckUtils]: 21: Hoare triple {9095#(<= 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; {9096#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:03,290 INFO L290 TraceCheckUtils]: 22: Hoare triple {9096#(<= 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; {9097#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:03,290 INFO L290 TraceCheckUtils]: 23: Hoare triple {9097#(<= 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; {9098#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:03,290 INFO L290 TraceCheckUtils]: 24: Hoare triple {9098#(<= 499972 main_~y~0)} assume !(~y~0 > 0); {9077#false} is VALID [2022-04-28 03:50:03,290 INFO L272 TraceCheckUtils]: 25: Hoare triple {9077#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {9077#false} is VALID [2022-04-28 03:50:03,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {9077#false} ~cond := #in~cond; {9077#false} is VALID [2022-04-28 03:50:03,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {9077#false} assume 0 == ~cond; {9077#false} is VALID [2022-04-28 03:50:03,291 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#false} assume !false; {9077#false} is VALID [2022-04-28 03:50:03,291 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-28 03:50:03,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:03,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {9077#false} assume !false; {9077#false} is VALID [2022-04-28 03:50:03,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {9077#false} assume 0 == ~cond; {9077#false} is VALID [2022-04-28 03:50:03,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {9077#false} ~cond := #in~cond; {9077#false} is VALID [2022-04-28 03:50:03,885 INFO L272 TraceCheckUtils]: 25: Hoare triple {9077#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {9077#false} is VALID [2022-04-28 03:50:03,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {9199#(< 0 main_~y~0)} assume !(~y~0 > 0); {9077#false} is VALID [2022-04-28 03:50:03,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {9203#(< 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; {9199#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:03,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {9207#(< 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; {9203#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:03,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {9211#(< 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; {9207#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:03,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {9215#(< 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; {9211#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:03,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {9219#(< 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; {9215#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:03,889 INFO L290 TraceCheckUtils]: 18: Hoare triple {9223#(< 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; {9219#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:03,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {9227#(< 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; {9223#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:03,896 INFO L290 TraceCheckUtils]: 16: Hoare triple {9231#(< 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; {9227#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:03,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {9235#(< 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; {9231#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:03,898 INFO L290 TraceCheckUtils]: 14: Hoare triple {9239#(< 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; {9235#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:03,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {9243#(< 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; {9239#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:03,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {9247#(< 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; {9243#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:03,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {9251#(< 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; {9247#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:03,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {9255#(< 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; {9251#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:03,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {9255#(< 28 main_~y~0)} [114] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {9255#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:03,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {9255#(< 28 main_~y~0)} [117] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_95| |v_main_#t~post5_94|)) (.cse0 (<= 500000 v_main_~x~0_485)) (.cse2 (= |v_main_#t~post6_95| |v_main_#t~post6_94|)) (.cse3 (= v_main_~y~0_454 v_main_~y~0_453)) (.cse4 (= v_main_~x~0_485 v_main_~x~0_484))) (or (and (= (+ v_main_~x~0_485 v_main_~y~0_453) (+ v_main_~x~0_484 v_main_~y~0_454)) (< v_main_~x~0_484 1000001) .cse0 (< v_main_~x~0_485 v_main_~x~0_484)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 (or (not (< v_main_~x~0_485 1000000)) (not .cse0)) .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_454, main_#t~post5=|v_main_#t~post5_95|, main_~x~0=v_main_~x~0_485, main_#t~post6=|v_main_#t~post6_95|} OutVars{main_~y~0=v_main_~y~0_453, main_#t~post5=|v_main_#t~post5_94|, main_~x~0=v_main_~x~0_484, main_#t~post6=|v_main_#t~post6_94|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {9255#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:03,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {9255#(< 28 main_~y~0)} [116] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {9255#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:03,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {9255#(< 28 main_~y~0)} [115] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_483 v_main_~x~0_482))) (or (and (< v_main_~x~0_483 v_main_~x~0_482) (< v_main_~x~0_482 500001)) (and (= |v_main_#t~post4_89| |v_main_#t~post4_90|) (not (< v_main_~x~0_483 500000)) .cse0) (and (= |v_main_#t~post4_90| |v_main_#t~post4_89|) .cse0))) InVars {main_~x~0=v_main_~x~0_483, main_#t~post4=|v_main_#t~post4_90|} OutVars{main_~x~0=v_main_~x~0_482, main_#t~post4=|v_main_#t~post4_89|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {9255#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:03,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {9076#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {9255#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:03,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {9076#true} call #t~ret9 := main(); {9076#true} is VALID [2022-04-28 03:50:03,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9076#true} {9076#true} #53#return; {9076#true} is VALID [2022-04-28 03:50:03,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {9076#true} assume true; {9076#true} is VALID [2022-04-28 03:50:03,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {9076#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(18, 2);call #Ultimate.allocInit(12, 3); {9076#true} is VALID [2022-04-28 03:50:03,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {9076#true} call ULTIMATE.init(); {9076#true} is VALID [2022-04-28 03:50:03,904 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-28 03:50:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851988015] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:03,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 36 [2022-04-28 03:50:04,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:04,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2048490436] [2022-04-28 03:50:04,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2048490436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:04,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:04,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 03:50:04,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491479148] [2022-04-28 03:50:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:04,710 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-28 03:50:04,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:04,710 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-28 03:50:04,761 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-28 03:50:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 03:50:04,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:04,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 03:50:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1420, Invalid=2240, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:50:04,763 INFO L87 Difference]: Start difference. First operand 122 states and 127 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-28 03:50:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:07,756 INFO L93 Difference]: Finished difference Result 193 states and 205 transitions. [2022-04-28 03:50:07,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 03:50:07,756 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-28 03:50:07,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:07,757 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-28 03:50:07,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 103 transitions. [2022-04-28 03:50:07,758 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-28 03:50:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 103 transitions. [2022-04-28 03:50:07,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 103 transitions. [2022-04-28 03:50:07,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:07,869 INFO L225 Difference]: With dead ends: 193 [2022-04-28 03:50:07,869 INFO L226 Difference]: Without dead ends: 125 [2022-04-28 03:50:07,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=3193, Invalid=6907, Unknown=0, NotChecked=0, Total=10100 [2022-04-28 03:50:07,871 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 90 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1318 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:07,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 27 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1318 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 03:50:07,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-28 03:50:08,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-04-28 03:50:08,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:08,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:08,113 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:08,113 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:08,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:08,115 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-04-28 03:50:08,115 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-04-28 03:50:08,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:08,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:08,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 125 states. [2022-04-28 03:50:08,116 INFO L87 Difference]: Start difference. First operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 125 states. [2022-04-28 03:50:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:08,118 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2022-04-28 03:50:08,118 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-04-28 03:50:08,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:08,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:08,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:08,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 119 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 130 transitions. [2022-04-28 03:50:08,120 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 130 transitions. Word has length 74 [2022-04-28 03:50:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:08,121 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 130 transitions. [2022-04-28 03:50:08,121 INFO L496 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-28 03:50:08,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 125 states and 130 transitions. [2022-04-28 03:50:08,257 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-28 03:50:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 130 transitions. [2022-04-28 03:50:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 03:50:08,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:08,258 INFO L195 NwaCegarLoop]: trace histogram [25, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:08,287 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-28 03:50:08,459 WARN L477 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-28 03:50:08,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:08,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:08,459 INFO L85 PathProgramCache]: Analyzing trace with hash -2074180302, now seen corresponding path program 15 times [2022-04-28 03:50:08,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:08,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [135367969] [2022-04-28 03:50:08,560 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-28 03:50:08,802 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-28 03:50:08,804 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:08,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1715921953, now seen corresponding path program 1 times [2022-04-28 03:50:08,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:08,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521783347] [2022-04-28 03:50:08,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:08,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {10300#(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(18, 2);call #Ultimate.allocInit(12, 3); {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {10279#true} assume true; {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10279#true} {10279#true} #53#return; {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L272 TraceCheckUtils]: 0: Hoare triple {10279#true} call ULTIMATE.init(); {10300#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:09,028 INFO L290 TraceCheckUtils]: 1: Hoare triple {10300#(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(18, 2);call #Ultimate.allocInit(12, 3); {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L290 TraceCheckUtils]: 2: Hoare triple {10279#true} assume true; {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10279#true} {10279#true} #53#return; {10279#true} is VALID [2022-04-28 03:50:09,028 INFO L272 TraceCheckUtils]: 4: Hoare triple {10279#true} call #t~ret9 := main(); {10279#true} is VALID [2022-04-28 03:50:09,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {10279#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {10284#(<= 500000 main_~y~0)} [119] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_96| |v_main_#t~post4_95|)) (.cse1 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 500001) (< v_main_~x~0_537 v_main_~x~0_536)) (and .cse0 .cse1 (not (< v_main_~x~0_537 500000))))) InVars {main_~x~0=v_main_~x~0_537, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {10284#(<= 500000 main_~y~0)} [120] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {10284#(<= 500000 main_~y~0)} [121] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_539 v_main_~x~0_538)) (.cse1 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse2 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse3 (= v_main_~y~0_514 v_main_~y~0_513)) (.cse4 (<= 500000 v_main_~x~0_539))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_539 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_539 v_main_~y~0_513))) (and .cse4 (< .cse5 (+ v_main_~y~0_514 1000001)) (= (+ v_main_~x~0_538 v_main_~y~0_514) .cse5) (< v_main_~y~0_514 v_main_~y~0_513))))) InVars {main_~y~0=v_main_~y~0_514, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_513, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {10284#(<= 500000 main_~y~0)} [118] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {10284#(<= 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; {10285#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:09,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {10285#(<= 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; {10286#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:09,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {10286#(<= 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; {10287#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:09,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {10287#(<= 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; {10288#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:09,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {10288#(<= 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; {10289#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:09,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {10289#(<= 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; {10290#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:09,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {10290#(<= 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; {10291#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:09,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {10291#(<= 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; {10292#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:09,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {10292#(<= 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; {10293#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:09,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {10293#(<= 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; {10294#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:09,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {10294#(<= 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; {10295#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:09,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {10295#(<= 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; {10296#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:09,037 INFO L290 TraceCheckUtils]: 22: Hoare triple {10296#(<= 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; {10297#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:09,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {10297#(<= 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; {10298#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:09,038 INFO L290 TraceCheckUtils]: 24: Hoare triple {10298#(<= 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; {10299#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:09,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {10299#(<= 499970 main_~y~0)} assume !(~y~0 > 0); {10280#false} is VALID [2022-04-28 03:50:09,038 INFO L272 TraceCheckUtils]: 26: Hoare triple {10280#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {10280#false} is VALID [2022-04-28 03:50:09,038 INFO L290 TraceCheckUtils]: 27: Hoare triple {10280#false} ~cond := #in~cond; {10280#false} is VALID [2022-04-28 03:50:09,038 INFO L290 TraceCheckUtils]: 28: Hoare triple {10280#false} assume 0 == ~cond; {10280#false} is VALID [2022-04-28 03:50:09,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {10280#false} assume !false; {10280#false} is VALID [2022-04-28 03:50:09,039 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-28 03:50:09,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521783347] [2022-04-28 03:50:09,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521783347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:09,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895625167] [2022-04-28 03:50:09,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:09,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:09,039 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:09,040 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-28 03:50:09,041 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-28 03:50:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 03:50:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:09,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:09,463 INFO L272 TraceCheckUtils]: 0: Hoare triple {10279#true} call ULTIMATE.init(); {10279#true} is VALID [2022-04-28 03:50:09,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {10279#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(18, 2);call #Ultimate.allocInit(12, 3); {10279#true} is VALID [2022-04-28 03:50:09,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {10279#true} assume true; {10279#true} is VALID [2022-04-28 03:50:09,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10279#true} {10279#true} #53#return; {10279#true} is VALID [2022-04-28 03:50:09,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {10279#true} call #t~ret9 := main(); {10279#true} is VALID [2022-04-28 03:50:09,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {10279#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {10284#(<= 500000 main_~y~0)} [119] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_96| |v_main_#t~post4_95|)) (.cse1 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 500001) (< v_main_~x~0_537 v_main_~x~0_536)) (and .cse0 .cse1 (not (< v_main_~x~0_537 500000))))) InVars {main_~x~0=v_main_~x~0_537, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,465 INFO L290 TraceCheckUtils]: 7: Hoare triple {10284#(<= 500000 main_~y~0)} [120] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {10284#(<= 500000 main_~y~0)} [121] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_539 v_main_~x~0_538)) (.cse1 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse2 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse3 (= v_main_~y~0_514 v_main_~y~0_513)) (.cse4 (<= 500000 v_main_~x~0_539))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_539 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_539 v_main_~y~0_513))) (and .cse4 (< .cse5 (+ v_main_~y~0_514 1000001)) (= (+ v_main_~x~0_538 v_main_~y~0_514) .cse5) (< v_main_~y~0_514 v_main_~y~0_513))))) InVars {main_~y~0=v_main_~y~0_514, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_513, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {10284#(<= 500000 main_~y~0)} [118] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {10284#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:09,466 INFO L290 TraceCheckUtils]: 10: Hoare triple {10284#(<= 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; {10285#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:09,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {10285#(<= 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; {10286#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:09,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {10286#(<= 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; {10287#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:09,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {10287#(<= 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; {10288#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:09,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {10288#(<= 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; {10289#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:09,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {10289#(<= 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; {10290#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:09,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {10290#(<= 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; {10291#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:09,470 INFO L290 TraceCheckUtils]: 17: Hoare triple {10291#(<= 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; {10292#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:09,470 INFO L290 TraceCheckUtils]: 18: Hoare triple {10292#(<= 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; {10293#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:09,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {10293#(<= 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; {10294#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:09,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {10294#(<= 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; {10295#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:09,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {10295#(<= 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; {10296#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:09,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {10296#(<= 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; {10297#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:09,472 INFO L290 TraceCheckUtils]: 23: Hoare triple {10297#(<= 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; {10298#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:09,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {10298#(<= 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; {10299#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:09,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {10299#(<= 499970 main_~y~0)} assume !(~y~0 > 0); {10280#false} is VALID [2022-04-28 03:50:09,473 INFO L272 TraceCheckUtils]: 26: Hoare triple {10280#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {10280#false} is VALID [2022-04-28 03:50:09,473 INFO L290 TraceCheckUtils]: 27: Hoare triple {10280#false} ~cond := #in~cond; {10280#false} is VALID [2022-04-28 03:50:09,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {10280#false} assume 0 == ~cond; {10280#false} is VALID [2022-04-28 03:50:09,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {10280#false} assume !false; {10280#false} is VALID [2022-04-28 03:50:09,474 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-28 03:50:09,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:10,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {10280#false} assume !false; {10280#false} is VALID [2022-04-28 03:50:10,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {10280#false} assume 0 == ~cond; {10280#false} is VALID [2022-04-28 03:50:10,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {10280#false} ~cond := #in~cond; {10280#false} is VALID [2022-04-28 03:50:10,101 INFO L272 TraceCheckUtils]: 26: Hoare triple {10280#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {10280#false} is VALID [2022-04-28 03:50:10,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {10403#(< 0 main_~y~0)} assume !(~y~0 > 0); {10280#false} is VALID [2022-04-28 03:50:10,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {10407#(< 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; {10403#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:10,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {10411#(< 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; {10407#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:10,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {10415#(< 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; {10411#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:10,103 INFO L290 TraceCheckUtils]: 21: Hoare triple {10419#(< 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; {10415#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:10,103 INFO L290 TraceCheckUtils]: 20: Hoare triple {10423#(< 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; {10419#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:10,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {10427#(< 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; {10423#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:10,104 INFO L290 TraceCheckUtils]: 18: Hoare triple {10431#(< 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; {10427#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:10,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {10435#(< 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; {10431#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:10,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {10439#(< 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; {10435#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:10,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {10443#(< 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; {10439#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:10,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {10447#(< 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; {10443#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:10,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {10451#(< 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; {10447#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:10,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {10455#(< 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; {10451#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:10,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {10459#(< 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; {10455#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:10,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {10463#(< 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; {10459#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:10,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {10463#(< 30 main_~y~0)} [118] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {10463#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:10,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {10463#(< 30 main_~y~0)} [121] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_539 v_main_~x~0_538)) (.cse1 (= |v_main_#t~post6_102| |v_main_#t~post6_101|)) (.cse2 (= |v_main_#t~post5_102| |v_main_#t~post5_101|)) (.cse3 (= v_main_~y~0_514 v_main_~y~0_513)) (.cse4 (<= 500000 v_main_~x~0_539))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_539 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_539 v_main_~y~0_513))) (and .cse4 (< .cse5 (+ v_main_~y~0_514 1000001)) (= (+ v_main_~x~0_538 v_main_~y~0_514) .cse5) (< v_main_~y~0_514 v_main_~y~0_513))))) InVars {main_~y~0=v_main_~y~0_514, main_#t~post5=|v_main_#t~post5_102|, main_~x~0=v_main_~x~0_539, main_#t~post6=|v_main_#t~post6_102|} OutVars{main_~y~0=v_main_~y~0_513, main_#t~post5=|v_main_#t~post5_101|, main_~x~0=v_main_~x~0_538, main_#t~post6=|v_main_#t~post6_101|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {10463#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:10,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {10463#(< 30 main_~y~0)} [120] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10463#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:10,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {10463#(< 30 main_~y~0)} [119] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_96| |v_main_#t~post4_95|)) (.cse1 (= v_main_~x~0_537 v_main_~x~0_536))) (or (and .cse0 .cse1) (and (< v_main_~x~0_536 500001) (< v_main_~x~0_537 v_main_~x~0_536)) (and .cse0 .cse1 (not (< v_main_~x~0_537 500000))))) InVars {main_~x~0=v_main_~x~0_537, main_#t~post4=|v_main_#t~post4_96|} OutVars{main_~x~0=v_main_~x~0_536, main_#t~post4=|v_main_#t~post4_95|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {10463#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:10,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {10279#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {10463#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:10,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {10279#true} call #t~ret9 := main(); {10279#true} is VALID [2022-04-28 03:50:10,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10279#true} {10279#true} #53#return; {10279#true} is VALID [2022-04-28 03:50:10,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {10279#true} assume true; {10279#true} is VALID [2022-04-28 03:50:10,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {10279#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(18, 2);call #Ultimate.allocInit(12, 3); {10279#true} is VALID [2022-04-28 03:50:10,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {10279#true} call ULTIMATE.init(); {10279#true} is VALID [2022-04-28 03:50:10,111 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-28 03:50:10,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895625167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:10,111 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:10,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 35 [2022-04-28 03:50:10,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:10,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [135367969] [2022-04-28 03:50:10,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [135367969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:10,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:10,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 03:50:10,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318022113] [2022-04-28 03:50:10,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:10,926 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 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 77 [2022-04-28 03:50:10,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:10,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:10,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:10,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 03:50:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:10,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 03:50:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1472, Invalid=2188, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 03:50:10,993 INFO L87 Difference]: Start difference. First operand 125 states and 130 transitions. Second operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:14,394 INFO L93 Difference]: Finished difference Result 203 states and 221 transitions. [2022-04-28 03:50:14,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 03:50:14,394 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 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 77 [2022-04-28 03:50:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-04-28 03:50:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 111 transitions. [2022-04-28 03:50:14,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 111 transitions. [2022-04-28 03:50:14,512 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-28 03:50:14,514 INFO L225 Difference]: With dead ends: 203 [2022-04-28 03:50:14,514 INFO L226 Difference]: Without dead ends: 134 [2022-04-28 03:50:14,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2996 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3434, Invalid=7072, Unknown=0, NotChecked=0, Total=10506 [2022-04-28 03:50:14,516 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 148 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 169 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 169 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:14,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 72 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [169 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 03:50:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-04-28 03:50:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 86. [2022-04-28 03:50:14,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:14,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:14,656 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:14,656 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:14,658 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-28 03:50:14,658 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-28 03:50:14,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:14,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:14,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 134 states. [2022-04-28 03:50:14,659 INFO L87 Difference]: Start difference. First operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 134 states. [2022-04-28 03:50:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:14,661 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2022-04-28 03:50:14,661 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-28 03:50:14,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:14,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:14,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:14,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 80 states have internal predecessors, (84), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-28 03:50:14,663 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 77 [2022-04-28 03:50:14,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:14,663 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-28 03:50:14,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.6222222222222222) internal successors, (73), 44 states have internal predecessors, (73), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:14,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-28 03:50:14,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:14,757 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 03:50:14,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-28 03:50:14,758 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:14,758 INFO L195 NwaCegarLoop]: trace histogram [27, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:14,774 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-28 03:50:14,958 WARN L477 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-28 03:50:14,958 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:14,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1819431355, now seen corresponding path program 16 times [2022-04-28 03:50:14,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:14,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436326538] [2022-04-28 03:50:15,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-28 03:50:15,276 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-28 03:50:15,278 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:15,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1471509790, now seen corresponding path program 1 times [2022-04-28 03:50:15,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:15,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189303256] [2022-04-28 03:50:15,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:15,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {11474#(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(18, 2);call #Ultimate.allocInit(12, 3); {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {11452#true} assume true; {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11452#true} {11452#true} #53#return; {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L272 TraceCheckUtils]: 0: Hoare triple {11452#true} call ULTIMATE.init(); {11474#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:15,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {11474#(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(18, 2);call #Ultimate.allocInit(12, 3); {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {11452#true} assume true; {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11452#true} {11452#true} #53#return; {11452#true} is VALID [2022-04-28 03:50:15,511 INFO L272 TraceCheckUtils]: 4: Hoare triple {11452#true} call #t~ret9 := main(); {11452#true} is VALID [2022-04-28 03:50:15,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {11452#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {11457#(<= 500000 main_~y~0)} [123] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_102| |v_main_#t~post4_101|)) (.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_102|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_101|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {11457#(<= 500000 main_~y~0)} [124] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,513 INFO L290 TraceCheckUtils]: 8: Hoare triple {11457#(<= 500000 main_~y~0)} [125] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_595)) (.cse2 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse3 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse4 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse5 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (let ((.cse1 (+ v_main_~x~0_595 v_main_~y~0_576))) (and .cse0 (< .cse1 (+ v_main_~y~0_577 1000001)) (= (+ v_main_~x~0_594 v_main_~y~0_577) .cse1) (< v_main_~y~0_577 v_main_~y~0_576))) (and .cse2 .cse3 (or (not (< v_main_~x~0_595 1000000)) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_577, 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_576, 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] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,513 INFO L290 TraceCheckUtils]: 9: Hoare triple {11457#(<= 500000 main_~y~0)} [122] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {11457#(<= 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; {11458#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:15,514 INFO L290 TraceCheckUtils]: 11: Hoare triple {11458#(<= 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; {11459#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:15,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {11459#(<= 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; {11460#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:15,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {11460#(<= 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; {11461#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:15,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {11461#(<= 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; {11462#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:15,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {11462#(<= 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; {11463#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:15,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {11463#(<= 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; {11464#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:15,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {11464#(<= 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; {11465#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:15,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {11465#(<= 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; {11466#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:15,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {11466#(<= 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; {11467#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:15,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {11467#(<= 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; {11468#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:15,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {11468#(<= 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; {11469#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:15,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {11469#(<= 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; {11470#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:15,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {11470#(<= 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; {11471#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:15,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {11471#(<= 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; {11472#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:15,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {11472#(<= 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; {11473#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:15,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {11473#(<= 499968 main_~y~0)} assume !(~y~0 > 0); {11453#false} is VALID [2022-04-28 03:50:15,521 INFO L272 TraceCheckUtils]: 27: Hoare triple {11453#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {11453#false} is VALID [2022-04-28 03:50:15,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {11453#false} ~cond := #in~cond; {11453#false} is VALID [2022-04-28 03:50:15,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {11453#false} assume 0 == ~cond; {11453#false} is VALID [2022-04-28 03:50:15,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {11453#false} assume !false; {11453#false} is VALID [2022-04-28 03:50:15,522 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-28 03:50:15,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:15,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189303256] [2022-04-28 03:50:15,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189303256] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:15,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240152528] [2022-04-28 03:50:15,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:15,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:15,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:15,523 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-28 03:50:15,524 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-28 03:50:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 03:50:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:15,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:15,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {11452#true} call ULTIMATE.init(); {11452#true} is VALID [2022-04-28 03:50:15,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {11452#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(18, 2);call #Ultimate.allocInit(12, 3); {11452#true} is VALID [2022-04-28 03:50:15,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {11452#true} assume true; {11452#true} is VALID [2022-04-28 03:50:15,892 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11452#true} {11452#true} #53#return; {11452#true} is VALID [2022-04-28 03:50:15,892 INFO L272 TraceCheckUtils]: 4: Hoare triple {11452#true} call #t~ret9 := main(); {11452#true} is VALID [2022-04-28 03:50:15,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {11452#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {11457#(<= 500000 main_~y~0)} [123] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_102| |v_main_#t~post4_101|)) (.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_102|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_101|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {11457#(<= 500000 main_~y~0)} [124] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {11457#(<= 500000 main_~y~0)} [125] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_595)) (.cse2 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse3 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse4 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse5 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (let ((.cse1 (+ v_main_~x~0_595 v_main_~y~0_576))) (and .cse0 (< .cse1 (+ v_main_~y~0_577 1000001)) (= (+ v_main_~x~0_594 v_main_~y~0_577) .cse1) (< v_main_~y~0_577 v_main_~y~0_576))) (and .cse2 .cse3 (or (not (< v_main_~x~0_595 1000000)) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_577, 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_576, 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] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {11457#(<= 500000 main_~y~0)} [122] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {11457#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:15,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {11457#(<= 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; {11458#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:15,895 INFO L290 TraceCheckUtils]: 11: Hoare triple {11458#(<= 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; {11459#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:15,895 INFO L290 TraceCheckUtils]: 12: Hoare triple {11459#(<= 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; {11460#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:15,896 INFO L290 TraceCheckUtils]: 13: Hoare triple {11460#(<= 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; {11461#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:15,896 INFO L290 TraceCheckUtils]: 14: Hoare triple {11461#(<= 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; {11462#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:15,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {11462#(<= 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; {11463#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:15,897 INFO L290 TraceCheckUtils]: 16: Hoare triple {11463#(<= 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; {11464#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:15,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {11464#(<= 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; {11465#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:15,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {11465#(<= 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; {11466#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:15,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {11466#(<= 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; {11467#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:15,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {11467#(<= 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; {11468#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:15,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {11468#(<= 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; {11469#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:15,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {11469#(<= 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; {11470#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:15,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {11470#(<= 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; {11471#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:15,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {11471#(<= 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; {11472#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:15,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {11472#(<= 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; {11473#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:15,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {11473#(<= 499968 main_~y~0)} assume !(~y~0 > 0); {11453#false} is VALID [2022-04-28 03:50:15,902 INFO L272 TraceCheckUtils]: 27: Hoare triple {11453#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {11453#false} is VALID [2022-04-28 03:50:15,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {11453#false} ~cond := #in~cond; {11453#false} is VALID [2022-04-28 03:50:15,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {11453#false} assume 0 == ~cond; {11453#false} is VALID [2022-04-28 03:50:15,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {11453#false} assume !false; {11453#false} is VALID [2022-04-28 03:50:15,902 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-28 03:50:15,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:16,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {11453#false} assume !false; {11453#false} is VALID [2022-04-28 03:50:16,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {11453#false} assume 0 == ~cond; {11453#false} is VALID [2022-04-28 03:50:16,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {11453#false} ~cond := #in~cond; {11453#false} is VALID [2022-04-28 03:50:16,574 INFO L272 TraceCheckUtils]: 27: Hoare triple {11453#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {11453#false} is VALID [2022-04-28 03:50:16,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {11580#(< 0 main_~y~0)} assume !(~y~0 > 0); {11453#false} is VALID [2022-04-28 03:50:16,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {11584#(< 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; {11580#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:16,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {11588#(< 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; {11584#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:16,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {11592#(< 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; {11588#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:16,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {11596#(< 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; {11592#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:16,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {11600#(< 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; {11596#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:16,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {11604#(< 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; {11600#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:16,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {11608#(< 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; {11604#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:16,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {11612#(< 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; {11608#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:16,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {11616#(< 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; {11612#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:16,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {11620#(< 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; {11616#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:16,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {11624#(< 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; {11620#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:16,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {11628#(< 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; {11624#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:16,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {11632#(< 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; {11628#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:16,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {11636#(< 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; {11632#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:16,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {11640#(< 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; {11636#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:16,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {11644#(< 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; {11640#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:16,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {11644#(< 32 main_~y~0)} [122] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {11644#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:16,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {11644#(< 32 main_~y~0)} [125] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_595)) (.cse2 (= v_main_~y~0_577 v_main_~y~0_576)) (.cse3 (= v_main_~x~0_595 v_main_~x~0_594)) (.cse4 (= |v_main_#t~post6_109| |v_main_#t~post6_108|)) (.cse5 (= |v_main_#t~post5_109| |v_main_#t~post5_108|))) (or (let ((.cse1 (+ v_main_~x~0_595 v_main_~y~0_576))) (and .cse0 (< .cse1 (+ v_main_~y~0_577 1000001)) (= (+ v_main_~x~0_594 v_main_~y~0_577) .cse1) (< v_main_~y~0_577 v_main_~y~0_576))) (and .cse2 .cse3 (or (not (< v_main_~x~0_595 1000000)) (not .cse0)) .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_577, 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_576, 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] {11644#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:16,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {11644#(< 32 main_~y~0)} [124] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {11644#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:16,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {11644#(< 32 main_~y~0)} [123] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_102| |v_main_#t~post4_101|)) (.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_102|} OutVars{main_~x~0=v_main_~x~0_592, main_#t~post4=|v_main_#t~post4_101|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {11644#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:16,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {11452#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {11644#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:16,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {11452#true} call #t~ret9 := main(); {11452#true} is VALID [2022-04-28 03:50:16,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11452#true} {11452#true} #53#return; {11452#true} is VALID [2022-04-28 03:50:16,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {11452#true} assume true; {11452#true} is VALID [2022-04-28 03:50:16,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {11452#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(18, 2);call #Ultimate.allocInit(12, 3); {11452#true} is VALID [2022-04-28 03:50:16,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {11452#true} call ULTIMATE.init(); {11452#true} is VALID [2022-04-28 03:50:16,588 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-28 03:50:16,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240152528] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:16,588 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:16,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 37 [2022-04-28 03:50:17,489 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:17,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436326538] [2022-04-28 03:50:17,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436326538] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:17,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:17,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-28 03:50:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490590576] [2022-04-28 03:50:17,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:17,489 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 03:50:17,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:17,490 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:17,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:17,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-28 03:50:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:17,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-28 03:50:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1667, Invalid=2493, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 03:50:17,556 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:21,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:21,380 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-04-28 03:50:21,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 03:50:21,381 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 82 [2022-04-28 03:50:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:21,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:21,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 112 transitions. [2022-04-28 03:50:21,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 112 transitions. [2022-04-28 03:50:21,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 112 transitions. [2022-04-28 03:50:21,501 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-28 03:50:21,503 INFO L225 Difference]: With dead ends: 169 [2022-04-28 03:50:21,503 INFO L226 Difference]: Without dead ends: 91 [2022-04-28 03:50:21,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3428 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3890, Invalid=8100, Unknown=0, NotChecked=0, Total=11990 [2022-04-28 03:50:21,505 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 249 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 295 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 295 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:21,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 47 Invalid, 1917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [295 Valid, 1622 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 03:50:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-04-28 03:50:21,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-04-28 03:50:21,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:21,660 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:21,661 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:21,661 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:21,662 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-28 03:50:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-28 03:50:21,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:21,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:21,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-04-28 03:50:21,663 INFO L87 Difference]: Start difference. First operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-04-28 03:50:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:21,664 INFO L93 Difference]: Finished difference Result 91 states and 95 transitions. [2022-04-28 03:50:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-28 03:50:21,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:21,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:21,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:21,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 84 states have (on average 1.0595238095238095) internal successors, (89), 85 states have internal predecessors, (89), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-04-28 03:50:21,666 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 82 [2022-04-28 03:50:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:21,666 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-04-28 03:50:21,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.625) internal successors, (78), 47 states have internal predecessors, (78), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:21,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 95 transitions. [2022-04-28 03:50:21,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:21,765 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-04-28 03:50:21,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 03:50:21,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:21,766 INFO L195 NwaCegarLoop]: trace histogram [29, 28, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:21,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:21,966 WARN L477 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-28 03:50:21,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:21,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:21,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1124956926, now seen corresponding path program 17 times [2022-04-28 03:50:21,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:21,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [557591964] [2022-04-28 03:50:26,044 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:26,102 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-28 03:50:26,309 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-28 03:50:26,310 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:26,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1811276223, now seen corresponding path program 1 times [2022-04-28 03:50:26,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:26,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634787286] [2022-04-28 03:50:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:26,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {12520#(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(18, 2);call #Ultimate.allocInit(12, 3); {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {12497#true} assume true; {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12497#true} {12497#true} #53#return; {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {12497#true} call ULTIMATE.init(); {12520#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:26,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {12520#(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(18, 2);call #Ultimate.allocInit(12, 3); {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {12497#true} assume true; {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12497#true} {12497#true} #53#return; {12497#true} is VALID [2022-04-28 03:50:26,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {12497#true} call #t~ret9 := main(); {12497#true} is VALID [2022-04-28 03:50:26,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {12497#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:26,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {12502#(<= 500000 main_~y~0)} [127] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_108| |v_main_#t~post4_107|)) (.cse1 (= v_main_~x~0_652 v_main_~x~0_651))) (or (and .cse0 .cse1) (and (< v_main_~x~0_652 v_main_~x~0_651) (< v_main_~x~0_651 500001)) (and (not (< v_main_~x~0_652 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_108|} OutVars{main_~x~0=v_main_~x~0_651, main_#t~post4=|v_main_#t~post4_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:26,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {12502#(<= 500000 main_~y~0)} [128] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:26,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {12502#(<= 500000 main_~y~0)} [129] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse3 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse4 (= v_main_~x~0_654 v_main_~x~0_653)) (.cse1 (<= 500000 v_main_~x~0_654))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_654 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_653 v_main_~y~0_644) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_653 1000001) (< v_main_~x~0_654 v_main_~x~0_653) .cse1))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_653, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:26,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {12502#(<= 500000 main_~y~0)} [126] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:26,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {12502#(<= 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; {12503#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:26,584 INFO L290 TraceCheckUtils]: 11: Hoare triple {12503#(<= 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; {12504#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:26,584 INFO L290 TraceCheckUtils]: 12: Hoare triple {12504#(<= 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; {12505#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:26,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {12505#(<= 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; {12506#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:26,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {12506#(<= 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; {12507#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:26,586 INFO L290 TraceCheckUtils]: 15: Hoare triple {12507#(<= 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; {12508#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:26,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {12508#(<= 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; {12509#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:26,586 INFO L290 TraceCheckUtils]: 17: Hoare triple {12509#(<= 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; {12510#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:26,587 INFO L290 TraceCheckUtils]: 18: Hoare triple {12510#(<= 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; {12511#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:26,587 INFO L290 TraceCheckUtils]: 19: Hoare triple {12511#(<= 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; {12512#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:26,588 INFO L290 TraceCheckUtils]: 20: Hoare triple {12512#(<= 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; {12513#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:26,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {12513#(<= 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; {12514#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:26,589 INFO L290 TraceCheckUtils]: 22: Hoare triple {12514#(<= 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; {12515#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:26,589 INFO L290 TraceCheckUtils]: 23: Hoare triple {12515#(<= 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; {12516#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:26,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {12516#(<= 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; {12517#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:26,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {12517#(<= 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; {12518#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:26,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {12518#(<= 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; {12519#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:26,591 INFO L290 TraceCheckUtils]: 27: Hoare triple {12519#(<= 499966 main_~y~0)} assume !(~y~0 > 0); {12498#false} is VALID [2022-04-28 03:50:26,591 INFO L272 TraceCheckUtils]: 28: Hoare triple {12498#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {12498#false} is VALID [2022-04-28 03:50:26,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {12498#false} ~cond := #in~cond; {12498#false} is VALID [2022-04-28 03:50:26,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#false} assume 0 == ~cond; {12498#false} is VALID [2022-04-28 03:50:26,591 INFO L290 TraceCheckUtils]: 31: Hoare triple {12498#false} assume !false; {12498#false} is VALID [2022-04-28 03:50:26,592 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-28 03:50:26,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:26,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634787286] [2022-04-28 03:50:26,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634787286] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:26,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471075639] [2022-04-28 03:50:26,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:26,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:26,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:26,593 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-28 03:50:26,594 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-28 03:50:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 03:50:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:26,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:27,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {12497#true} call ULTIMATE.init(); {12497#true} is VALID [2022-04-28 03:50:27,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {12497#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(18, 2);call #Ultimate.allocInit(12, 3); {12497#true} is VALID [2022-04-28 03:50:27,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {12497#true} assume true; {12497#true} is VALID [2022-04-28 03:50:27,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12497#true} {12497#true} #53#return; {12497#true} is VALID [2022-04-28 03:50:27,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {12497#true} call #t~ret9 := main(); {12497#true} is VALID [2022-04-28 03:50:27,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {12497#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:27,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {12502#(<= 500000 main_~y~0)} [127] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_108| |v_main_#t~post4_107|)) (.cse1 (= v_main_~x~0_652 v_main_~x~0_651))) (or (and .cse0 .cse1) (and (< v_main_~x~0_652 v_main_~x~0_651) (< v_main_~x~0_651 500001)) (and (not (< v_main_~x~0_652 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_108|} OutVars{main_~x~0=v_main_~x~0_651, main_#t~post4=|v_main_#t~post4_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:27,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {12502#(<= 500000 main_~y~0)} [128] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:27,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {12502#(<= 500000 main_~y~0)} [129] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse3 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse4 (= v_main_~x~0_654 v_main_~x~0_653)) (.cse1 (<= 500000 v_main_~x~0_654))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_654 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_653 v_main_~y~0_644) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_653 1000001) (< v_main_~x~0_654 v_main_~x~0_653) .cse1))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_653, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:27,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {12502#(<= 500000 main_~y~0)} [126] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {12502#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:27,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {12502#(<= 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; {12503#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:27,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {12503#(<= 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; {12504#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:27,034 INFO L290 TraceCheckUtils]: 12: Hoare triple {12504#(<= 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; {12505#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:27,035 INFO L290 TraceCheckUtils]: 13: Hoare triple {12505#(<= 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; {12506#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:27,035 INFO L290 TraceCheckUtils]: 14: Hoare triple {12506#(<= 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; {12507#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:27,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {12507#(<= 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; {12508#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:27,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {12508#(<= 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; {12509#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:27,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {12509#(<= 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; {12510#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:27,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {12510#(<= 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; {12511#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:27,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {12511#(<= 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; {12512#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:27,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {12512#(<= 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; {12513#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:27,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {12513#(<= 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; {12514#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:27,040 INFO L290 TraceCheckUtils]: 22: Hoare triple {12514#(<= 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; {12515#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:27,040 INFO L290 TraceCheckUtils]: 23: Hoare triple {12515#(<= 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; {12516#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:27,040 INFO L290 TraceCheckUtils]: 24: Hoare triple {12516#(<= 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; {12517#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:27,041 INFO L290 TraceCheckUtils]: 25: Hoare triple {12517#(<= 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; {12518#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:27,041 INFO L290 TraceCheckUtils]: 26: Hoare triple {12518#(<= 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; {12519#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:27,042 INFO L290 TraceCheckUtils]: 27: Hoare triple {12519#(<= 499966 main_~y~0)} assume !(~y~0 > 0); {12498#false} is VALID [2022-04-28 03:50:27,042 INFO L272 TraceCheckUtils]: 28: Hoare triple {12498#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {12498#false} is VALID [2022-04-28 03:50:27,042 INFO L290 TraceCheckUtils]: 29: Hoare triple {12498#false} ~cond := #in~cond; {12498#false} is VALID [2022-04-28 03:50:27,042 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#false} assume 0 == ~cond; {12498#false} is VALID [2022-04-28 03:50:27,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {12498#false} assume !false; {12498#false} is VALID [2022-04-28 03:50:27,042 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-28 03:50:27,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:27,725 INFO L290 TraceCheckUtils]: 31: Hoare triple {12498#false} assume !false; {12498#false} is VALID [2022-04-28 03:50:27,725 INFO L290 TraceCheckUtils]: 30: Hoare triple {12498#false} assume 0 == ~cond; {12498#false} is VALID [2022-04-28 03:50:27,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {12498#false} ~cond := #in~cond; {12498#false} is VALID [2022-04-28 03:50:27,725 INFO L272 TraceCheckUtils]: 28: Hoare triple {12498#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {12498#false} is VALID [2022-04-28 03:50:27,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {12629#(< 0 main_~y~0)} assume !(~y~0 > 0); {12498#false} is VALID [2022-04-28 03:50:27,726 INFO L290 TraceCheckUtils]: 26: Hoare triple {12633#(< 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; {12629#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:27,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {12637#(< 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; {12633#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:27,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {12641#(< 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; {12637#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:27,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {12645#(< 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; {12641#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:27,728 INFO L290 TraceCheckUtils]: 22: Hoare triple {12649#(< 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; {12645#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:27,728 INFO L290 TraceCheckUtils]: 21: Hoare triple {12653#(< 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; {12649#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:27,729 INFO L290 TraceCheckUtils]: 20: Hoare triple {12657#(< 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; {12653#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:27,729 INFO L290 TraceCheckUtils]: 19: Hoare triple {12661#(< 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; {12657#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:27,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {12665#(< 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; {12661#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:27,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {12669#(< 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; {12665#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:27,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {12673#(< 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; {12669#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:27,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {12677#(< 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; {12673#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:27,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {12681#(< 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; {12677#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:27,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {12685#(< 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; {12681#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:27,732 INFO L290 TraceCheckUtils]: 12: Hoare triple {12689#(< 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; {12685#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:27,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {12693#(< 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; {12689#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:27,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {12697#(< 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; {12693#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:27,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {12697#(< 34 main_~y~0)} [126] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {12697#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:27,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {12697#(< 34 main_~y~0)} [129] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_116| |v_main_#t~post5_115|)) (.cse2 (= |v_main_#t~post6_116| |v_main_#t~post6_115|)) (.cse3 (= v_main_~y~0_644 v_main_~y~0_643)) (.cse4 (= v_main_~x~0_654 v_main_~x~0_653)) (.cse1 (<= 500000 v_main_~x~0_654))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_654 1000000))) .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_653 v_main_~y~0_644) (+ v_main_~x~0_654 v_main_~y~0_643)) (< v_main_~x~0_653 1000001) (< v_main_~x~0_654 v_main_~x~0_653) .cse1))) InVars {main_~y~0=v_main_~y~0_644, main_#t~post5=|v_main_#t~post5_116|, main_~x~0=v_main_~x~0_654, main_#t~post6=|v_main_#t~post6_116|} OutVars{main_~y~0=v_main_~y~0_643, main_#t~post5=|v_main_#t~post5_115|, main_~x~0=v_main_~x~0_653, main_#t~post6=|v_main_#t~post6_115|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {12697#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:27,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {12697#(< 34 main_~y~0)} [128] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12697#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:27,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {12697#(< 34 main_~y~0)} [127] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_108| |v_main_#t~post4_107|)) (.cse1 (= v_main_~x~0_652 v_main_~x~0_651))) (or (and .cse0 .cse1) (and (< v_main_~x~0_652 v_main_~x~0_651) (< v_main_~x~0_651 500001)) (and (not (< v_main_~x~0_652 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_652, main_#t~post4=|v_main_#t~post4_108|} OutVars{main_~x~0=v_main_~x~0_651, main_#t~post4=|v_main_#t~post4_107|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {12697#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:27,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {12497#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {12697#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:27,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {12497#true} call #t~ret9 := main(); {12497#true} is VALID [2022-04-28 03:50:27,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12497#true} {12497#true} #53#return; {12497#true} is VALID [2022-04-28 03:50:27,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {12497#true} assume true; {12497#true} is VALID [2022-04-28 03:50:27,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {12497#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(18, 2);call #Ultimate.allocInit(12, 3); {12497#true} is VALID [2022-04-28 03:50:27,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {12497#true} call ULTIMATE.init(); {12497#true} is VALID [2022-04-28 03:50:27,736 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-28 03:50:27,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471075639] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:27,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:27,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 39 [2022-04-28 03:50:28,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:28,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [557591964] [2022-04-28 03:50:28,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [557591964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:28,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:28,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-28 03:50:28,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644025594] [2022-04-28 03:50:28,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:28,691 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 03:50:28,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:28,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:28,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:28,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-28 03:50:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-28 03:50:28,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1874, Invalid=2818, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 03:50:28,755 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:32,654 INFO L93 Difference]: Finished difference Result 179 states and 192 transitions. [2022-04-28 03:50:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-28 03:50:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 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 87 [2022-04-28 03:50:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:32,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 117 transitions. [2022-04-28 03:50:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:32,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 117 transitions. [2022-04-28 03:50:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 117 transitions. [2022-04-28 03:50:32,750 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-28 03:50:32,751 INFO L225 Difference]: With dead ends: 179 [2022-04-28 03:50:32,751 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 03:50:32,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3889 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4374, Invalid=9198, Unknown=0, NotChecked=0, Total=13572 [2022-04-28 03:50:32,753 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 73 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1818 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:32,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 47 Invalid, 1909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1818 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 03:50:32,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 03:50:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-04-28 03:50:32,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:32,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:32,897 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:32,897 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:32,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:32,899 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:50:32,899 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:50:32,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:32,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:32,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-28 03:50:32,899 INFO L87 Difference]: Start difference. First operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 96 states. [2022-04-28 03:50:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:32,901 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 03:50:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:50:32,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:32,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:32,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:32,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 90 states have internal predecessors, (94), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-28 03:50:32,903 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 87 [2022-04-28 03:50:32,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:32,903 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-28 03:50:32,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 1.6274509803921569) internal successors, (83), 50 states have internal predecessors, (83), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:32,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-28 03:50:33,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 03:50:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 03:50:33,016 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:33,016 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:33,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-28 03:50:33,217 WARN L477 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-28 03:50:33,217 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:33,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1495129873, now seen corresponding path program 18 times [2022-04-28 03:50:33,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:33,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [124222346] [2022-04-28 03:50:35,339 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:35,410 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-28 03:50:35,639 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-28 03:50:35,641 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:35,644 INFO L85 PathProgramCache]: Analyzing trace with hash -591735614, now seen corresponding path program 1 times [2022-04-28 03:50:35,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:35,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232836889] [2022-04-28 03:50:35,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:35,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:35,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:35,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {13622#(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(18, 2);call #Ultimate.allocInit(12, 3); {13598#true} is VALID [2022-04-28 03:50:35,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {13598#true} assume true; {13598#true} is VALID [2022-04-28 03:50:35,952 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13598#true} {13598#true} #53#return; {13598#true} is VALID [2022-04-28 03:50:35,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {13598#true} call ULTIMATE.init(); {13622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:35,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {13622#(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(18, 2);call #Ultimate.allocInit(12, 3); {13598#true} is VALID [2022-04-28 03:50:35,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {13598#true} assume true; {13598#true} is VALID [2022-04-28 03:50:35,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13598#true} {13598#true} #53#return; {13598#true} is VALID [2022-04-28 03:50:35,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {13598#true} call #t~ret9 := main(); {13598#true} is VALID [2022-04-28 03:50:35,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {13598#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:35,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {13603#(<= 500000 main_~y~0)} [131] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_714 v_main_~x~0_713)) (.cse1 (= |v_main_#t~post4_114| |v_main_#t~post4_113|))) (or (and (< v_main_~x~0_714 v_main_~x~0_713) (< v_main_~x~0_713 500001)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_714)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_714, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_713, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:35,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {13603#(<= 500000 main_~y~0)} [132] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:35,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {13603#(<= 500000 main_~y~0)} [133] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_716)) (.cse2 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714)) (.cse5 (= v_main_~x~0_716 v_main_~x~0_715))) (or (let ((.cse0 (+ v_main_~x~0_716 v_main_~y~0_714))) (and (< .cse0 (+ v_main_~y~0_715 1000001)) (< v_main_~y~0_715 v_main_~y~0_714) (= (+ v_main_~x~0_715 v_main_~y~0_715) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_716 1000000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_716, 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_715, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:35,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {13603#(<= 500000 main_~y~0)} [130] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:35,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {13603#(<= 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; {13604#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:35,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {13604#(<= 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; {13605#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:35,958 INFO L290 TraceCheckUtils]: 12: Hoare triple {13605#(<= 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; {13606#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:35,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {13606#(<= 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; {13607#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:35,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {13607#(<= 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; {13608#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:35,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {13608#(<= 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; {13609#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:35,960 INFO L290 TraceCheckUtils]: 16: Hoare triple {13609#(<= 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; {13610#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:35,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {13610#(<= 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; {13611#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:35,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {13611#(<= 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; {13612#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:35,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {13612#(<= 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; {13613#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:35,962 INFO L290 TraceCheckUtils]: 20: Hoare triple {13613#(<= 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; {13614#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:35,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {13614#(<= 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; {13615#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:35,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {13615#(<= 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; {13616#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:35,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {13616#(<= 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; {13617#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:35,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {13617#(<= 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; {13618#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:35,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {13618#(<= 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; {13619#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:35,966 INFO L290 TraceCheckUtils]: 26: Hoare triple {13619#(<= 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; {13620#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:35,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {13620#(<= 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; {13621#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:50:35,967 INFO L290 TraceCheckUtils]: 28: Hoare triple {13621#(<= 499964 main_~y~0)} assume !(~y~0 > 0); {13599#false} is VALID [2022-04-28 03:50:35,967 INFO L272 TraceCheckUtils]: 29: Hoare triple {13599#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {13599#false} is VALID [2022-04-28 03:50:35,967 INFO L290 TraceCheckUtils]: 30: Hoare triple {13599#false} ~cond := #in~cond; {13599#false} is VALID [2022-04-28 03:50:35,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {13599#false} assume 0 == ~cond; {13599#false} is VALID [2022-04-28 03:50:35,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {13599#false} assume !false; {13599#false} is VALID [2022-04-28 03:50:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:35,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232836889] [2022-04-28 03:50:35,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232836889] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:35,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072386512] [2022-04-28 03:50:35,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:35,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:35,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:35,969 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-28 03:50:35,972 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-28 03:50:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,024 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 03:50:36,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:36,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:36,420 INFO L272 TraceCheckUtils]: 0: Hoare triple {13598#true} call ULTIMATE.init(); {13598#true} is VALID [2022-04-28 03:50:36,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {13598#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(18, 2);call #Ultimate.allocInit(12, 3); {13598#true} is VALID [2022-04-28 03:50:36,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {13598#true} assume true; {13598#true} is VALID [2022-04-28 03:50:36,421 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13598#true} {13598#true} #53#return; {13598#true} is VALID [2022-04-28 03:50:36,421 INFO L272 TraceCheckUtils]: 4: Hoare triple {13598#true} call #t~ret9 := main(); {13598#true} is VALID [2022-04-28 03:50:36,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {13598#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:36,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {13603#(<= 500000 main_~y~0)} [131] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_714 v_main_~x~0_713)) (.cse1 (= |v_main_#t~post4_114| |v_main_#t~post4_113|))) (or (and (< v_main_~x~0_714 v_main_~x~0_713) (< v_main_~x~0_713 500001)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_714)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_714, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_713, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:36,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {13603#(<= 500000 main_~y~0)} [132] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:36,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {13603#(<= 500000 main_~y~0)} [133] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_716)) (.cse2 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714)) (.cse5 (= v_main_~x~0_716 v_main_~x~0_715))) (or (let ((.cse0 (+ v_main_~x~0_716 v_main_~y~0_714))) (and (< .cse0 (+ v_main_~y~0_715 1000001)) (< v_main_~y~0_715 v_main_~y~0_714) (= (+ v_main_~x~0_715 v_main_~y~0_715) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_716 1000000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_716, 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_715, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:36,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {13603#(<= 500000 main_~y~0)} [130] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {13603#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:36,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {13603#(<= 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; {13604#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:36,425 INFO L290 TraceCheckUtils]: 11: Hoare triple {13604#(<= 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; {13605#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:36,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {13605#(<= 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; {13606#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:36,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {13606#(<= 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; {13607#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:36,431 INFO L290 TraceCheckUtils]: 14: Hoare triple {13607#(<= 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; {13608#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:36,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {13608#(<= 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; {13609#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:36,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {13609#(<= 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; {13610#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:36,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {13610#(<= 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; {13611#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:36,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {13611#(<= 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; {13612#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:36,435 INFO L290 TraceCheckUtils]: 19: Hoare triple {13612#(<= 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; {13613#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:36,435 INFO L290 TraceCheckUtils]: 20: Hoare triple {13613#(<= 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; {13614#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:36,436 INFO L290 TraceCheckUtils]: 21: Hoare triple {13614#(<= 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; {13615#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:36,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {13615#(<= 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; {13616#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:36,437 INFO L290 TraceCheckUtils]: 23: Hoare triple {13616#(<= 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; {13617#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:36,438 INFO L290 TraceCheckUtils]: 24: Hoare triple {13617#(<= 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; {13618#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:36,438 INFO L290 TraceCheckUtils]: 25: Hoare triple {13618#(<= 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; {13619#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:36,439 INFO L290 TraceCheckUtils]: 26: Hoare triple {13619#(<= 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; {13620#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:36,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {13620#(<= 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; {13621#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:50:36,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {13621#(<= 499964 main_~y~0)} assume !(~y~0 > 0); {13599#false} is VALID [2022-04-28 03:50:36,440 INFO L272 TraceCheckUtils]: 29: Hoare triple {13599#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {13599#false} is VALID [2022-04-28 03:50:36,440 INFO L290 TraceCheckUtils]: 30: Hoare triple {13599#false} ~cond := #in~cond; {13599#false} is VALID [2022-04-28 03:50:36,440 INFO L290 TraceCheckUtils]: 31: Hoare triple {13599#false} assume 0 == ~cond; {13599#false} is VALID [2022-04-28 03:50:36,441 INFO L290 TraceCheckUtils]: 32: Hoare triple {13599#false} assume !false; {13599#false} is VALID [2022-04-28 03:50:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:36,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:37,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {13599#false} assume !false; {13599#false} is VALID [2022-04-28 03:50:37,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {13599#false} assume 0 == ~cond; {13599#false} is VALID [2022-04-28 03:50:37,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {13599#false} ~cond := #in~cond; {13599#false} is VALID [2022-04-28 03:50:37,195 INFO L272 TraceCheckUtils]: 29: Hoare triple {13599#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {13599#false} is VALID [2022-04-28 03:50:37,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {13734#(< 0 main_~y~0)} assume !(~y~0 > 0); {13599#false} is VALID [2022-04-28 03:50:37,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {13738#(< 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; {13734#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:37,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {13742#(< 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; {13738#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:37,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {13746#(< 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; {13742#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:37,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {13750#(< 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; {13746#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:37,198 INFO L290 TraceCheckUtils]: 23: Hoare triple {13754#(< 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; {13750#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:37,199 INFO L290 TraceCheckUtils]: 22: Hoare triple {13758#(< 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; {13754#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:37,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {13762#(< 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; {13758#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:37,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {13766#(< 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; {13762#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:37,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {13770#(< 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; {13766#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:37,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {13774#(< 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; {13770#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:37,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {13778#(< 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; {13774#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:37,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {13782#(< 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; {13778#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:37,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {13786#(< 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; {13782#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:37,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {13790#(< 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; {13786#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:37,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {13794#(< 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; {13790#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:37,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {13798#(< 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; {13794#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:37,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {13802#(< 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; {13798#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:37,204 INFO L290 TraceCheckUtils]: 10: Hoare triple {13806#(< 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; {13802#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:37,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {13806#(< 36 main_~y~0)} [130] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {13806#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:37,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {13806#(< 36 main_~y~0)} [133] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_716)) (.cse2 (= |v_main_#t~post6_123| |v_main_#t~post6_122|)) (.cse3 (= |v_main_#t~post5_123| |v_main_#t~post5_122|)) (.cse4 (= v_main_~y~0_715 v_main_~y~0_714)) (.cse5 (= v_main_~x~0_716 v_main_~x~0_715))) (or (let ((.cse0 (+ v_main_~x~0_716 v_main_~y~0_714))) (and (< .cse0 (+ v_main_~y~0_715 1000001)) (< v_main_~y~0_715 v_main_~y~0_714) (= (+ v_main_~x~0_715 v_main_~y~0_715) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_716 1000000)) (not .cse1))) (and .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_715, main_#t~post5=|v_main_#t~post5_123|, main_~x~0=v_main_~x~0_716, 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_715, main_#t~post6=|v_main_#t~post6_122|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {13806#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:37,206 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(< 36 main_~y~0)} [132] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {13806#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:37,206 INFO L290 TraceCheckUtils]: 6: Hoare triple {13806#(< 36 main_~y~0)} [131] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_714 v_main_~x~0_713)) (.cse1 (= |v_main_#t~post4_114| |v_main_#t~post4_113|))) (or (and (< v_main_~x~0_714 v_main_~x~0_713) (< v_main_~x~0_713 500001)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_714)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_714, main_#t~post4=|v_main_#t~post4_114|} OutVars{main_~x~0=v_main_~x~0_713, main_#t~post4=|v_main_#t~post4_113|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {13806#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:37,206 INFO L290 TraceCheckUtils]: 5: Hoare triple {13598#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {13806#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:37,206 INFO L272 TraceCheckUtils]: 4: Hoare triple {13598#true} call #t~ret9 := main(); {13598#true} is VALID [2022-04-28 03:50:37,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13598#true} {13598#true} #53#return; {13598#true} is VALID [2022-04-28 03:50:37,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {13598#true} assume true; {13598#true} is VALID [2022-04-28 03:50:37,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {13598#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(18, 2);call #Ultimate.allocInit(12, 3); {13598#true} is VALID [2022-04-28 03:50:37,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {13598#true} call ULTIMATE.init(); {13598#true} is VALID [2022-04-28 03:50:37,207 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 03:50:37,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072386512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:37,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:37,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 41 [2022-04-28 03:50:38,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:38,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [124222346] [2022-04-28 03:50:38,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [124222346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:38,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:38,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-28 03:50:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248499925] [2022-04-28 03:50:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:38,366 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 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 92 [2022-04-28 03:50:38,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:38,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:38,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:38,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-28 03:50:38,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:38,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-28 03:50:38,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=3163, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 03:50:38,446 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:42,989 INFO L93 Difference]: Finished difference Result 189 states and 202 transitions. [2022-04-28 03:50:42,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-28 03:50:42,989 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 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 92 [2022-04-28 03:50:42,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:42,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 03:50:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 122 transitions. [2022-04-28 03:50:42,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 122 transitions. [2022-04-28 03:50:43,116 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-28 03:50:43,118 INFO L225 Difference]: With dead ends: 189 [2022-04-28 03:50:43,118 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 03:50:43,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 83 SyntacticMatches, 2 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4379 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4886, Invalid=10366, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:50:43,120 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 110 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2076 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 2076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:43,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 42 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 2076 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 03:50:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 03:50:43,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 03:50:43,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:43,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:43,298 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:43,298 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:43,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:43,300 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-28 03:50:43,300 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 03:50:43,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:43,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:43,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 101 states. [2022-04-28 03:50:43,301 INFO L87 Difference]: Start difference. First operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 101 states. [2022-04-28 03:50:43,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:43,303 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-28 03:50:43,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 03:50:43,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:43,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:43,303 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:43,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:43,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 94 states have (on average 1.053191489361702) internal successors, (99), 95 states have internal predecessors, (99), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:43,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 105 transitions. [2022-04-28 03:50:43,306 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 105 transitions. Word has length 92 [2022-04-28 03:50:43,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:43,306 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 105 transitions. [2022-04-28 03:50:43,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 1.6296296296296295) internal successors, (88), 53 states have internal predecessors, (88), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:50:43,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 105 transitions. [2022-04-28 03:50:43,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 03:50:43,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-28 03:50:43,418 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:43,418 INFO L195 NwaCegarLoop]: trace histogram [33, 32, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:43,446 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-28 03:50:43,619 WARN L477 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-28 03:50:43,619 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:43,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:43,620 INFO L85 PathProgramCache]: Analyzing trace with hash -619530550, now seen corresponding path program 19 times [2022-04-28 03:50:43,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:43,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592197532] [2022-04-28 03:50:43,737 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-28 03:50:43,953 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-28 03:50:43,954 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:43,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2103365729, now seen corresponding path program 1 times [2022-04-28 03:50:43,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84563345] [2022-04-28 03:50:43,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:43,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:43,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:44,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:44,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {14780#(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(18, 2);call #Ultimate.allocInit(12, 3); {14755#true} is VALID [2022-04-28 03:50:44,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {14755#true} assume true; {14755#true} is VALID [2022-04-28 03:50:44,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14755#true} {14755#true} #53#return; {14755#true} is VALID [2022-04-28 03:50:44,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {14755#true} call ULTIMATE.init(); {14780#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:44,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {14780#(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(18, 2);call #Ultimate.allocInit(12, 3); {14755#true} is VALID [2022-04-28 03:50:44,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {14755#true} assume true; {14755#true} is VALID [2022-04-28 03:50:44,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14755#true} {14755#true} #53#return; {14755#true} is VALID [2022-04-28 03:50:44,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {14755#true} call #t~ret9 := main(); {14755#true} is VALID [2022-04-28 03:50:44,298 INFO L290 TraceCheckUtils]: 5: Hoare triple {14755#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14760#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:44,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {14760#(<= 500000 main_~y~0)} [135] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_779 v_main_~x~0_778))) (or (and .cse0 (<= 500000 v_main_~x~0_779) (= |v_main_#t~post4_119| |v_main_#t~post4_120|)) (and .cse0 (= |v_main_#t~post4_120| |v_main_#t~post4_119|)) (and (< v_main_~x~0_778 500001) (< v_main_~x~0_779 v_main_~x~0_778)))) InVars {main_~x~0=v_main_~x~0_779, main_#t~post4=|v_main_#t~post4_120|} OutVars{main_~x~0=v_main_~x~0_778, main_#t~post4=|v_main_#t~post4_119|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14760#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:44,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {14760#(<= 500000 main_~y~0)} [136] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14760#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:44,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {14760#(<= 500000 main_~y~0)} [137] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse2 (= v_main_~x~0_781 v_main_~x~0_780)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse1 (<= 500000 v_main_~x~0_781))) (or (and (= v_main_~y~0_789 v_main_~y~0_790) .cse0 (or (not (< v_main_~x~0_781 1000000)) (not .cse1)) .cse2 .cse3) (and (= v_main_~y~0_790 v_main_~y~0_789) .cse0 .cse2 .cse3) (and .cse1 (< v_main_~x~0_780 1000001) (< v_main_~x~0_781 v_main_~x~0_780) (= (+ v_main_~x~0_780 v_main_~y~0_790) (+ v_main_~x~0_781 v_main_~y~0_789))))) InVars {main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_781, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_789, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_780, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14760#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:44,300 INFO L290 TraceCheckUtils]: 9: Hoare triple {14760#(<= 500000 main_~y~0)} [134] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {14760#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:44,301 INFO L290 TraceCheckUtils]: 10: Hoare triple {14760#(<= 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; {14761#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:44,301 INFO L290 TraceCheckUtils]: 11: Hoare triple {14761#(<= 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; {14762#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:44,302 INFO L290 TraceCheckUtils]: 12: Hoare triple {14762#(<= 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; {14763#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:44,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {14763#(<= 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; {14764#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:44,303 INFO L290 TraceCheckUtils]: 14: Hoare triple {14764#(<= 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; {14765#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:44,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {14765#(<= 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; {14766#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:44,304 INFO L290 TraceCheckUtils]: 16: Hoare triple {14766#(<= 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; {14767#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:44,305 INFO L290 TraceCheckUtils]: 17: Hoare triple {14767#(<= 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; {14768#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:44,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {14768#(<= 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; {14769#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:44,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {14769#(<= 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; {14770#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:44,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {14770#(<= 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; {14771#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:44,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {14771#(<= 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; {14772#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:44,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {14772#(<= 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; {14773#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:44,308 INFO L290 TraceCheckUtils]: 23: Hoare triple {14773#(<= 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; {14774#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:44,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {14774#(<= 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; {14775#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:44,309 INFO L290 TraceCheckUtils]: 25: Hoare triple {14775#(<= 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; {14776#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:44,310 INFO L290 TraceCheckUtils]: 26: Hoare triple {14776#(<= 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; {14777#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:44,310 INFO L290 TraceCheckUtils]: 27: Hoare triple {14777#(<= 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; {14778#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:50:44,310 INFO L290 TraceCheckUtils]: 28: Hoare triple {14778#(<= 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; {14779#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:50:44,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {14779#(<= 499962 main_~y~0)} assume !(~y~0 > 0); {14756#false} is VALID [2022-04-28 03:50:44,311 INFO L272 TraceCheckUtils]: 30: Hoare triple {14756#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {14756#false} is VALID [2022-04-28 03:50:44,311 INFO L290 TraceCheckUtils]: 31: Hoare triple {14756#false} ~cond := #in~cond; {14756#false} is VALID [2022-04-28 03:50:44,311 INFO L290 TraceCheckUtils]: 32: Hoare triple {14756#false} assume 0 == ~cond; {14756#false} is VALID [2022-04-28 03:50:44,311 INFO L290 TraceCheckUtils]: 33: Hoare triple {14756#false} assume !false; {14756#false} is VALID [2022-04-28 03:50:44,311 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-28 03:50:44,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:44,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84563345] [2022-04-28 03:50:44,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84563345] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:44,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915054859] [2022-04-28 03:50:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:44,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:44,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:44,313 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-28 03:50:44,316 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-28 03:50:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:44,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 03:50:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:44,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:45,109 INFO L272 TraceCheckUtils]: 0: Hoare triple {14755#true} call ULTIMATE.init(); {14755#true} is VALID [2022-04-28 03:50:45,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {14755#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(18, 2);call #Ultimate.allocInit(12, 3); {14755#true} is VALID [2022-04-28 03:50:45,109 INFO L290 TraceCheckUtils]: 2: Hoare triple {14755#true} assume true; {14755#true} is VALID [2022-04-28 03:50:45,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14755#true} {14755#true} #53#return; {14755#true} is VALID [2022-04-28 03:50:45,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {14755#true} call #t~ret9 := main(); {14755#true} is VALID [2022-04-28 03:50:45,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {14755#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {14799#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:50:45,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {14799#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [135] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_779 v_main_~x~0_778))) (or (and .cse0 (<= 500000 v_main_~x~0_779) (= |v_main_#t~post4_119| |v_main_#t~post4_120|)) (and .cse0 (= |v_main_#t~post4_120| |v_main_#t~post4_119|)) (and (< v_main_~x~0_778 500001) (< v_main_~x~0_779 v_main_~x~0_778)))) InVars {main_~x~0=v_main_~x~0_779, main_#t~post4=|v_main_#t~post4_120|} OutVars{main_~x~0=v_main_~x~0_778, main_#t~post4=|v_main_#t~post4_119|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {14803#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:50:45,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {14803#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [136] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14803#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:50:45,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {14803#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [137] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse2 (= v_main_~x~0_781 v_main_~x~0_780)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse1 (<= 500000 v_main_~x~0_781))) (or (and (= v_main_~y~0_789 v_main_~y~0_790) .cse0 (or (not (< v_main_~x~0_781 1000000)) (not .cse1)) .cse2 .cse3) (and (= v_main_~y~0_790 v_main_~y~0_789) .cse0 .cse2 .cse3) (and .cse1 (< v_main_~x~0_780 1000001) (< v_main_~x~0_781 v_main_~x~0_780) (= (+ v_main_~x~0_780 v_main_~y~0_790) (+ v_main_~x~0_781 v_main_~y~0_789))))) InVars {main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_781, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_789, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_780, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14810#(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-28 03:50:45,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {14810#(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)))} [134] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {14814#(< 999999 main_~y~0)} is VALID [2022-04-28 03:50:45,112 INFO L290 TraceCheckUtils]: 10: Hoare triple {14814#(< 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; {14818#(< 999997 main_~y~0)} is VALID [2022-04-28 03:50:45,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {14818#(< 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; {14822#(< 999995 main_~y~0)} is VALID [2022-04-28 03:50:45,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {14822#(< 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; {14826#(< 999993 main_~y~0)} is VALID [2022-04-28 03:50:45,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {14826#(< 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; {14830#(< 999991 main_~y~0)} is VALID [2022-04-28 03:50:45,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {14830#(< 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; {14834#(< 999989 main_~y~0)} is VALID [2022-04-28 03:50:45,115 INFO L290 TraceCheckUtils]: 15: Hoare triple {14834#(< 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; {14838#(< 999987 main_~y~0)} is VALID [2022-04-28 03:50:45,115 INFO L290 TraceCheckUtils]: 16: Hoare triple {14838#(< 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; {14842#(< 999985 main_~y~0)} is VALID [2022-04-28 03:50:45,116 INFO L290 TraceCheckUtils]: 17: Hoare triple {14842#(< 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; {14846#(< 999983 main_~y~0)} is VALID [2022-04-28 03:50:45,116 INFO L290 TraceCheckUtils]: 18: Hoare triple {14846#(< 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; {14850#(< 999981 main_~y~0)} is VALID [2022-04-28 03:50:45,117 INFO L290 TraceCheckUtils]: 19: Hoare triple {14850#(< 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; {14854#(< 999979 main_~y~0)} is VALID [2022-04-28 03:50:45,117 INFO L290 TraceCheckUtils]: 20: Hoare triple {14854#(< 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; {14858#(< 999977 main_~y~0)} is VALID [2022-04-28 03:50:45,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {14858#(< 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; {14862#(< 999975 main_~y~0)} is VALID [2022-04-28 03:50:45,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {14862#(< 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; {14866#(< 999973 main_~y~0)} is VALID [2022-04-28 03:50:45,119 INFO L290 TraceCheckUtils]: 23: Hoare triple {14866#(< 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; {14870#(< 999971 main_~y~0)} is VALID [2022-04-28 03:50:45,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {14870#(< 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; {14874#(< 999969 main_~y~0)} is VALID [2022-04-28 03:50:45,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {14874#(< 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; {14878#(< 999967 main_~y~0)} is VALID [2022-04-28 03:50:45,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {14878#(< 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; {14882#(< 999965 main_~y~0)} is VALID [2022-04-28 03:50:45,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {14882#(< 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; {14886#(< 999963 main_~y~0)} is VALID [2022-04-28 03:50:45,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {14886#(< 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; {14890#(< 999961 main_~y~0)} is VALID [2022-04-28 03:50:45,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {14890#(< 999961 main_~y~0)} assume !(~y~0 > 0); {14756#false} is VALID [2022-04-28 03:50:45,122 INFO L272 TraceCheckUtils]: 30: Hoare triple {14756#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {14756#false} is VALID [2022-04-28 03:50:45,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {14756#false} ~cond := #in~cond; {14756#false} is VALID [2022-04-28 03:50:45,122 INFO L290 TraceCheckUtils]: 32: Hoare triple {14756#false} assume 0 == ~cond; {14756#false} is VALID [2022-04-28 03:50:45,122 INFO L290 TraceCheckUtils]: 33: Hoare triple {14756#false} assume !false; {14756#false} is VALID [2022-04-28 03:50:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:45,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:46,227 INFO L290 TraceCheckUtils]: 33: Hoare triple {14756#false} assume !false; {14756#false} is VALID [2022-04-28 03:50:46,227 INFO L290 TraceCheckUtils]: 32: Hoare triple {14756#false} assume 0 == ~cond; {14756#false} is VALID [2022-04-28 03:50:46,227 INFO L290 TraceCheckUtils]: 31: Hoare triple {14756#false} ~cond := #in~cond; {14756#false} is VALID [2022-04-28 03:50:46,227 INFO L272 TraceCheckUtils]: 30: Hoare triple {14756#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {14756#false} is VALID [2022-04-28 03:50:46,227 INFO L290 TraceCheckUtils]: 29: Hoare triple {14918#(< 0 main_~y~0)} assume !(~y~0 > 0); {14756#false} is VALID [2022-04-28 03:50:46,228 INFO L290 TraceCheckUtils]: 28: Hoare triple {14922#(< 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; {14918#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:46,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {14926#(< 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; {14922#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:46,229 INFO L290 TraceCheckUtils]: 26: Hoare triple {14930#(< 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; {14926#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:46,229 INFO L290 TraceCheckUtils]: 25: Hoare triple {14934#(< 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; {14930#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:46,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {14938#(< 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; {14934#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:46,230 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(< 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; {14938#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:46,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {14946#(< 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; {14942#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:46,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {14950#(< 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; {14946#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:46,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {14954#(< 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; {14950#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:46,232 INFO L290 TraceCheckUtils]: 19: Hoare triple {14958#(< 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; {14954#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:46,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {14962#(< 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; {14958#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:46,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {14966#(< 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; {14962#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:46,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {14970#(< 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; {14966#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:46,234 INFO L290 TraceCheckUtils]: 15: Hoare triple {14974#(< 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; {14970#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:46,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {14978#(< 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; {14974#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:46,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {14982#(< 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; {14978#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:46,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {14986#(< 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; {14982#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:46,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {14990#(< 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; {14986#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:46,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {14994#(< 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; {14990#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:46,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {14998#(or (< main_~x~0 1000000) (< 38 main_~y~0))} [134] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {14994#(< 38 main_~y~0)} is VALID [2022-04-28 03:50:46,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {15002#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999962))) (or (< main_~x~0 1000000) (< 38 main_~y~0)))} [137] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_130| |v_main_#t~post5_129|)) (.cse2 (= v_main_~x~0_781 v_main_~x~0_780)) (.cse3 (= |v_main_#t~post6_130| |v_main_#t~post6_129|)) (.cse1 (<= 500000 v_main_~x~0_781))) (or (and (= v_main_~y~0_789 v_main_~y~0_790) .cse0 (or (not (< v_main_~x~0_781 1000000)) (not .cse1)) .cse2 .cse3) (and (= v_main_~y~0_790 v_main_~y~0_789) .cse0 .cse2 .cse3) (and .cse1 (< v_main_~x~0_780 1000001) (< v_main_~x~0_781 v_main_~x~0_780) (= (+ v_main_~x~0_780 v_main_~y~0_790) (+ v_main_~x~0_781 v_main_~y~0_789))))) InVars {main_~y~0=v_main_~y~0_790, main_#t~post5=|v_main_#t~post5_130|, main_~x~0=v_main_~x~0_781, main_#t~post6=|v_main_#t~post6_130|} OutVars{main_~y~0=v_main_~y~0_789, main_#t~post5=|v_main_#t~post5_129|, main_~x~0=v_main_~x~0_780, main_#t~post6=|v_main_#t~post6_129|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {14998#(or (< main_~x~0 1000000) (< 38 main_~y~0))} is VALID [2022-04-28 03:50:46,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {15002#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999962))) (or (< main_~x~0 1000000) (< 38 main_~y~0)))} [136] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15002#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999962))) (or (< main_~x~0 1000000) (< 38 main_~y~0)))} is VALID [2022-04-28 03:50:46,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {15009#(and (or (< main_~x~0 1000000) (< 38 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999962))) (<= 0 (+ 499961 main_~y~0)))} [135] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_779 v_main_~x~0_778))) (or (and .cse0 (<= 500000 v_main_~x~0_779) (= |v_main_#t~post4_119| |v_main_#t~post4_120|)) (and .cse0 (= |v_main_#t~post4_120| |v_main_#t~post4_119|)) (and (< v_main_~x~0_778 500001) (< v_main_~x~0_779 v_main_~x~0_778)))) InVars {main_~x~0=v_main_~x~0_779, main_#t~post4=|v_main_#t~post4_120|} OutVars{main_~x~0=v_main_~x~0_778, main_#t~post4=|v_main_#t~post4_119|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15002#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999962))) (or (< main_~x~0 1000000) (< 38 main_~y~0)))} is VALID [2022-04-28 03:50:46,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {14755#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15009#(and (or (< main_~x~0 1000000) (< 38 main_~y~0)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999962))) (<= 0 (+ 499961 main_~y~0)))} is VALID [2022-04-28 03:50:46,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {14755#true} call #t~ret9 := main(); {14755#true} is VALID [2022-04-28 03:50:46,241 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14755#true} {14755#true} #53#return; {14755#true} is VALID [2022-04-28 03:50:46,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {14755#true} assume true; {14755#true} is VALID [2022-04-28 03:50:46,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {14755#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(18, 2);call #Ultimate.allocInit(12, 3); {14755#true} is VALID [2022-04-28 03:50:46,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {14755#true} call ULTIMATE.init(); {14755#true} is VALID [2022-04-28 03:50:46,242 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 0 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:46,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915054859] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:46,242 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:46,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25, 25] total 69 [2022-04-28 03:50:47,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:50:47,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592197532] [2022-04-28 03:50:47,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592197532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:50:47,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:50:47,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-28 03:50:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554558350] [2022-04-28 03:50:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:50:47,693 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-28 03:50:47,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:50:47,693 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-28 03:50:47,764 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-28 03:50:47,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-28 03:50:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:47,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-28 03:50:47,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3714, Invalid=6588, Unknown=0, NotChecked=0, Total=10302 [2022-04-28 03:50:47,766 INFO L87 Difference]: Start difference. First operand 101 states and 105 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-28 03:50:53,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:53,217 INFO L93 Difference]: Finished difference Result 199 states and 212 transitions. [2022-04-28 03:50:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-28 03:50:53,217 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-28 03:50:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:50:53,218 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-28 03:50:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 127 transitions. [2022-04-28 03:50:53,220 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-28 03:50:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 127 transitions. [2022-04-28 03:50:53,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 127 transitions. [2022-04-28 03:50:53,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:53,349 INFO L225 Difference]: With dead ends: 199 [2022-04-28 03:50:53,349 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 03:50:53,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8273 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7011, Invalid=17169, Unknown=0, NotChecked=0, Total=24180 [2022-04-28 03:50:53,351 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 188 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 2488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:50:53,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 37 Invalid, 2488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-28 03:50:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 03:50:53,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-04-28 03:50:53,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:50:53,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:53,540 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:53,540 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:53,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:53,542 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-28 03:50:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:50:53,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:53,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:53,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-04-28 03:50:53,543 INFO L87 Difference]: Start difference. First operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 106 states. [2022-04-28 03:50:53,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:50:53,545 INFO L93 Difference]: Finished difference Result 106 states and 110 transitions. [2022-04-28 03:50:53,545 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:50:53,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:50:53,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:50:53,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:50:53,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:50:53,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 100 states have internal predecessors, (104), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:50:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-28 03:50:53,548 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 97 [2022-04-28 03:50:53,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:50:53,548 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-28 03:50:53,548 INFO L496 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-28 03:50:53,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-28 03:50:53,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:50:53,665 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-28 03:50:53,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 03:50:53,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:50:53,666 INFO L195 NwaCegarLoop]: trace histogram [35, 34, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:50:53,689 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-28 03:50:53,866 WARN L477 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-28 03:50:53,866 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:50:53,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:50:53,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1758202403, now seen corresponding path program 20 times [2022-04-28 03:50:53,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:50:53,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1346757061] [2022-04-28 03:50:56,324 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:50:56,381 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-28 03:50:56,618 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-28 03:50:56,619 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:50:56,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2051496286, now seen corresponding path program 1 times [2022-04-28 03:50:56,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:50:56,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266166578] [2022-04-28 03:50:56,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:56,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:50:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:50:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:56,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {16019#(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(18, 2);call #Ultimate.allocInit(12, 3); {15993#true} is VALID [2022-04-28 03:50:56,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {15993#true} assume true; {15993#true} is VALID [2022-04-28 03:50:56,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15993#true} {15993#true} #53#return; {15993#true} is VALID [2022-04-28 03:50:56,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {15993#true} call ULTIMATE.init(); {16019#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:50:56,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {16019#(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(18, 2);call #Ultimate.allocInit(12, 3); {15993#true} is VALID [2022-04-28 03:50:56,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {15993#true} assume true; {15993#true} is VALID [2022-04-28 03:50:56,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15993#true} {15993#true} #53#return; {15993#true} is VALID [2022-04-28 03:50:56,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {15993#true} call #t~ret9 := main(); {15993#true} is VALID [2022-04-28 03:50:56,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {15993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {15998#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:56,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {15998#(<= 500000 main_~y~0)} [139] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse1 (= |v_main_#t~post4_127| |v_main_#t~post4_126|))) (or (and (< v_main_~x~0_847 500001) (< v_main_~x~0_848 v_main_~x~0_847)) (and (not (< v_main_~x~0_848 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_848, main_#t~post4=|v_main_#t~post4_127|} OutVars{main_~x~0=v_main_~x~0_847, main_#t~post4=|v_main_#t~post4_126|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {15998#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:56,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {15998#(<= 500000 main_~y~0)} [140] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {15998#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:56,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {15998#(<= 500000 main_~y~0)} [141] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_850)) (.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_869 v_main_~y~0_868))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_850 1000000))) .cse2 .cse3 (= v_main_~x~0_849 v_main_~x~0_850)) (let ((.cse4 (+ v_main_~x~0_850 v_main_~y~0_868))) (and (= .cse4 (+ v_main_~x~0_849 v_main_~y~0_869)) (< .cse4 (+ v_main_~y~0_869 1000001)) (< v_main_~y~0_869 v_main_~y~0_868) .cse1)) (and .cse0 (= v_main_~x~0_850 v_main_~x~0_849) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_850, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_849, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {15998#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:56,977 INFO L290 TraceCheckUtils]: 9: Hoare triple {15998#(<= 500000 main_~y~0)} [138] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {15998#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:50:56,977 INFO L290 TraceCheckUtils]: 10: Hoare triple {15998#(<= 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; {15999#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:50:56,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {15999#(<= 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; {16000#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:50:56,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {16000#(<= 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; {16001#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:50:56,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {16001#(<= 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; {16002#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:50:56,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {16002#(<= 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; {16003#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:50:56,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {16003#(<= 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; {16004#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:50:56,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {16004#(<= 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; {16005#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:50:56,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {16005#(<= 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; {16006#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:50:56,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {16006#(<= 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; {16007#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:50:56,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {16007#(<= 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; {16008#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:50:56,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {16008#(<= 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; {16009#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:50:56,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {16009#(<= 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; {16010#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:50:56,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {16010#(<= 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; {16011#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:50:56,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {16011#(<= 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; {16012#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:50:56,986 INFO L290 TraceCheckUtils]: 24: Hoare triple {16012#(<= 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; {16013#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:50:56,987 INFO L290 TraceCheckUtils]: 25: Hoare triple {16013#(<= 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; {16014#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:50:56,987 INFO L290 TraceCheckUtils]: 26: Hoare triple {16014#(<= 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; {16015#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:50:56,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {16015#(<= 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; {16016#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:50:56,989 INFO L290 TraceCheckUtils]: 28: Hoare triple {16016#(<= 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; {16017#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:50:56,989 INFO L290 TraceCheckUtils]: 29: Hoare triple {16017#(<= 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; {16018#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:50:56,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {16018#(<= 499960 main_~y~0)} assume !(~y~0 > 0); {15994#false} is VALID [2022-04-28 03:50:56,990 INFO L272 TraceCheckUtils]: 31: Hoare triple {15994#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {15994#false} is VALID [2022-04-28 03:50:56,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2022-04-28 03:50:56,990 INFO L290 TraceCheckUtils]: 33: Hoare triple {15994#false} assume 0 == ~cond; {15994#false} is VALID [2022-04-28 03:50:56,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2022-04-28 03:50:56,990 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-28 03:50:56,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:50:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266166578] [2022-04-28 03:50:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266166578] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:50:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111266244] [2022-04-28 03:50:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:50:56,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:50:56,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:50:56,992 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-28 03:50:57,004 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-28 03:50:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:57,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-28 03:50:57,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:50:57,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:50:57,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {15993#true} call ULTIMATE.init(); {15993#true} is VALID [2022-04-28 03:50:57,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {15993#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(18, 2);call #Ultimate.allocInit(12, 3); {15993#true} is VALID [2022-04-28 03:50:57,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {15993#true} assume true; {15993#true} is VALID [2022-04-28 03:50:57,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15993#true} {15993#true} #53#return; {15993#true} is VALID [2022-04-28 03:50:57,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {15993#true} call #t~ret9 := main(); {15993#true} is VALID [2022-04-28 03:50:57,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {15993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16038#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:50:57,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {16038#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [139] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse1 (= |v_main_#t~post4_127| |v_main_#t~post4_126|))) (or (and (< v_main_~x~0_847 500001) (< v_main_~x~0_848 v_main_~x~0_847)) (and (not (< v_main_~x~0_848 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_848, main_#t~post4=|v_main_#t~post4_127|} OutVars{main_~x~0=v_main_~x~0_847, main_#t~post4=|v_main_#t~post4_126|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16042#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:50:57,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {16042#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [140] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16042#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:50:57,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {16042#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [141] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_850)) (.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_869 v_main_~y~0_868))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_850 1000000))) .cse2 .cse3 (= v_main_~x~0_849 v_main_~x~0_850)) (let ((.cse4 (+ v_main_~x~0_850 v_main_~y~0_868))) (and (= .cse4 (+ v_main_~x~0_849 v_main_~y~0_869)) (< .cse4 (+ v_main_~y~0_869 1000001)) (< v_main_~y~0_869 v_main_~y~0_868) .cse1)) (and .cse0 (= v_main_~x~0_850 v_main_~x~0_849) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_850, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_849, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16049#(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-28 03:50:57,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {16049#(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)))} [138] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {16053#(< 999999 main_~y~0)} is VALID [2022-04-28 03:50:57,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {16053#(< 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; {16057#(< 999997 main_~y~0)} is VALID [2022-04-28 03:50:57,825 INFO L290 TraceCheckUtils]: 11: Hoare triple {16057#(< 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; {16061#(< 999995 main_~y~0)} is VALID [2022-04-28 03:50:57,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {16061#(< 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; {16065#(< 999993 main_~y~0)} is VALID [2022-04-28 03:50:57,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {16065#(< 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; {16069#(< 999991 main_~y~0)} is VALID [2022-04-28 03:50:57,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {16069#(< 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; {16073#(< 999989 main_~y~0)} is VALID [2022-04-28 03:50:57,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {16073#(< 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; {16077#(< 999987 main_~y~0)} is VALID [2022-04-28 03:50:57,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {16077#(< 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; {16081#(< 999985 main_~y~0)} is VALID [2022-04-28 03:50:57,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {16081#(< 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; {16085#(< 999983 main_~y~0)} is VALID [2022-04-28 03:50:57,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {16085#(< 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; {16089#(< 999981 main_~y~0)} is VALID [2022-04-28 03:50:57,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {16089#(< 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; {16093#(< 999979 main_~y~0)} is VALID [2022-04-28 03:50:57,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {16093#(< 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; {16097#(< 999977 main_~y~0)} is VALID [2022-04-28 03:50:57,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {16097#(< 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; {16101#(< 999975 main_~y~0)} is VALID [2022-04-28 03:50:57,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {16101#(< 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; {16105#(< 999973 main_~y~0)} is VALID [2022-04-28 03:50:57,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {16105#(< 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; {16109#(< 999971 main_~y~0)} is VALID [2022-04-28 03:50:57,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {16109#(< 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; {16113#(< 999969 main_~y~0)} is VALID [2022-04-28 03:50:57,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {16113#(< 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; {16117#(< 999967 main_~y~0)} is VALID [2022-04-28 03:50:57,832 INFO L290 TraceCheckUtils]: 26: Hoare triple {16117#(< 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; {16121#(< 999965 main_~y~0)} is VALID [2022-04-28 03:50:57,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {16121#(< 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; {16125#(< 999963 main_~y~0)} is VALID [2022-04-28 03:50:57,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {16125#(< 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; {16129#(< 999961 main_~y~0)} is VALID [2022-04-28 03:50:57,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {16129#(< 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; {16133#(< 999959 main_~y~0)} is VALID [2022-04-28 03:50:57,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {16133#(< 999959 main_~y~0)} assume !(~y~0 > 0); {15994#false} is VALID [2022-04-28 03:50:57,834 INFO L272 TraceCheckUtils]: 31: Hoare triple {15994#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {15994#false} is VALID [2022-04-28 03:50:57,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2022-04-28 03:50:57,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {15994#false} assume 0 == ~cond; {15994#false} is VALID [2022-04-28 03:50:57,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2022-04-28 03:50:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:57,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:50:58,980 INFO L290 TraceCheckUtils]: 34: Hoare triple {15994#false} assume !false; {15994#false} is VALID [2022-04-28 03:50:58,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {15994#false} assume 0 == ~cond; {15994#false} is VALID [2022-04-28 03:50:58,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {15994#false} ~cond := #in~cond; {15994#false} is VALID [2022-04-28 03:50:58,981 INFO L272 TraceCheckUtils]: 31: Hoare triple {15994#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {15994#false} is VALID [2022-04-28 03:50:58,981 INFO L290 TraceCheckUtils]: 30: Hoare triple {16161#(< 0 main_~y~0)} assume !(~y~0 > 0); {15994#false} is VALID [2022-04-28 03:50:58,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {16165#(< 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; {16161#(< 0 main_~y~0)} is VALID [2022-04-28 03:50:58,982 INFO L290 TraceCheckUtils]: 28: Hoare triple {16169#(< 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; {16165#(< 2 main_~y~0)} is VALID [2022-04-28 03:50:58,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {16173#(< 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; {16169#(< 4 main_~y~0)} is VALID [2022-04-28 03:50:58,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {16177#(< 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; {16173#(< 6 main_~y~0)} is VALID [2022-04-28 03:50:58,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {16181#(< 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; {16177#(< 8 main_~y~0)} is VALID [2022-04-28 03:50:58,984 INFO L290 TraceCheckUtils]: 24: Hoare triple {16185#(< 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; {16181#(< 10 main_~y~0)} is VALID [2022-04-28 03:50:58,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {16189#(< 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; {16185#(< 12 main_~y~0)} is VALID [2022-04-28 03:50:58,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {16193#(< 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; {16189#(< 14 main_~y~0)} is VALID [2022-04-28 03:50:58,985 INFO L290 TraceCheckUtils]: 21: Hoare triple {16197#(< 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; {16193#(< 16 main_~y~0)} is VALID [2022-04-28 03:50:58,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {16201#(< 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; {16197#(< 18 main_~y~0)} is VALID [2022-04-28 03:50:58,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {16205#(< 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; {16201#(< 20 main_~y~0)} is VALID [2022-04-28 03:50:58,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {16209#(< 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; {16205#(< 22 main_~y~0)} is VALID [2022-04-28 03:50:58,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {16213#(< 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; {16209#(< 24 main_~y~0)} is VALID [2022-04-28 03:50:58,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {16217#(< 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; {16213#(< 26 main_~y~0)} is VALID [2022-04-28 03:50:58,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {16221#(< 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; {16217#(< 28 main_~y~0)} is VALID [2022-04-28 03:50:58,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {16225#(< 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; {16221#(< 30 main_~y~0)} is VALID [2022-04-28 03:50:58,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {16229#(< 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; {16225#(< 32 main_~y~0)} is VALID [2022-04-28 03:50:58,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {16233#(< 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; {16229#(< 34 main_~y~0)} is VALID [2022-04-28 03:50:58,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {16237#(< 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; {16233#(< 36 main_~y~0)} is VALID [2022-04-28 03:50:58,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {16241#(< 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; {16237#(< 38 main_~y~0)} is VALID [2022-04-28 03:50:58,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {16245#(or (< main_~x~0 1000000) (< 40 main_~y~0))} [138] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {16241#(< 40 main_~y~0)} is VALID [2022-04-28 03:50:58,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {16249#(and (or (< main_~x~0 1000000) (< 40 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} [141] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_850)) (.cse0 (= |v_main_#t~post6_137| |v_main_#t~post6_136|)) (.cse2 (= |v_main_#t~post5_137| |v_main_#t~post5_136|)) (.cse3 (= v_main_~y~0_869 v_main_~y~0_868))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_850 1000000))) .cse2 .cse3 (= v_main_~x~0_849 v_main_~x~0_850)) (let ((.cse4 (+ v_main_~x~0_850 v_main_~y~0_868))) (and (= .cse4 (+ v_main_~x~0_849 v_main_~y~0_869)) (< .cse4 (+ v_main_~y~0_869 1000001)) (< v_main_~y~0_869 v_main_~y~0_868) .cse1)) (and .cse0 (= v_main_~x~0_850 v_main_~x~0_849) .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_869, main_#t~post5=|v_main_#t~post5_137|, main_~x~0=v_main_~x~0_850, main_#t~post6=|v_main_#t~post6_137|} OutVars{main_~y~0=v_main_~y~0_868, main_#t~post5=|v_main_#t~post5_136|, main_~x~0=v_main_~x~0_849, main_#t~post6=|v_main_#t~post6_136|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {16245#(or (< main_~x~0 1000000) (< 40 main_~y~0))} is VALID [2022-04-28 03:50:58,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {16249#(and (or (< main_~x~0 1000000) (< 40 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} [140] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {16249#(and (or (< main_~x~0 1000000) (< 40 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} is VALID [2022-04-28 03:50:58,993 INFO L290 TraceCheckUtils]: 6: Hoare triple {16256#(and (<= 0 (+ 499959 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 40 main_~y~0)))} [139] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_848 v_main_~x~0_847)) (.cse1 (= |v_main_#t~post4_127| |v_main_#t~post4_126|))) (or (and (< v_main_~x~0_847 500001) (< v_main_~x~0_848 v_main_~x~0_847)) (and (not (< v_main_~x~0_848 500000)) .cse0 .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_848, main_#t~post4=|v_main_#t~post4_127|} OutVars{main_~x~0=v_main_~x~0_847, main_#t~post4=|v_main_#t~post4_126|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {16249#(and (or (< main_~x~0 1000000) (< 40 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0))))} is VALID [2022-04-28 03:50:58,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {15993#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {16256#(and (<= 0 (+ 499959 main_~y~0)) (or (< main_~x~0 (+ main_~y~0 999960)) (<= 1000000 main_~x~0)) (or (< main_~x~0 1000000) (< 40 main_~y~0)))} is VALID [2022-04-28 03:50:58,994 INFO L272 TraceCheckUtils]: 4: Hoare triple {15993#true} call #t~ret9 := main(); {15993#true} is VALID [2022-04-28 03:50:58,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15993#true} {15993#true} #53#return; {15993#true} is VALID [2022-04-28 03:50:58,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {15993#true} assume true; {15993#true} is VALID [2022-04-28 03:50:58,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {15993#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(18, 2);call #Ultimate.allocInit(12, 3); {15993#true} is VALID [2022-04-28 03:50:58,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {15993#true} call ULTIMATE.init(); {15993#true} is VALID [2022-04-28 03:50:58,994 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 0 proven. 212 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:50:58,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111266244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:50:58,994 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:50:58,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 26, 26] total 72 [2022-04-28 03:51:00,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:00,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1346757061] [2022-04-28 03:51:00,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1346757061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:00,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:00,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-28 03:51:00,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676780043] [2022-04-28 03:51:00,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:00,581 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-28 03:51:00,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:00,581 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-28 03:51:00,652 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-28 03:51:00,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-28 03:51:00,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:00,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-28 03:51:00,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4079, Invalid=7263, Unknown=0, NotChecked=0, Total=11342 [2022-04-28 03:51:00,654 INFO L87 Difference]: Start difference. First operand 106 states and 110 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-28 03:51:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:06,715 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2022-04-28 03:51:06,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-28 03:51:06,716 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-28 03:51:06,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:06,716 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-28 03:51:06,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 132 transitions. [2022-04-28 03:51:06,718 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-28 03:51:06,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 132 transitions. [2022-04-28 03:51:06,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 132 transitions. [2022-04-28 03:51:06,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:06,853 INFO L225 Difference]: With dead ends: 209 [2022-04-28 03:51:06,853 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 03:51:06,856 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9139 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7712, Invalid=19020, Unknown=0, NotChecked=0, Total=26732 [2022-04-28 03:51:06,856 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 198 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2656 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 2878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 2656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:06,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 52 Invalid, 2878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 2656 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 03:51:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 03:51:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-04-28 03:51:07,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:07,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:07,058 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:07,058 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:07,060 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 03:51:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 03:51:07,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:07,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:07,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 111 states. [2022-04-28 03:51:07,061 INFO L87 Difference]: Start difference. First operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 111 states. [2022-04-28 03:51:07,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:07,063 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 03:51:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 03:51:07,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:07,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:07,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:07,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 104 states have (on average 1.0480769230769231) internal successors, (109), 105 states have internal predecessors, (109), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2022-04-28 03:51:07,066 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 102 [2022-04-28 03:51:07,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:07,066 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2022-04-28 03:51:07,066 INFO L496 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-28 03:51:07,067 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 115 transitions. [2022-04-28 03:51:07,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 03:51:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-28 03:51:07,183 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:07,183 INFO L195 NwaCegarLoop]: trace histogram [37, 36, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:07,209 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-28 03:51:07,383 WARN L477 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-28 03:51:07,383 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:07,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1486715030, now seen corresponding path program 21 times [2022-04-28 03:51:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:07,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1167741032] [2022-04-28 03:51:11,453 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:11,500 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-28 03:51:11,719 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-28 03:51:11,720 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:11,722 INFO L85 PathProgramCache]: Analyzing trace with hash -2082014591, now seen corresponding path program 1 times [2022-04-28 03:51:11,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:11,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119697649] [2022-04-28 03:51:11,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:11,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:12,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {17315#(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(18, 2);call #Ultimate.allocInit(12, 3); {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {17288#true} assume true; {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17288#true} {17288#true} #53#return; {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {17288#true} call ULTIMATE.init(); {17315#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:12,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {17315#(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(18, 2);call #Ultimate.allocInit(12, 3); {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {17288#true} assume true; {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17288#true} {17288#true} #53#return; {17288#true} is VALID [2022-04-28 03:51:12,059 INFO L272 TraceCheckUtils]: 4: Hoare triple {17288#true} call #t~ret9 := main(); {17288#true} is VALID [2022-04-28 03:51:12,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {17288#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,060 INFO L290 TraceCheckUtils]: 6: Hoare triple {17293#(<= 500000 main_~y~0)} [143] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_919 500001) (< v_main_~x~0_920 v_main_~x~0_919)) (and .cse0 (= v_main_~x~0_920 v_main_~x~0_919)) (and (<= 500000 v_main_~x~0_920) (= v_main_~x~0_919 v_main_~x~0_920) .cse0))) InVars {main_~x~0=v_main_~x~0_920, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_919, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {17293#(<= 500000 main_~y~0)} [144] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {17293#(<= 500000 main_~y~0)} [145] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_922 v_main_~x~0_921)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (<= 500000 v_main_~x~0_922)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_922 v_main_~y~0_951))) (and .cse4 (< v_main_~y~0_952 v_main_~y~0_951) (= .cse5 (+ v_main_~x~0_921 v_main_~y~0_952)) (< .cse5 (+ v_main_~y~0_952 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_922 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_922, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_951, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_921, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {17293#(<= 500000 main_~y~0)} [142] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {17293#(<= 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; {17294#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:12,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {17294#(<= 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; {17295#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:12,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {17295#(<= 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; {17296#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:12,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {17296#(<= 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; {17297#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:12,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {17297#(<= 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; {17298#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:12,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {17298#(<= 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; {17299#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:12,065 INFO L290 TraceCheckUtils]: 16: Hoare triple {17299#(<= 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; {17300#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:12,065 INFO L290 TraceCheckUtils]: 17: Hoare triple {17300#(<= 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; {17301#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:12,066 INFO L290 TraceCheckUtils]: 18: Hoare triple {17301#(<= 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; {17302#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:12,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {17302#(<= 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; {17303#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:12,067 INFO L290 TraceCheckUtils]: 20: Hoare triple {17303#(<= 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; {17304#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:12,067 INFO L290 TraceCheckUtils]: 21: Hoare triple {17304#(<= 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; {17305#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:12,067 INFO L290 TraceCheckUtils]: 22: Hoare triple {17305#(<= 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; {17306#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:12,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {17306#(<= 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; {17307#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:12,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {17307#(<= 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; {17308#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:12,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {17308#(<= 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; {17309#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:12,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {17309#(<= 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; {17310#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:12,070 INFO L290 TraceCheckUtils]: 27: Hoare triple {17310#(<= 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; {17311#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:12,070 INFO L290 TraceCheckUtils]: 28: Hoare triple {17311#(<= 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; {17312#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:12,071 INFO L290 TraceCheckUtils]: 29: Hoare triple {17312#(<= 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; {17313#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:12,071 INFO L290 TraceCheckUtils]: 30: Hoare triple {17313#(<= 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; {17314#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:12,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {17314#(<= 499958 main_~y~0)} assume !(~y~0 > 0); {17289#false} is VALID [2022-04-28 03:51:12,072 INFO L272 TraceCheckUtils]: 32: Hoare triple {17289#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {17289#false} is VALID [2022-04-28 03:51:12,072 INFO L290 TraceCheckUtils]: 33: Hoare triple {17289#false} ~cond := #in~cond; {17289#false} is VALID [2022-04-28 03:51:12,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {17289#false} assume 0 == ~cond; {17289#false} is VALID [2022-04-28 03:51:12,072 INFO L290 TraceCheckUtils]: 35: Hoare triple {17289#false} assume !false; {17289#false} is VALID [2022-04-28 03:51:12,072 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-28 03:51:12,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119697649] [2022-04-28 03:51:12,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119697649] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:12,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103994107] [2022-04-28 03:51:12,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:12,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:12,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:12,073 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-28 03:51:12,074 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-28 03:51:12,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:12,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 03:51:12,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:12,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:12,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {17288#true} call ULTIMATE.init(); {17288#true} is VALID [2022-04-28 03:51:12,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {17288#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(18, 2);call #Ultimate.allocInit(12, 3); {17288#true} is VALID [2022-04-28 03:51:12,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {17288#true} assume true; {17288#true} is VALID [2022-04-28 03:51:12,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17288#true} {17288#true} #53#return; {17288#true} is VALID [2022-04-28 03:51:12,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {17288#true} call #t~ret9 := main(); {17288#true} is VALID [2022-04-28 03:51:12,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {17288#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {17293#(<= 500000 main_~y~0)} [143] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_919 500001) (< v_main_~x~0_920 v_main_~x~0_919)) (and .cse0 (= v_main_~x~0_920 v_main_~x~0_919)) (and (<= 500000 v_main_~x~0_920) (= v_main_~x~0_919 v_main_~x~0_920) .cse0))) InVars {main_~x~0=v_main_~x~0_920, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_919, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {17293#(<= 500000 main_~y~0)} [144] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {17293#(<= 500000 main_~y~0)} [145] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_922 v_main_~x~0_921)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (<= 500000 v_main_~x~0_922)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_922 v_main_~y~0_951))) (and .cse4 (< v_main_~y~0_952 v_main_~y~0_951) (= .cse5 (+ v_main_~x~0_921 v_main_~y~0_952)) (< .cse5 (+ v_main_~y~0_952 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_922 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_922, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_951, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_921, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {17293#(<= 500000 main_~y~0)} [142] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {17293#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:12,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {17293#(<= 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; {17294#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:12,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {17294#(<= 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; {17295#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:12,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {17295#(<= 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; {17296#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:12,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {17296#(<= 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; {17297#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:12,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {17297#(<= 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; {17298#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:12,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {17298#(<= 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; {17299#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:12,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {17299#(<= 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; {17300#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:12,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {17300#(<= 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; {17301#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:12,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {17301#(<= 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; {17302#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:12,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {17302#(<= 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; {17303#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:12,586 INFO L290 TraceCheckUtils]: 20: Hoare triple {17303#(<= 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; {17304#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:12,587 INFO L290 TraceCheckUtils]: 21: Hoare triple {17304#(<= 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; {17305#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:12,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {17305#(<= 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; {17306#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:12,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {17306#(<= 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; {17307#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:12,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {17307#(<= 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; {17308#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:12,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {17308#(<= 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; {17309#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:12,591 INFO L290 TraceCheckUtils]: 26: Hoare triple {17309#(<= 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; {17310#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:12,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {17310#(<= 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; {17311#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:12,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {17311#(<= 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; {17312#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:12,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {17312#(<= 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; {17313#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:12,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {17313#(<= 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; {17314#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:12,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {17314#(<= 499958 main_~y~0)} assume !(~y~0 > 0); {17289#false} is VALID [2022-04-28 03:51:12,593 INFO L272 TraceCheckUtils]: 32: Hoare triple {17289#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {17289#false} is VALID [2022-04-28 03:51:12,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {17289#false} ~cond := #in~cond; {17289#false} is VALID [2022-04-28 03:51:12,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {17289#false} assume 0 == ~cond; {17289#false} is VALID [2022-04-28 03:51:12,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {17289#false} assume !false; {17289#false} is VALID [2022-04-28 03:51:12,594 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-28 03:51:12,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:13,529 INFO L290 TraceCheckUtils]: 35: Hoare triple {17289#false} assume !false; {17289#false} is VALID [2022-04-28 03:51:13,529 INFO L290 TraceCheckUtils]: 34: Hoare triple {17289#false} assume 0 == ~cond; {17289#false} is VALID [2022-04-28 03:51:13,529 INFO L290 TraceCheckUtils]: 33: Hoare triple {17289#false} ~cond := #in~cond; {17289#false} is VALID [2022-04-28 03:51:13,529 INFO L272 TraceCheckUtils]: 32: Hoare triple {17289#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {17289#false} is VALID [2022-04-28 03:51:13,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {17436#(< 0 main_~y~0)} assume !(~y~0 > 0); {17289#false} is VALID [2022-04-28 03:51:13,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {17440#(< 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; {17436#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:13,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {17444#(< 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; {17440#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:13,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {17448#(< 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; {17444#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:13,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(< 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; {17448#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:13,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {17456#(< 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; {17452#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:13,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {17460#(< 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; {17456#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:13,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {17464#(< 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; {17460#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:13,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {17468#(< 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; {17464#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:13,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {17472#(< 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; {17468#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:13,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {17476#(< 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; {17472#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:13,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {17480#(< 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; {17476#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:13,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {17484#(< 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; {17480#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:13,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {17488#(< 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; {17484#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:13,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {17492#(< 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; {17488#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:13,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {17496#(< 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; {17492#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:13,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {17500#(< 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; {17496#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:13,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {17504#(< 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; {17500#(< 32 main_~y~0)} is VALID [2022-04-28 03:51:13,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {17508#(< 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; {17504#(< 34 main_~y~0)} is VALID [2022-04-28 03:51:13,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {17512#(< 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; {17508#(< 36 main_~y~0)} is VALID [2022-04-28 03:51:13,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {17516#(< 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; {17512#(< 38 main_~y~0)} is VALID [2022-04-28 03:51:13,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {17520#(< 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; {17516#(< 40 main_~y~0)} is VALID [2022-04-28 03:51:13,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {17520#(< 42 main_~y~0)} [142] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {17520#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:13,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {17520#(< 42 main_~y~0)} [145] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_952 v_main_~y~0_951)) (.cse1 (= v_main_~x~0_922 v_main_~x~0_921)) (.cse2 (= |v_main_#t~post6_144| |v_main_#t~post6_143|)) (.cse4 (<= 500000 v_main_~x~0_922)) (.cse3 (= |v_main_#t~post5_144| |v_main_#t~post5_143|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_922 v_main_~y~0_951))) (and .cse4 (< v_main_~y~0_952 v_main_~y~0_951) (= .cse5 (+ v_main_~x~0_921 v_main_~y~0_952)) (< .cse5 (+ v_main_~y~0_952 1000001)))) (and .cse0 .cse1 .cse2 (or (not (< v_main_~x~0_922 1000000)) (not .cse4)) .cse3))) InVars {main_~y~0=v_main_~y~0_952, main_#t~post5=|v_main_#t~post5_144|, main_~x~0=v_main_~x~0_922, main_#t~post6=|v_main_#t~post6_144|} OutVars{main_~y~0=v_main_~y~0_951, main_#t~post5=|v_main_#t~post5_143|, main_~x~0=v_main_~x~0_921, main_#t~post6=|v_main_#t~post6_143|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {17520#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:13,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {17520#(< 42 main_~y~0)} [144] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17520#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:13,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {17520#(< 42 main_~y~0)} [143] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_134| |v_main_#t~post4_133|))) (or (and (< v_main_~x~0_919 500001) (< v_main_~x~0_920 v_main_~x~0_919)) (and .cse0 (= v_main_~x~0_920 v_main_~x~0_919)) (and (<= 500000 v_main_~x~0_920) (= v_main_~x~0_919 v_main_~x~0_920) .cse0))) InVars {main_~x~0=v_main_~x~0_920, main_#t~post4=|v_main_#t~post4_134|} OutVars{main_~x~0=v_main_~x~0_919, main_#t~post4=|v_main_#t~post4_133|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {17520#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:13,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {17288#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {17520#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:13,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {17288#true} call #t~ret9 := main(); {17288#true} is VALID [2022-04-28 03:51:13,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17288#true} {17288#true} #53#return; {17288#true} is VALID [2022-04-28 03:51:13,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {17288#true} assume true; {17288#true} is VALID [2022-04-28 03:51:13,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {17288#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(18, 2);call #Ultimate.allocInit(12, 3); {17288#true} is VALID [2022-04-28 03:51:13,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {17288#true} call ULTIMATE.init(); {17288#true} is VALID [2022-04-28 03:51:13,542 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-28 03:51:13,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103994107] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:13,542 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:13,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 47 [2022-04-28 03:51:14,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:14,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1167741032] [2022-04-28 03:51:14,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1167741032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:14,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:14,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-28 03:51:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232667524] [2022-04-28 03:51:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:14,915 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-28 03:51:14,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:14,916 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-28 03:51:14,993 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-28 03:51:14,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-28 03:51:14,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:14,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-28 03:51:14,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2822, Invalid=4318, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 03:51:14,995 INFO L87 Difference]: Start difference. First operand 111 states and 115 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-28 03:51:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:21,044 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2022-04-28 03:51:21,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-28 03:51:21,044 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-28 03:51:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:21,045 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-28 03:51:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 137 transitions. [2022-04-28 03:51:21,047 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-28 03:51:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 137 transitions. [2022-04-28 03:51:21,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 137 transitions. [2022-04-28 03:51:21,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:21,190 INFO L225 Difference]: With dead ends: 219 [2022-04-28 03:51:21,190 INFO L226 Difference]: Without dead ends: 116 [2022-04-28 03:51:21,192 INFO L412 NwaCegarLoop]: 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-28 03:51:21,193 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 89 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:21,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 57 Invalid, 3075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 03:51:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-28 03:51:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-04-28 03:51:21,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:21,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:21,396 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:21,396 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:21,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:21,398 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-28 03:51:21,398 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 03:51:21,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:21,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:21,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 116 states. [2022-04-28 03:51:21,398 INFO L87 Difference]: Start difference. First operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 116 states. [2022-04-28 03:51:21,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:21,400 INFO L93 Difference]: Finished difference Result 116 states and 120 transitions. [2022-04-28 03:51:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 03:51:21,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:21,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:21,400 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:21,400 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:21,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 110 states have internal predecessors, (114), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:21,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-28 03:51:21,402 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 107 [2022-04-28 03:51:21,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:21,402 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-28 03:51:21,402 INFO L496 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-28 03:51:21,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-28 03:51:21,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-28 03:51:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-04-28 03:51:21,517 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:21,517 INFO L195 NwaCegarLoop]: trace histogram [39, 38, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:21,537 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-28 03:51:21,731 WARN L477 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-28 03:51:21,732 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:21,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:21,732 INFO L85 PathProgramCache]: Analyzing trace with hash 2128661847, now seen corresponding path program 22 times [2022-04-28 03:51:21,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:21,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738405811] [2022-04-28 03:51:21,835 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-28 03:51:25,948 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:51:26,058 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-28 03:51:26,059 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:26,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1176371070, now seen corresponding path program 1 times [2022-04-28 03:51:26,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:26,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241982382] [2022-04-28 03:51:26,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:26,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:26,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:26,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:26,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:26,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {18641#(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(18, 2);call #Ultimate.allocInit(12, 3); {18613#true} is VALID [2022-04-28 03:51:26,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {18613#true} assume true; {18613#true} is VALID [2022-04-28 03:51:26,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18613#true} {18613#true} #53#return; {18613#true} is VALID [2022-04-28 03:51:26,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {18613#true} call ULTIMATE.init(); {18641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:26,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {18641#(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(18, 2);call #Ultimate.allocInit(12, 3); {18613#true} is VALID [2022-04-28 03:51:26,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {18613#true} assume true; {18613#true} is VALID [2022-04-28 03:51:26,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18613#true} {18613#true} #53#return; {18613#true} is VALID [2022-04-28 03:51:26,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {18613#true} call #t~ret9 := main(); {18613#true} is VALID [2022-04-28 03:51:26,394 INFO L290 TraceCheckUtils]: 5: Hoare triple {18613#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,394 INFO L290 TraceCheckUtils]: 6: Hoare triple {18618#(<= 500000 main_~y~0)} [147] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_994 v_main_~x~0_993))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (< v_main_~x~0_994 v_main_~x~0_993) (< v_main_~x~0_993 500001)) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) .cse0 (not (< v_main_~x~0_994 500000))))) InVars {main_~x~0=v_main_~x~0_994, main_#t~post4=|v_main_#t~post4_140|} OutVars{main_~x~0=v_main_~x~0_993, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,395 INFO L290 TraceCheckUtils]: 7: Hoare triple {18618#(<= 500000 main_~y~0)} [148] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {18618#(<= 500000 main_~y~0)} [149] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_996)) (.cse2 (= v_main_~x~0_996 v_main_~x~0_995)) (.cse3 (= v_main_~y~0_1039 v_main_~y~0_1038)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_996 v_main_~y~0_1038))) (and (< .cse0 (+ 1000001 v_main_~y~0_1039)) (< v_main_~y~0_1039 v_main_~y~0_1038) (= (+ v_main_~x~0_995 v_main_~y~0_1039) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_996 1000000)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_996, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1038, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_995, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {18618#(<= 500000 main_~y~0)} [146] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {18618#(<= 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; {18619#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:26,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {18619#(<= 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; {18620#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:26,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {18620#(<= 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; {18621#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:26,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {18621#(<= 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; {18622#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:26,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {18622#(<= 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; {18623#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:26,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {18623#(<= 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; {18624#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:26,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {18624#(<= 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; {18625#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:26,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {18625#(<= 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; {18626#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:26,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {18626#(<= 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; {18627#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:26,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {18627#(<= 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; {18628#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:26,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {18628#(<= 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; {18629#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:26,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {18629#(<= 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; {18630#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:26,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {18630#(<= 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; {18631#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:26,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {18631#(<= 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; {18632#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:26,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {18632#(<= 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; {18633#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:26,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {18633#(<= 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; {18634#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:26,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {18634#(<= 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; {18635#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:26,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {18635#(<= 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; {18636#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:26,407 INFO L290 TraceCheckUtils]: 28: Hoare triple {18636#(<= 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; {18637#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:26,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {18637#(<= 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; {18638#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:26,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {18638#(<= 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; {18639#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:26,408 INFO L290 TraceCheckUtils]: 31: Hoare triple {18639#(<= 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; {18640#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:51:26,409 INFO L290 TraceCheckUtils]: 32: Hoare triple {18640#(<= 499956 main_~y~0)} assume !(~y~0 > 0); {18614#false} is VALID [2022-04-28 03:51:26,409 INFO L272 TraceCheckUtils]: 33: Hoare triple {18614#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {18614#false} is VALID [2022-04-28 03:51:26,409 INFO L290 TraceCheckUtils]: 34: Hoare triple {18614#false} ~cond := #in~cond; {18614#false} is VALID [2022-04-28 03:51:26,409 INFO L290 TraceCheckUtils]: 35: Hoare triple {18614#false} assume 0 == ~cond; {18614#false} is VALID [2022-04-28 03:51:26,409 INFO L290 TraceCheckUtils]: 36: Hoare triple {18614#false} assume !false; {18614#false} is VALID [2022-04-28 03:51:26,409 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-28 03:51:26,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:26,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241982382] [2022-04-28 03:51:26,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241982382] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:26,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696083026] [2022-04-28 03:51:26,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:26,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:26,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:26,411 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-28 03:51:26,411 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-28 03:51:26,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:26,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 03:51:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:26,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:26,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {18613#true} call ULTIMATE.init(); {18613#true} is VALID [2022-04-28 03:51:26,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {18613#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(18, 2);call #Ultimate.allocInit(12, 3); {18613#true} is VALID [2022-04-28 03:51:26,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {18613#true} assume true; {18613#true} is VALID [2022-04-28 03:51:26,876 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18613#true} {18613#true} #53#return; {18613#true} is VALID [2022-04-28 03:51:26,876 INFO L272 TraceCheckUtils]: 4: Hoare triple {18613#true} call #t~ret9 := main(); {18613#true} is VALID [2022-04-28 03:51:26,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {18613#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {18618#(<= 500000 main_~y~0)} [147] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_994 v_main_~x~0_993))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (< v_main_~x~0_994 v_main_~x~0_993) (< v_main_~x~0_993 500001)) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) .cse0 (not (< v_main_~x~0_994 500000))))) InVars {main_~x~0=v_main_~x~0_994, main_#t~post4=|v_main_#t~post4_140|} OutVars{main_~x~0=v_main_~x~0_993, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {18618#(<= 500000 main_~y~0)} [148] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {18618#(<= 500000 main_~y~0)} [149] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_996)) (.cse2 (= v_main_~x~0_996 v_main_~x~0_995)) (.cse3 (= v_main_~y~0_1039 v_main_~y~0_1038)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_996 v_main_~y~0_1038))) (and (< .cse0 (+ 1000001 v_main_~y~0_1039)) (< v_main_~y~0_1039 v_main_~y~0_1038) (= (+ v_main_~x~0_995 v_main_~y~0_1039) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_996 1000000)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_996, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1038, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_995, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {18618#(<= 500000 main_~y~0)} [146] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {18618#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:26,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {18618#(<= 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; {18619#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:26,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {18619#(<= 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; {18620#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:26,879 INFO L290 TraceCheckUtils]: 12: Hoare triple {18620#(<= 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; {18621#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:26,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {18621#(<= 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; {18622#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:26,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {18622#(<= 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; {18623#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:26,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {18623#(<= 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; {18624#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:26,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {18624#(<= 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; {18625#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:26,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {18625#(<= 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; {18626#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:26,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {18626#(<= 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; {18627#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:26,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {18627#(<= 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; {18628#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:26,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {18628#(<= 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; {18629#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:26,883 INFO L290 TraceCheckUtils]: 21: Hoare triple {18629#(<= 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; {18630#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:26,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {18630#(<= 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; {18631#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:26,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {18631#(<= 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; {18632#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:26,885 INFO L290 TraceCheckUtils]: 24: Hoare triple {18632#(<= 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; {18633#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:26,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {18633#(<= 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; {18634#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:26,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {18634#(<= 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; {18635#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:26,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {18635#(<= 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; {18636#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:26,887 INFO L290 TraceCheckUtils]: 28: Hoare triple {18636#(<= 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; {18637#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:26,887 INFO L290 TraceCheckUtils]: 29: Hoare triple {18637#(<= 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; {18638#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:26,888 INFO L290 TraceCheckUtils]: 30: Hoare triple {18638#(<= 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; {18639#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:26,888 INFO L290 TraceCheckUtils]: 31: Hoare triple {18639#(<= 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; {18640#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:51:26,888 INFO L290 TraceCheckUtils]: 32: Hoare triple {18640#(<= 499956 main_~y~0)} assume !(~y~0 > 0); {18614#false} is VALID [2022-04-28 03:51:26,889 INFO L272 TraceCheckUtils]: 33: Hoare triple {18614#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {18614#false} is VALID [2022-04-28 03:51:26,889 INFO L290 TraceCheckUtils]: 34: Hoare triple {18614#false} ~cond := #in~cond; {18614#false} is VALID [2022-04-28 03:51:26,889 INFO L290 TraceCheckUtils]: 35: Hoare triple {18614#false} assume 0 == ~cond; {18614#false} is VALID [2022-04-28 03:51:26,889 INFO L290 TraceCheckUtils]: 36: Hoare triple {18614#false} assume !false; {18614#false} is VALID [2022-04-28 03:51:26,889 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-28 03:51:26,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:27,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {18614#false} assume !false; {18614#false} is VALID [2022-04-28 03:51:27,817 INFO L290 TraceCheckUtils]: 35: Hoare triple {18614#false} assume 0 == ~cond; {18614#false} is VALID [2022-04-28 03:51:27,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {18614#false} ~cond := #in~cond; {18614#false} is VALID [2022-04-28 03:51:27,817 INFO L272 TraceCheckUtils]: 33: Hoare triple {18614#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {18614#false} is VALID [2022-04-28 03:51:27,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {18765#(< 0 main_~y~0)} assume !(~y~0 > 0); {18614#false} is VALID [2022-04-28 03:51:27,818 INFO L290 TraceCheckUtils]: 31: Hoare triple {18769#(< 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; {18765#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:27,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {18773#(< 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; {18769#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:27,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {18777#(< 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; {18773#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:27,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {18781#(< 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; {18777#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:27,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {18785#(< 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; {18781#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:27,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {18789#(< 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; {18785#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:27,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {18793#(< 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; {18789#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:27,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {18797#(< 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; {18793#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:27,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {18801#(< 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; {18797#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:27,822 INFO L290 TraceCheckUtils]: 22: Hoare triple {18805#(< 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; {18801#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:27,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {18809#(< 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; {18805#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:27,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {18813#(< 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; {18809#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:27,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {18817#(< 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; {18813#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:27,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {18821#(< 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; {18817#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:27,824 INFO L290 TraceCheckUtils]: 17: Hoare triple {18825#(< 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; {18821#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:27,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {18829#(< 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; {18825#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:27,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {18833#(< 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; {18829#(< 32 main_~y~0)} is VALID [2022-04-28 03:51:27,826 INFO L290 TraceCheckUtils]: 14: Hoare triple {18837#(< 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; {18833#(< 34 main_~y~0)} is VALID [2022-04-28 03:51:27,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {18841#(< 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; {18837#(< 36 main_~y~0)} is VALID [2022-04-28 03:51:27,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {18845#(< 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; {18841#(< 38 main_~y~0)} is VALID [2022-04-28 03:51:27,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {18849#(< 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; {18845#(< 40 main_~y~0)} is VALID [2022-04-28 03:51:27,828 INFO L290 TraceCheckUtils]: 10: Hoare triple {18853#(< 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; {18849#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:27,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {18853#(< 44 main_~y~0)} [146] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {18853#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:27,829 INFO L290 TraceCheckUtils]: 8: Hoare triple {18853#(< 44 main_~y~0)} [149] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_996)) (.cse2 (= v_main_~x~0_996 v_main_~x~0_995)) (.cse3 (= v_main_~y~0_1039 v_main_~y~0_1038)) (.cse4 (= |v_main_#t~post6_151| |v_main_#t~post6_150|)) (.cse5 (= |v_main_#t~post5_151| |v_main_#t~post5_150|))) (or (let ((.cse0 (+ v_main_~x~0_996 v_main_~y~0_1038))) (and (< .cse0 (+ 1000001 v_main_~y~0_1039)) (< v_main_~y~0_1039 v_main_~y~0_1038) (= (+ v_main_~x~0_995 v_main_~y~0_1039) .cse0) .cse1)) (and .cse2 .cse3 .cse4 .cse5) (and (or (not (< v_main_~x~0_996 1000000)) (not .cse1)) .cse2 .cse3 .cse4 .cse5))) InVars {main_~y~0=v_main_~y~0_1039, main_#t~post5=|v_main_#t~post5_151|, main_~x~0=v_main_~x~0_996, main_#t~post6=|v_main_#t~post6_151|} OutVars{main_~y~0=v_main_~y~0_1038, main_#t~post5=|v_main_#t~post5_150|, main_~x~0=v_main_~x~0_995, main_#t~post6=|v_main_#t~post6_150|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {18853#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:27,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {18853#(< 44 main_~y~0)} [148] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18853#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:27,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {18853#(< 44 main_~y~0)} [147] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_994 v_main_~x~0_993))) (or (and (= |v_main_#t~post4_140| |v_main_#t~post4_139|) .cse0) (and (< v_main_~x~0_994 v_main_~x~0_993) (< v_main_~x~0_993 500001)) (and (= |v_main_#t~post4_139| |v_main_#t~post4_140|) .cse0 (not (< v_main_~x~0_994 500000))))) InVars {main_~x~0=v_main_~x~0_994, main_#t~post4=|v_main_#t~post4_140|} OutVars{main_~x~0=v_main_~x~0_993, main_#t~post4=|v_main_#t~post4_139|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {18853#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:27,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {18613#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {18853#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:27,830 INFO L272 TraceCheckUtils]: 4: Hoare triple {18613#true} call #t~ret9 := main(); {18613#true} is VALID [2022-04-28 03:51:27,830 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18613#true} {18613#true} #53#return; {18613#true} is VALID [2022-04-28 03:51:27,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {18613#true} assume true; {18613#true} is VALID [2022-04-28 03:51:27,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {18613#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(18, 2);call #Ultimate.allocInit(12, 3); {18613#true} is VALID [2022-04-28 03:51:27,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {18613#true} call ULTIMATE.init(); {18613#true} is VALID [2022-04-28 03:51:27,830 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-28 03:51:27,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696083026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:27,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:27,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 49 [2022-04-28 03:51:29,272 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:29,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [738405811] [2022-04-28 03:51:29,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [738405811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:29,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:29,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-28 03:51:29,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035393955] [2022-04-28 03:51:29,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:29,272 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-28 03:51:29,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:29,273 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-28 03:51:29,351 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-28 03:51:29,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-28 03:51:29,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:29,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-28 03:51:29,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3089, Invalid=4743, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 03:51:29,352 INFO L87 Difference]: Start difference. First operand 116 states and 120 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-28 03:51:36,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:36,294 INFO L93 Difference]: Finished difference Result 229 states and 242 transitions. [2022-04-28 03:51:36,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-28 03:51:36,294 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-28 03:51:36,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:36,294 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-28 03:51:36,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-28 03:51:36,296 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-28 03:51:36,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 142 transitions. [2022-04-28 03:51:36,297 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 142 transitions. [2022-04-28 03:51:36,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:36,453 INFO L225 Difference]: With dead ends: 229 [2022-04-28 03:51:36,453 INFO L226 Difference]: Without dead ends: 121 [2022-04-28 03:51:36,455 INFO L412 NwaCegarLoop]: 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-28 03:51:36,455 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 218 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3208 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 3497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 3208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:36,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 32 Invalid, 3497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 3208 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-28 03:51:36,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-28 03:51:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-04-28 03:51:36,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:36,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:36,631 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:36,631 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:36,633 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-28 03:51:36,633 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:51:36,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:36,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:36,633 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 121 states. [2022-04-28 03:51:36,634 INFO L87 Difference]: Start difference. First operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 121 states. [2022-04-28 03:51:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:36,635 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-04-28 03:51:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:51:36,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:36,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:36,636 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:36,636 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 114 states have (on average 1.043859649122807) internal successors, (119), 115 states have internal predecessors, (119), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:36,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-04-28 03:51:36,637 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 112 [2022-04-28 03:51:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:36,638 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-04-28 03:51:36,638 INFO L496 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-28 03:51:36,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 125 transitions. [2022-04-28 03:51:36,749 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-28 03:51:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-04-28 03:51:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-28 03:51:36,750 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:36,750 INFO L195 NwaCegarLoop]: trace histogram [41, 40, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:36,771 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-28 03:51:36,959 WARN L477 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-28 03:51:36,959 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:36,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:36,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1293746274, now seen corresponding path program 23 times [2022-04-28 03:51:36,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:36,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [394292657] [2022-04-28 03:51:37,062 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-28 03:51:37,313 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-28 03:51:37,315 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1597727583, now seen corresponding path program 1 times [2022-04-28 03:51:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:37,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159101121] [2022-04-28 03:51:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:37,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:37,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:37,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {20023#(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(18, 2);call #Ultimate.allocInit(12, 3); {19994#true} is VALID [2022-04-28 03:51:37,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {19994#true} assume true; {19994#true} is VALID [2022-04-28 03:51:37,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19994#true} {19994#true} #53#return; {19994#true} is VALID [2022-04-28 03:51:37,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {19994#true} call ULTIMATE.init(); {20023#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:37,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {20023#(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(18, 2);call #Ultimate.allocInit(12, 3); {19994#true} is VALID [2022-04-28 03:51:37,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {19994#true} assume true; {19994#true} is VALID [2022-04-28 03:51:37,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19994#true} {19994#true} #53#return; {19994#true} is VALID [2022-04-28 03:51:37,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {19994#true} call #t~ret9 := main(); {19994#true} is VALID [2022-04-28 03:51:37,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {19994#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {19999#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:37,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {19999#(<= 500000 main_~y~0)} [151] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_146| |v_main_#t~post4_145|)) (.cse1 (= v_main_~x~0_1071 v_main_~x~0_1070))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1071) .cse0 .cse1) (and (< v_main_~x~0_1071 v_main_~x~0_1070) (< v_main_~x~0_1070 500001)))) InVars {main_~x~0=v_main_~x~0_1071, main_#t~post4=|v_main_#t~post4_146|} OutVars{main_~x~0=v_main_~x~0_1070, main_#t~post4=|v_main_#t~post4_145|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {19999#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:37,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {19999#(<= 500000 main_~y~0)} [152] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {19999#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:37,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {19999#(<= 500000 main_~y~0)} [153] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1073 v_main_~x~0_1072)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse3 (<= 500000 v_main_~x~0_1073))) (or (and .cse0 .cse1 (= v_main_~y~0_1130 v_main_~y~0_1129) .cse2) (and .cse0 .cse1 (= v_main_~y~0_1129 v_main_~y~0_1130) (or (not (< v_main_~x~0_1073 1000000)) (not .cse3)) .cse2) (and (< v_main_~x~0_1072 1000001) (< v_main_~x~0_1073 v_main_~x~0_1072) .cse3 (= (+ v_main_~x~0_1073 v_main_~y~0_1129) (+ v_main_~x~0_1072 v_main_~y~0_1130))))) InVars {main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1073, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1129, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1072, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {19999#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:37,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {19999#(<= 500000 main_~y~0)} [150] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {19999#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:37,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {19999#(<= 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; {20000#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:37,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {20000#(<= 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; {20001#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:37,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {20001#(<= 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; {20002#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:37,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {20002#(<= 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; {20003#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:37,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {20003#(<= 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; {20004#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:37,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {20004#(<= 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; {20005#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:37,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {20005#(<= 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; {20006#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:37,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {20006#(<= 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; {20007#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:37,746 INFO L290 TraceCheckUtils]: 18: Hoare triple {20007#(<= 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; {20008#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:37,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {20008#(<= 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; {20009#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:37,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {20009#(<= 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; {20010#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:37,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {20010#(<= 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; {20011#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:37,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {20011#(<= 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; {20012#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:37,749 INFO L290 TraceCheckUtils]: 23: Hoare triple {20012#(<= 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; {20013#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:37,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {20013#(<= 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; {20014#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:37,750 INFO L290 TraceCheckUtils]: 25: Hoare triple {20014#(<= 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; {20015#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:37,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {20015#(<= 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; {20016#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:37,751 INFO L290 TraceCheckUtils]: 27: Hoare triple {20016#(<= 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; {20017#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:37,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {20017#(<= 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; {20018#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:37,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {20018#(<= 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; {20019#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:37,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {20019#(<= 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; {20020#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:37,754 INFO L290 TraceCheckUtils]: 31: Hoare triple {20020#(<= 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; {20021#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:51:37,755 INFO L290 TraceCheckUtils]: 32: Hoare triple {20021#(<= 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; {20022#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:51:37,755 INFO L290 TraceCheckUtils]: 33: Hoare triple {20022#(<= 499954 main_~y~0)} assume !(~y~0 > 0); {19995#false} is VALID [2022-04-28 03:51:37,755 INFO L272 TraceCheckUtils]: 34: Hoare triple {19995#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {19995#false} is VALID [2022-04-28 03:51:37,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {19995#false} ~cond := #in~cond; {19995#false} is VALID [2022-04-28 03:51:37,755 INFO L290 TraceCheckUtils]: 36: Hoare triple {19995#false} assume 0 == ~cond; {19995#false} is VALID [2022-04-28 03:51:37,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {19995#false} assume !false; {19995#false} is VALID [2022-04-28 03:51:37,756 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-28 03:51:37,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159101121] [2022-04-28 03:51:37,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159101121] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:37,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99544027] [2022-04-28 03:51:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:37,757 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-28 03:51:37,758 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-28 03:51:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:37,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:51:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:37,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:38,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {19994#true} call ULTIMATE.init(); {19994#true} is VALID [2022-04-28 03:51:38,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {19994#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(18, 2);call #Ultimate.allocInit(12, 3); {19994#true} is VALID [2022-04-28 03:51:38,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {19994#true} assume true; {19994#true} is VALID [2022-04-28 03:51:38,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19994#true} {19994#true} #53#return; {19994#true} is VALID [2022-04-28 03:51:38,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {19994#true} call #t~ret9 := main(); {19994#true} is VALID [2022-04-28 03:51:38,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {19994#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {20042#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:51:38,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {20042#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [151] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_146| |v_main_#t~post4_145|)) (.cse1 (= v_main_~x~0_1071 v_main_~x~0_1070))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1071) .cse0 .cse1) (and (< v_main_~x~0_1071 v_main_~x~0_1070) (< v_main_~x~0_1070 500001)))) InVars {main_~x~0=v_main_~x~0_1071, main_#t~post4=|v_main_#t~post4_146|} OutVars{main_~x~0=v_main_~x~0_1070, main_#t~post4=|v_main_#t~post4_145|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {20046#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:51:38,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {20046#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [152] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20046#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:51:38,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {20046#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [153] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1073 v_main_~x~0_1072)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse3 (<= 500000 v_main_~x~0_1073))) (or (and .cse0 .cse1 (= v_main_~y~0_1130 v_main_~y~0_1129) .cse2) (and .cse0 .cse1 (= v_main_~y~0_1129 v_main_~y~0_1130) (or (not (< v_main_~x~0_1073 1000000)) (not .cse3)) .cse2) (and (< v_main_~x~0_1072 1000001) (< v_main_~x~0_1073 v_main_~x~0_1072) .cse3 (= (+ v_main_~x~0_1073 v_main_~y~0_1129) (+ v_main_~x~0_1072 v_main_~y~0_1130))))) InVars {main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1073, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1129, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1072, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20053#(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-28 03:51:38,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {20053#(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)))} [150] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {20057#(< 999999 main_~y~0)} is VALID [2022-04-28 03:51:38,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {20057#(< 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; {20061#(< 999997 main_~y~0)} is VALID [2022-04-28 03:51:38,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {20061#(< 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; {20065#(< 999995 main_~y~0)} is VALID [2022-04-28 03:51:38,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {20065#(< 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; {20069#(< 999993 main_~y~0)} is VALID [2022-04-28 03:51:38,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {20069#(< 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; {20073#(< 999991 main_~y~0)} is VALID [2022-04-28 03:51:38,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {20073#(< 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; {20077#(< 999989 main_~y~0)} is VALID [2022-04-28 03:51:38,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {20077#(< 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; {20081#(< 999987 main_~y~0)} is VALID [2022-04-28 03:51:38,644 INFO L290 TraceCheckUtils]: 16: Hoare triple {20081#(< 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; {20085#(< 999985 main_~y~0)} is VALID [2022-04-28 03:51:38,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {20085#(< 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; {20089#(< 999983 main_~y~0)} is VALID [2022-04-28 03:51:38,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {20089#(< 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; {20093#(< 999981 main_~y~0)} is VALID [2022-04-28 03:51:38,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {20093#(< 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; {20097#(< 999979 main_~y~0)} is VALID [2022-04-28 03:51:38,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {20097#(< 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; {20101#(< 999977 main_~y~0)} is VALID [2022-04-28 03:51:38,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {20101#(< 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; {20105#(< 999975 main_~y~0)} is VALID [2022-04-28 03:51:38,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {20105#(< 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; {20109#(< 999973 main_~y~0)} is VALID [2022-04-28 03:51:38,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {20109#(< 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; {20113#(< 999971 main_~y~0)} is VALID [2022-04-28 03:51:38,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {20113#(< 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; {20117#(< 999969 main_~y~0)} is VALID [2022-04-28 03:51:38,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {20117#(< 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; {20121#(< 999967 main_~y~0)} is VALID [2022-04-28 03:51:38,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {20121#(< 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; {20125#(< 999965 main_~y~0)} is VALID [2022-04-28 03:51:38,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {20125#(< 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; {20129#(< 999963 main_~y~0)} is VALID [2022-04-28 03:51:38,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {20129#(< 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; {20133#(< 999961 main_~y~0)} is VALID [2022-04-28 03:51:38,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {20133#(< 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; {20137#(< 999959 main_~y~0)} is VALID [2022-04-28 03:51:38,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {20137#(< 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; {20141#(< 999957 main_~y~0)} is VALID [2022-04-28 03:51:38,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {20141#(< 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; {20145#(< 999955 main_~y~0)} is VALID [2022-04-28 03:51:38,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {20145#(< 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; {20149#(< 999953 main_~y~0)} is VALID [2022-04-28 03:51:38,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {20149#(< 999953 main_~y~0)} assume !(~y~0 > 0); {19995#false} is VALID [2022-04-28 03:51:38,652 INFO L272 TraceCheckUtils]: 34: Hoare triple {19995#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {19995#false} is VALID [2022-04-28 03:51:38,652 INFO L290 TraceCheckUtils]: 35: Hoare triple {19995#false} ~cond := #in~cond; {19995#false} is VALID [2022-04-28 03:51:38,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {19995#false} assume 0 == ~cond; {19995#false} is VALID [2022-04-28 03:51:38,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {19995#false} assume !false; {19995#false} is VALID [2022-04-28 03:51:38,653 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:38,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:39,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {19995#false} assume !false; {19995#false} is VALID [2022-04-28 03:51:39,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {19995#false} assume 0 == ~cond; {19995#false} is VALID [2022-04-28 03:51:39,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {19995#false} ~cond := #in~cond; {19995#false} is VALID [2022-04-28 03:51:39,961 INFO L272 TraceCheckUtils]: 34: Hoare triple {19995#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {19995#false} is VALID [2022-04-28 03:51:39,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {20177#(< 0 main_~y~0)} assume !(~y~0 > 0); {19995#false} is VALID [2022-04-28 03:51:39,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {20181#(< 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; {20177#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:39,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {20185#(< 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; {20181#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:39,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {20189#(< 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; {20185#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:39,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {20193#(< 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; {20189#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:39,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {20197#(< 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; {20193#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:39,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {20201#(< 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; {20197#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:39,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {20205#(< 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; {20201#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:39,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {20209#(< 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; {20205#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:39,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {20213#(< 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; {20209#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:39,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {20217#(< 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; {20213#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:39,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {20221#(< 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; {20217#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:39,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {20225#(< 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; {20221#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:39,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {20229#(< 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; {20225#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:39,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {20233#(< 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; {20229#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:39,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {20237#(< 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; {20233#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:39,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {20241#(< 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; {20237#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:39,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {20245#(< 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; {20241#(< 32 main_~y~0)} is VALID [2022-04-28 03:51:39,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {20249#(< 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; {20245#(< 34 main_~y~0)} is VALID [2022-04-28 03:51:39,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {20253#(< 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; {20249#(< 36 main_~y~0)} is VALID [2022-04-28 03:51:39,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {20257#(< 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; {20253#(< 38 main_~y~0)} is VALID [2022-04-28 03:51:39,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {20261#(< 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; {20257#(< 40 main_~y~0)} is VALID [2022-04-28 03:51:39,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {20265#(< 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; {20261#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:39,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {20269#(< 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; {20265#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:39,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {20273#(or (< 46 main_~y~0) (< main_~x~0 1000000))} [150] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {20269#(< 46 main_~y~0)} is VALID [2022-04-28 03:51:39,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {20277#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999954))) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} [153] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1073 v_main_~x~0_1072)) (.cse1 (= |v_main_#t~post6_158| |v_main_#t~post6_157|)) (.cse2 (= |v_main_#t~post5_158| |v_main_#t~post5_157|)) (.cse3 (<= 500000 v_main_~x~0_1073))) (or (and .cse0 .cse1 (= v_main_~y~0_1130 v_main_~y~0_1129) .cse2) (and .cse0 .cse1 (= v_main_~y~0_1129 v_main_~y~0_1130) (or (not (< v_main_~x~0_1073 1000000)) (not .cse3)) .cse2) (and (< v_main_~x~0_1072 1000001) (< v_main_~x~0_1073 v_main_~x~0_1072) .cse3 (= (+ v_main_~x~0_1073 v_main_~y~0_1129) (+ v_main_~x~0_1072 v_main_~y~0_1130))))) InVars {main_~y~0=v_main_~y~0_1130, main_#t~post5=|v_main_#t~post5_158|, main_~x~0=v_main_~x~0_1073, main_#t~post6=|v_main_#t~post6_158|} OutVars{main_~y~0=v_main_~y~0_1129, main_#t~post5=|v_main_#t~post5_157|, main_~x~0=v_main_~x~0_1072, main_#t~post6=|v_main_#t~post6_157|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {20273#(or (< 46 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:51:39,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {20277#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999954))) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} [152] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {20277#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999954))) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:51:39,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {20284#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999954))) (<= 0 (+ main_~y~0 499953)) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} [151] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_146| |v_main_#t~post4_145|)) (.cse1 (= v_main_~x~0_1071 v_main_~x~0_1070))) (or (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_1071) .cse0 .cse1) (and (< v_main_~x~0_1071 v_main_~x~0_1070) (< v_main_~x~0_1070 500001)))) InVars {main_~x~0=v_main_~x~0_1071, main_#t~post4=|v_main_#t~post4_146|} OutVars{main_~x~0=v_main_~x~0_1070, main_#t~post4=|v_main_#t~post4_145|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {20277#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999954))) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:51:39,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {19994#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {20284#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999954))) (<= 0 (+ main_~y~0 499953)) (or (< 46 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:51:39,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {19994#true} call #t~ret9 := main(); {19994#true} is VALID [2022-04-28 03:51:39,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19994#true} {19994#true} #53#return; {19994#true} is VALID [2022-04-28 03:51:39,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {19994#true} assume true; {19994#true} is VALID [2022-04-28 03:51:39,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {19994#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(18, 2);call #Ultimate.allocInit(12, 3); {19994#true} is VALID [2022-04-28 03:51:39,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {19994#true} call ULTIMATE.init(); {19994#true} is VALID [2022-04-28 03:51:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 278 backedges. 0 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:51:39,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [99544027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:39,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:39,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 29, 29] total 81 [2022-04-28 03:51:41,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:41,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [394292657] [2022-04-28 03:51:41,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [394292657] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:41,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:41,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-28 03:51:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767249583] [2022-04-28 03:51:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:41,929 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-28 03:51:41,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:41,930 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-28 03:51:42,018 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-28 03:51:42,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-28 03:51:42,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:42,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-28 03:51:42,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5276, Invalid=9486, Unknown=0, NotChecked=0, Total=14762 [2022-04-28 03:51:42,020 INFO L87 Difference]: Start difference. First operand 121 states and 125 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-28 03:51:49,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:49,910 INFO L93 Difference]: Finished difference Result 239 states and 252 transitions. [2022-04-28 03:51:49,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-28 03:51:49,911 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-28 03:51:49,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:51:49,911 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-28 03:51:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 147 transitions. [2022-04-28 03:51:49,912 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-28 03:51:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 147 transitions. [2022-04-28 03:51:49,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 147 transitions. [2022-04-28 03:51:50,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:51:50,033 INFO L225 Difference]: With dead ends: 239 [2022-04-28 03:51:50,033 INFO L226 Difference]: Without dead ends: 126 [2022-04-28 03:51:50,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11995 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=10013, Invalid=25143, Unknown=0, NotChecked=0, Total=35156 [2022-04-28 03:51:50,035 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 315 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3539 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 3928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 3539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:51:50,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 22 Invalid, 3928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 3539 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-28 03:51:50,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-28 03:51:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-04-28 03:51:50,221 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:51:50,222 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:50,222 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:50,222 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:50,224 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-28 03:51:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:51:50,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:50,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:50,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 126 states. [2022-04-28 03:51:50,224 INFO L87 Difference]: Start difference. First operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 126 states. [2022-04-28 03:51:50,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:51:50,226 INFO L93 Difference]: Finished difference Result 126 states and 130 transitions. [2022-04-28 03:51:50,226 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:51:50,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:51:50,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:51:50,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:51:50,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:51:50,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 120 states have internal predecessors, (124), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:51:50,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2022-04-28 03:51:50,228 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 117 [2022-04-28 03:51:50,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:51:50,229 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2022-04-28 03:51:50,229 INFO L496 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-28 03:51:50,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 130 transitions. [2022-04-28 03:51:50,357 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-28 03:51:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-28 03:51:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 03:51:50,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:51:50,358 INFO L195 NwaCegarLoop]: trace histogram [43, 42, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:51:50,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 03:51:50,577 WARN L477 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-28 03:51:50,577 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:51:50,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:51:50,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2104415605, now seen corresponding path program 24 times [2022-04-28 03:51:50,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:50,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1822813358] [2022-04-28 03:51:50,691 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-28 03:51:50,923 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-28 03:51:50,924 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:51:50,926 INFO L85 PathProgramCache]: Analyzing trace with hash -397090206, now seen corresponding path program 1 times [2022-04-28 03:51:50,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:51:50,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926563723] [2022-04-28 03:51:50,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:50,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:51:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:51:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {21490#(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(18, 2);call #Ultimate.allocInit(12, 3); {21460#true} is VALID [2022-04-28 03:51:51,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {21460#true} assume true; {21460#true} is VALID [2022-04-28 03:51:51,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21460#true} {21460#true} #53#return; {21460#true} is VALID [2022-04-28 03:51:51,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {21460#true} call ULTIMATE.init(); {21490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:51:51,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {21490#(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(18, 2);call #Ultimate.allocInit(12, 3); {21460#true} is VALID [2022-04-28 03:51:51,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {21460#true} assume true; {21460#true} is VALID [2022-04-28 03:51:51,301 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21460#true} {21460#true} #53#return; {21460#true} is VALID [2022-04-28 03:51:51,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {21460#true} call #t~ret9 := main(); {21460#true} is VALID [2022-04-28 03:51:51,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {21460#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21465#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:51,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {21465#(<= 500000 main_~y~0)} [155] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse1 (= |v_main_#t~post4_153| |v_main_#t~post4_152|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1152 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_1151 500001) (< v_main_~x~0_1152 v_main_~x~0_1151)))) InVars {main_~x~0=v_main_~x~0_1152, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1151, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21465#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:51,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {21465#(<= 500000 main_~y~0)} [156] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21465#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:51,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {21465#(<= 500000 main_~y~0)} [157] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1225 v_main_~y~0_1224)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (<= 500000 v_main_~x~0_1154))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1154 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (< v_main_~x~0_1154 v_main_~x~0_1153) .cse4 (= (+ v_main_~x~0_1154 v_main_~y~0_1224) (+ v_main_~x~0_1153 v_main_~y~0_1225)) (< v_main_~x~0_1153 1000001)))) InVars {main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1154, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1224, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1153, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21465#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:51,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {21465#(<= 500000 main_~y~0)} [154] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {21465#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:51:51,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {21465#(<= 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; {21466#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:51:51,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {21466#(<= 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; {21467#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:51:51,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {21467#(<= 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; {21468#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:51:51,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {21468#(<= 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; {21469#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:51:51,308 INFO L290 TraceCheckUtils]: 14: Hoare triple {21469#(<= 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; {21470#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:51:51,308 INFO L290 TraceCheckUtils]: 15: Hoare triple {21470#(<= 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; {21471#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:51:51,309 INFO L290 TraceCheckUtils]: 16: Hoare triple {21471#(<= 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; {21472#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:51:51,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {21472#(<= 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; {21473#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:51:51,310 INFO L290 TraceCheckUtils]: 18: Hoare triple {21473#(<= 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; {21474#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:51:51,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {21474#(<= 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; {21475#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:51:51,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {21475#(<= 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; {21476#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:51:51,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {21476#(<= 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; {21477#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:51:51,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {21477#(<= 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; {21478#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:51:51,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {21478#(<= 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; {21479#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:51:51,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {21479#(<= 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; {21480#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:51:51,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {21480#(<= 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; {21481#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:51:51,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {21481#(<= 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; {21482#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:51:51,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {21482#(<= 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; {21483#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:51:51,317 INFO L290 TraceCheckUtils]: 28: Hoare triple {21483#(<= 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; {21484#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:51:51,317 INFO L290 TraceCheckUtils]: 29: Hoare triple {21484#(<= 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; {21485#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:51:51,318 INFO L290 TraceCheckUtils]: 30: Hoare triple {21485#(<= 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; {21486#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:51:51,319 INFO L290 TraceCheckUtils]: 31: Hoare triple {21486#(<= 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; {21487#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:51:51,319 INFO L290 TraceCheckUtils]: 32: Hoare triple {21487#(<= 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; {21488#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:51:51,320 INFO L290 TraceCheckUtils]: 33: Hoare triple {21488#(<= 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; {21489#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:51:51,320 INFO L290 TraceCheckUtils]: 34: Hoare triple {21489#(<= 499952 main_~y~0)} assume !(~y~0 > 0); {21461#false} is VALID [2022-04-28 03:51:51,320 INFO L272 TraceCheckUtils]: 35: Hoare triple {21461#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {21461#false} is VALID [2022-04-28 03:51:51,321 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#false} ~cond := #in~cond; {21461#false} is VALID [2022-04-28 03:51:51,321 INFO L290 TraceCheckUtils]: 37: Hoare triple {21461#false} assume 0 == ~cond; {21461#false} is VALID [2022-04-28 03:51:51,321 INFO L290 TraceCheckUtils]: 38: Hoare triple {21461#false} assume !false; {21461#false} is VALID [2022-04-28 03:51:51,321 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-28 03:51:51,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:51:51,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926563723] [2022-04-28 03:51:51,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926563723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:51:51,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941682737] [2022-04-28 03:51:51,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:51:51,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:51:51,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:51:51,324 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-28 03:51:51,337 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-28 03:51:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:51:51,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:51:51,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:51:52,262 INFO L272 TraceCheckUtils]: 0: Hoare triple {21460#true} call ULTIMATE.init(); {21460#true} is VALID [2022-04-28 03:51:52,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {21460#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(18, 2);call #Ultimate.allocInit(12, 3); {21460#true} is VALID [2022-04-28 03:51:52,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {21460#true} assume true; {21460#true} is VALID [2022-04-28 03:51:52,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21460#true} {21460#true} #53#return; {21460#true} is VALID [2022-04-28 03:51:52,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {21460#true} call #t~ret9 := main(); {21460#true} is VALID [2022-04-28 03:51:52,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {21460#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21509#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:51:52,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {21509#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [155] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse1 (= |v_main_#t~post4_153| |v_main_#t~post4_152|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1152 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_1151 500001) (< v_main_~x~0_1152 v_main_~x~0_1151)))) InVars {main_~x~0=v_main_~x~0_1152, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1151, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21513#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:51:52,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {21513#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [156] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21513#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:51:52,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {21513#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [157] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1225 v_main_~y~0_1224)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (<= 500000 v_main_~x~0_1154))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1154 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (< v_main_~x~0_1154 v_main_~x~0_1153) .cse4 (= (+ v_main_~x~0_1154 v_main_~y~0_1224) (+ v_main_~x~0_1153 v_main_~y~0_1225)) (< v_main_~x~0_1153 1000001)))) InVars {main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1154, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1224, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1153, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21520#(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-28 03:51:52,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {21520#(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)))} [154] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {21524#(< 999999 main_~y~0)} is VALID [2022-04-28 03:51:52,266 INFO L290 TraceCheckUtils]: 10: Hoare triple {21524#(< 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; {21528#(< 999997 main_~y~0)} is VALID [2022-04-28 03:51:52,266 INFO L290 TraceCheckUtils]: 11: Hoare triple {21528#(< 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; {21532#(< 999995 main_~y~0)} is VALID [2022-04-28 03:51:52,266 INFO L290 TraceCheckUtils]: 12: Hoare triple {21532#(< 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; {21536#(< 999993 main_~y~0)} is VALID [2022-04-28 03:51:52,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {21536#(< 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; {21540#(< 999991 main_~y~0)} is VALID [2022-04-28 03:51:52,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {21540#(< 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; {21544#(< 999989 main_~y~0)} is VALID [2022-04-28 03:51:52,268 INFO L290 TraceCheckUtils]: 15: Hoare triple {21544#(< 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; {21548#(< 999987 main_~y~0)} is VALID [2022-04-28 03:51:52,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {21548#(< 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; {21552#(< 999985 main_~y~0)} is VALID [2022-04-28 03:51:52,269 INFO L290 TraceCheckUtils]: 17: Hoare triple {21552#(< 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; {21556#(< 999983 main_~y~0)} is VALID [2022-04-28 03:51:52,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {21556#(< 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; {21560#(< 999981 main_~y~0)} is VALID [2022-04-28 03:51:52,270 INFO L290 TraceCheckUtils]: 19: Hoare triple {21560#(< 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; {21564#(< 999979 main_~y~0)} is VALID [2022-04-28 03:51:52,270 INFO L290 TraceCheckUtils]: 20: Hoare triple {21564#(< 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; {21568#(< 999977 main_~y~0)} is VALID [2022-04-28 03:51:52,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {21568#(< 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; {21572#(< 999975 main_~y~0)} is VALID [2022-04-28 03:51:52,271 INFO L290 TraceCheckUtils]: 22: Hoare triple {21572#(< 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; {21576#(< 999973 main_~y~0)} is VALID [2022-04-28 03:51:52,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {21576#(< 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; {21580#(< 999971 main_~y~0)} is VALID [2022-04-28 03:51:52,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {21580#(< 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; {21584#(< 999969 main_~y~0)} is VALID [2022-04-28 03:51:52,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {21584#(< 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; {21588#(< 999967 main_~y~0)} is VALID [2022-04-28 03:51:52,277 INFO L290 TraceCheckUtils]: 26: Hoare triple {21588#(< 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; {21592#(< 999965 main_~y~0)} is VALID [2022-04-28 03:51:52,277 INFO L290 TraceCheckUtils]: 27: Hoare triple {21592#(< 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; {21596#(< 999963 main_~y~0)} is VALID [2022-04-28 03:51:52,278 INFO L290 TraceCheckUtils]: 28: Hoare triple {21596#(< 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; {21600#(< 999961 main_~y~0)} is VALID [2022-04-28 03:51:52,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {21600#(< 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; {21604#(< 999959 main_~y~0)} is VALID [2022-04-28 03:51:52,279 INFO L290 TraceCheckUtils]: 30: Hoare triple {21604#(< 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; {21608#(< 999957 main_~y~0)} is VALID [2022-04-28 03:51:52,280 INFO L290 TraceCheckUtils]: 31: Hoare triple {21608#(< 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; {21612#(< 999955 main_~y~0)} is VALID [2022-04-28 03:51:52,280 INFO L290 TraceCheckUtils]: 32: Hoare triple {21612#(< 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; {21616#(< 999953 main_~y~0)} is VALID [2022-04-28 03:51:52,281 INFO L290 TraceCheckUtils]: 33: Hoare triple {21616#(< 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; {21620#(< 999951 main_~y~0)} is VALID [2022-04-28 03:51:52,281 INFO L290 TraceCheckUtils]: 34: Hoare triple {21620#(< 999951 main_~y~0)} assume !(~y~0 > 0); {21461#false} is VALID [2022-04-28 03:51:52,282 INFO L272 TraceCheckUtils]: 35: Hoare triple {21461#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {21461#false} is VALID [2022-04-28 03:51:52,282 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#false} ~cond := #in~cond; {21461#false} is VALID [2022-04-28 03:51:52,282 INFO L290 TraceCheckUtils]: 37: Hoare triple {21461#false} assume 0 == ~cond; {21461#false} is VALID [2022-04-28 03:51:52,282 INFO L290 TraceCheckUtils]: 38: Hoare triple {21461#false} assume !false; {21461#false} is VALID [2022-04-28 03:51:52,282 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-28 03:51:52,282 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:51:53,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {21461#false} assume !false; {21461#false} is VALID [2022-04-28 03:51:53,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {21461#false} assume 0 == ~cond; {21461#false} is VALID [2022-04-28 03:51:53,571 INFO L290 TraceCheckUtils]: 36: Hoare triple {21461#false} ~cond := #in~cond; {21461#false} is VALID [2022-04-28 03:51:53,571 INFO L272 TraceCheckUtils]: 35: Hoare triple {21461#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {21461#false} is VALID [2022-04-28 03:51:53,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {21648#(< 0 main_~y~0)} assume !(~y~0 > 0); {21461#false} is VALID [2022-04-28 03:51:53,572 INFO L290 TraceCheckUtils]: 33: Hoare triple {21652#(< 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; {21648#(< 0 main_~y~0)} is VALID [2022-04-28 03:51:53,573 INFO L290 TraceCheckUtils]: 32: Hoare triple {21656#(< 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; {21652#(< 2 main_~y~0)} is VALID [2022-04-28 03:51:53,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {21660#(< 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; {21656#(< 4 main_~y~0)} is VALID [2022-04-28 03:51:53,574 INFO L290 TraceCheckUtils]: 30: Hoare triple {21664#(< 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; {21660#(< 6 main_~y~0)} is VALID [2022-04-28 03:51:53,574 INFO L290 TraceCheckUtils]: 29: Hoare triple {21668#(< 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; {21664#(< 8 main_~y~0)} is VALID [2022-04-28 03:51:53,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {21672#(< 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; {21668#(< 10 main_~y~0)} is VALID [2022-04-28 03:51:53,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {21676#(< 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; {21672#(< 12 main_~y~0)} is VALID [2022-04-28 03:51:53,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {21680#(< 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; {21676#(< 14 main_~y~0)} is VALID [2022-04-28 03:51:53,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {21684#(< 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; {21680#(< 16 main_~y~0)} is VALID [2022-04-28 03:51:53,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {21688#(< 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; {21684#(< 18 main_~y~0)} is VALID [2022-04-28 03:51:53,577 INFO L290 TraceCheckUtils]: 23: Hoare triple {21692#(< 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; {21688#(< 20 main_~y~0)} is VALID [2022-04-28 03:51:53,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {21696#(< 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; {21692#(< 22 main_~y~0)} is VALID [2022-04-28 03:51:53,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {21700#(< 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; {21696#(< 24 main_~y~0)} is VALID [2022-04-28 03:51:53,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {21704#(< 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; {21700#(< 26 main_~y~0)} is VALID [2022-04-28 03:51:53,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {21708#(< 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; {21704#(< 28 main_~y~0)} is VALID [2022-04-28 03:51:53,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {21712#(< 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; {21708#(< 30 main_~y~0)} is VALID [2022-04-28 03:51:53,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {21716#(< 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; {21712#(< 32 main_~y~0)} is VALID [2022-04-28 03:51:53,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {21720#(< 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; {21716#(< 34 main_~y~0)} is VALID [2022-04-28 03:51:53,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {21724#(< 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; {21720#(< 36 main_~y~0)} is VALID [2022-04-28 03:51:53,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {21728#(< 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; {21724#(< 38 main_~y~0)} is VALID [2022-04-28 03:51:53,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {21732#(< 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; {21728#(< 40 main_~y~0)} is VALID [2022-04-28 03:51:53,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {21736#(< 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; {21732#(< 42 main_~y~0)} is VALID [2022-04-28 03:51:53,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {21740#(< 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; {21736#(< 44 main_~y~0)} is VALID [2022-04-28 03:51:53,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {21744#(< 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; {21740#(< 46 main_~y~0)} is VALID [2022-04-28 03:51:53,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {21748#(or (< main_~x~0 1000000) (< 48 main_~y~0))} [154] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {21744#(< 48 main_~y~0)} is VALID [2022-04-28 03:51:53,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {21752#(and (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} [157] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1225 v_main_~y~0_1224)) (.cse1 (= |v_main_#t~post6_165| |v_main_#t~post6_164|)) (.cse2 (= v_main_~x~0_1154 v_main_~x~0_1153)) (.cse3 (= |v_main_#t~post5_165| |v_main_#t~post5_164|)) (.cse4 (<= 500000 v_main_~x~0_1154))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (or (not (< v_main_~x~0_1154 1000000)) (not .cse4)) .cse1 .cse2 .cse3) (and (< v_main_~x~0_1154 v_main_~x~0_1153) .cse4 (= (+ v_main_~x~0_1154 v_main_~y~0_1224) (+ v_main_~x~0_1153 v_main_~y~0_1225)) (< v_main_~x~0_1153 1000001)))) InVars {main_~y~0=v_main_~y~0_1225, main_#t~post5=|v_main_#t~post5_165|, main_~x~0=v_main_~x~0_1154, main_#t~post6=|v_main_#t~post6_165|} OutVars{main_~y~0=v_main_~y~0_1224, main_#t~post5=|v_main_#t~post5_164|, main_~x~0=v_main_~x~0_1153, main_#t~post6=|v_main_#t~post6_164|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {21748#(or (< main_~x~0 1000000) (< 48 main_~y~0))} is VALID [2022-04-28 03:51:53,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {21752#(and (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} [156] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {21752#(and (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} is VALID [2022-04-28 03:51:53,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {21759#(and (<= 0 (+ main_~y~0 499951)) (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0)) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} [155] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1152 v_main_~x~0_1151)) (.cse1 (= |v_main_#t~post4_153| |v_main_#t~post4_152|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_1152 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_1151 500001) (< v_main_~x~0_1152 v_main_~x~0_1151)))) InVars {main_~x~0=v_main_~x~0_1152, main_#t~post4=|v_main_#t~post4_153|} OutVars{main_~x~0=v_main_~x~0_1151, main_#t~post4=|v_main_#t~post4_152|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {21752#(and (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0) (not (<= 500000 main_~x~0))) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} is VALID [2022-04-28 03:51:53,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {21460#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {21759#(and (<= 0 (+ main_~y~0 499951)) (or (< main_~x~0 (+ main_~y~0 999952)) (<= 48 main_~y~0)) (or (< main_~x~0 1000000) (< 48 main_~y~0)))} is VALID [2022-04-28 03:51:53,592 INFO L272 TraceCheckUtils]: 4: Hoare triple {21460#true} call #t~ret9 := main(); {21460#true} is VALID [2022-04-28 03:51:53,592 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21460#true} {21460#true} #53#return; {21460#true} is VALID [2022-04-28 03:51:53,592 INFO L290 TraceCheckUtils]: 2: Hoare triple {21460#true} assume true; {21460#true} is VALID [2022-04-28 03:51:53,592 INFO L290 TraceCheckUtils]: 1: Hoare triple {21460#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(18, 2);call #Ultimate.allocInit(12, 3); {21460#true} is VALID [2022-04-28 03:51:53,592 INFO L272 TraceCheckUtils]: 0: Hoare triple {21460#true} call ULTIMATE.init(); {21460#true} is VALID [2022-04-28 03:51:53,592 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-28 03:51:53,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941682737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:51:53,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:51:53,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 30] total 84 [2022-04-28 03:51:55,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:51:55,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1822813358] [2022-04-28 03:51:55,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1822813358] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:51:55,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:51:55,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [72] imperfect sequences [] total 72 [2022-04-28 03:51:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32034516] [2022-04-28 03:51:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:51:55,799 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-28 03:51:55,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:51:55,799 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-28 03:51:55,886 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-28 03:51:55,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-04-28 03:51:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:51:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-04-28 03:51:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5709, Invalid=10293, Unknown=0, NotChecked=0, Total=16002 [2022-04-28 03:51:55,888 INFO L87 Difference]: Start difference. First operand 126 states and 130 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-28 03:52:04,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:04,312 INFO L93 Difference]: Finished difference Result 249 states and 262 transitions. [2022-04-28 03:52:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-04-28 03:52:04,312 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-28 03:52:04,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:04,312 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-28 03:52:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 152 transitions. [2022-04-28 03:52:04,314 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-28 03:52:04,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 152 transitions. [2022-04-28 03:52:04,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 152 transitions. [2022-04-28 03:52:04,435 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-28 03:52:04,436 INFO L225 Difference]: With dead ends: 249 [2022-04-28 03:52:04,436 INFO L226 Difference]: Without dead ends: 131 [2022-04-28 03:52:04,439 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13033 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=10846, Invalid=27374, Unknown=0, NotChecked=0, Total=38220 [2022-04-28 03:52:04,439 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 192 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3937 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 3937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:04,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 67 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 3937 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-28 03:52:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-28 03:52:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-28 03:52:04,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:04,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:04,636 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:04,636 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:04,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:04,637 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-28 03:52:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:52:04,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:04,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:04,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 131 states. [2022-04-28 03:52:04,638 INFO L87 Difference]: Start difference. First operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 131 states. [2022-04-28 03:52:04,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:04,640 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2022-04-28 03:52:04,640 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:52:04,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:04,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:04,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:04,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:04,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 124 states have (on average 1.0403225806451613) internal successors, (129), 125 states have internal predecessors, (129), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:04,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 135 transitions. [2022-04-28 03:52:04,642 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 135 transitions. Word has length 122 [2022-04-28 03:52:04,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:04,643 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 135 transitions. [2022-04-28 03:52:04,643 INFO L496 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-28 03:52:04,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 135 transitions. [2022-04-28 03:52:04,762 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-28 03:52:04,762 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 135 transitions. [2022-04-28 03:52:04,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-28 03:52:04,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:04,762 INFO L195 NwaCegarLoop]: trace histogram [45, 44, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:04,778 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-28 03:52:04,967 WARN L477 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-28 03:52:04,968 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:04,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1421832658, now seen corresponding path program 25 times [2022-04-28 03:52:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:04,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008455843] [2022-04-28 03:52:09,037 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:09,092 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-28 03:52:13,210 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:52:13,315 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-28 03:52:13,316 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash -2070300991, now seen corresponding path program 1 times [2022-04-28 03:52:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:13,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161313179] [2022-04-28 03:52:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:13,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:13,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {23017#(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(18, 2);call #Ultimate.allocInit(12, 3); {22983#true} is VALID [2022-04-28 03:52:13,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {22983#true} assume true; {22983#true} is VALID [2022-04-28 03:52:13,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22983#true} {22983#true} #53#return; {22983#true} is VALID [2022-04-28 03:52:13,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {22983#true} call ULTIMATE.init(); {23017#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:13,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {23017#(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(18, 2);call #Ultimate.allocInit(12, 3); {22983#true} is VALID [2022-04-28 03:52:13,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {22983#true} assume true; {22983#true} is VALID [2022-04-28 03:52:13,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22983#true} {22983#true} #53#return; {22983#true} is VALID [2022-04-28 03:52:13,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {22983#true} call #t~ret9 := main(); {22983#true} is VALID [2022-04-28 03:52:13,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {22983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {22988#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:52:13,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {22988#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [159] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1236 v_main_~x~0_1235))) (or (and (< v_main_~x~0_1235 500001) (< v_main_~x~0_1236 v_main_~x~0_1235)) (and (<= 500000 v_main_~x~0_1236) (= |v_main_#t~post4_159| |v_main_#t~post4_160|) .cse0) (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0))) InVars {main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1235, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {22989#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:52:13,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {22989#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [160] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {22989#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:52:13,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {22989#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [161] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1324 v_main_~y~0_1323)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse3 (= v_main_~x~0_1238 v_main_~x~0_1237)) (.cse4 (<= 500000 v_main_~x~0_1238))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1238 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1237 1000001) .cse4 (= (+ v_main_~x~0_1237 v_main_~y~0_1324) (+ v_main_~x~0_1238 v_main_~y~0_1323)) (< v_main_~x~0_1238 v_main_~x~0_1237)))) InVars {main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1323, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1237, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {22990#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:52:13,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {22990#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [158] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {22991#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:13,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {22991#(<= 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; {22992#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:52:13,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {22992#(<= 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; {22993#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:52:13,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {22993#(<= 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; {22994#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:52:13,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {22994#(<= 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; {22995#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:52:13,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {22995#(<= 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; {22996#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:52:13,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {22996#(<= 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; {22997#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:52:13,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {22997#(<= 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; {22998#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:52:13,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {22998#(<= 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; {22999#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:52:13,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {22999#(<= 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; {23000#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:52:13,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {23000#(<= 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; {23001#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:52:13,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {23001#(<= 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; {23002#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:52:13,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {23002#(<= 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; {23003#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:52:13,801 INFO L290 TraceCheckUtils]: 22: Hoare triple {23003#(<= 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; {23004#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:52:13,801 INFO L290 TraceCheckUtils]: 23: Hoare triple {23004#(<= 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; {23005#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:52:13,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {23005#(<= 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; {23006#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:52:13,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {23006#(<= 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; {23007#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:52:13,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {23007#(<= 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; {23008#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:52:13,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {23008#(<= 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; {23009#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:52:13,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {23009#(<= 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; {23010#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:52:13,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {23010#(<= 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; {23011#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:52:13,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {23011#(<= 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; {23012#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:52:13,805 INFO L290 TraceCheckUtils]: 31: Hoare triple {23012#(<= 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; {23013#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:52:13,805 INFO L290 TraceCheckUtils]: 32: Hoare triple {23013#(<= 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; {23014#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:52:13,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {23014#(<= 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; {23015#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:52:13,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {23015#(<= 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; {23016#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:52:13,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {23016#(<= 499950 main_~y~0)} assume !(~y~0 > 0); {22984#false} is VALID [2022-04-28 03:52:13,807 INFO L272 TraceCheckUtils]: 36: Hoare triple {22984#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {22984#false} is VALID [2022-04-28 03:52:13,807 INFO L290 TraceCheckUtils]: 37: Hoare triple {22984#false} ~cond := #in~cond; {22984#false} is VALID [2022-04-28 03:52:13,807 INFO L290 TraceCheckUtils]: 38: Hoare triple {22984#false} assume 0 == ~cond; {22984#false} is VALID [2022-04-28 03:52:13,807 INFO L290 TraceCheckUtils]: 39: Hoare triple {22984#false} assume !false; {22984#false} is VALID [2022-04-28 03:52:13,807 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:13,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161313179] [2022-04-28 03:52:13,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161313179] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:13,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239027248] [2022-04-28 03:52:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:13,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:13,808 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-28 03:52:13,809 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-28 03:52:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:13,861 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:52:13,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:13,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:14,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {22983#true} call ULTIMATE.init(); {22983#true} is VALID [2022-04-28 03:52:14,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {22983#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(18, 2);call #Ultimate.allocInit(12, 3); {22983#true} is VALID [2022-04-28 03:52:14,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {22983#true} assume true; {22983#true} is VALID [2022-04-28 03:52:14,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22983#true} {22983#true} #53#return; {22983#true} is VALID [2022-04-28 03:52:14,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {22983#true} call #t~ret9 := main(); {22983#true} is VALID [2022-04-28 03:52:14,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {22983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23036#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:52:14,740 INFO L290 TraceCheckUtils]: 6: Hoare triple {23036#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [159] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1236 v_main_~x~0_1235))) (or (and (< v_main_~x~0_1235 500001) (< v_main_~x~0_1236 v_main_~x~0_1235)) (and (<= 500000 v_main_~x~0_1236) (= |v_main_#t~post4_159| |v_main_#t~post4_160|) .cse0) (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0))) InVars {main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1235, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23040#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:52:14,740 INFO L290 TraceCheckUtils]: 7: Hoare triple {23040#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [160] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23040#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:52:14,741 INFO L290 TraceCheckUtils]: 8: Hoare triple {23040#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [161] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1324 v_main_~y~0_1323)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse3 (= v_main_~x~0_1238 v_main_~x~0_1237)) (.cse4 (<= 500000 v_main_~x~0_1238))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1238 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1237 1000001) .cse4 (= (+ v_main_~x~0_1237 v_main_~y~0_1324) (+ v_main_~x~0_1238 v_main_~y~0_1323)) (< v_main_~x~0_1238 v_main_~x~0_1237)))) InVars {main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1323, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1237, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23047#(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-28 03:52:14,741 INFO L290 TraceCheckUtils]: 9: Hoare triple {23047#(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)))} [158] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {23051#(< 999999 main_~y~0)} is VALID [2022-04-28 03:52:14,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {23051#(< 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; {23055#(< 999997 main_~y~0)} is VALID [2022-04-28 03:52:14,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {23055#(< 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; {23059#(< 999995 main_~y~0)} is VALID [2022-04-28 03:52:14,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {23059#(< 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; {23063#(< 999993 main_~y~0)} is VALID [2022-04-28 03:52:14,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {23063#(< 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; {23067#(< 999991 main_~y~0)} is VALID [2022-04-28 03:52:14,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {23067#(< 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; {23071#(< 999989 main_~y~0)} is VALID [2022-04-28 03:52:14,744 INFO L290 TraceCheckUtils]: 15: Hoare triple {23071#(< 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; {23075#(< 999987 main_~y~0)} is VALID [2022-04-28 03:52:14,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {23075#(< 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; {23079#(< 999985 main_~y~0)} is VALID [2022-04-28 03:52:14,745 INFO L290 TraceCheckUtils]: 17: Hoare triple {23079#(< 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; {23083#(< 999983 main_~y~0)} is VALID [2022-04-28 03:52:14,745 INFO L290 TraceCheckUtils]: 18: Hoare triple {23083#(< 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; {23087#(< 999981 main_~y~0)} is VALID [2022-04-28 03:52:14,746 INFO L290 TraceCheckUtils]: 19: Hoare triple {23087#(< 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; {23091#(< 999979 main_~y~0)} is VALID [2022-04-28 03:52:14,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {23091#(< 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; {23095#(< 999977 main_~y~0)} is VALID [2022-04-28 03:52:14,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {23095#(< 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; {23099#(< 999975 main_~y~0)} is VALID [2022-04-28 03:52:14,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {23099#(< 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; {23103#(< 999973 main_~y~0)} is VALID [2022-04-28 03:52:14,748 INFO L290 TraceCheckUtils]: 23: Hoare triple {23103#(< 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; {23107#(< 999971 main_~y~0)} is VALID [2022-04-28 03:52:14,748 INFO L290 TraceCheckUtils]: 24: Hoare triple {23107#(< 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; {23111#(< 999969 main_~y~0)} is VALID [2022-04-28 03:52:14,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {23111#(< 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; {23115#(< 999967 main_~y~0)} is VALID [2022-04-28 03:52:14,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {23115#(< 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; {23119#(< 999965 main_~y~0)} is VALID [2022-04-28 03:52:14,750 INFO L290 TraceCheckUtils]: 27: Hoare triple {23119#(< 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; {23123#(< 999963 main_~y~0)} is VALID [2022-04-28 03:52:14,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {23123#(< 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; {23127#(< 999961 main_~y~0)} is VALID [2022-04-28 03:52:14,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {23127#(< 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; {23131#(< 999959 main_~y~0)} is VALID [2022-04-28 03:52:14,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {23131#(< 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; {23135#(< 999957 main_~y~0)} is VALID [2022-04-28 03:52:14,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {23135#(< 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; {23139#(< 999955 main_~y~0)} is VALID [2022-04-28 03:52:14,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {23139#(< 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; {23143#(< 999953 main_~y~0)} is VALID [2022-04-28 03:52:14,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {23143#(< 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; {23147#(< 999951 main_~y~0)} is VALID [2022-04-28 03:52:14,753 INFO L290 TraceCheckUtils]: 34: Hoare triple {23147#(< 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; {23151#(< 999949 main_~y~0)} is VALID [2022-04-28 03:52:14,753 INFO L290 TraceCheckUtils]: 35: Hoare triple {23151#(< 999949 main_~y~0)} assume !(~y~0 > 0); {22984#false} is VALID [2022-04-28 03:52:14,753 INFO L272 TraceCheckUtils]: 36: Hoare triple {22984#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {22984#false} is VALID [2022-04-28 03:52:14,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {22984#false} ~cond := #in~cond; {22984#false} is VALID [2022-04-28 03:52:14,753 INFO L290 TraceCheckUtils]: 38: Hoare triple {22984#false} assume 0 == ~cond; {22984#false} is VALID [2022-04-28 03:52:14,754 INFO L290 TraceCheckUtils]: 39: Hoare triple {22984#false} assume !false; {22984#false} is VALID [2022-04-28 03:52:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:14,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:16,230 INFO L290 TraceCheckUtils]: 39: Hoare triple {22984#false} assume !false; {22984#false} is VALID [2022-04-28 03:52:16,231 INFO L290 TraceCheckUtils]: 38: Hoare triple {22984#false} assume 0 == ~cond; {22984#false} is VALID [2022-04-28 03:52:16,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {22984#false} ~cond := #in~cond; {22984#false} is VALID [2022-04-28 03:52:16,231 INFO L272 TraceCheckUtils]: 36: Hoare triple {22984#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {22984#false} is VALID [2022-04-28 03:52:16,231 INFO L290 TraceCheckUtils]: 35: Hoare triple {23179#(< 0 main_~y~0)} assume !(~y~0 > 0); {22984#false} is VALID [2022-04-28 03:52:16,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {23183#(< 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; {23179#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:16,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {23187#(< 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; {23183#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:16,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {23191#(< 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; {23187#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:16,233 INFO L290 TraceCheckUtils]: 31: Hoare triple {23195#(< 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; {23191#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:16,233 INFO L290 TraceCheckUtils]: 30: Hoare triple {23199#(< 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; {23195#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:16,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {23203#(< 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; {23199#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:16,234 INFO L290 TraceCheckUtils]: 28: Hoare triple {23207#(< 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; {23203#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:16,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {23211#(< 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; {23207#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:16,235 INFO L290 TraceCheckUtils]: 26: Hoare triple {23215#(< 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; {23211#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:16,236 INFO L290 TraceCheckUtils]: 25: Hoare triple {23219#(< 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; {23215#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:16,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {23223#(< 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; {23219#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:16,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {23227#(< 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; {23223#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:16,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {23231#(< 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; {23227#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:16,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {23235#(< 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; {23231#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:16,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {23239#(< 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; {23235#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:16,238 INFO L290 TraceCheckUtils]: 19: Hoare triple {23243#(< 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; {23239#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:16,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {23247#(< 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; {23243#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:16,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {23251#(< 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; {23247#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:16,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {23255#(< 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; {23251#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:16,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {23259#(< 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; {23255#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:16,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {23263#(< 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; {23259#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:16,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {23267#(< 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; {23263#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:16,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {23271#(< 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; {23267#(< 44 main_~y~0)} is VALID [2022-04-28 03:52:16,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {23275#(< 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; {23271#(< 46 main_~y~0)} is VALID [2022-04-28 03:52:16,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {23279#(< 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; {23275#(< 48 main_~y~0)} is VALID [2022-04-28 03:52:16,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {23283#(or (< main_~x~0 1000000) (< 50 main_~y~0))} [158] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {23279#(< 50 main_~y~0)} is VALID [2022-04-28 03:52:16,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {23287#(and (or (< main_~x~0 1000000) (< 50 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999950))))} [161] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~y~0_1324 v_main_~y~0_1323)) (.cse1 (= |v_main_#t~post5_172| |v_main_#t~post5_171|)) (.cse2 (= |v_main_#t~post6_172| |v_main_#t~post6_171|)) (.cse3 (= v_main_~x~0_1238 v_main_~x~0_1237)) (.cse4 (<= 500000 v_main_~x~0_1238))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not (< v_main_~x~0_1238 1000000)) (not .cse4)) .cse0 .cse1 .cse2 .cse3) (and (< v_main_~x~0_1237 1000001) .cse4 (= (+ v_main_~x~0_1237 v_main_~y~0_1324) (+ v_main_~x~0_1238 v_main_~y~0_1323)) (< v_main_~x~0_1238 v_main_~x~0_1237)))) InVars {main_~y~0=v_main_~y~0_1324, main_#t~post5=|v_main_#t~post5_172|, main_~x~0=v_main_~x~0_1238, main_#t~post6=|v_main_#t~post6_172|} OutVars{main_~y~0=v_main_~y~0_1323, main_#t~post5=|v_main_#t~post5_171|, main_~x~0=v_main_~x~0_1237, main_#t~post6=|v_main_#t~post6_171|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {23283#(or (< main_~x~0 1000000) (< 50 main_~y~0))} is VALID [2022-04-28 03:52:16,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {23287#(and (or (< main_~x~0 1000000) (< 50 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999950))))} [160] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {23287#(and (or (< main_~x~0 1000000) (< 50 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999950))))} is VALID [2022-04-28 03:52:16,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {23294#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999950))) (or (< main_~x~0 1000000) (< 50 main_~y~0)) (<= 0 (+ main_~y~0 499949)))} [159] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1236 v_main_~x~0_1235))) (or (and (< v_main_~x~0_1235 500001) (< v_main_~x~0_1236 v_main_~x~0_1235)) (and (<= 500000 v_main_~x~0_1236) (= |v_main_#t~post4_159| |v_main_#t~post4_160|) .cse0) (and (= |v_main_#t~post4_160| |v_main_#t~post4_159|) .cse0))) InVars {main_~x~0=v_main_~x~0_1236, main_#t~post4=|v_main_#t~post4_160|} OutVars{main_~x~0=v_main_~x~0_1235, main_#t~post4=|v_main_#t~post4_159|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {23287#(and (or (< main_~x~0 1000000) (< 50 main_~y~0)) (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999950))))} is VALID [2022-04-28 03:52:16,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {22983#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {23294#(and (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999950))) (or (< main_~x~0 1000000) (< 50 main_~y~0)) (<= 0 (+ main_~y~0 499949)))} is VALID [2022-04-28 03:52:16,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {22983#true} call #t~ret9 := main(); {22983#true} is VALID [2022-04-28 03:52:16,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22983#true} {22983#true} #53#return; {22983#true} is VALID [2022-04-28 03:52:16,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {22983#true} assume true; {22983#true} is VALID [2022-04-28 03:52:16,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {22983#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(18, 2);call #Ultimate.allocInit(12, 3); {22983#true} is VALID [2022-04-28 03:52:16,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {22983#true} call ULTIMATE.init(); {22983#true} is VALID [2022-04-28 03:52:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 327 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:52:16,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239027248] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:16,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:16,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 90 [2022-04-28 03:52:18,552 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:18,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008455843] [2022-04-28 03:52:18,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008455843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:18,553 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:18,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [75] imperfect sequences [] total 75 [2022-04-28 03:52:18,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689896049] [2022-04-28 03:52:18,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:18,553 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 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 127 [2022-04-28 03:52:18,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:18,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:18,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:18,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-04-28 03:52:18,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:18,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-04-28 03:52:18,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6425, Invalid=11935, Unknown=0, NotChecked=0, Total=18360 [2022-04-28 03:52:18,647 INFO L87 Difference]: Start difference. First operand 131 states and 135 transitions. Second operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:28,453 INFO L93 Difference]: Finished difference Result 345 states and 358 transitions. [2022-04-28 03:52:28,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2022-04-28 03:52:28,454 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 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 127 [2022-04-28 03:52:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:28,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:28,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 157 transitions. [2022-04-28 03:52:28,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:28,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 157 transitions. [2022-04-28 03:52:28,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 157 transitions. [2022-04-28 03:52:28,621 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-28 03:52:28,625 INFO L225 Difference]: With dead ends: 345 [2022-04-28 03:52:28,625 INFO L226 Difference]: Without dead ends: 222 [2022-04-28 03:52:28,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14917 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=11986, Invalid=31070, Unknown=0, NotChecked=0, Total=43056 [2022-04-28 03:52:28,629 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 297 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4462 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 4782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 4462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:28,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 47 Invalid, 4782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 4462 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-04-28 03:52:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-04-28 03:52:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-04-28 03:52:29,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:29,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:29,090 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:29,090 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:29,093 INFO L93 Difference]: Finished difference Result 222 states and 227 transitions. [2022-04-28 03:52:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 227 transitions. [2022-04-28 03:52:29,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:29,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:29,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 222 states. [2022-04-28 03:52:29,094 INFO L87 Difference]: Start difference. First operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 222 states. [2022-04-28 03:52:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:29,098 INFO L93 Difference]: Finished difference Result 222 states and 227 transitions. [2022-04-28 03:52:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 227 transitions. [2022-04-28 03:52:29,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:29,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:29,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:29,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:29,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 215 states have (on average 1.027906976744186) internal successors, (221), 216 states have internal predecessors, (221), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 227 transitions. [2022-04-28 03:52:29,102 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 227 transitions. Word has length 127 [2022-04-28 03:52:29,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:29,102 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 227 transitions. [2022-04-28 03:52:29,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 1.64) internal successors, (123), 74 states have internal predecessors, (123), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:52:29,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 222 states and 227 transitions. [2022-04-28 03:52:29,347 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-28 03:52:29,348 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 227 transitions. [2022-04-28 03:52:29,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-28 03:52:29,348 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:29,348 INFO L195 NwaCegarLoop]: trace histogram [46, 45, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:29,374 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-28 03:52:29,549 WARN L477 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-28 03:52:29,549 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:29,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:29,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1185534266, now seen corresponding path program 26 times [2022-04-28 03:52:29,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:29,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1653145914] [2022-04-28 03:52:29,692 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-28 03:52:29,942 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-28 03:52:29,944 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:29,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1196471230, now seen corresponding path program 1 times [2022-04-28 03:52:29,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093208907] [2022-04-28 03:52:29,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:29,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:30,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:30,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:30,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {25115#(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(18, 2);call #Ultimate.allocInit(12, 3); {25083#true} is VALID [2022-04-28 03:52:30,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {25083#true} assume true; {25083#true} is VALID [2022-04-28 03:52:30,380 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25083#true} {25083#true} #53#return; {25083#true} is VALID [2022-04-28 03:52:30,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {25083#true} call ULTIMATE.init(); {25115#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:30,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {25115#(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(18, 2);call #Ultimate.allocInit(12, 3); {25083#true} is VALID [2022-04-28 03:52:30,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {25083#true} assume true; {25083#true} is VALID [2022-04-28 03:52:30,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25083#true} {25083#true} #53#return; {25083#true} is VALID [2022-04-28 03:52:30,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {25083#true} call #t~ret9 := main(); {25083#true} is VALID [2022-04-28 03:52:30,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {25083#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {25088#(<= 500000 main_~y~0)} [163] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1323 v_main_~x~0_1322)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1323 500000))) (and (< v_main_~x~0_1323 v_main_~x~0_1322) (< v_main_~x~0_1322 500001)))) InVars {main_~x~0=v_main_~x~0_1323, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,382 INFO L290 TraceCheckUtils]: 7: Hoare triple {25088#(<= 500000 main_~y~0)} [164] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,382 INFO L290 TraceCheckUtils]: 8: Hoare triple {25088#(<= 500000 main_~y~0)} [165] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1325 v_main_~x~0_1324)) (.cse2 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse3 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse0 (<= 500000 v_main_~x~0_1325))) (or (and (< v_main_~x~0_1324 1000001) (= (+ v_main_~x~0_1324 v_main_~y~0_1427) (+ v_main_~x~0_1325 v_main_~y~0_1426)) (< v_main_~x~0_1325 v_main_~x~0_1324) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1325 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1325, 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_1324, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {25088#(<= 500000 main_~y~0)} [162] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,383 INFO L290 TraceCheckUtils]: 10: Hoare triple {25088#(<= 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; {25089#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:52:30,384 INFO L290 TraceCheckUtils]: 11: Hoare triple {25089#(<= 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; {25090#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:52:30,384 INFO L290 TraceCheckUtils]: 12: Hoare triple {25090#(<= 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; {25091#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:52:30,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {25091#(<= 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; {25092#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:52:30,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {25092#(<= 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; {25093#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:52:30,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {25093#(<= 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; {25094#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:52:30,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {25094#(<= 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; {25095#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:52:30,386 INFO L290 TraceCheckUtils]: 17: Hoare triple {25095#(<= 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; {25096#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:52:30,387 INFO L290 TraceCheckUtils]: 18: Hoare triple {25096#(<= 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; {25097#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:52:30,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {25097#(<= 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; {25098#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:52:30,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {25098#(<= 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; {25099#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:52:30,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {25099#(<= 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; {25100#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:52:30,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {25100#(<= 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; {25101#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:52:30,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {25101#(<= 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; {25102#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:52:30,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {25102#(<= 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; {25103#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:52:30,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {25103#(<= 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; {25104#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:52:30,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {25104#(<= 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; {25105#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:52:30,391 INFO L290 TraceCheckUtils]: 27: Hoare triple {25105#(<= 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; {25106#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:52:30,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {25106#(<= 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; {25107#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:52:30,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {25107#(<= 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; {25108#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:52:30,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {25108#(<= 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; {25109#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:52:30,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {25109#(<= 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; {25110#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:52:30,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {25110#(<= 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; {25111#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:52:30,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {25111#(<= 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; {25112#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:52:30,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {25112#(<= 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; {25113#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:52:30,395 INFO L290 TraceCheckUtils]: 35: Hoare triple {25113#(<= 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; {25114#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:52:30,395 INFO L290 TraceCheckUtils]: 36: Hoare triple {25114#(<= 499948 main_~y~0)} assume !(~y~0 > 0); {25084#false} is VALID [2022-04-28 03:52:30,395 INFO L272 TraceCheckUtils]: 37: Hoare triple {25084#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {25084#false} is VALID [2022-04-28 03:52:30,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {25084#false} ~cond := #in~cond; {25084#false} is VALID [2022-04-28 03:52:30,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {25084#false} assume 0 == ~cond; {25084#false} is VALID [2022-04-28 03:52:30,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {25084#false} assume !false; {25084#false} is VALID [2022-04-28 03:52:30,396 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-28 03:52:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:30,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093208907] [2022-04-28 03:52:30,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093208907] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:30,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153224388] [2022-04-28 03:52:30,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:30,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:30,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:30,399 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-28 03:52:30,399 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-28 03:52:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:30,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 03:52:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:30,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:30,916 INFO L272 TraceCheckUtils]: 0: Hoare triple {25083#true} call ULTIMATE.init(); {25083#true} is VALID [2022-04-28 03:52:30,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {25083#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(18, 2);call #Ultimate.allocInit(12, 3); {25083#true} is VALID [2022-04-28 03:52:30,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {25083#true} assume true; {25083#true} is VALID [2022-04-28 03:52:30,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25083#true} {25083#true} #53#return; {25083#true} is VALID [2022-04-28 03:52:30,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {25083#true} call #t~ret9 := main(); {25083#true} is VALID [2022-04-28 03:52:30,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {25083#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {25088#(<= 500000 main_~y~0)} [163] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1323 v_main_~x~0_1322)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1323 500000))) (and (< v_main_~x~0_1323 v_main_~x~0_1322) (< v_main_~x~0_1322 500001)))) InVars {main_~x~0=v_main_~x~0_1323, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {25088#(<= 500000 main_~y~0)} [164] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {25088#(<= 500000 main_~y~0)} [165] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1325 v_main_~x~0_1324)) (.cse2 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse3 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse0 (<= 500000 v_main_~x~0_1325))) (or (and (< v_main_~x~0_1324 1000001) (= (+ v_main_~x~0_1324 v_main_~y~0_1427) (+ v_main_~x~0_1325 v_main_~y~0_1426)) (< v_main_~x~0_1325 v_main_~x~0_1324) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1325 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1325, 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_1324, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {25088#(<= 500000 main_~y~0)} [162] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {25088#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:30,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {25088#(<= 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; {25089#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:52:30,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {25089#(<= 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; {25090#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:52:30,920 INFO L290 TraceCheckUtils]: 12: Hoare triple {25090#(<= 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; {25091#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:52:30,920 INFO L290 TraceCheckUtils]: 13: Hoare triple {25091#(<= 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; {25092#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:52:30,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {25092#(<= 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; {25093#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:52:30,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {25093#(<= 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; {25094#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:52:30,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {25094#(<= 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; {25095#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:52:30,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {25095#(<= 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; {25096#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:52:30,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {25096#(<= 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; {25097#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:52:30,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {25097#(<= 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; {25098#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:52:30,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {25098#(<= 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; {25099#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:52:30,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {25099#(<= 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; {25100#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:52:30,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {25100#(<= 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; {25101#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:52:30,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {25101#(<= 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; {25102#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:52:30,925 INFO L290 TraceCheckUtils]: 24: Hoare triple {25102#(<= 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; {25103#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:52:30,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {25103#(<= 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; {25104#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:52:30,926 INFO L290 TraceCheckUtils]: 26: Hoare triple {25104#(<= 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; {25105#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:52:30,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {25105#(<= 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; {25106#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:52:30,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {25106#(<= 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; {25107#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:52:30,928 INFO L290 TraceCheckUtils]: 29: Hoare triple {25107#(<= 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; {25108#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:52:30,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {25108#(<= 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; {25109#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:52:30,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {25109#(<= 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; {25110#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:52:30,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {25110#(<= 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; {25111#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:52:30,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {25111#(<= 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; {25112#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:52:30,930 INFO L290 TraceCheckUtils]: 34: Hoare triple {25112#(<= 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; {25113#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:52:30,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {25113#(<= 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; {25114#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:52:30,931 INFO L290 TraceCheckUtils]: 36: Hoare triple {25114#(<= 499948 main_~y~0)} assume !(~y~0 > 0); {25084#false} is VALID [2022-04-28 03:52:30,931 INFO L272 TraceCheckUtils]: 37: Hoare triple {25084#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {25084#false} is VALID [2022-04-28 03:52:30,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {25084#false} ~cond := #in~cond; {25084#false} is VALID [2022-04-28 03:52:30,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {25084#false} assume 0 == ~cond; {25084#false} is VALID [2022-04-28 03:52:30,931 INFO L290 TraceCheckUtils]: 40: Hoare triple {25084#false} assume !false; {25084#false} is VALID [2022-04-28 03:52:30,931 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-28 03:52:30,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:32,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {25084#false} assume !false; {25084#false} is VALID [2022-04-28 03:52:32,100 INFO L290 TraceCheckUtils]: 39: Hoare triple {25084#false} assume 0 == ~cond; {25084#false} is VALID [2022-04-28 03:52:32,100 INFO L290 TraceCheckUtils]: 38: Hoare triple {25084#false} ~cond := #in~cond; {25084#false} is VALID [2022-04-28 03:52:32,100 INFO L272 TraceCheckUtils]: 37: Hoare triple {25084#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {25084#false} is VALID [2022-04-28 03:52:32,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {25251#(< 0 main_~y~0)} assume !(~y~0 > 0); {25084#false} is VALID [2022-04-28 03:52:32,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {25255#(< 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; {25251#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:32,102 INFO L290 TraceCheckUtils]: 34: Hoare triple {25259#(< 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; {25255#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:32,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {25263#(< 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; {25259#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:32,103 INFO L290 TraceCheckUtils]: 32: Hoare triple {25267#(< 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; {25263#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:32,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {25271#(< 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; {25267#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:32,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {25275#(< 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; {25271#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:32,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {25279#(< 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; {25275#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:32,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {25283#(< 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; {25279#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:32,105 INFO L290 TraceCheckUtils]: 27: Hoare triple {25287#(< 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; {25283#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:32,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {25291#(< 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; {25287#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:32,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {25295#(< 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; {25291#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:32,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {25299#(< 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; {25295#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:32,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {25303#(< 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; {25299#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:32,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {25307#(< 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; {25303#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:32,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {25311#(< 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; {25307#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:32,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {25315#(< 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; {25311#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:32,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {25319#(< 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; {25315#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:32,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {25323#(< 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; {25319#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:32,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {25327#(< 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; {25323#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:32,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {25331#(< 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; {25327#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:32,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {25335#(< 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; {25331#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:32,111 INFO L290 TraceCheckUtils]: 14: Hoare triple {25339#(< 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; {25335#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:32,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {25343#(< 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; {25339#(< 44 main_~y~0)} is VALID [2022-04-28 03:52:32,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {25347#(< 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; {25343#(< 46 main_~y~0)} is VALID [2022-04-28 03:52:32,113 INFO L290 TraceCheckUtils]: 11: Hoare triple {25351#(< 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; {25347#(< 48 main_~y~0)} is VALID [2022-04-28 03:52:32,113 INFO L290 TraceCheckUtils]: 10: Hoare triple {25355#(< 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; {25351#(< 50 main_~y~0)} is VALID [2022-04-28 03:52:32,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {25355#(< 52 main_~y~0)} [162] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {25355#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:32,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {25355#(< 52 main_~y~0)} [165] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= v_main_~x~0_1325 v_main_~x~0_1324)) (.cse2 (= v_main_~y~0_1427 v_main_~y~0_1426)) (.cse3 (= |v_main_#t~post6_179| |v_main_#t~post6_178|)) (.cse4 (= |v_main_#t~post5_179| |v_main_#t~post5_178|)) (.cse0 (<= 500000 v_main_~x~0_1325))) (or (and (< v_main_~x~0_1324 1000001) (= (+ v_main_~x~0_1324 v_main_~y~0_1427) (+ v_main_~x~0_1325 v_main_~y~0_1426)) (< v_main_~x~0_1325 v_main_~x~0_1324) .cse0) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (or (not (< v_main_~x~0_1325 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1427, main_#t~post5=|v_main_#t~post5_179|, main_~x~0=v_main_~x~0_1325, 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_1324, main_#t~post6=|v_main_#t~post6_178|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {25355#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:32,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {25355#(< 52 main_~y~0)} [164] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {25355#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:32,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {25355#(< 52 main_~y~0)} [163] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1323 v_main_~x~0_1322)) (.cse1 (= |v_main_#t~post4_167| |v_main_#t~post4_166|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1323 500000))) (and (< v_main_~x~0_1323 v_main_~x~0_1322) (< v_main_~x~0_1322 500001)))) InVars {main_~x~0=v_main_~x~0_1323, main_#t~post4=|v_main_#t~post4_167|} OutVars{main_~x~0=v_main_~x~0_1322, main_#t~post4=|v_main_#t~post4_166|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {25355#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:32,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {25083#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {25355#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:32,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {25083#true} call #t~ret9 := main(); {25083#true} is VALID [2022-04-28 03:52:32,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25083#true} {25083#true} #53#return; {25083#true} is VALID [2022-04-28 03:52:32,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {25083#true} assume true; {25083#true} is VALID [2022-04-28 03:52:32,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {25083#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(18, 2);call #Ultimate.allocInit(12, 3); {25083#true} is VALID [2022-04-28 03:52:32,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {25083#true} call ULTIMATE.init(); {25083#true} is VALID [2022-04-28 03:52:32,115 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-28 03:52:32,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153224388] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:32,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:32,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 57 [2022-04-28 03:52:34,090 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:34,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1653145914] [2022-04-28 03:52:34,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1653145914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:34,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:34,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [77] imperfect sequences [] total 77 [2022-04-28 03:52:34,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697353632] [2022-04-28 03:52:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:34,091 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-28 03:52:34,091 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:34,091 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-28 03:52:34,184 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-28 03:52:34,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2022-04-28 03:52:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:34,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2022-04-28 03:52:34,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4220, Invalid=6492, Unknown=0, NotChecked=0, Total=10712 [2022-04-28 03:52:34,186 INFO L87 Difference]: Start difference. First operand 222 states and 227 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-28 03:52:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:43,646 INFO L93 Difference]: Finished difference Result 353 states and 369 transitions. [2022-04-28 03:52:43,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2022-04-28 03:52:43,646 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-28 03:52:43,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:52:43,647 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-28 03:52:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 162 transitions. [2022-04-28 03:52:43,648 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-28 03:52:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 162 transitions. [2022-04-28 03:52:43,649 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 162 transitions. [2022-04-28 03:52:43,783 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-28 03:52:43,786 INFO L225 Difference]: With dead ends: 353 [2022-04-28 03:52:43,786 INFO L226 Difference]: Without dead ends: 229 [2022-04-28 03:52:43,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9136 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=9846, Invalid=21660, Unknown=0, NotChecked=0, Total=31506 [2022-04-28 03:52:43,788 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 347 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4423 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 4423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:52:43,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 37 Invalid, 4709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 4423 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-28 03:52:43,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-04-28 03:52:44,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 139. [2022-04-28 03:52:44,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:52:44,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:44,004 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:44,004 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:44,007 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2022-04-28 03:52:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 234 transitions. [2022-04-28 03:52:44,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:44,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:44,007 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 229 states. [2022-04-28 03:52:44,007 INFO L87 Difference]: Start difference. First operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 229 states. [2022-04-28 03:52:44,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:52:44,011 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2022-04-28 03:52:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 234 transitions. [2022-04-28 03:52:44,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:52:44,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:52:44,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:52:44,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:52:44,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 132 states have (on average 1.0378787878787878) internal successors, (137), 133 states have internal predecessors, (137), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:52:44,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 143 transitions. [2022-04-28 03:52:44,013 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 143 transitions. Word has length 130 [2022-04-28 03:52:44,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:52:44,014 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 143 transitions. [2022-04-28 03:52:44,014 INFO L496 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-28 03:52:44,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 143 transitions. [2022-04-28 03:52:44,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:52:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 143 transitions. [2022-04-28 03:52:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-28 03:52:44,133 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:52:44,133 INFO L195 NwaCegarLoop]: trace histogram [48, 47, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:52:44,150 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-28 03:52:44,334 WARN L477 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-28 03:52:44,334 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:52:44,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:52:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash 727508831, now seen corresponding path program 27 times [2022-04-28 03:52:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:44,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [131561989] [2022-04-28 03:52:47,212 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-28 03:52:47,462 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-28 03:52:47,464 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:52:47,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1215805215, now seen corresponding path program 1 times [2022-04-28 03:52:47,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:52:47,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954281644] [2022-04-28 03:52:47,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:47,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:52:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:52:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:47,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {27058#(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(18, 2);call #Ultimate.allocInit(12, 3); {27025#true} is VALID [2022-04-28 03:52:47,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {27025#true} assume true; {27025#true} is VALID [2022-04-28 03:52:47,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27025#true} {27025#true} #53#return; {27025#true} is VALID [2022-04-28 03:52:47,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {27025#true} call ULTIMATE.init(); {27058#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:52:47,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {27058#(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(18, 2);call #Ultimate.allocInit(12, 3); {27025#true} is VALID [2022-04-28 03:52:47,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {27025#true} assume true; {27025#true} is VALID [2022-04-28 03:52:47,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27025#true} {27025#true} #53#return; {27025#true} is VALID [2022-04-28 03:52:47,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {27025#true} call #t~ret9 := main(); {27025#true} is VALID [2022-04-28 03:52:47,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {27025#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:47,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {27030#(<= 500000 main_~y~0)} [167] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1411 v_main_~x~0_1410))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1411 500000))) (and (< v_main_~x~0_1410 500001) (< v_main_~x~0_1411 v_main_~x~0_1410)))) InVars {main_~x~0=v_main_~x~0_1411, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:47,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {27030#(<= 500000 main_~y~0)} [168] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:47,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {27030#(<= 500000 main_~y~0)} [169] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1413 v_main_~x~0_1412)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 500000 v_main_~x~0_1413))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1413 1000000))) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1413 v_main_~y~0_1532))) (and (= .cse5 (+ v_main_~x~0_1412 v_main_~y~0_1533)) (< .cse5 (+ 1000001 v_main_~y~0_1533)) (< v_main_~y~0_1533 v_main_~y~0_1532) .cse4)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1413, 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_1412, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:47,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {27030#(<= 500000 main_~y~0)} [166] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:47,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {27030#(<= 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; {27031#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:52:47,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {27031#(<= 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; {27032#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:52:48,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {27032#(<= 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; {27033#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:52:48,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {27033#(<= 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; {27034#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:52:48,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {27034#(<= 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; {27035#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:52:48,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {27035#(<= 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; {27036#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:52:48,002 INFO L290 TraceCheckUtils]: 16: Hoare triple {27036#(<= 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; {27037#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:52:48,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {27037#(<= 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; {27038#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:52:48,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {27038#(<= 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; {27039#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:52:48,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {27039#(<= 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; {27040#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:52:48,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {27040#(<= 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; {27041#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:52:48,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {27041#(<= 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; {27042#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:52:48,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {27042#(<= 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; {27043#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:52:48,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {27043#(<= 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; {27044#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:52:48,007 INFO L290 TraceCheckUtils]: 24: Hoare triple {27044#(<= 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; {27045#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:52:48,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {27045#(<= 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; {27046#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:52:48,008 INFO L290 TraceCheckUtils]: 26: Hoare triple {27046#(<= 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; {27047#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:52:48,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {27047#(<= 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; {27048#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:52:48,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {27048#(<= 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; {27049#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:52:48,010 INFO L290 TraceCheckUtils]: 29: Hoare triple {27049#(<= 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; {27050#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:52:48,010 INFO L290 TraceCheckUtils]: 30: Hoare triple {27050#(<= 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; {27051#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:52:48,011 INFO L290 TraceCheckUtils]: 31: Hoare triple {27051#(<= 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; {27052#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:52:48,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {27052#(<= 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; {27053#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:52:48,012 INFO L290 TraceCheckUtils]: 33: Hoare triple {27053#(<= 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; {27054#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:52:48,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {27054#(<= 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; {27055#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:52:48,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {27055#(<= 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; {27056#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:52:48,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {27056#(<= 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; {27057#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:52:48,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {27057#(<= 499946 main_~y~0)} assume !(~y~0 > 0); {27026#false} is VALID [2022-04-28 03:52:48,015 INFO L272 TraceCheckUtils]: 38: Hoare triple {27026#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {27026#false} is VALID [2022-04-28 03:52:48,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {27026#false} ~cond := #in~cond; {27026#false} is VALID [2022-04-28 03:52:48,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {27026#false} assume 0 == ~cond; {27026#false} is VALID [2022-04-28 03:52:48,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {27026#false} assume !false; {27026#false} is VALID [2022-04-28 03:52:48,015 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-28 03:52:48,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:52:48,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954281644] [2022-04-28 03:52:48,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954281644] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:52:48,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040285011] [2022-04-28 03:52:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:52:48,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:52:48,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:52:48,017 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-28 03:52:48,019 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-28 03:52:48,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:48,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 03:52:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:52:48,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:52:48,565 INFO L272 TraceCheckUtils]: 0: Hoare triple {27025#true} call ULTIMATE.init(); {27025#true} is VALID [2022-04-28 03:52:48,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {27025#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(18, 2);call #Ultimate.allocInit(12, 3); {27025#true} is VALID [2022-04-28 03:52:48,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {27025#true} assume true; {27025#true} is VALID [2022-04-28 03:52:48,565 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27025#true} {27025#true} #53#return; {27025#true} is VALID [2022-04-28 03:52:48,565 INFO L272 TraceCheckUtils]: 4: Hoare triple {27025#true} call #t~ret9 := main(); {27025#true} is VALID [2022-04-28 03:52:48,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {27025#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:48,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {27030#(<= 500000 main_~y~0)} [167] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1411 v_main_~x~0_1410))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1411 500000))) (and (< v_main_~x~0_1410 500001) (< v_main_~x~0_1411 v_main_~x~0_1410)))) InVars {main_~x~0=v_main_~x~0_1411, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:48,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {27030#(<= 500000 main_~y~0)} [168] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:48,567 INFO L290 TraceCheckUtils]: 8: Hoare triple {27030#(<= 500000 main_~y~0)} [169] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1413 v_main_~x~0_1412)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 500000 v_main_~x~0_1413))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1413 1000000))) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1413 v_main_~y~0_1532))) (and (= .cse5 (+ v_main_~x~0_1412 v_main_~y~0_1533)) (< .cse5 (+ 1000001 v_main_~y~0_1533)) (< v_main_~y~0_1533 v_main_~y~0_1532) .cse4)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1413, 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_1412, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:48,568 INFO L290 TraceCheckUtils]: 9: Hoare triple {27030#(<= 500000 main_~y~0)} [166] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {27030#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:52:48,568 INFO L290 TraceCheckUtils]: 10: Hoare triple {27030#(<= 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; {27031#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:52:48,569 INFO L290 TraceCheckUtils]: 11: Hoare triple {27031#(<= 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; {27032#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:52:48,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {27032#(<= 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; {27033#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:52:48,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {27033#(<= 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; {27034#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:52:48,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {27034#(<= 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; {27035#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:52:48,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {27035#(<= 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; {27036#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:52:48,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {27036#(<= 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; {27037#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:52:48,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {27037#(<= 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; {27038#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:52:48,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {27038#(<= 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; {27039#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:52:48,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {27039#(<= 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; {27040#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:52:48,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {27040#(<= 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; {27041#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:52:48,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {27041#(<= 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; {27042#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:52:48,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {27042#(<= 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; {27043#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:52:48,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {27043#(<= 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; {27044#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:52:48,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {27044#(<= 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; {27045#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:52:48,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {27045#(<= 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; {27046#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:52:48,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {27046#(<= 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; {27047#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:52:48,577 INFO L290 TraceCheckUtils]: 27: Hoare triple {27047#(<= 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; {27048#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:52:48,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {27048#(<= 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; {27049#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:52:48,578 INFO L290 TraceCheckUtils]: 29: Hoare triple {27049#(<= 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; {27050#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:52:48,579 INFO L290 TraceCheckUtils]: 30: Hoare triple {27050#(<= 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; {27051#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:52:48,579 INFO L290 TraceCheckUtils]: 31: Hoare triple {27051#(<= 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; {27052#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:52:48,580 INFO L290 TraceCheckUtils]: 32: Hoare triple {27052#(<= 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; {27053#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:52:48,580 INFO L290 TraceCheckUtils]: 33: Hoare triple {27053#(<= 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; {27054#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:52:48,581 INFO L290 TraceCheckUtils]: 34: Hoare triple {27054#(<= 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; {27055#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:52:48,581 INFO L290 TraceCheckUtils]: 35: Hoare triple {27055#(<= 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; {27056#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:52:48,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {27056#(<= 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; {27057#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:52:48,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {27057#(<= 499946 main_~y~0)} assume !(~y~0 > 0); {27026#false} is VALID [2022-04-28 03:52:48,582 INFO L272 TraceCheckUtils]: 38: Hoare triple {27026#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {27026#false} is VALID [2022-04-28 03:52:48,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {27026#false} ~cond := #in~cond; {27026#false} is VALID [2022-04-28 03:52:48,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {27026#false} assume 0 == ~cond; {27026#false} is VALID [2022-04-28 03:52:48,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {27026#false} assume !false; {27026#false} is VALID [2022-04-28 03:52:48,583 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-28 03:52:48,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:52:49,925 INFO L290 TraceCheckUtils]: 41: Hoare triple {27026#false} assume !false; {27026#false} is VALID [2022-04-28 03:52:49,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {27026#false} assume 0 == ~cond; {27026#false} is VALID [2022-04-28 03:52:49,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {27026#false} ~cond := #in~cond; {27026#false} is VALID [2022-04-28 03:52:49,926 INFO L272 TraceCheckUtils]: 38: Hoare triple {27026#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {27026#false} is VALID [2022-04-28 03:52:49,926 INFO L290 TraceCheckUtils]: 37: Hoare triple {27197#(< 0 main_~y~0)} assume !(~y~0 > 0); {27026#false} is VALID [2022-04-28 03:52:49,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {27201#(< 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; {27197#(< 0 main_~y~0)} is VALID [2022-04-28 03:52:49,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {27205#(< 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; {27201#(< 2 main_~y~0)} is VALID [2022-04-28 03:52:49,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {27209#(< 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; {27205#(< 4 main_~y~0)} is VALID [2022-04-28 03:52:49,928 INFO L290 TraceCheckUtils]: 33: Hoare triple {27213#(< 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; {27209#(< 6 main_~y~0)} is VALID [2022-04-28 03:52:49,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {27217#(< 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; {27213#(< 8 main_~y~0)} is VALID [2022-04-28 03:52:49,929 INFO L290 TraceCheckUtils]: 31: Hoare triple {27221#(< 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; {27217#(< 10 main_~y~0)} is VALID [2022-04-28 03:52:49,929 INFO L290 TraceCheckUtils]: 30: Hoare triple {27225#(< 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; {27221#(< 12 main_~y~0)} is VALID [2022-04-28 03:52:49,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {27229#(< 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; {27225#(< 14 main_~y~0)} is VALID [2022-04-28 03:52:49,930 INFO L290 TraceCheckUtils]: 28: Hoare triple {27233#(< 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; {27229#(< 16 main_~y~0)} is VALID [2022-04-28 03:52:49,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {27237#(< 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; {27233#(< 18 main_~y~0)} is VALID [2022-04-28 03:52:49,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {27241#(< 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; {27237#(< 20 main_~y~0)} is VALID [2022-04-28 03:52:49,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {27245#(< 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; {27241#(< 22 main_~y~0)} is VALID [2022-04-28 03:52:49,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {27249#(< 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; {27245#(< 24 main_~y~0)} is VALID [2022-04-28 03:52:49,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {27253#(< 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; {27249#(< 26 main_~y~0)} is VALID [2022-04-28 03:52:49,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {27257#(< 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; {27253#(< 28 main_~y~0)} is VALID [2022-04-28 03:52:49,933 INFO L290 TraceCheckUtils]: 21: Hoare triple {27261#(< 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; {27257#(< 30 main_~y~0)} is VALID [2022-04-28 03:52:49,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {27265#(< 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; {27261#(< 32 main_~y~0)} is VALID [2022-04-28 03:52:49,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {27269#(< 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; {27265#(< 34 main_~y~0)} is VALID [2022-04-28 03:52:49,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {27273#(< 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; {27269#(< 36 main_~y~0)} is VALID [2022-04-28 03:52:49,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {27277#(< 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; {27273#(< 38 main_~y~0)} is VALID [2022-04-28 03:52:49,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {27281#(< 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; {27277#(< 40 main_~y~0)} is VALID [2022-04-28 03:52:49,936 INFO L290 TraceCheckUtils]: 15: Hoare triple {27285#(< 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; {27281#(< 42 main_~y~0)} is VALID [2022-04-28 03:52:49,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {27289#(< 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; {27285#(< 44 main_~y~0)} is VALID [2022-04-28 03:52:49,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {27293#(< 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; {27289#(< 46 main_~y~0)} is VALID [2022-04-28 03:52:49,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {27297#(< 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; {27293#(< 48 main_~y~0)} is VALID [2022-04-28 03:52:49,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {27301#(< 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; {27297#(< 50 main_~y~0)} is VALID [2022-04-28 03:52:49,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {27305#(< 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; {27301#(< 52 main_~y~0)} is VALID [2022-04-28 03:52:49,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {27305#(< 54 main_~y~0)} [166] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {27305#(< 54 main_~y~0)} is VALID [2022-04-28 03:52:49,939 INFO L290 TraceCheckUtils]: 8: Hoare triple {27305#(< 54 main_~y~0)} [169] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1413 v_main_~x~0_1412)) (.cse1 (= |v_main_#t~post5_186| |v_main_#t~post5_185|)) (.cse2 (= v_main_~y~0_1533 v_main_~y~0_1532)) (.cse3 (= |v_main_#t~post6_186| |v_main_#t~post6_185|)) (.cse4 (<= 500000 v_main_~x~0_1413))) (or (and .cse0 .cse1 .cse2 .cse3) (and (or (not .cse4) (not (< v_main_~x~0_1413 1000000))) .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1413 v_main_~y~0_1532))) (and (= .cse5 (+ v_main_~x~0_1412 v_main_~y~0_1533)) (< .cse5 (+ 1000001 v_main_~y~0_1533)) (< v_main_~y~0_1533 v_main_~y~0_1532) .cse4)))) InVars {main_~y~0=v_main_~y~0_1533, main_#t~post5=|v_main_#t~post5_186|, main_~x~0=v_main_~x~0_1413, 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_1412, main_#t~post6=|v_main_#t~post6_185|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {27305#(< 54 main_~y~0)} is VALID [2022-04-28 03:52:49,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {27305#(< 54 main_~y~0)} [168] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {27305#(< 54 main_~y~0)} is VALID [2022-04-28 03:52:49,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {27305#(< 54 main_~y~0)} [167] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_173| |v_main_#t~post4_172|)) (.cse1 (= v_main_~x~0_1411 v_main_~x~0_1410))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_1411 500000))) (and (< v_main_~x~0_1410 500001) (< v_main_~x~0_1411 v_main_~x~0_1410)))) InVars {main_~x~0=v_main_~x~0_1411, main_#t~post4=|v_main_#t~post4_173|} OutVars{main_~x~0=v_main_~x~0_1410, main_#t~post4=|v_main_#t~post4_172|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {27305#(< 54 main_~y~0)} is VALID [2022-04-28 03:52:49,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {27025#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {27305#(< 54 main_~y~0)} is VALID [2022-04-28 03:52:49,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {27025#true} call #t~ret9 := main(); {27025#true} is VALID [2022-04-28 03:52:49,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27025#true} {27025#true} #53#return; {27025#true} is VALID [2022-04-28 03:52:49,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {27025#true} assume true; {27025#true} is VALID [2022-04-28 03:52:49,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {27025#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(18, 2);call #Ultimate.allocInit(12, 3); {27025#true} is VALID [2022-04-28 03:52:49,950 INFO L272 TraceCheckUtils]: 0: Hoare triple {27025#true} call ULTIMATE.init(); {27025#true} is VALID [2022-04-28 03:52:49,950 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-28 03:52:49,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040285011] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:52:49,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:52:49,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 59 [2022-04-28 03:52:51,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:52:51,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [131561989] [2022-04-28 03:52:51,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [131561989] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:52:51,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:52:51,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [80] imperfect sequences [] total 80 [2022-04-28 03:52:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431095636] [2022-04-28 03:52:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:52:51,890 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-28 03:52:51,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:52:51,890 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-28 03:52:52,008 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-28 03:52:52,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-04-28 03:52:52,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:52:52,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-04-28 03:52:52,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4545, Invalid=7011, Unknown=0, NotChecked=0, Total=11556 [2022-04-28 03:52:52,010 INFO L87 Difference]: Start difference. First operand 139 states and 143 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-28 03:53:01,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:01,933 INFO L93 Difference]: Finished difference Result 275 states and 288 transitions. [2022-04-28 03:53:01,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-04-28 03:53:01,933 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-28 03:53:01,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:01,934 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-28 03:53:01,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 165 transitions. [2022-04-28 03:53:01,935 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-28 03:53:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 165 transitions. [2022-04-28 03:53:01,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 165 transitions. [2022-04-28 03:53:02,075 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-28 03:53:02,077 INFO L225 Difference]: With dead ends: 275 [2022-04-28 03:53:02,077 INFO L226 Difference]: Without dead ends: 144 [2022-04-28 03:53:02,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9879 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=10605, Invalid=23435, Unknown=0, NotChecked=0, Total=34040 [2022-04-28 03:53:02,080 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 264 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4810 mSolverCounterSat, 344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 344 IncrementalHoareTripleChecker+Valid, 4810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:02,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 27 Invalid, 5154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [344 Valid, 4810 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-04-28 03:53:02,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-28 03:53:02,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-04-28 03:53:02,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:02,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:02,317 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:02,317 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:02,319 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:53:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:53:02,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:02,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:02,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 144 states. [2022-04-28 03:53:02,320 INFO L87 Difference]: Start difference. First operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 144 states. [2022-04-28 03:53:02,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:02,322 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2022-04-28 03:53:02,322 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:53:02,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:02,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:02,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:02,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 138 states have internal predecessors, (142), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-28 03:53:02,324 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 135 [2022-04-28 03:53:02,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:02,325 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-28 03:53:02,325 INFO L496 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-28 03:53:02,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-28 03:53:02,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:02,478 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-28 03:53:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-28 03:53:02,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:02,478 INFO L195 NwaCegarLoop]: trace histogram [50, 49, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:02,504 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-28 03:53:02,679 WARN L477 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-28 03:53:02,679 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:02,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 535217326, now seen corresponding path program 28 times [2022-04-28 03:53:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:02,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128674917] [2022-04-28 03:53:02,816 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-28 03:53:03,056 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-28 03:53:03,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash -351322590, now seen corresponding path program 1 times [2022-04-28 03:53:03,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:03,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039830693] [2022-04-28 03:53:03,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:03,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:03,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {28701#(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(18, 2);call #Ultimate.allocInit(12, 3); {28667#true} is VALID [2022-04-28 03:53:03,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {28667#true} assume true; {28667#true} is VALID [2022-04-28 03:53:03,536 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28667#true} {28667#true} #53#return; {28667#true} is VALID [2022-04-28 03:53:03,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {28667#true} call ULTIMATE.init(); {28701#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:03,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {28701#(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(18, 2);call #Ultimate.allocInit(12, 3); {28667#true} is VALID [2022-04-28 03:53:03,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {28667#true} assume true; {28667#true} is VALID [2022-04-28 03:53:03,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28667#true} {28667#true} #53#return; {28667#true} is VALID [2022-04-28 03:53:03,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {28667#true} call #t~ret9 := main(); {28667#true} is VALID [2022-04-28 03:53:03,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {28667#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:03,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {28672#(<= 500000 main_~y~0)} [171] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_179| |v_main_#t~post4_178|)) (.cse1 (= v_main_~x~0_1502 v_main_~x~0_1501))) (or (and (< v_main_~x~0_1501 500001) (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1502)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1502, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:03,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {28672#(<= 500000 main_~y~0)} [172] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:03,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {28672#(<= 500000 main_~y~0)} [173] L10-2-->L17-1_primed: Formula: (let ((.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_1504 v_main_~x~0_1503)) (.cse3 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse4 (<= 500000 v_main_~x~0_1504))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1504 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1504 v_main_~y~0_1642))) (and (= (+ v_main_~x~0_1503 v_main_~y~0_1643) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) .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_1504, 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_1503, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:03,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {28672#(<= 500000 main_~y~0)} [170] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:03,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {28672#(<= 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; {28673#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:03,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {28673#(<= 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; {28674#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:03,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {28674#(<= 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; {28675#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:03,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {28675#(<= 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; {28676#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:03,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {28676#(<= 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; {28677#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:03,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {28677#(<= 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; {28678#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:03,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {28678#(<= 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; {28679#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:03,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {28679#(<= 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; {28680#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:03,543 INFO L290 TraceCheckUtils]: 18: Hoare triple {28680#(<= 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; {28681#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:03,544 INFO L290 TraceCheckUtils]: 19: Hoare triple {28681#(<= 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; {28682#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:03,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {28682#(<= 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; {28683#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:03,545 INFO L290 TraceCheckUtils]: 21: Hoare triple {28683#(<= 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; {28684#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:03,545 INFO L290 TraceCheckUtils]: 22: Hoare triple {28684#(<= 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; {28685#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:03,545 INFO L290 TraceCheckUtils]: 23: Hoare triple {28685#(<= 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; {28686#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:03,546 INFO L290 TraceCheckUtils]: 24: Hoare triple {28686#(<= 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; {28687#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:03,546 INFO L290 TraceCheckUtils]: 25: Hoare triple {28687#(<= 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; {28688#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:03,547 INFO L290 TraceCheckUtils]: 26: Hoare triple {28688#(<= 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; {28689#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:03,547 INFO L290 TraceCheckUtils]: 27: Hoare triple {28689#(<= 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; {28690#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:03,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {28690#(<= 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; {28691#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:03,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {28691#(<= 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; {28692#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:03,549 INFO L290 TraceCheckUtils]: 30: Hoare triple {28692#(<= 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; {28693#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:03,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {28693#(<= 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; {28694#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:03,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {28694#(<= 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; {28695#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:03,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {28695#(<= 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; {28696#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:03,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {28696#(<= 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; {28697#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:03,551 INFO L290 TraceCheckUtils]: 35: Hoare triple {28697#(<= 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; {28698#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:03,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {28698#(<= 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; {28699#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:03,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {28699#(<= 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; {28700#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:03,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {28700#(<= 499944 main_~y~0)} assume !(~y~0 > 0); {28668#false} is VALID [2022-04-28 03:53:03,553 INFO L272 TraceCheckUtils]: 39: Hoare triple {28668#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {28668#false} is VALID [2022-04-28 03:53:03,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {28668#false} ~cond := #in~cond; {28668#false} is VALID [2022-04-28 03:53:03,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {28668#false} assume 0 == ~cond; {28668#false} is VALID [2022-04-28 03:53:03,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {28668#false} assume !false; {28668#false} is VALID [2022-04-28 03:53:03,553 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-28 03:53:03,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:03,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039830693] [2022-04-28 03:53:03,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039830693] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:03,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928062025] [2022-04-28 03:53:03,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:03,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:03,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:03,554 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-28 03:53:03,555 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-28 03:53:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:03,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 03:53:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:03,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:04,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {28667#true} call ULTIMATE.init(); {28667#true} is VALID [2022-04-28 03:53:04,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {28667#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(18, 2);call #Ultimate.allocInit(12, 3); {28667#true} is VALID [2022-04-28 03:53:04,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {28667#true} assume true; {28667#true} is VALID [2022-04-28 03:53:04,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28667#true} {28667#true} #53#return; {28667#true} is VALID [2022-04-28 03:53:04,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {28667#true} call #t~ret9 := main(); {28667#true} is VALID [2022-04-28 03:53:04,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {28667#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:04,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {28672#(<= 500000 main_~y~0)} [171] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_179| |v_main_#t~post4_178|)) (.cse1 (= v_main_~x~0_1502 v_main_~x~0_1501))) (or (and (< v_main_~x~0_1501 500001) (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1502)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1502, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:04,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {28672#(<= 500000 main_~y~0)} [172] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:04,050 INFO L290 TraceCheckUtils]: 8: Hoare triple {28672#(<= 500000 main_~y~0)} [173] L10-2-->L17-1_primed: Formula: (let ((.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_1504 v_main_~x~0_1503)) (.cse3 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse4 (<= 500000 v_main_~x~0_1504))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1504 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1504 v_main_~y~0_1642))) (and (= (+ v_main_~x~0_1503 v_main_~y~0_1643) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) .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_1504, 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_1503, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:04,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {28672#(<= 500000 main_~y~0)} [170] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {28672#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:04,051 INFO L290 TraceCheckUtils]: 10: Hoare triple {28672#(<= 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; {28673#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:04,052 INFO L290 TraceCheckUtils]: 11: Hoare triple {28673#(<= 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; {28674#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:04,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {28674#(<= 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; {28675#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:04,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {28675#(<= 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; {28676#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:04,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {28676#(<= 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; {28677#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:04,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {28677#(<= 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; {28678#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:04,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {28678#(<= 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; {28679#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:04,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {28679#(<= 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; {28680#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:04,055 INFO L290 TraceCheckUtils]: 18: Hoare triple {28680#(<= 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; {28681#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:04,055 INFO L290 TraceCheckUtils]: 19: Hoare triple {28681#(<= 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; {28682#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:04,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {28682#(<= 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; {28683#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:04,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {28683#(<= 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; {28684#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:04,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {28684#(<= 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; {28685#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:04,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {28685#(<= 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; {28686#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:04,058 INFO L290 TraceCheckUtils]: 24: Hoare triple {28686#(<= 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; {28687#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:04,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {28687#(<= 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; {28688#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:04,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {28688#(<= 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; {28689#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:04,059 INFO L290 TraceCheckUtils]: 27: Hoare triple {28689#(<= 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; {28690#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:04,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {28690#(<= 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; {28691#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:04,060 INFO L290 TraceCheckUtils]: 29: Hoare triple {28691#(<= 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; {28692#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:04,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {28692#(<= 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; {28693#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:04,061 INFO L290 TraceCheckUtils]: 31: Hoare triple {28693#(<= 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; {28694#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:04,061 INFO L290 TraceCheckUtils]: 32: Hoare triple {28694#(<= 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; {28695#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:04,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {28695#(<= 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; {28696#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:04,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {28696#(<= 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; {28697#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:04,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {28697#(<= 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; {28698#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:04,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {28698#(<= 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; {28699#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:04,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {28699#(<= 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; {28700#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:04,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {28700#(<= 499944 main_~y~0)} assume !(~y~0 > 0); {28668#false} is VALID [2022-04-28 03:53:04,064 INFO L272 TraceCheckUtils]: 39: Hoare triple {28668#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {28668#false} is VALID [2022-04-28 03:53:04,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {28668#false} ~cond := #in~cond; {28668#false} is VALID [2022-04-28 03:53:04,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {28668#false} assume 0 == ~cond; {28668#false} is VALID [2022-04-28 03:53:04,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {28668#false} assume !false; {28668#false} is VALID [2022-04-28 03:53:04,065 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-28 03:53:04,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:05,379 INFO L290 TraceCheckUtils]: 42: Hoare triple {28668#false} assume !false; {28668#false} is VALID [2022-04-28 03:53:05,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {28668#false} assume 0 == ~cond; {28668#false} is VALID [2022-04-28 03:53:05,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {28668#false} ~cond := #in~cond; {28668#false} is VALID [2022-04-28 03:53:05,380 INFO L272 TraceCheckUtils]: 39: Hoare triple {28668#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {28668#false} is VALID [2022-04-28 03:53:05,380 INFO L290 TraceCheckUtils]: 38: Hoare triple {28843#(< 0 main_~y~0)} assume !(~y~0 > 0); {28668#false} is VALID [2022-04-28 03:53:05,380 INFO L290 TraceCheckUtils]: 37: Hoare triple {28847#(< 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; {28843#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:05,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {28851#(< 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; {28847#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:05,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {28855#(< 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; {28851#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:05,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {28859#(< 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; {28855#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:05,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {28863#(< 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; {28859#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:05,383 INFO L290 TraceCheckUtils]: 32: Hoare triple {28867#(< 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; {28863#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:05,383 INFO L290 TraceCheckUtils]: 31: Hoare triple {28871#(< 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; {28867#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:05,384 INFO L290 TraceCheckUtils]: 30: Hoare triple {28875#(< 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; {28871#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:05,384 INFO L290 TraceCheckUtils]: 29: Hoare triple {28879#(< 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; {28875#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:05,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {28883#(< 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; {28879#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:05,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {28887#(< 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; {28883#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:05,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {28891#(< 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; {28887#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:05,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {28895#(< 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; {28891#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:05,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {28899#(< 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; {28895#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:05,387 INFO L290 TraceCheckUtils]: 23: Hoare triple {28903#(< 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; {28899#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:05,387 INFO L290 TraceCheckUtils]: 22: Hoare triple {28907#(< 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; {28903#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:05,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {28911#(< 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; {28907#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:05,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {28915#(< 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; {28911#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:05,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {28919#(< 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; {28915#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:05,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {28923#(< 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; {28919#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:05,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {28927#(< 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; {28923#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:05,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {28931#(< 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; {28927#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:05,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {28935#(< 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; {28931#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:05,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {28939#(< 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; {28935#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:05,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {28943#(< 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; {28939#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:05,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {28947#(< 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; {28943#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:05,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {28951#(< 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; {28947#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:05,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {28955#(< 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; {28951#(< 54 main_~y~0)} is VALID [2022-04-28 03:53:05,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {28955#(< 56 main_~y~0)} [170] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {28955#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:05,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {28955#(< 56 main_~y~0)} [173] L10-2-->L17-1_primed: Formula: (let ((.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_1504 v_main_~x~0_1503)) (.cse3 (= |v_main_#t~post6_193| |v_main_#t~post6_192|)) (.cse4 (<= 500000 v_main_~x~0_1504))) (or (and .cse0 .cse1 .cse2 .cse3 (or (not .cse4) (not (< v_main_~x~0_1504 1000000)))) (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_1504 v_main_~y~0_1642))) (and (= (+ v_main_~x~0_1503 v_main_~y~0_1643) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1643)) (< v_main_~y~0_1643 v_main_~y~0_1642) .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_1504, 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_1503, main_#t~post6=|v_main_#t~post6_192|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {28955#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:05,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {28955#(< 56 main_~y~0)} [172] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {28955#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:05,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {28955#(< 56 main_~y~0)} [171] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_179| |v_main_#t~post4_178|)) (.cse1 (= v_main_~x~0_1502 v_main_~x~0_1501))) (or (and (< v_main_~x~0_1501 500001) (< v_main_~x~0_1502 v_main_~x~0_1501)) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1502)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1502, main_#t~post4=|v_main_#t~post4_179|} OutVars{main_~x~0=v_main_~x~0_1501, main_#t~post4=|v_main_#t~post4_178|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {28955#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:05,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {28667#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {28955#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:05,395 INFO L272 TraceCheckUtils]: 4: Hoare triple {28667#true} call #t~ret9 := main(); {28667#true} is VALID [2022-04-28 03:53:05,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28667#true} {28667#true} #53#return; {28667#true} is VALID [2022-04-28 03:53:05,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {28667#true} assume true; {28667#true} is VALID [2022-04-28 03:53:05,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {28667#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(18, 2);call #Ultimate.allocInit(12, 3); {28667#true} is VALID [2022-04-28 03:53:05,395 INFO L272 TraceCheckUtils]: 0: Hoare triple {28667#true} call ULTIMATE.init(); {28667#true} is VALID [2022-04-28 03:53:05,396 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-28 03:53:05,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928062025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:05,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:05,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 61 [2022-04-28 03:53:07,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:07,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128674917] [2022-04-28 03:53:07,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128674917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:07,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:07,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [83] imperfect sequences [] total 83 [2022-04-28 03:53:07,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903906274] [2022-04-28 03:53:07,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:07,491 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-28 03:53:07,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:07,491 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-28 03:53:07,589 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-28 03:53:07,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-04-28 03:53:07,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:07,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-04-28 03:53:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4882, Invalid=7550, Unknown=0, NotChecked=0, Total=12432 [2022-04-28 03:53:07,591 INFO L87 Difference]: Start difference. First operand 144 states and 148 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-28 03:53:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:18,383 INFO L93 Difference]: Finished difference Result 285 states and 298 transitions. [2022-04-28 03:53:18,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-04-28 03:53:18,384 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-28 03:53:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:18,384 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-28 03:53:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 170 transitions. [2022-04-28 03:53:18,385 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-28 03:53:18,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 170 transitions. [2022-04-28 03:53:18,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 170 transitions. [2022-04-28 03:53:18,528 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-28 03:53:18,530 INFO L225 Difference]: With dead ends: 285 [2022-04-28 03:53:18,530 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 03:53:18,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 112 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10651 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=11392, Invalid=25280, Unknown=0, NotChecked=0, Total=36672 [2022-04-28 03:53:18,532 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 274 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5241 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 5599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 5241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:18,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 52 Invalid, 5599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 5241 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-04-28 03:53:18,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 03:53:18,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-04-28 03:53:18,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:18,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:18,754 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:18,754 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:18,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:18,755 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2022-04-28 03:53:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-28 03:53:18,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:18,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:18,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 149 states. [2022-04-28 03:53:18,756 INFO L87 Difference]: Start difference. First operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 149 states. [2022-04-28 03:53:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:18,757 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2022-04-28 03:53:18,757 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-28 03:53:18,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:18,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:18,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:18,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 142 states have (on average 1.0352112676056338) internal successors, (147), 143 states have internal predecessors, (147), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 153 transitions. [2022-04-28 03:53:18,759 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 153 transitions. Word has length 140 [2022-04-28 03:53:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:18,759 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 153 transitions. [2022-04-28 03:53:18,760 INFO L496 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-28 03:53:18,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 153 transitions. [2022-04-28 03:53:18,897 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 153 transitions. [2022-04-28 03:53:18,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-28 03:53:18,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:18,898 INFO L195 NwaCegarLoop]: trace histogram [52, 51, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:18,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-28 03:53:19,111 WARN L477 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-28 03:53:19,111 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:19,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash 447645419, now seen corresponding path program 29 times [2022-04-28 03:53:19,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:19,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [552259159] [2022-04-28 03:53:19,205 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-28 03:53:23,325 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:23,424 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-28 03:53:23,425 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:23,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1187884287, now seen corresponding path program 1 times [2022-04-28 03:53:23,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:23,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335095436] [2022-04-28 03:53:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:23,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:23,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {30400#(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(18, 2);call #Ultimate.allocInit(12, 3); {30365#true} is VALID [2022-04-28 03:53:23,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {30365#true} assume true; {30365#true} is VALID [2022-04-28 03:53:23,920 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30365#true} {30365#true} #53#return; {30365#true} is VALID [2022-04-28 03:53:23,920 INFO L272 TraceCheckUtils]: 0: Hoare triple {30365#true} call ULTIMATE.init(); {30400#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:23,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {30400#(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(18, 2);call #Ultimate.allocInit(12, 3); {30365#true} is VALID [2022-04-28 03:53:23,920 INFO L290 TraceCheckUtils]: 2: Hoare triple {30365#true} assume true; {30365#true} is VALID [2022-04-28 03:53:23,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30365#true} {30365#true} #53#return; {30365#true} is VALID [2022-04-28 03:53:23,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {30365#true} call #t~ret9 := main(); {30365#true} is VALID [2022-04-28 03:53:23,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {30365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:23,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {30370#(<= 500000 main_~y~0)} [175] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1596 v_main_~x~0_1595))) (or (and (< v_main_~x~0_1595 500001) (< v_main_~x~0_1596 v_main_~x~0_1595)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1596 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1596, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:23,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {30370#(<= 500000 main_~y~0)} [176] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:23,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {30370#(<= 500000 main_~y~0)} [177] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1598)) (.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse1 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse3 (= v_main_~x~0_1598 v_main_~x~0_1597)) (.cse4 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1598 1000000)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1598 v_main_~y~0_1756))) (and .cse2 (< .cse5 (+ 1000001 v_main_~y~0_1757)) (= (+ v_main_~x~0_1597 v_main_~y~0_1757) .cse5) (< v_main_~y~0_1757 v_main_~y~0_1756))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1598, 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_1597, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:23,923 INFO L290 TraceCheckUtils]: 9: Hoare triple {30370#(<= 500000 main_~y~0)} [174] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:23,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {30370#(<= 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; {30371#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:23,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {30371#(<= 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; {30372#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:23,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {30372#(<= 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; {30373#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:23,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {30373#(<= 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; {30374#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:23,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {30374#(<= 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; {30375#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:23,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {30375#(<= 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; {30376#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:23,927 INFO L290 TraceCheckUtils]: 16: Hoare triple {30376#(<= 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; {30377#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:23,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {30377#(<= 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; {30378#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:23,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {30378#(<= 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; {30379#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:23,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {30379#(<= 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; {30380#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:23,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {30380#(<= 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; {30381#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:23,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {30381#(<= 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; {30382#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:23,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {30382#(<= 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; {30383#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:23,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {30383#(<= 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; {30384#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:23,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {30384#(<= 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; {30385#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:23,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {30385#(<= 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; {30386#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:23,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {30386#(<= 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; {30387#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:23,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {30387#(<= 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; {30388#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:23,935 INFO L290 TraceCheckUtils]: 28: Hoare triple {30388#(<= 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; {30389#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:23,935 INFO L290 TraceCheckUtils]: 29: Hoare triple {30389#(<= 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; {30390#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:23,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {30390#(<= 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; {30391#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:23,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {30391#(<= 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; {30392#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:23,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {30392#(<= 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; {30393#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:23,938 INFO L290 TraceCheckUtils]: 33: Hoare triple {30393#(<= 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; {30394#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:23,938 INFO L290 TraceCheckUtils]: 34: Hoare triple {30394#(<= 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; {30395#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:23,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {30395#(<= 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; {30396#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:23,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {30396#(<= 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; {30397#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:23,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {30397#(<= 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; {30398#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:23,941 INFO L290 TraceCheckUtils]: 38: Hoare triple {30398#(<= 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; {30399#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:53:23,941 INFO L290 TraceCheckUtils]: 39: Hoare triple {30399#(<= 499942 main_~y~0)} assume !(~y~0 > 0); {30366#false} is VALID [2022-04-28 03:53:23,941 INFO L272 TraceCheckUtils]: 40: Hoare triple {30366#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {30366#false} is VALID [2022-04-28 03:53:23,941 INFO L290 TraceCheckUtils]: 41: Hoare triple {30366#false} ~cond := #in~cond; {30366#false} is VALID [2022-04-28 03:53:23,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {30366#false} assume 0 == ~cond; {30366#false} is VALID [2022-04-28 03:53:23,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {30366#false} assume !false; {30366#false} is VALID [2022-04-28 03:53:23,942 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-28 03:53:23,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:23,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335095436] [2022-04-28 03:53:23,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335095436] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:23,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091253284] [2022-04-28 03:53:23,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:23,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:23,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:23,948 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-28 03:53:23,949 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-28 03:53:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:24,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 03:53:24,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:24,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:24,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {30365#true} call ULTIMATE.init(); {30365#true} is VALID [2022-04-28 03:53:24,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {30365#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(18, 2);call #Ultimate.allocInit(12, 3); {30365#true} is VALID [2022-04-28 03:53:24,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {30365#true} assume true; {30365#true} is VALID [2022-04-28 03:53:24,496 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30365#true} {30365#true} #53#return; {30365#true} is VALID [2022-04-28 03:53:24,496 INFO L272 TraceCheckUtils]: 4: Hoare triple {30365#true} call #t~ret9 := main(); {30365#true} is VALID [2022-04-28 03:53:24,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {30365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:24,497 INFO L290 TraceCheckUtils]: 6: Hoare triple {30370#(<= 500000 main_~y~0)} [175] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1596 v_main_~x~0_1595))) (or (and (< v_main_~x~0_1595 500001) (< v_main_~x~0_1596 v_main_~x~0_1595)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1596 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1596, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:24,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {30370#(<= 500000 main_~y~0)} [176] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:24,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {30370#(<= 500000 main_~y~0)} [177] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1598)) (.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse1 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse3 (= v_main_~x~0_1598 v_main_~x~0_1597)) (.cse4 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1598 1000000)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1598 v_main_~y~0_1756))) (and .cse2 (< .cse5 (+ 1000001 v_main_~y~0_1757)) (= (+ v_main_~x~0_1597 v_main_~y~0_1757) .cse5) (< v_main_~y~0_1757 v_main_~y~0_1756))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1598, 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_1597, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:24,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {30370#(<= 500000 main_~y~0)} [174] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {30370#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:24,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {30370#(<= 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; {30371#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:24,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {30371#(<= 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; {30372#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:24,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {30372#(<= 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; {30373#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:24,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {30373#(<= 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; {30374#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:24,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {30374#(<= 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; {30375#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:24,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {30375#(<= 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; {30376#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:24,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {30376#(<= 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; {30377#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:24,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {30377#(<= 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; {30378#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:24,502 INFO L290 TraceCheckUtils]: 18: Hoare triple {30378#(<= 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; {30379#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:24,503 INFO L290 TraceCheckUtils]: 19: Hoare triple {30379#(<= 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; {30380#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:24,503 INFO L290 TraceCheckUtils]: 20: Hoare triple {30380#(<= 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; {30381#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:24,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {30381#(<= 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; {30382#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:24,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {30382#(<= 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; {30383#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:24,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {30383#(<= 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; {30384#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:24,505 INFO L290 TraceCheckUtils]: 24: Hoare triple {30384#(<= 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; {30385#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:24,506 INFO L290 TraceCheckUtils]: 25: Hoare triple {30385#(<= 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; {30386#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:24,506 INFO L290 TraceCheckUtils]: 26: Hoare triple {30386#(<= 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; {30387#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:24,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {30387#(<= 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; {30388#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:24,507 INFO L290 TraceCheckUtils]: 28: Hoare triple {30388#(<= 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; {30389#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:24,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {30389#(<= 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; {30390#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:24,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {30390#(<= 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; {30391#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:24,509 INFO L290 TraceCheckUtils]: 31: Hoare triple {30391#(<= 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; {30392#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:24,509 INFO L290 TraceCheckUtils]: 32: Hoare triple {30392#(<= 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; {30393#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:24,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {30393#(<= 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; {30394#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:24,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {30394#(<= 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; {30395#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:24,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {30395#(<= 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; {30396#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:24,511 INFO L290 TraceCheckUtils]: 36: Hoare triple {30396#(<= 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; {30397#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:24,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {30397#(<= 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; {30398#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:24,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {30398#(<= 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; {30399#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:53:24,521 INFO L290 TraceCheckUtils]: 39: Hoare triple {30399#(<= 499942 main_~y~0)} assume !(~y~0 > 0); {30366#false} is VALID [2022-04-28 03:53:24,521 INFO L272 TraceCheckUtils]: 40: Hoare triple {30366#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {30366#false} is VALID [2022-04-28 03:53:24,521 INFO L290 TraceCheckUtils]: 41: Hoare triple {30366#false} ~cond := #in~cond; {30366#false} is VALID [2022-04-28 03:53:24,521 INFO L290 TraceCheckUtils]: 42: Hoare triple {30366#false} assume 0 == ~cond; {30366#false} is VALID [2022-04-28 03:53:24,521 INFO L290 TraceCheckUtils]: 43: Hoare triple {30366#false} assume !false; {30366#false} is VALID [2022-04-28 03:53:24,522 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-28 03:53:24,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:25,937 INFO L290 TraceCheckUtils]: 43: Hoare triple {30366#false} assume !false; {30366#false} is VALID [2022-04-28 03:53:25,937 INFO L290 TraceCheckUtils]: 42: Hoare triple {30366#false} assume 0 == ~cond; {30366#false} is VALID [2022-04-28 03:53:25,937 INFO L290 TraceCheckUtils]: 41: Hoare triple {30366#false} ~cond := #in~cond; {30366#false} is VALID [2022-04-28 03:53:25,937 INFO L272 TraceCheckUtils]: 40: Hoare triple {30366#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {30366#false} is VALID [2022-04-28 03:53:25,938 INFO L290 TraceCheckUtils]: 39: Hoare triple {30545#(< 0 main_~y~0)} assume !(~y~0 > 0); {30366#false} is VALID [2022-04-28 03:53:25,938 INFO L290 TraceCheckUtils]: 38: Hoare triple {30549#(< 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; {30545#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:25,939 INFO L290 TraceCheckUtils]: 37: Hoare triple {30553#(< 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; {30549#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:25,939 INFO L290 TraceCheckUtils]: 36: Hoare triple {30557#(< 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; {30553#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:25,940 INFO L290 TraceCheckUtils]: 35: Hoare triple {30561#(< 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; {30557#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:25,940 INFO L290 TraceCheckUtils]: 34: Hoare triple {30565#(< 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; {30561#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:25,940 INFO L290 TraceCheckUtils]: 33: Hoare triple {30569#(< 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; {30565#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:25,941 INFO L290 TraceCheckUtils]: 32: Hoare triple {30573#(< 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; {30569#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:25,941 INFO L290 TraceCheckUtils]: 31: Hoare triple {30577#(< 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; {30573#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:25,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {30581#(< 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; {30577#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:25,942 INFO L290 TraceCheckUtils]: 29: Hoare triple {30585#(< 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; {30581#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:25,943 INFO L290 TraceCheckUtils]: 28: Hoare triple {30589#(< 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; {30585#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:25,943 INFO L290 TraceCheckUtils]: 27: Hoare triple {30593#(< 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; {30589#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:25,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {30597#(< 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; {30593#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:25,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {30601#(< 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; {30597#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:25,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {30605#(< 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; {30601#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:25,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {30609#(< 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; {30605#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:25,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {30613#(< 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; {30609#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:25,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {30617#(< 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; {30613#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:25,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {30621#(< 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; {30617#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:25,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {30625#(< 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; {30621#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:25,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {30629#(< 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; {30625#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:25,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {30633#(< 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; {30629#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:25,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {30637#(< 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; {30633#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:25,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {30641#(< 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; {30637#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:25,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {30645#(< 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; {30641#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:25,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {30649#(< 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; {30645#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:25,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {30653#(< 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; {30649#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:25,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {30657#(< 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; {30653#(< 54 main_~y~0)} is VALID [2022-04-28 03:53:25,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {30661#(< 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; {30657#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:25,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {30661#(< 58 main_~y~0)} [174] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {30661#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:25,952 INFO L290 TraceCheckUtils]: 8: Hoare triple {30661#(< 58 main_~y~0)} [177] L10-2-->L17-1_primed: Formula: (let ((.cse2 (<= 500000 v_main_~x~0_1598)) (.cse0 (= |v_main_#t~post6_200| |v_main_#t~post6_199|)) (.cse1 (= v_main_~y~0_1757 v_main_~y~0_1756)) (.cse3 (= v_main_~x~0_1598 v_main_~x~0_1597)) (.cse4 (= |v_main_#t~post5_200| |v_main_#t~post5_199|))) (or (and .cse0 .cse1 (or (not (< v_main_~x~0_1598 1000000)) (not .cse2)) .cse3 .cse4) (let ((.cse5 (+ v_main_~x~0_1598 v_main_~y~0_1756))) (and .cse2 (< .cse5 (+ 1000001 v_main_~y~0_1757)) (= (+ v_main_~x~0_1597 v_main_~y~0_1757) .cse5) (< v_main_~y~0_1757 v_main_~y~0_1756))) (and .cse0 .cse1 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_1757, main_#t~post5=|v_main_#t~post5_200|, main_~x~0=v_main_~x~0_1598, 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_1597, main_#t~post6=|v_main_#t~post6_199|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {30661#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:25,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {30661#(< 58 main_~y~0)} [176] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {30661#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:25,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {30661#(< 58 main_~y~0)} [175] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_185| |v_main_#t~post4_184|)) (.cse1 (= v_main_~x~0_1596 v_main_~x~0_1595))) (or (and (< v_main_~x~0_1595 500001) (< v_main_~x~0_1596 v_main_~x~0_1595)) (and .cse0 .cse1) (and .cse0 (not (< v_main_~x~0_1596 500000)) .cse1))) InVars {main_~x~0=v_main_~x~0_1596, main_#t~post4=|v_main_#t~post4_185|} OutVars{main_~x~0=v_main_~x~0_1595, main_#t~post4=|v_main_#t~post4_184|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {30661#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:25,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {30365#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {30661#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:25,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {30365#true} call #t~ret9 := main(); {30365#true} is VALID [2022-04-28 03:53:25,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30365#true} {30365#true} #53#return; {30365#true} is VALID [2022-04-28 03:53:25,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {30365#true} assume true; {30365#true} is VALID [2022-04-28 03:53:25,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {30365#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(18, 2);call #Ultimate.allocInit(12, 3); {30365#true} is VALID [2022-04-28 03:53:25,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {30365#true} call ULTIMATE.init(); {30365#true} is VALID [2022-04-28 03:53:25,954 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-28 03:53:25,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091253284] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:25,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:25,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 63 [2022-04-28 03:53:28,187 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:28,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [552259159] [2022-04-28 03:53:28,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [552259159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:28,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:28,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [86] imperfect sequences [] total 86 [2022-04-28 03:53:28,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741901174] [2022-04-28 03:53:28,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:28,188 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-28 03:53:28,188 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:28,188 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-28 03:53:28,313 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-28 03:53:28,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-04-28 03:53:28,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-04-28 03:53:28,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5231, Invalid=8109, Unknown=0, NotChecked=0, Total=13340 [2022-04-28 03:53:28,315 INFO L87 Difference]: Start difference. First operand 149 states and 153 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-28 03:53:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:39,466 INFO L93 Difference]: Finished difference Result 295 states and 308 transitions. [2022-04-28 03:53:39,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-04-28 03:53:39,466 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-28 03:53:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:53:39,467 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-28 03:53:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 175 transitions. [2022-04-28 03:53:39,468 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-28 03:53:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 175 transitions. [2022-04-28 03:53:39,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 175 transitions. [2022-04-28 03:53:39,618 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-28 03:53:39,619 INFO L225 Difference]: With dead ends: 295 [2022-04-28 03:53:39,619 INFO L226 Difference]: Without dead ends: 154 [2022-04-28 03:53:39,621 INFO L412 NwaCegarLoop]: 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-28 03:53:39,622 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 229 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5570 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 5570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-28 03:53:39,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 27 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 5570 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-04-28 03:53:39,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-28 03:53:39,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-04-28 03:53:39,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:53:39,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:39,853 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:39,854 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:39,855 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2022-04-28 03:53:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-28 03:53:39,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:39,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:39,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 154 states. [2022-04-28 03:53:39,855 INFO L87 Difference]: Start difference. First operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 154 states. [2022-04-28 03:53:39,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:53:39,857 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2022-04-28 03:53:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-28 03:53:39,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:53:39,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:53:39,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:53:39,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:53:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 147 states have (on average 1.034013605442177) internal successors, (152), 148 states have internal predecessors, (152), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:53:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-04-28 03:53:39,859 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 145 [2022-04-28 03:53:39,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:53:39,859 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-04-28 03:53:39,859 INFO L496 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-28 03:53:39,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 158 transitions. [2022-04-28 03:53:39,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:53:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-28 03:53:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-04-28 03:53:39,995 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:53:39,995 INFO L195 NwaCegarLoop]: trace histogram [54, 53, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:53:40,013 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-28 03:53:40,196 WARN L477 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-28 03:53:40,196 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:53:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:53:40,196 INFO L85 PathProgramCache]: Analyzing trace with hash -658783710, now seen corresponding path program 30 times [2022-04-28 03:53:40,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:40,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [881539359] [2022-04-28 03:53:44,265 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:53:44,320 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-28 03:53:44,540 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-28 03:53:44,541 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:53:44,543 INFO L85 PathProgramCache]: Analyzing trace with hash 940750850, now seen corresponding path program 1 times [2022-04-28 03:53:44,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:53:44,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795070973] [2022-04-28 03:53:44,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:44,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:53:44,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:45,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:53:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:45,144 INFO L290 TraceCheckUtils]: 0: Hoare triple {32155#(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(18, 2);call #Ultimate.allocInit(12, 3); {32119#true} is VALID [2022-04-28 03:53:45,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 03:53:45,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32119#true} {32119#true} #53#return; {32119#true} is VALID [2022-04-28 03:53:45,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:53:45,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {32155#(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(18, 2);call #Ultimate.allocInit(12, 3); {32119#true} is VALID [2022-04-28 03:53:45,144 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 03:53:45,144 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #53#return; {32119#true} is VALID [2022-04-28 03:53:45,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret9 := main(); {32119#true} is VALID [2022-04-28 03:53:45,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,145 INFO L290 TraceCheckUtils]: 6: Hoare triple {32124#(<= 500000 main_~y~0)} [179] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1693 v_main_~x~0_1692))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1693)) (and (< v_main_~x~0_1692 500001) (< v_main_~x~0_1693 v_main_~x~0_1692)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1693, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,146 INFO L290 TraceCheckUtils]: 7: Hoare triple {32124#(<= 500000 main_~y~0)} [180] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {32124#(<= 500000 main_~y~0)} [181] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1695 v_main_~x~0_1694)) (.cse3 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 500000 v_main_~x~0_1695))) (or (let ((.cse1 (+ v_main_~x~0_1695 v_main_~y~0_1874))) (and (< v_main_~y~0_1875 v_main_~y~0_1874) .cse0 (= (+ v_main_~x~0_1694 v_main_~y~0_1875) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1875)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1695 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1695, 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_1694, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {32124#(<= 500000 main_~y~0)} [178] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {32124#(<= 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; {32125#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:45,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {32125#(<= 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; {32126#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:45,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {32126#(<= 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; {32127#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:45,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {32127#(<= 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; {32128#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:45,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {32128#(<= 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; {32129#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:45,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {32129#(<= 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; {32130#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:45,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {32130#(<= 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; {32131#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:45,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {32131#(<= 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; {32132#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:45,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {32132#(<= 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; {32133#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:45,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {32133#(<= 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; {32134#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:45,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {32134#(<= 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; {32135#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:45,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {32135#(<= 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; {32136#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:45,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {32136#(<= 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; {32137#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:45,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {32137#(<= 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; {32138#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:45,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {32138#(<= 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; {32139#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:45,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {32139#(<= 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; {32140#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:45,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {32140#(<= 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; {32141#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:45,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {32141#(<= 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; {32142#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:45,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {32142#(<= 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; {32143#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:45,158 INFO L290 TraceCheckUtils]: 29: Hoare triple {32143#(<= 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; {32144#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:45,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {32144#(<= 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; {32145#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:45,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {32145#(<= 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; {32146#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:45,160 INFO L290 TraceCheckUtils]: 32: Hoare triple {32146#(<= 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; {32147#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:45,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {32147#(<= 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; {32148#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:45,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {32148#(<= 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; {32149#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:45,162 INFO L290 TraceCheckUtils]: 35: Hoare triple {32149#(<= 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; {32150#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:45,162 INFO L290 TraceCheckUtils]: 36: Hoare triple {32150#(<= 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; {32151#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:45,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {32151#(<= 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; {32152#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:45,164 INFO L290 TraceCheckUtils]: 38: Hoare triple {32152#(<= 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; {32153#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:53:45,164 INFO L290 TraceCheckUtils]: 39: Hoare triple {32153#(<= 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; {32154#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:53:45,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {32154#(<= 499940 main_~y~0)} assume !(~y~0 > 0); {32120#false} is VALID [2022-04-28 03:53:45,165 INFO L272 TraceCheckUtils]: 41: Hoare triple {32120#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {32120#false} is VALID [2022-04-28 03:53:45,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 03:53:45,165 INFO L290 TraceCheckUtils]: 43: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 03:53:45,165 INFO L290 TraceCheckUtils]: 44: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 03:53:45,166 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-28 03:53:45,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:53:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795070973] [2022-04-28 03:53:45,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795070973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:53:45,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187287211] [2022-04-28 03:53:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:53:45,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:53:45,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:53:45,168 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-28 03:53:45,176 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-28 03:53:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:45,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 03:53:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:53:45,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:53:45,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32119#true} is VALID [2022-04-28 03:53:45,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#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(18, 2);call #Ultimate.allocInit(12, 3); {32119#true} is VALID [2022-04-28 03:53:45,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 03:53:45,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #53#return; {32119#true} is VALID [2022-04-28 03:53:45,748 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret9 := main(); {32119#true} is VALID [2022-04-28 03:53:45,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {32124#(<= 500000 main_~y~0)} [179] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1693 v_main_~x~0_1692))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1693)) (and (< v_main_~x~0_1692 500001) (< v_main_~x~0_1693 v_main_~x~0_1692)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1693, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {32124#(<= 500000 main_~y~0)} [180] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {32124#(<= 500000 main_~y~0)} [181] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1695 v_main_~x~0_1694)) (.cse3 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 500000 v_main_~x~0_1695))) (or (let ((.cse1 (+ v_main_~x~0_1695 v_main_~y~0_1874))) (and (< v_main_~y~0_1875 v_main_~y~0_1874) .cse0 (= (+ v_main_~x~0_1694 v_main_~y~0_1875) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1875)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1695 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1695, 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_1694, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {32124#(<= 500000 main_~y~0)} [178] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {32124#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:53:45,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {32124#(<= 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; {32125#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:53:45,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {32125#(<= 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; {32126#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:53:45,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {32126#(<= 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; {32127#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:53:45,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {32127#(<= 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; {32128#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:53:45,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {32128#(<= 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; {32129#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:53:45,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {32129#(<= 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; {32130#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:53:45,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {32130#(<= 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; {32131#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:53:45,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {32131#(<= 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; {32132#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:53:45,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {32132#(<= 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; {32133#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:53:45,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {32133#(<= 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; {32134#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:53:45,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {32134#(<= 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; {32135#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:53:45,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {32135#(<= 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; {32136#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:53:45,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {32136#(<= 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; {32137#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:53:45,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {32137#(<= 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; {32138#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:53:45,757 INFO L290 TraceCheckUtils]: 24: Hoare triple {32138#(<= 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; {32139#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:53:45,757 INFO L290 TraceCheckUtils]: 25: Hoare triple {32139#(<= 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; {32140#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:53:45,758 INFO L290 TraceCheckUtils]: 26: Hoare triple {32140#(<= 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; {32141#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:53:45,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {32141#(<= 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; {32142#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:53:45,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {32142#(<= 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; {32143#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:53:45,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {32143#(<= 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; {32144#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:53:45,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {32144#(<= 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; {32145#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:53:45,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {32145#(<= 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; {32146#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:53:45,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {32146#(<= 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; {32147#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:53:45,761 INFO L290 TraceCheckUtils]: 33: Hoare triple {32147#(<= 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; {32148#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:53:45,762 INFO L290 TraceCheckUtils]: 34: Hoare triple {32148#(<= 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; {32149#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:53:45,762 INFO L290 TraceCheckUtils]: 35: Hoare triple {32149#(<= 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; {32150#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:53:45,762 INFO L290 TraceCheckUtils]: 36: Hoare triple {32150#(<= 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; {32151#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:53:45,763 INFO L290 TraceCheckUtils]: 37: Hoare triple {32151#(<= 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; {32152#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:53:45,763 INFO L290 TraceCheckUtils]: 38: Hoare triple {32152#(<= 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; {32153#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:53:45,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {32153#(<= 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; {32154#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:53:45,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {32154#(<= 499940 main_~y~0)} assume !(~y~0 > 0); {32120#false} is VALID [2022-04-28 03:53:45,764 INFO L272 TraceCheckUtils]: 41: Hoare triple {32120#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {32120#false} is VALID [2022-04-28 03:53:45,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 03:53:45,764 INFO L290 TraceCheckUtils]: 43: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 03:53:45,765 INFO L290 TraceCheckUtils]: 44: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 03:53:45,765 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-28 03:53:45,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:53:47,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {32120#false} assume !false; {32120#false} is VALID [2022-04-28 03:53:47,369 INFO L290 TraceCheckUtils]: 43: Hoare triple {32120#false} assume 0 == ~cond; {32120#false} is VALID [2022-04-28 03:53:47,369 INFO L290 TraceCheckUtils]: 42: Hoare triple {32120#false} ~cond := #in~cond; {32120#false} is VALID [2022-04-28 03:53:47,369 INFO L272 TraceCheckUtils]: 41: Hoare triple {32120#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {32120#false} is VALID [2022-04-28 03:53:47,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {32303#(< 0 main_~y~0)} assume !(~y~0 > 0); {32120#false} is VALID [2022-04-28 03:53:47,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {32307#(< 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; {32303#(< 0 main_~y~0)} is VALID [2022-04-28 03:53:47,371 INFO L290 TraceCheckUtils]: 38: Hoare triple {32311#(< 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; {32307#(< 2 main_~y~0)} is VALID [2022-04-28 03:53:47,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {32315#(< 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; {32311#(< 4 main_~y~0)} is VALID [2022-04-28 03:53:47,372 INFO L290 TraceCheckUtils]: 36: Hoare triple {32319#(< 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; {32315#(< 6 main_~y~0)} is VALID [2022-04-28 03:53:47,372 INFO L290 TraceCheckUtils]: 35: Hoare triple {32323#(< 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; {32319#(< 8 main_~y~0)} is VALID [2022-04-28 03:53:47,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {32327#(< 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; {32323#(< 10 main_~y~0)} is VALID [2022-04-28 03:53:47,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {32331#(< 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; {32327#(< 12 main_~y~0)} is VALID [2022-04-28 03:53:47,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {32335#(< 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; {32331#(< 14 main_~y~0)} is VALID [2022-04-28 03:53:47,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {32339#(< 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; {32335#(< 16 main_~y~0)} is VALID [2022-04-28 03:53:47,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {32343#(< 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; {32339#(< 18 main_~y~0)} is VALID [2022-04-28 03:53:47,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {32347#(< 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; {32343#(< 20 main_~y~0)} is VALID [2022-04-28 03:53:47,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {32351#(< 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; {32347#(< 22 main_~y~0)} is VALID [2022-04-28 03:53:47,376 INFO L290 TraceCheckUtils]: 27: Hoare triple {32355#(< 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; {32351#(< 24 main_~y~0)} is VALID [2022-04-28 03:53:47,376 INFO L290 TraceCheckUtils]: 26: Hoare triple {32359#(< 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; {32355#(< 26 main_~y~0)} is VALID [2022-04-28 03:53:47,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {32363#(< 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; {32359#(< 28 main_~y~0)} is VALID [2022-04-28 03:53:47,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {32367#(< 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; {32363#(< 30 main_~y~0)} is VALID [2022-04-28 03:53:47,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {32371#(< 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; {32367#(< 32 main_~y~0)} is VALID [2022-04-28 03:53:47,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {32375#(< 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; {32371#(< 34 main_~y~0)} is VALID [2022-04-28 03:53:47,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {32379#(< 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; {32375#(< 36 main_~y~0)} is VALID [2022-04-28 03:53:47,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {32383#(< 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; {32379#(< 38 main_~y~0)} is VALID [2022-04-28 03:53:47,380 INFO L290 TraceCheckUtils]: 19: Hoare triple {32387#(< 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; {32383#(< 40 main_~y~0)} is VALID [2022-04-28 03:53:47,380 INFO L290 TraceCheckUtils]: 18: Hoare triple {32391#(< 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; {32387#(< 42 main_~y~0)} is VALID [2022-04-28 03:53:47,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {32395#(< 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; {32391#(< 44 main_~y~0)} is VALID [2022-04-28 03:53:47,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {32399#(< 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; {32395#(< 46 main_~y~0)} is VALID [2022-04-28 03:53:47,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {32403#(< 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; {32399#(< 48 main_~y~0)} is VALID [2022-04-28 03:53:47,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {32407#(< 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; {32403#(< 50 main_~y~0)} is VALID [2022-04-28 03:53:47,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {32411#(< 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; {32407#(< 52 main_~y~0)} is VALID [2022-04-28 03:53:47,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {32415#(< 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; {32411#(< 54 main_~y~0)} is VALID [2022-04-28 03:53:47,383 INFO L290 TraceCheckUtils]: 11: Hoare triple {32419#(< 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; {32415#(< 56 main_~y~0)} is VALID [2022-04-28 03:53:47,384 INFO L290 TraceCheckUtils]: 10: Hoare triple {32423#(< 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; {32419#(< 58 main_~y~0)} is VALID [2022-04-28 03:53:47,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {32423#(< 60 main_~y~0)} [178] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {32423#(< 60 main_~y~0)} is VALID [2022-04-28 03:53:47,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {32423#(< 60 main_~y~0)} [181] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= v_main_~x~0_1695 v_main_~x~0_1694)) (.cse3 (= v_main_~y~0_1875 v_main_~y~0_1874)) (.cse4 (= |v_main_#t~post5_207| |v_main_#t~post5_206|)) (.cse5 (= |v_main_#t~post6_207| |v_main_#t~post6_206|)) (.cse0 (<= 500000 v_main_~x~0_1695))) (or (let ((.cse1 (+ v_main_~x~0_1695 v_main_~y~0_1874))) (and (< v_main_~y~0_1875 v_main_~y~0_1874) .cse0 (= (+ v_main_~x~0_1694 v_main_~y~0_1875) .cse1) (< .cse1 (+ 1000001 v_main_~y~0_1875)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 .cse4 .cse5 (or (not (< v_main_~x~0_1695 1000000)) (not .cse0))))) InVars {main_~y~0=v_main_~y~0_1875, main_#t~post5=|v_main_#t~post5_207|, main_~x~0=v_main_~x~0_1695, 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_1694, main_#t~post6=|v_main_#t~post6_206|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {32423#(< 60 main_~y~0)} is VALID [2022-04-28 03:53:47,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {32423#(< 60 main_~y~0)} [180] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32423#(< 60 main_~y~0)} is VALID [2022-04-28 03:53:47,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {32423#(< 60 main_~y~0)} [179] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_191| |v_main_#t~post4_190|)) (.cse1 (= v_main_~x~0_1693 v_main_~x~0_1692))) (or (and .cse0 .cse1 (<= 500000 v_main_~x~0_1693)) (and (< v_main_~x~0_1692 500001) (< v_main_~x~0_1693 v_main_~x~0_1692)) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1693, main_#t~post4=|v_main_#t~post4_191|} OutVars{main_~x~0=v_main_~x~0_1692, main_#t~post4=|v_main_#t~post4_190|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {32423#(< 60 main_~y~0)} is VALID [2022-04-28 03:53:47,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {32119#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {32423#(< 60 main_~y~0)} is VALID [2022-04-28 03:53:47,386 INFO L272 TraceCheckUtils]: 4: Hoare triple {32119#true} call #t~ret9 := main(); {32119#true} is VALID [2022-04-28 03:53:47,386 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32119#true} {32119#true} #53#return; {32119#true} is VALID [2022-04-28 03:53:47,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {32119#true} assume true; {32119#true} is VALID [2022-04-28 03:53:47,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {32119#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(18, 2);call #Ultimate.allocInit(12, 3); {32119#true} is VALID [2022-04-28 03:53:47,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {32119#true} call ULTIMATE.init(); {32119#true} is VALID [2022-04-28 03:53:47,387 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-28 03:53:47,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187287211] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:53:47,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:53:47,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 65 [2022-04-28 03:53:49,728 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:53:49,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [881539359] [2022-04-28 03:53:49,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [881539359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:53:49,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:53:49,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [89] imperfect sequences [] total 89 [2022-04-28 03:53:49,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328975070] [2022-04-28 03:53:49,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:53:49,728 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-28 03:53:49,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:53:49,729 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-28 03:53:49,849 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-28 03:53:49,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-04-28 03:53:49,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:53:49,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-04-28 03:53:49,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5592, Invalid=8688, Unknown=0, NotChecked=0, Total=14280 [2022-04-28 03:53:49,850 INFO L87 Difference]: Start difference. First operand 154 states and 158 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-28 03:54:01,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:01,969 INFO L93 Difference]: Finished difference Result 305 states and 318 transitions. [2022-04-28 03:54:01,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-04-28 03:54:01,970 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-28 03:54:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:01,970 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-28 03:54:01,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 180 transitions. [2022-04-28 03:54:01,971 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-28 03:54:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 180 transitions. [2022-04-28 03:54:01,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 180 transitions. [2022-04-28 03:54:02,118 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-28 03:54:02,120 INFO L225 Difference]: With dead ends: 305 [2022-04-28 03:54:02,120 INFO L226 Difference]: Without dead ends: 159 [2022-04-28 03:54:02,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12282 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=13050, Invalid=29180, Unknown=0, NotChecked=0, Total=42230 [2022-04-28 03:54:02,123 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 180 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6087 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 6356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 6087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:02,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 47 Invalid, 6356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 6087 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 03:54:02,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-04-28 03:54:02,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-04-28 03:54:02,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:02,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:02,418 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:02,418 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:02,420 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-28 03:54:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:54:02,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:02,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:02,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 159 states. [2022-04-28 03:54:02,420 INFO L87 Difference]: Start difference. First operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 159 states. [2022-04-28 03:54:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:02,423 INFO L93 Difference]: Finished difference Result 159 states and 163 transitions. [2022-04-28 03:54:02,423 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:54:02,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:02,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:02,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:02,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 152 states have (on average 1.0328947368421053) internal successors, (157), 153 states have internal predecessors, (157), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 163 transitions. [2022-04-28 03:54:02,426 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 163 transitions. Word has length 150 [2022-04-28 03:54:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:02,426 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 163 transitions. [2022-04-28 03:54:02,427 INFO L496 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-28 03:54:02,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 163 transitions. [2022-04-28 03:54:02,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:02,578 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 163 transitions. [2022-04-28 03:54:02,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-28 03:54:02,578 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:02,578 INFO L195 NwaCegarLoop]: trace histogram [56, 55, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:02,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-28 03:54:02,799 WARN L477 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-28 03:54:02,799 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:02,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:02,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1290124407, now seen corresponding path program 31 times [2022-04-28 03:54:02,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:02,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1269785978] [2022-04-28 03:54:02,896 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-28 03:54:03,103 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-28 03:54:03,104 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash 549049633, now seen corresponding path program 1 times [2022-04-28 03:54:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:03,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682808694] [2022-04-28 03:54:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:03,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:03,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {33966#(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(18, 2);call #Ultimate.allocInit(12, 3); {33929#true} is VALID [2022-04-28 03:54:03,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-28 03:54:03,749 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33929#true} {33929#true} #53#return; {33929#true} is VALID [2022-04-28 03:54:03,749 INFO L272 TraceCheckUtils]: 0: Hoare triple {33929#true} call ULTIMATE.init(); {33966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:03,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {33966#(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(18, 2);call #Ultimate.allocInit(12, 3); {33929#true} is VALID [2022-04-28 03:54:03,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-28 03:54:03,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33929#true} {33929#true} #53#return; {33929#true} is VALID [2022-04-28 03:54:03,750 INFO L272 TraceCheckUtils]: 4: Hoare triple {33929#true} call #t~ret9 := main(); {33929#true} is VALID [2022-04-28 03:54:03,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {33929#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:03,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {33934#(<= 500000 main_~y~0)} [183] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1793 v_main_~x~0_1792)) (.cse1 (= |v_main_#t~post4_197| |v_main_#t~post4_196|))) (or (and (< v_main_~x~0_1793 v_main_~x~0_1792) (< v_main_~x~0_1792 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1793)))) InVars {main_~x~0=v_main_~x~0_1793, main_#t~post4=|v_main_#t~post4_197|} OutVars{main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:03,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {33934#(<= 500000 main_~y~0)} [184] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:03,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {33934#(<= 500000 main_~y~0)} [185] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~x~0_1795 v_main_~x~0_1794)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1795))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1795 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1795 v_main_~y~0_1996))) (and .cse4 (= (+ v_main_~x~0_1794 v_main_~y~0_1997) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1997)) (< v_main_~y~0_1997 v_main_~y~0_1996))))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1795, 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_1794, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:03,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {33934#(<= 500000 main_~y~0)} [182] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:03,752 INFO L290 TraceCheckUtils]: 10: Hoare triple {33934#(<= 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; {33935#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:03,753 INFO L290 TraceCheckUtils]: 11: Hoare triple {33935#(<= 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; {33936#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:03,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {33936#(<= 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; {33937#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:03,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {33937#(<= 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; {33938#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:03,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {33938#(<= 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; {33939#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:03,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {33939#(<= 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; {33940#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:03,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {33940#(<= 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; {33941#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:03,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {33941#(<= 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; {33942#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:03,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {33942#(<= 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; {33943#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:03,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {33943#(<= 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; {33944#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:03,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {33944#(<= 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; {33945#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:03,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {33945#(<= 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; {33946#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:03,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {33946#(<= 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; {33947#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:03,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {33947#(<= 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; {33948#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:03,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {33948#(<= 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; {33949#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:03,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {33949#(<= 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; {33950#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:03,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {33950#(<= 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; {33951#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:03,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {33951#(<= 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; {33952#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:03,761 INFO L290 TraceCheckUtils]: 28: Hoare triple {33952#(<= 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; {33953#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:03,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {33953#(<= 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; {33954#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:03,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {33954#(<= 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; {33955#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:03,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {33955#(<= 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; {33956#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:03,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {33956#(<= 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; {33957#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:03,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {33957#(<= 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; {33958#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:03,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {33958#(<= 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; {33959#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:03,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {33959#(<= 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; {33960#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:03,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {33960#(<= 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; {33961#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:03,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {33961#(<= 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; {33962#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:03,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {33962#(<= 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; {33963#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:03,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {33963#(<= 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; {33964#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:03,767 INFO L290 TraceCheckUtils]: 40: Hoare triple {33964#(<= 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; {33965#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:03,767 INFO L290 TraceCheckUtils]: 41: Hoare triple {33965#(<= 499938 main_~y~0)} assume !(~y~0 > 0); {33930#false} is VALID [2022-04-28 03:54:03,767 INFO L272 TraceCheckUtils]: 42: Hoare triple {33930#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {33930#false} is VALID [2022-04-28 03:54:03,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {33930#false} ~cond := #in~cond; {33930#false} is VALID [2022-04-28 03:54:03,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {33930#false} assume 0 == ~cond; {33930#false} is VALID [2022-04-28 03:54:03,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {33930#false} assume !false; {33930#false} is VALID [2022-04-28 03:54:03,768 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-28 03:54:03,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:03,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682808694] [2022-04-28 03:54:03,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682808694] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:03,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448395798] [2022-04-28 03:54:03,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:03,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:03,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:03,769 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-28 03:54:03,770 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-28 03:54:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:03,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 34 conjunts are in the unsatisfiable core [2022-04-28 03:54:03,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:03,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:04,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {33929#true} call ULTIMATE.init(); {33929#true} is VALID [2022-04-28 03:54:04,361 INFO L290 TraceCheckUtils]: 1: Hoare triple {33929#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(18, 2);call #Ultimate.allocInit(12, 3); {33929#true} is VALID [2022-04-28 03:54:04,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-28 03:54:04,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33929#true} {33929#true} #53#return; {33929#true} is VALID [2022-04-28 03:54:04,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {33929#true} call #t~ret9 := main(); {33929#true} is VALID [2022-04-28 03:54:04,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {33929#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:04,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {33934#(<= 500000 main_~y~0)} [183] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1793 v_main_~x~0_1792)) (.cse1 (= |v_main_#t~post4_197| |v_main_#t~post4_196|))) (or (and (< v_main_~x~0_1793 v_main_~x~0_1792) (< v_main_~x~0_1792 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1793)))) InVars {main_~x~0=v_main_~x~0_1793, main_#t~post4=|v_main_#t~post4_197|} OutVars{main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:04,362 INFO L290 TraceCheckUtils]: 7: Hoare triple {33934#(<= 500000 main_~y~0)} [184] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:04,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {33934#(<= 500000 main_~y~0)} [185] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~x~0_1795 v_main_~x~0_1794)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1795))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1795 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1795 v_main_~y~0_1996))) (and .cse4 (= (+ v_main_~x~0_1794 v_main_~y~0_1997) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1997)) (< v_main_~y~0_1997 v_main_~y~0_1996))))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1795, 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_1794, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:04,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {33934#(<= 500000 main_~y~0)} [182] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {33934#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:04,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {33934#(<= 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; {33935#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:04,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {33935#(<= 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; {33936#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:04,365 INFO L290 TraceCheckUtils]: 12: Hoare triple {33936#(<= 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; {33937#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:04,365 INFO L290 TraceCheckUtils]: 13: Hoare triple {33937#(<= 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; {33938#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:04,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {33938#(<= 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; {33939#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:04,366 INFO L290 TraceCheckUtils]: 15: Hoare triple {33939#(<= 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; {33940#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:04,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {33940#(<= 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; {33941#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:04,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {33941#(<= 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; {33942#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:04,368 INFO L290 TraceCheckUtils]: 18: Hoare triple {33942#(<= 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; {33943#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:04,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {33943#(<= 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; {33944#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:04,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {33944#(<= 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; {33945#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:04,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {33945#(<= 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; {33946#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:04,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {33946#(<= 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; {33947#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:04,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {33947#(<= 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; {33948#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:04,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {33948#(<= 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; {33949#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:04,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {33949#(<= 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; {33950#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:04,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {33950#(<= 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; {33951#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:04,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {33951#(<= 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; {33952#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:04,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {33952#(<= 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; {33953#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:04,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {33953#(<= 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; {33954#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:04,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {33954#(<= 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; {33955#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:04,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {33955#(<= 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; {33956#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:04,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {33956#(<= 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; {33957#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:04,375 INFO L290 TraceCheckUtils]: 33: Hoare triple {33957#(<= 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; {33958#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:04,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {33958#(<= 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; {33959#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:04,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {33959#(<= 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; {33960#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:04,376 INFO L290 TraceCheckUtils]: 36: Hoare triple {33960#(<= 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; {33961#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:04,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {33961#(<= 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; {33962#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:04,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {33962#(<= 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; {33963#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:04,378 INFO L290 TraceCheckUtils]: 39: Hoare triple {33963#(<= 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; {33964#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:04,378 INFO L290 TraceCheckUtils]: 40: Hoare triple {33964#(<= 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; {33965#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:04,379 INFO L290 TraceCheckUtils]: 41: Hoare triple {33965#(<= 499938 main_~y~0)} assume !(~y~0 > 0); {33930#false} is VALID [2022-04-28 03:54:04,379 INFO L272 TraceCheckUtils]: 42: Hoare triple {33930#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {33930#false} is VALID [2022-04-28 03:54:04,379 INFO L290 TraceCheckUtils]: 43: Hoare triple {33930#false} ~cond := #in~cond; {33930#false} is VALID [2022-04-28 03:54:04,379 INFO L290 TraceCheckUtils]: 44: Hoare triple {33930#false} assume 0 == ~cond; {33930#false} is VALID [2022-04-28 03:54:04,379 INFO L290 TraceCheckUtils]: 45: Hoare triple {33930#false} assume !false; {33930#false} is VALID [2022-04-28 03:54:04,379 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-28 03:54:04,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:05,956 INFO L290 TraceCheckUtils]: 45: Hoare triple {33930#false} assume !false; {33930#false} is VALID [2022-04-28 03:54:05,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {33930#false} assume 0 == ~cond; {33930#false} is VALID [2022-04-28 03:54:05,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {33930#false} ~cond := #in~cond; {33930#false} is VALID [2022-04-28 03:54:05,957 INFO L272 TraceCheckUtils]: 42: Hoare triple {33930#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {33930#false} is VALID [2022-04-28 03:54:05,957 INFO L290 TraceCheckUtils]: 41: Hoare triple {34117#(< 0 main_~y~0)} assume !(~y~0 > 0); {33930#false} is VALID [2022-04-28 03:54:05,957 INFO L290 TraceCheckUtils]: 40: Hoare triple {34121#(< 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; {34117#(< 0 main_~y~0)} is VALID [2022-04-28 03:54:05,958 INFO L290 TraceCheckUtils]: 39: Hoare triple {34125#(< 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; {34121#(< 2 main_~y~0)} is VALID [2022-04-28 03:54:05,958 INFO L290 TraceCheckUtils]: 38: Hoare triple {34129#(< 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; {34125#(< 4 main_~y~0)} is VALID [2022-04-28 03:54:05,959 INFO L290 TraceCheckUtils]: 37: Hoare triple {34133#(< 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; {34129#(< 6 main_~y~0)} is VALID [2022-04-28 03:54:05,959 INFO L290 TraceCheckUtils]: 36: Hoare triple {34137#(< 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; {34133#(< 8 main_~y~0)} is VALID [2022-04-28 03:54:05,960 INFO L290 TraceCheckUtils]: 35: Hoare triple {34141#(< 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; {34137#(< 10 main_~y~0)} is VALID [2022-04-28 03:54:05,960 INFO L290 TraceCheckUtils]: 34: Hoare triple {34145#(< 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; {34141#(< 12 main_~y~0)} is VALID [2022-04-28 03:54:05,961 INFO L290 TraceCheckUtils]: 33: Hoare triple {34149#(< 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; {34145#(< 14 main_~y~0)} is VALID [2022-04-28 03:54:05,961 INFO L290 TraceCheckUtils]: 32: Hoare triple {34153#(< 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; {34149#(< 16 main_~y~0)} is VALID [2022-04-28 03:54:05,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {34157#(< 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; {34153#(< 18 main_~y~0)} is VALID [2022-04-28 03:54:05,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {34161#(< 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; {34157#(< 20 main_~y~0)} is VALID [2022-04-28 03:54:05,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {34165#(< 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; {34161#(< 22 main_~y~0)} is VALID [2022-04-28 03:54:05,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {34169#(< 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; {34165#(< 24 main_~y~0)} is VALID [2022-04-28 03:54:05,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {34173#(< 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; {34169#(< 26 main_~y~0)} is VALID [2022-04-28 03:54:05,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {34177#(< 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; {34173#(< 28 main_~y~0)} is VALID [2022-04-28 03:54:05,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {34181#(< 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; {34177#(< 30 main_~y~0)} is VALID [2022-04-28 03:54:05,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {34185#(< 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; {34181#(< 32 main_~y~0)} is VALID [2022-04-28 03:54:05,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {34189#(< 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; {34185#(< 34 main_~y~0)} is VALID [2022-04-28 03:54:05,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {34193#(< 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; {34189#(< 36 main_~y~0)} is VALID [2022-04-28 03:54:05,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {34197#(< 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; {34193#(< 38 main_~y~0)} is VALID [2022-04-28 03:54:05,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {34201#(< 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; {34197#(< 40 main_~y~0)} is VALID [2022-04-28 03:54:05,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {34205#(< 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; {34201#(< 42 main_~y~0)} is VALID [2022-04-28 03:54:05,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {34209#(< 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; {34205#(< 44 main_~y~0)} is VALID [2022-04-28 03:54:05,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {34213#(< 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; {34209#(< 46 main_~y~0)} is VALID [2022-04-28 03:54:05,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {34217#(< 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; {34213#(< 48 main_~y~0)} is VALID [2022-04-28 03:54:05,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {34221#(< 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; {34217#(< 50 main_~y~0)} is VALID [2022-04-28 03:54:05,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {34225#(< 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; {34221#(< 52 main_~y~0)} is VALID [2022-04-28 03:54:05,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {34229#(< 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; {34225#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:05,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {34233#(< 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; {34229#(< 56 main_~y~0)} is VALID [2022-04-28 03:54:05,971 INFO L290 TraceCheckUtils]: 11: Hoare triple {34237#(< 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; {34233#(< 58 main_~y~0)} is VALID [2022-04-28 03:54:05,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {34241#(< 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; {34237#(< 60 main_~y~0)} is VALID [2022-04-28 03:54:05,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {34241#(< 62 main_~y~0)} [182] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {34241#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:05,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {34241#(< 62 main_~y~0)} [185] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post5_214| |v_main_#t~post5_213|)) (.cse1 (= |v_main_#t~post6_214| |v_main_#t~post6_213|)) (.cse2 (= v_main_~x~0_1795 v_main_~x~0_1794)) (.cse3 (= v_main_~y~0_1997 v_main_~y~0_1996)) (.cse4 (<= 500000 v_main_~x~0_1795))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_1795 1000000)) (not .cse4))) (let ((.cse5 (+ v_main_~x~0_1795 v_main_~y~0_1996))) (and .cse4 (= (+ v_main_~x~0_1794 v_main_~y~0_1997) .cse5) (< .cse5 (+ 1000001 v_main_~y~0_1997)) (< v_main_~y~0_1997 v_main_~y~0_1996))))) InVars {main_~y~0=v_main_~y~0_1997, main_#t~post5=|v_main_#t~post5_214|, main_~x~0=v_main_~x~0_1795, 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_1794, main_#t~post6=|v_main_#t~post6_213|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {34241#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:05,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {34241#(< 62 main_~y~0)} [184] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34241#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:05,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {34241#(< 62 main_~y~0)} [183] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_1793 v_main_~x~0_1792)) (.cse1 (= |v_main_#t~post4_197| |v_main_#t~post4_196|))) (or (and (< v_main_~x~0_1793 v_main_~x~0_1792) (< v_main_~x~0_1792 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_1793)))) InVars {main_~x~0=v_main_~x~0_1793, main_#t~post4=|v_main_#t~post4_197|} OutVars{main_~x~0=v_main_~x~0_1792, main_#t~post4=|v_main_#t~post4_196|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {34241#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:05,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {33929#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {34241#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:05,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {33929#true} call #t~ret9 := main(); {33929#true} is VALID [2022-04-28 03:54:05,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33929#true} {33929#true} #53#return; {33929#true} is VALID [2022-04-28 03:54:05,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-28 03:54:05,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {33929#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(18, 2);call #Ultimate.allocInit(12, 3); {33929#true} is VALID [2022-04-28 03:54:05,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {33929#true} call ULTIMATE.init(); {33929#true} is VALID [2022-04-28 03:54:05,974 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-28 03:54:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448395798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:05,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 67 [2022-04-28 03:54:08,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:08,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1269785978] [2022-04-28 03:54:08,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1269785978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:08,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:08,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [92] imperfect sequences [] total 92 [2022-04-28 03:54:08,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023016672] [2022-04-28 03:54:08,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:08,483 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-28 03:54:08,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:08,483 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-28 03:54:08,601 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-28 03:54:08,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-04-28 03:54:08,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:08,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-04-28 03:54:08,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5965, Invalid=9287, Unknown=0, NotChecked=0, Total=15252 [2022-04-28 03:54:08,603 INFO L87 Difference]: Start difference. First operand 159 states and 163 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-28 03:54:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:21,611 INFO L93 Difference]: Finished difference Result 315 states and 328 transitions. [2022-04-28 03:54:21,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-04-28 03:54:21,611 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-28 03:54:21,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:21,612 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-28 03:54:21,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-04-28 03:54:21,613 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-28 03:54:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2022-04-28 03:54:21,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 185 transitions. [2022-04-28 03:54:21,766 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-28 03:54:21,768 INFO L225 Difference]: With dead ends: 315 [2022-04-28 03:54:21,768 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 03:54:21,771 INFO L412 NwaCegarLoop]: 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-28 03:54:21,771 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 243 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6516 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 6795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 6516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:21,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 37 Invalid, 6795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 6516 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-04-28 03:54:21,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 03:54:22,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 03:54:22,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:22,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:22,026 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:22,027 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:22,028 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-28 03:54:22,028 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-28 03:54:22,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:22,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:22,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 164 states. [2022-04-28 03:54:22,029 INFO L87 Difference]: Start difference. First operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 164 states. [2022-04-28 03:54:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:22,030 INFO L93 Difference]: Finished difference Result 164 states and 168 transitions. [2022-04-28 03:54:22,030 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-28 03:54:22,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:22,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:22,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:22,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 157 states have (on average 1.0318471337579618) internal successors, (162), 158 states have internal predecessors, (162), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:22,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2022-04-28 03:54:22,032 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 155 [2022-04-28 03:54:22,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:22,032 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2022-04-28 03:54:22,032 INFO L496 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-28 03:54:22,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 168 transitions. [2022-04-28 03:54:22,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2022-04-28 03:54:22,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-04-28 03:54:22,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:22,172 INFO L195 NwaCegarLoop]: trace histogram [58, 57, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:22,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-28 03:54:22,375 WARN L477 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-28 03:54:22,375 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:22,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:22,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1700951658, now seen corresponding path program 32 times [2022-04-28 03:54:22,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:22,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2128098673] [2022-04-28 03:54:22,483 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-28 03:54:26,600 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:54:26,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-28 03:54:26,707 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 819444194, now seen corresponding path program 1 times [2022-04-28 03:54:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:26,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250039756] [2022-04-28 03:54:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:26,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {35833#(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(18, 2);call #Ultimate.allocInit(12, 3); {35795#true} is VALID [2022-04-28 03:54:27,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {35795#true} assume true; {35795#true} is VALID [2022-04-28 03:54:27,376 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35795#true} {35795#true} #53#return; {35795#true} is VALID [2022-04-28 03:54:27,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {35795#true} call ULTIMATE.init(); {35833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:27,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {35833#(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(18, 2);call #Ultimate.allocInit(12, 3); {35795#true} is VALID [2022-04-28 03:54:27,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {35795#true} assume true; {35795#true} is VALID [2022-04-28 03:54:27,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35795#true} {35795#true} #53#return; {35795#true} is VALID [2022-04-28 03:54:27,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {35795#true} call #t~ret9 := main(); {35795#true} is VALID [2022-04-28 03:54:27,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {35795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:27,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {35800#(<= 500000 main_~y~0)} [187] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_203| |v_main_#t~post4_202|)) (.cse1 (= v_main_~x~0_1896 v_main_~x~0_1895))) (or (and (< v_main_~x~0_1896 v_main_~x~0_1895) (< v_main_~x~0_1895 500001)) (and .cse0 (not (< v_main_~x~0_1896 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1896, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:27,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {35800#(<= 500000 main_~y~0)} [188] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:27,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {35800#(<= 500000 main_~y~0)} [189] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse2 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse3 (= v_main_~x~0_1898 v_main_~x~0_1897)) (.cse5 (<= 500000 v_main_~x~0_1898))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1898 v_main_~y~0_2122))) (and (= (+ v_main_~x~0_1897 v_main_~y~0_2123) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_1898 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_1898, 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_1897, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:27,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {35800#(<= 500000 main_~y~0)} [186] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:27,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {35800#(<= 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; {35801#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:27,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {35801#(<= 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; {35802#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:27,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {35802#(<= 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; {35803#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:27,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {35803#(<= 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; {35804#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:27,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {35804#(<= 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; {35805#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:27,384 INFO L290 TraceCheckUtils]: 15: Hoare triple {35805#(<= 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; {35806#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:27,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {35806#(<= 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; {35807#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:27,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {35807#(<= 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; {35808#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:27,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {35808#(<= 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; {35809#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:27,387 INFO L290 TraceCheckUtils]: 19: Hoare triple {35809#(<= 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; {35810#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:27,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {35810#(<= 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; {35811#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:27,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {35811#(<= 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; {35812#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:27,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {35812#(<= 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; {35813#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:27,389 INFO L290 TraceCheckUtils]: 23: Hoare triple {35813#(<= 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; {35814#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:27,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {35814#(<= 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; {35815#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:27,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {35815#(<= 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; {35816#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:27,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {35816#(<= 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; {35817#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:27,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {35817#(<= 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; {35818#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:27,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {35818#(<= 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; {35819#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:27,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {35819#(<= 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; {35820#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:27,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {35820#(<= 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; {35821#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:27,395 INFO L290 TraceCheckUtils]: 31: Hoare triple {35821#(<= 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; {35822#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:27,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {35822#(<= 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; {35823#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:27,396 INFO L290 TraceCheckUtils]: 33: Hoare triple {35823#(<= 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; {35824#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:27,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {35824#(<= 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; {35825#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:27,397 INFO L290 TraceCheckUtils]: 35: Hoare triple {35825#(<= 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; {35826#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:27,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {35826#(<= 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; {35827#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:27,398 INFO L290 TraceCheckUtils]: 37: Hoare triple {35827#(<= 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; {35828#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:27,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {35828#(<= 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; {35829#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:27,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {35829#(<= 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; {35830#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:27,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {35830#(<= 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; {35831#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:27,401 INFO L290 TraceCheckUtils]: 41: Hoare triple {35831#(<= 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; {35832#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:54:27,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {35832#(<= 499936 main_~y~0)} assume !(~y~0 > 0); {35796#false} is VALID [2022-04-28 03:54:27,401 INFO L272 TraceCheckUtils]: 43: Hoare triple {35796#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {35796#false} is VALID [2022-04-28 03:54:27,401 INFO L290 TraceCheckUtils]: 44: Hoare triple {35796#false} ~cond := #in~cond; {35796#false} is VALID [2022-04-28 03:54:27,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {35796#false} assume 0 == ~cond; {35796#false} is VALID [2022-04-28 03:54:27,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {35796#false} assume !false; {35796#false} is VALID [2022-04-28 03:54:27,402 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-28 03:54:27,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250039756] [2022-04-28 03:54:27,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250039756] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:27,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496028721] [2022-04-28 03:54:27,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:27,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:27,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:27,404 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-28 03:54:27,405 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-28 03:54:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 03:54:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:27,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:28,007 INFO L272 TraceCheckUtils]: 0: Hoare triple {35795#true} call ULTIMATE.init(); {35795#true} is VALID [2022-04-28 03:54:28,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {35795#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(18, 2);call #Ultimate.allocInit(12, 3); {35795#true} is VALID [2022-04-28 03:54:28,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {35795#true} assume true; {35795#true} is VALID [2022-04-28 03:54:28,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35795#true} {35795#true} #53#return; {35795#true} is VALID [2022-04-28 03:54:28,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {35795#true} call #t~ret9 := main(); {35795#true} is VALID [2022-04-28 03:54:28,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {35795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:28,008 INFO L290 TraceCheckUtils]: 6: Hoare triple {35800#(<= 500000 main_~y~0)} [187] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_203| |v_main_#t~post4_202|)) (.cse1 (= v_main_~x~0_1896 v_main_~x~0_1895))) (or (and (< v_main_~x~0_1896 v_main_~x~0_1895) (< v_main_~x~0_1895 500001)) (and .cse0 (not (< v_main_~x~0_1896 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1896, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:28,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {35800#(<= 500000 main_~y~0)} [188] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:28,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {35800#(<= 500000 main_~y~0)} [189] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse2 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse3 (= v_main_~x~0_1898 v_main_~x~0_1897)) (.cse5 (<= 500000 v_main_~x~0_1898))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1898 v_main_~y~0_2122))) (and (= (+ v_main_~x~0_1897 v_main_~y~0_2123) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_1898 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_1898, 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_1897, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:28,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {35800#(<= 500000 main_~y~0)} [186] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {35800#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:28,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {35800#(<= 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; {35801#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:28,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {35801#(<= 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; {35802#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:28,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {35802#(<= 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; {35803#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:28,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {35803#(<= 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; {35804#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:28,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {35804#(<= 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; {35805#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:28,013 INFO L290 TraceCheckUtils]: 15: Hoare triple {35805#(<= 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; {35806#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:28,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {35806#(<= 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; {35807#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:28,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {35807#(<= 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; {35808#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:28,014 INFO L290 TraceCheckUtils]: 18: Hoare triple {35808#(<= 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; {35809#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:28,014 INFO L290 TraceCheckUtils]: 19: Hoare triple {35809#(<= 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; {35810#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:28,015 INFO L290 TraceCheckUtils]: 20: Hoare triple {35810#(<= 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; {35811#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:28,015 INFO L290 TraceCheckUtils]: 21: Hoare triple {35811#(<= 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; {35812#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:28,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {35812#(<= 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; {35813#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:28,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {35813#(<= 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; {35814#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:28,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {35814#(<= 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; {35815#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:28,017 INFO L290 TraceCheckUtils]: 25: Hoare triple {35815#(<= 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; {35816#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:28,018 INFO L290 TraceCheckUtils]: 26: Hoare triple {35816#(<= 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; {35817#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:28,018 INFO L290 TraceCheckUtils]: 27: Hoare triple {35817#(<= 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; {35818#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:28,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {35818#(<= 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; {35819#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:28,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {35819#(<= 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; {35820#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:28,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {35820#(<= 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; {35821#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:28,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {35821#(<= 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; {35822#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:28,021 INFO L290 TraceCheckUtils]: 32: Hoare triple {35822#(<= 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; {35823#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:28,021 INFO L290 TraceCheckUtils]: 33: Hoare triple {35823#(<= 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; {35824#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:28,021 INFO L290 TraceCheckUtils]: 34: Hoare triple {35824#(<= 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; {35825#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:28,022 INFO L290 TraceCheckUtils]: 35: Hoare triple {35825#(<= 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; {35826#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:28,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {35826#(<= 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; {35827#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:28,023 INFO L290 TraceCheckUtils]: 37: Hoare triple {35827#(<= 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; {35828#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:28,023 INFO L290 TraceCheckUtils]: 38: Hoare triple {35828#(<= 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; {35829#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:28,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {35829#(<= 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; {35830#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:28,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {35830#(<= 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; {35831#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:28,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {35831#(<= 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; {35832#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:54:28,025 INFO L290 TraceCheckUtils]: 42: Hoare triple {35832#(<= 499936 main_~y~0)} assume !(~y~0 > 0); {35796#false} is VALID [2022-04-28 03:54:28,025 INFO L272 TraceCheckUtils]: 43: Hoare triple {35796#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {35796#false} is VALID [2022-04-28 03:54:28,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {35796#false} ~cond := #in~cond; {35796#false} is VALID [2022-04-28 03:54:28,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {35796#false} assume 0 == ~cond; {35796#false} is VALID [2022-04-28 03:54:28,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {35796#false} assume !false; {35796#false} is VALID [2022-04-28 03:54:28,026 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-28 03:54:28,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:29,634 INFO L290 TraceCheckUtils]: 46: Hoare triple {35796#false} assume !false; {35796#false} is VALID [2022-04-28 03:54:29,634 INFO L290 TraceCheckUtils]: 45: Hoare triple {35796#false} assume 0 == ~cond; {35796#false} is VALID [2022-04-28 03:54:29,634 INFO L290 TraceCheckUtils]: 44: Hoare triple {35796#false} ~cond := #in~cond; {35796#false} is VALID [2022-04-28 03:54:29,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {35796#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {35796#false} is VALID [2022-04-28 03:54:29,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {35987#(< 0 main_~y~0)} assume !(~y~0 > 0); {35796#false} is VALID [2022-04-28 03:54:29,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {35991#(< 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; {35987#(< 0 main_~y~0)} is VALID [2022-04-28 03:54:29,636 INFO L290 TraceCheckUtils]: 40: Hoare triple {35995#(< 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; {35991#(< 2 main_~y~0)} is VALID [2022-04-28 03:54:29,636 INFO L290 TraceCheckUtils]: 39: Hoare triple {35999#(< 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; {35995#(< 4 main_~y~0)} is VALID [2022-04-28 03:54:29,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {36003#(< 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; {35999#(< 6 main_~y~0)} is VALID [2022-04-28 03:54:29,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {36007#(< 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; {36003#(< 8 main_~y~0)} is VALID [2022-04-28 03:54:29,638 INFO L290 TraceCheckUtils]: 36: Hoare triple {36011#(< 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; {36007#(< 10 main_~y~0)} is VALID [2022-04-28 03:54:29,638 INFO L290 TraceCheckUtils]: 35: Hoare triple {36015#(< 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; {36011#(< 12 main_~y~0)} is VALID [2022-04-28 03:54:29,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {36019#(< 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; {36015#(< 14 main_~y~0)} is VALID [2022-04-28 03:54:29,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {36023#(< 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; {36019#(< 16 main_~y~0)} is VALID [2022-04-28 03:54:29,640 INFO L290 TraceCheckUtils]: 32: Hoare triple {36027#(< 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; {36023#(< 18 main_~y~0)} is VALID [2022-04-28 03:54:29,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {36031#(< 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; {36027#(< 20 main_~y~0)} is VALID [2022-04-28 03:54:29,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {36035#(< 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; {36031#(< 22 main_~y~0)} is VALID [2022-04-28 03:54:29,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {36039#(< 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; {36035#(< 24 main_~y~0)} is VALID [2022-04-28 03:54:29,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {36043#(< 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; {36039#(< 26 main_~y~0)} is VALID [2022-04-28 03:54:29,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {36047#(< 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; {36043#(< 28 main_~y~0)} is VALID [2022-04-28 03:54:29,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {36051#(< 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; {36047#(< 30 main_~y~0)} is VALID [2022-04-28 03:54:29,643 INFO L290 TraceCheckUtils]: 25: Hoare triple {36055#(< 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; {36051#(< 32 main_~y~0)} is VALID [2022-04-28 03:54:29,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {36059#(< 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; {36055#(< 34 main_~y~0)} is VALID [2022-04-28 03:54:29,644 INFO L290 TraceCheckUtils]: 23: Hoare triple {36063#(< 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; {36059#(< 36 main_~y~0)} is VALID [2022-04-28 03:54:29,644 INFO L290 TraceCheckUtils]: 22: Hoare triple {36067#(< 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; {36063#(< 38 main_~y~0)} is VALID [2022-04-28 03:54:29,645 INFO L290 TraceCheckUtils]: 21: Hoare triple {36071#(< 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; {36067#(< 40 main_~y~0)} is VALID [2022-04-28 03:54:29,645 INFO L290 TraceCheckUtils]: 20: Hoare triple {36075#(< 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; {36071#(< 42 main_~y~0)} is VALID [2022-04-28 03:54:29,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {36079#(< 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; {36075#(< 44 main_~y~0)} is VALID [2022-04-28 03:54:29,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {36083#(< 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; {36079#(< 46 main_~y~0)} is VALID [2022-04-28 03:54:29,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {36087#(< 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; {36083#(< 48 main_~y~0)} is VALID [2022-04-28 03:54:29,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {36091#(< 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; {36087#(< 50 main_~y~0)} is VALID [2022-04-28 03:54:29,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {36095#(< 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; {36091#(< 52 main_~y~0)} is VALID [2022-04-28 03:54:29,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {36099#(< 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; {36095#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:29,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {36103#(< 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; {36099#(< 56 main_~y~0)} is VALID [2022-04-28 03:54:29,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {36107#(< 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; {36103#(< 58 main_~y~0)} is VALID [2022-04-28 03:54:29,649 INFO L290 TraceCheckUtils]: 11: Hoare triple {36111#(< 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; {36107#(< 60 main_~y~0)} is VALID [2022-04-28 03:54:29,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {36115#(< 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; {36111#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:29,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {36115#(< 64 main_~y~0)} [186] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {36115#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:29,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {36115#(< 64 main_~y~0)} [189] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_221| |v_main_#t~post6_220|)) (.cse1 (= v_main_~y~0_2123 v_main_~y~0_2122)) (.cse2 (= |v_main_#t~post5_221| |v_main_#t~post5_220|)) (.cse3 (= v_main_~x~0_1898 v_main_~x~0_1897)) (.cse5 (<= 500000 v_main_~x~0_1898))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_1898 v_main_~y~0_2122))) (and (= (+ v_main_~x~0_1897 v_main_~y~0_2123) .cse4) (< .cse4 (+ 1000001 v_main_~y~0_2123)) (< v_main_~y~0_2123 v_main_~y~0_2122) .cse5)) (and .cse0 .cse1 .cse2 .cse3 (or (not .cse5) (not (< v_main_~x~0_1898 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_1898, 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_1897, main_#t~post6=|v_main_#t~post6_220|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {36115#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:29,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {36115#(< 64 main_~y~0)} [188] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36115#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:29,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {36115#(< 64 main_~y~0)} [187] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_203| |v_main_#t~post4_202|)) (.cse1 (= v_main_~x~0_1896 v_main_~x~0_1895))) (or (and (< v_main_~x~0_1896 v_main_~x~0_1895) (< v_main_~x~0_1895 500001)) (and .cse0 (not (< v_main_~x~0_1896 500000)) .cse1) (and .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_1896, main_#t~post4=|v_main_#t~post4_203|} OutVars{main_~x~0=v_main_~x~0_1895, main_#t~post4=|v_main_#t~post4_202|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {36115#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:29,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {35795#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {36115#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:29,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {35795#true} call #t~ret9 := main(); {35795#true} is VALID [2022-04-28 03:54:29,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35795#true} {35795#true} #53#return; {35795#true} is VALID [2022-04-28 03:54:29,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {35795#true} assume true; {35795#true} is VALID [2022-04-28 03:54:29,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {35795#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(18, 2);call #Ultimate.allocInit(12, 3); {35795#true} is VALID [2022-04-28 03:54:29,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {35795#true} call ULTIMATE.init(); {35795#true} is VALID [2022-04-28 03:54:29,653 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-28 03:54:29,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496028721] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:29,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:29,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 69 [2022-04-28 03:54:32,262 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:32,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2128098673] [2022-04-28 03:54:32,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2128098673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:32,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:32,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [95] imperfect sequences [] total 95 [2022-04-28 03:54:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491533874] [2022-04-28 03:54:32,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:32,263 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-28 03:54:32,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:32,263 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-28 03:54:32,378 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-28 03:54:32,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-04-28 03:54:32,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-04-28 03:54:32,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6350, Invalid=9906, Unknown=0, NotChecked=0, Total=16256 [2022-04-28 03:54:32,380 INFO L87 Difference]: Start difference. First operand 164 states and 168 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-28 03:54:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:46,495 INFO L93 Difference]: Finished difference Result 325 states and 338 transitions. [2022-04-28 03:54:46,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2022-04-28 03:54:46,496 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-28 03:54:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:54:46,496 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-28 03:54:46,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 190 transitions. [2022-04-28 03:54:46,497 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-28 03:54:46,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 190 transitions. [2022-04-28 03:54:46,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 190 transitions. [2022-04-28 03:54:46,683 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-28 03:54:46,685 INFO L225 Difference]: With dead ends: 325 [2022-04-28 03:54:46,685 INFO L226 Difference]: Without dead ends: 169 [2022-04-28 03:54:46,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 124 SyntacticMatches, 2 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14029 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=14820, Invalid=33360, Unknown=0, NotChecked=0, Total=48180 [2022-04-28 03:54:46,689 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 373 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 6997 mSolverCounterSat, 409 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 7406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 409 IncrementalHoareTripleChecker+Valid, 6997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-04-28 03:54:46,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 57 Invalid, 7406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [409 Valid, 6997 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-04-28 03:54:46,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-28 03:54:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-04-28 03:54:46,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:54:46,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:46,960 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:46,961 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:46,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:46,962 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-04-28 03:54:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-04-28 03:54:46,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:46,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:46,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 169 states. [2022-04-28 03:54:46,963 INFO L87 Difference]: Start difference. First operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 169 states. [2022-04-28 03:54:46,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:54:46,964 INFO L93 Difference]: Finished difference Result 169 states and 173 transitions. [2022-04-28 03:54:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-04-28 03:54:46,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:54:46,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:54:46,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:54:46,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:54:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 162 states have (on average 1.0308641975308641) internal successors, (167), 163 states have internal predecessors, (167), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:54:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 173 transitions. [2022-04-28 03:54:46,966 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 173 transitions. Word has length 160 [2022-04-28 03:54:46,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:54:46,966 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 173 transitions. [2022-04-28 03:54:46,966 INFO L496 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-28 03:54:46,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 173 transitions. [2022-04-28 03:54:47,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:54:47,106 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 173 transitions. [2022-04-28 03:54:47,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-04-28 03:54:47,107 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:54:47,107 INFO L195 NwaCegarLoop]: trace histogram [60, 59, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:54:47,123 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-28 03:54:47,307 WARN L477 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-28 03:54:47,308 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:54:47,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:54:47,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1596835843, now seen corresponding path program 33 times [2022-04-28 03:54:47,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:47,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2037016631] [2022-04-28 03:54:47,399 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-28 03:54:47,621 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-28 03:54:47,622 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:54:47,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1128214719, now seen corresponding path program 1 times [2022-04-28 03:54:47,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:54:47,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154833188] [2022-04-28 03:54:47,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:47,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:54:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:48,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:54:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:48,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {37756#(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(18, 2);call #Ultimate.allocInit(12, 3); {37717#true} is VALID [2022-04-28 03:54:48,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 03:54:48,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37717#true} {37717#true} #53#return; {37717#true} is VALID [2022-04-28 03:54:48,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37756#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:54:48,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {37756#(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(18, 2);call #Ultimate.allocInit(12, 3); {37717#true} is VALID [2022-04-28 03:54:48,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 03:54:48,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #53#return; {37717#true} is VALID [2022-04-28 03:54:48,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret9 := main(); {37717#true} is VALID [2022-04-28 03:54:48,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {37722#(<= 500000 main_~y~0)} [191] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2002 v_main_~x~0_2001)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (not (< v_main_~x~0_2002 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 500001) (< v_main_~x~0_2002 v_main_~x~0_2001)))) InVars {main_~x~0=v_main_~x~0_2002, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {37722#(<= 500000 main_~y~0)} [192] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {37722#(<= 500000 main_~y~0)} [193] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2004 v_main_~x~0_2003)) (.cse0 (<= 500000 v_main_~x~0_2004)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse1 (+ v_main_~x~0_2004 v_main_~y~0_2252))) (and .cse0 (< v_main_~y~0_2253 v_main_~y~0_2252) (= .cse1 (+ v_main_~x~0_2003 v_main_~y~0_2253)) (< .cse1 (+ 1000001 v_main_~y~0_2253)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_2004 1000000))) .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_2004, 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_2003, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {37722#(<= 500000 main_~y~0)} [190] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,353 INFO L290 TraceCheckUtils]: 10: Hoare triple {37722#(<= 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; {37723#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:48,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {37723#(<= 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; {37724#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:48,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {37724#(<= 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; {37725#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:48,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {37725#(<= 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; {37726#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:48,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {37726#(<= 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; {37727#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:48,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {37727#(<= 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; {37728#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:48,356 INFO L290 TraceCheckUtils]: 16: Hoare triple {37728#(<= 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; {37729#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:48,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {37729#(<= 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; {37730#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:48,357 INFO L290 TraceCheckUtils]: 18: Hoare triple {37730#(<= 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; {37731#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:48,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {37731#(<= 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; {37732#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:48,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {37732#(<= 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; {37733#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:48,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {37733#(<= 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; {37734#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:48,359 INFO L290 TraceCheckUtils]: 22: Hoare triple {37734#(<= 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; {37735#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:48,359 INFO L290 TraceCheckUtils]: 23: Hoare triple {37735#(<= 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; {37736#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:48,359 INFO L290 TraceCheckUtils]: 24: Hoare triple {37736#(<= 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; {37737#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:48,360 INFO L290 TraceCheckUtils]: 25: Hoare triple {37737#(<= 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; {37738#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:48,360 INFO L290 TraceCheckUtils]: 26: Hoare triple {37738#(<= 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; {37739#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:48,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {37739#(<= 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; {37740#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:48,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {37740#(<= 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; {37741#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:48,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {37741#(<= 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; {37742#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:48,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {37742#(<= 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; {37743#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:48,363 INFO L290 TraceCheckUtils]: 31: Hoare triple {37743#(<= 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; {37744#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:48,363 INFO L290 TraceCheckUtils]: 32: Hoare triple {37744#(<= 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; {37745#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:48,364 INFO L290 TraceCheckUtils]: 33: Hoare triple {37745#(<= 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; {37746#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:48,364 INFO L290 TraceCheckUtils]: 34: Hoare triple {37746#(<= 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; {37747#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:48,365 INFO L290 TraceCheckUtils]: 35: Hoare triple {37747#(<= 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; {37748#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:48,365 INFO L290 TraceCheckUtils]: 36: Hoare triple {37748#(<= 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; {37749#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:48,366 INFO L290 TraceCheckUtils]: 37: Hoare triple {37749#(<= 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; {37750#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:48,366 INFO L290 TraceCheckUtils]: 38: Hoare triple {37750#(<= 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; {37751#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:48,366 INFO L290 TraceCheckUtils]: 39: Hoare triple {37751#(<= 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; {37752#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:48,367 INFO L290 TraceCheckUtils]: 40: Hoare triple {37752#(<= 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; {37753#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:48,367 INFO L290 TraceCheckUtils]: 41: Hoare triple {37753#(<= 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; {37754#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:54:48,368 INFO L290 TraceCheckUtils]: 42: Hoare triple {37754#(<= 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; {37755#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:54:48,368 INFO L290 TraceCheckUtils]: 43: Hoare triple {37755#(<= 499934 main_~y~0)} assume !(~y~0 > 0); {37718#false} is VALID [2022-04-28 03:54:48,368 INFO L272 TraceCheckUtils]: 44: Hoare triple {37718#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {37718#false} is VALID [2022-04-28 03:54:48,368 INFO L290 TraceCheckUtils]: 45: Hoare triple {37718#false} ~cond := #in~cond; {37718#false} is VALID [2022-04-28 03:54:48,368 INFO L290 TraceCheckUtils]: 46: Hoare triple {37718#false} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 03:54:48,368 INFO L290 TraceCheckUtils]: 47: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 03:54:48,369 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-28 03:54:48,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:54:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154833188] [2022-04-28 03:54:48,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154833188] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:54:48,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896793490] [2022-04-28 03:54:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:54:48,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:54:48,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:54:48,370 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-28 03:54:48,372 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-28 03:54:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:48,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-28 03:54:48,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:54:48,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:54:48,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37717#true} is VALID [2022-04-28 03:54:48,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#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(18, 2);call #Ultimate.allocInit(12, 3); {37717#true} is VALID [2022-04-28 03:54:48,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 03:54:48,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #53#return; {37717#true} is VALID [2022-04-28 03:54:48,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret9 := main(); {37717#true} is VALID [2022-04-28 03:54:48,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {37722#(<= 500000 main_~y~0)} [191] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2002 v_main_~x~0_2001)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (not (< v_main_~x~0_2002 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 500001) (< v_main_~x~0_2002 v_main_~x~0_2001)))) InVars {main_~x~0=v_main_~x~0_2002, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {37722#(<= 500000 main_~y~0)} [192] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {37722#(<= 500000 main_~y~0)} [193] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2004 v_main_~x~0_2003)) (.cse0 (<= 500000 v_main_~x~0_2004)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse1 (+ v_main_~x~0_2004 v_main_~y~0_2252))) (and .cse0 (< v_main_~y~0_2253 v_main_~y~0_2252) (= .cse1 (+ v_main_~x~0_2003 v_main_~y~0_2253)) (< .cse1 (+ 1000001 v_main_~y~0_2253)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_2004 1000000))) .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_2004, 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_2003, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {37722#(<= 500000 main_~y~0)} [190] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {37722#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:54:48,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {37722#(<= 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; {37723#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:54:48,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {37723#(<= 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; {37724#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:54:48,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {37724#(<= 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; {37725#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:54:48,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {37725#(<= 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; {37726#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:54:48,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {37726#(<= 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; {37727#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:54:48,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {37727#(<= 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; {37728#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:54:48,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {37728#(<= 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; {37729#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:54:48,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {37729#(<= 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; {37730#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:54:48,936 INFO L290 TraceCheckUtils]: 18: Hoare triple {37730#(<= 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; {37731#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:54:48,936 INFO L290 TraceCheckUtils]: 19: Hoare triple {37731#(<= 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; {37732#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:54:48,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {37732#(<= 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; {37733#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:54:48,937 INFO L290 TraceCheckUtils]: 21: Hoare triple {37733#(<= 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; {37734#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:54:48,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {37734#(<= 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; {37735#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:54:48,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {37735#(<= 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; {37736#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:54:48,939 INFO L290 TraceCheckUtils]: 24: Hoare triple {37736#(<= 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; {37737#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:54:48,939 INFO L290 TraceCheckUtils]: 25: Hoare triple {37737#(<= 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; {37738#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:54:48,940 INFO L290 TraceCheckUtils]: 26: Hoare triple {37738#(<= 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; {37739#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:54:48,940 INFO L290 TraceCheckUtils]: 27: Hoare triple {37739#(<= 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; {37740#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:54:48,941 INFO L290 TraceCheckUtils]: 28: Hoare triple {37740#(<= 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; {37741#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:54:48,941 INFO L290 TraceCheckUtils]: 29: Hoare triple {37741#(<= 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; {37742#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:54:48,942 INFO L290 TraceCheckUtils]: 30: Hoare triple {37742#(<= 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; {37743#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:54:48,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {37743#(<= 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; {37744#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:54:48,943 INFO L290 TraceCheckUtils]: 32: Hoare triple {37744#(<= 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; {37745#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:54:48,943 INFO L290 TraceCheckUtils]: 33: Hoare triple {37745#(<= 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; {37746#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:54:48,943 INFO L290 TraceCheckUtils]: 34: Hoare triple {37746#(<= 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; {37747#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:54:48,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {37747#(<= 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; {37748#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:54:48,944 INFO L290 TraceCheckUtils]: 36: Hoare triple {37748#(<= 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; {37749#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:54:48,945 INFO L290 TraceCheckUtils]: 37: Hoare triple {37749#(<= 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; {37750#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:54:48,945 INFO L290 TraceCheckUtils]: 38: Hoare triple {37750#(<= 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; {37751#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:54:48,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {37751#(<= 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; {37752#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:54:48,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {37752#(<= 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; {37753#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:54:48,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {37753#(<= 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; {37754#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:54:48,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {37754#(<= 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; {37755#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:54:48,948 INFO L290 TraceCheckUtils]: 43: Hoare triple {37755#(<= 499934 main_~y~0)} assume !(~y~0 > 0); {37718#false} is VALID [2022-04-28 03:54:48,948 INFO L272 TraceCheckUtils]: 44: Hoare triple {37718#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {37718#false} is VALID [2022-04-28 03:54:48,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {37718#false} ~cond := #in~cond; {37718#false} is VALID [2022-04-28 03:54:48,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {37718#false} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 03:54:48,948 INFO L290 TraceCheckUtils]: 47: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 03:54:48,948 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-28 03:54:48,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:54:50,615 INFO L290 TraceCheckUtils]: 47: Hoare triple {37718#false} assume !false; {37718#false} is VALID [2022-04-28 03:54:50,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {37718#false} assume 0 == ~cond; {37718#false} is VALID [2022-04-28 03:54:50,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {37718#false} ~cond := #in~cond; {37718#false} is VALID [2022-04-28 03:54:50,615 INFO L272 TraceCheckUtils]: 44: Hoare triple {37718#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {37718#false} is VALID [2022-04-28 03:54:50,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {37913#(< 0 main_~y~0)} assume !(~y~0 > 0); {37718#false} is VALID [2022-04-28 03:54:50,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {37917#(< 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; {37913#(< 0 main_~y~0)} is VALID [2022-04-28 03:54:50,616 INFO L290 TraceCheckUtils]: 41: Hoare triple {37921#(< 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; {37917#(< 2 main_~y~0)} is VALID [2022-04-28 03:54:50,617 INFO L290 TraceCheckUtils]: 40: Hoare triple {37925#(< 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; {37921#(< 4 main_~y~0)} is VALID [2022-04-28 03:54:50,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {37929#(< 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; {37925#(< 6 main_~y~0)} is VALID [2022-04-28 03:54:50,620 INFO L290 TraceCheckUtils]: 38: Hoare triple {37933#(< 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; {37929#(< 8 main_~y~0)} is VALID [2022-04-28 03:54:50,621 INFO L290 TraceCheckUtils]: 37: Hoare triple {37937#(< 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; {37933#(< 10 main_~y~0)} is VALID [2022-04-28 03:54:50,621 INFO L290 TraceCheckUtils]: 36: Hoare triple {37941#(< 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; {37937#(< 12 main_~y~0)} is VALID [2022-04-28 03:54:50,622 INFO L290 TraceCheckUtils]: 35: Hoare triple {37945#(< 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; {37941#(< 14 main_~y~0)} is VALID [2022-04-28 03:54:50,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {37949#(< 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; {37945#(< 16 main_~y~0)} is VALID [2022-04-28 03:54:50,623 INFO L290 TraceCheckUtils]: 33: Hoare triple {37953#(< 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; {37949#(< 18 main_~y~0)} is VALID [2022-04-28 03:54:50,624 INFO L290 TraceCheckUtils]: 32: Hoare triple {37957#(< 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; {37953#(< 20 main_~y~0)} is VALID [2022-04-28 03:54:50,625 INFO L290 TraceCheckUtils]: 31: Hoare triple {37961#(< 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; {37957#(< 22 main_~y~0)} is VALID [2022-04-28 03:54:50,625 INFO L290 TraceCheckUtils]: 30: Hoare triple {37965#(< 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; {37961#(< 24 main_~y~0)} is VALID [2022-04-28 03:54:50,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {37969#(< 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; {37965#(< 26 main_~y~0)} is VALID [2022-04-28 03:54:50,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {37973#(< 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; {37969#(< 28 main_~y~0)} is VALID [2022-04-28 03:54:50,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {37977#(< 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; {37973#(< 30 main_~y~0)} is VALID [2022-04-28 03:54:50,628 INFO L290 TraceCheckUtils]: 26: Hoare triple {37981#(< 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; {37977#(< 32 main_~y~0)} is VALID [2022-04-28 03:54:50,628 INFO L290 TraceCheckUtils]: 25: Hoare triple {37985#(< 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; {37981#(< 34 main_~y~0)} is VALID [2022-04-28 03:54:50,629 INFO L290 TraceCheckUtils]: 24: Hoare triple {37989#(< 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; {37985#(< 36 main_~y~0)} is VALID [2022-04-28 03:54:50,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {37993#(< 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; {37989#(< 38 main_~y~0)} is VALID [2022-04-28 03:54:50,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {37997#(< 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; {37993#(< 40 main_~y~0)} is VALID [2022-04-28 03:54:50,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {38001#(< 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; {37997#(< 42 main_~y~0)} is VALID [2022-04-28 03:54:50,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {38005#(< 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; {38001#(< 44 main_~y~0)} is VALID [2022-04-28 03:54:50,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {38009#(< 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; {38005#(< 46 main_~y~0)} is VALID [2022-04-28 03:54:50,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {38013#(< 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; {38009#(< 48 main_~y~0)} is VALID [2022-04-28 03:54:50,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {38017#(< 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; {38013#(< 50 main_~y~0)} is VALID [2022-04-28 03:54:50,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {38021#(< 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; {38017#(< 52 main_~y~0)} is VALID [2022-04-28 03:54:50,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {38025#(< 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; {38021#(< 54 main_~y~0)} is VALID [2022-04-28 03:54:50,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {38029#(< 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; {38025#(< 56 main_~y~0)} is VALID [2022-04-28 03:54:50,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {38033#(< 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; {38029#(< 58 main_~y~0)} is VALID [2022-04-28 03:54:50,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {38037#(< 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; {38033#(< 60 main_~y~0)} is VALID [2022-04-28 03:54:50,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {38041#(< 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; {38037#(< 62 main_~y~0)} is VALID [2022-04-28 03:54:50,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {38045#(< 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; {38041#(< 64 main_~y~0)} is VALID [2022-04-28 03:54:50,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {38045#(< 66 main_~y~0)} [190] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {38045#(< 66 main_~y~0)} is VALID [2022-04-28 03:54:50,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {38045#(< 66 main_~y~0)} [193] L10-2-->L17-1_primed: Formula: (let ((.cse2 (= |v_main_#t~post6_228| |v_main_#t~post6_227|)) (.cse3 (= v_main_~x~0_2004 v_main_~x~0_2003)) (.cse0 (<= 500000 v_main_~x~0_2004)) (.cse4 (= v_main_~y~0_2253 v_main_~y~0_2252)) (.cse5 (= |v_main_#t~post5_228| |v_main_#t~post5_227|))) (or (let ((.cse1 (+ v_main_~x~0_2004 v_main_~y~0_2252))) (and .cse0 (< v_main_~y~0_2253 v_main_~y~0_2252) (= .cse1 (+ v_main_~x~0_2003 v_main_~y~0_2253)) (< .cse1 (+ 1000001 v_main_~y~0_2253)))) (and .cse2 .cse3 .cse4 .cse5) (and .cse2 .cse3 (or (not .cse0) (not (< v_main_~x~0_2004 1000000))) .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_2004, 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_2003, main_#t~post6=|v_main_#t~post6_227|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {38045#(< 66 main_~y~0)} is VALID [2022-04-28 03:54:50,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {38045#(< 66 main_~y~0)} [192] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38045#(< 66 main_~y~0)} is VALID [2022-04-28 03:54:50,639 INFO L290 TraceCheckUtils]: 6: Hoare triple {38045#(< 66 main_~y~0)} [191] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2002 v_main_~x~0_2001)) (.cse1 (= |v_main_#t~post4_209| |v_main_#t~post4_208|))) (or (and (not (< v_main_~x~0_2002 500000)) .cse0 .cse1) (and .cse0 .cse1) (and (< v_main_~x~0_2001 500001) (< v_main_~x~0_2002 v_main_~x~0_2001)))) InVars {main_~x~0=v_main_~x~0_2002, main_#t~post4=|v_main_#t~post4_209|} OutVars{main_~x~0=v_main_~x~0_2001, main_#t~post4=|v_main_#t~post4_208|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {38045#(< 66 main_~y~0)} is VALID [2022-04-28 03:54:50,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {37717#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {38045#(< 66 main_~y~0)} is VALID [2022-04-28 03:54:50,640 INFO L272 TraceCheckUtils]: 4: Hoare triple {37717#true} call #t~ret9 := main(); {37717#true} is VALID [2022-04-28 03:54:50,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37717#true} {37717#true} #53#return; {37717#true} is VALID [2022-04-28 03:54:50,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {37717#true} assume true; {37717#true} is VALID [2022-04-28 03:54:50,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {37717#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(18, 2);call #Ultimate.allocInit(12, 3); {37717#true} is VALID [2022-04-28 03:54:50,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {37717#true} call ULTIMATE.init(); {37717#true} is VALID [2022-04-28 03:54:50,640 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-28 03:54:50,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896793490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:54:50,641 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:54:50,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 71 [2022-04-28 03:54:53,488 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:54:53,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2037016631] [2022-04-28 03:54:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2037016631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:54:53,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:54:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [98] imperfect sequences [] total 98 [2022-04-28 03:54:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923282393] [2022-04-28 03:54:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:54:53,489 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-28 03:54:53,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:54:53,490 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-28 03:54:53,612 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-28 03:54:53,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-28 03:54:53,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:54:53,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-28 03:54:53,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6747, Invalid=10545, Unknown=0, NotChecked=0, Total=17292 [2022-04-28 03:54:53,614 INFO L87 Difference]: Start difference. First operand 169 states and 173 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-28 03:55:08,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:08,328 INFO L93 Difference]: Finished difference Result 335 states and 348 transitions. [2022-04-28 03:55:08,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2022-04-28 03:55:08,328 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-28 03:55:08,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:08,329 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-28 03:55:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 195 transitions. [2022-04-28 03:55:08,331 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-28 03:55:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 195 transitions. [2022-04-28 03:55:08,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 195 transitions. [2022-04-28 03:55:08,512 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-28 03:55:08,514 INFO L225 Difference]: With dead ends: 335 [2022-04-28 03:55:08,514 INFO L226 Difference]: Without dead ends: 174 [2022-04-28 03:55:08,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14946 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=15747, Invalid=35555, Unknown=0, NotChecked=0, Total=51302 [2022-04-28 03:55:08,517 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 261 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 7422 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 7782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 7422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:08,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 32 Invalid, 7782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 7422 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-04-28 03:55:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-28 03:55:08,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-28 03:55:08,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:08,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:08,803 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:08,803 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:08,805 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-28 03:55:08,805 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:55:08,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:08,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:08,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 174 states. [2022-04-28 03:55:08,806 INFO L87 Difference]: Start difference. First operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 174 states. [2022-04-28 03:55:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:08,807 INFO L93 Difference]: Finished difference Result 174 states and 178 transitions. [2022-04-28 03:55:08,807 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:55:08,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:08,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:08,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:08,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.029940119760479) internal successors, (172), 168 states have internal predecessors, (172), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 178 transitions. [2022-04-28 03:55:08,809 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 178 transitions. Word has length 165 [2022-04-28 03:55:08,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:08,809 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 178 transitions. [2022-04-28 03:55:08,809 INFO L496 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-28 03:55:08,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 174 states and 178 transitions. [2022-04-28 03:55:08,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:08,965 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 178 transitions. [2022-04-28 03:55:08,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-04-28 03:55:08,966 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:08,966 INFO L195 NwaCegarLoop]: trace histogram [62, 61, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:08,981 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-28 03:55:09,166 WARN L477 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-28 03:55:09,166 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:09,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1698637046, now seen corresponding path program 34 times [2022-04-28 03:55:09,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:09,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [103097518] [2022-04-28 03:55:13,228 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:13,274 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-28 03:55:13,477 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-28 03:55:13,478 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:13,480 INFO L85 PathProgramCache]: Analyzing trace with hash 519848898, now seen corresponding path program 1 times [2022-04-28 03:55:13,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:13,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143446085] [2022-04-28 03:55:13,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:13,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:14,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:14,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {39735#(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(18, 2);call #Ultimate.allocInit(12, 3); {39695#true} is VALID [2022-04-28 03:55:14,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {39695#true} assume true; {39695#true} is VALID [2022-04-28 03:55:14,206 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39695#true} {39695#true} #53#return; {39695#true} is VALID [2022-04-28 03:55:14,206 INFO L272 TraceCheckUtils]: 0: Hoare triple {39695#true} call ULTIMATE.init(); {39735#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:14,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {39735#(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(18, 2);call #Ultimate.allocInit(12, 3); {39695#true} is VALID [2022-04-28 03:55:14,206 INFO L290 TraceCheckUtils]: 2: Hoare triple {39695#true} assume true; {39695#true} is VALID [2022-04-28 03:55:14,206 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39695#true} {39695#true} #53#return; {39695#true} is VALID [2022-04-28 03:55:14,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {39695#true} call #t~ret9 := main(); {39695#true} is VALID [2022-04-28 03:55:14,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {39695#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {39700#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:14,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {39700#(<= 500000 main_~y~0)} [195] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2111 v_main_~x~0_2110)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2111 v_main_~x~0_2110) (< v_main_~x~0_2110 500001)) (and (not (< v_main_~x~0_2111 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2111, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39700#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:14,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {39700#(<= 500000 main_~y~0)} [196] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39700#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:14,212 INFO L290 TraceCheckUtils]: 8: Hoare triple {39700#(<= 500000 main_~y~0)} [197] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse3 (= v_main_~x~0_2113 v_main_~x~0_2112)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse0 (<= 500000 v_main_~x~0_2113))) (or (and (or (not .cse0) (not (< v_main_~x~0_2113 1000000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2113 v_main_~x~0_2112) (= (+ v_main_~x~0_2112 v_main_~y~0_2387) (+ v_main_~x~0_2113 v_main_~y~0_2386)) (< v_main_~x~0_2112 1000001) .cse0))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2113, 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_2112, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39700#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:14,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {39700#(<= 500000 main_~y~0)} [194] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {39700#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:14,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {39700#(<= 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; {39701#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:55:14,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {39701#(<= 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; {39702#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:55:14,214 INFO L290 TraceCheckUtils]: 12: Hoare triple {39702#(<= 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; {39703#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:55:14,214 INFO L290 TraceCheckUtils]: 13: Hoare triple {39703#(<= 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; {39704#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:55:14,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {39704#(<= 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; {39705#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:55:14,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {39705#(<= 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; {39706#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:55:14,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {39706#(<= 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; {39707#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:55:14,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {39707#(<= 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; {39708#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:55:14,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {39708#(<= 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; {39709#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:55:14,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {39709#(<= 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; {39710#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:55:14,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {39710#(<= 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; {39711#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:55:14,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {39711#(<= 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; {39712#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:55:14,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {39712#(<= 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; {39713#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:55:14,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {39713#(<= 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; {39714#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:55:14,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {39714#(<= 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; {39715#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:55:14,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {39715#(<= 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; {39716#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:55:14,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {39716#(<= 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; {39717#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:55:14,221 INFO L290 TraceCheckUtils]: 27: Hoare triple {39717#(<= 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; {39718#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:55:14,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {39718#(<= 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; {39719#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:55:14,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {39719#(<= 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; {39720#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:55:14,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {39720#(<= 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; {39721#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:55:14,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {39721#(<= 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; {39722#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:55:14,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {39722#(<= 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; {39723#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:55:14,224 INFO L290 TraceCheckUtils]: 33: Hoare triple {39723#(<= 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; {39724#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:55:14,224 INFO L290 TraceCheckUtils]: 34: Hoare triple {39724#(<= 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; {39725#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:55:14,224 INFO L290 TraceCheckUtils]: 35: Hoare triple {39725#(<= 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; {39726#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:55:14,229 INFO L290 TraceCheckUtils]: 36: Hoare triple {39726#(<= 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; {39727#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:55:14,231 INFO L290 TraceCheckUtils]: 37: Hoare triple {39727#(<= 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; {39728#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:55:14,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {39728#(<= 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; {39729#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:55:14,233 INFO L290 TraceCheckUtils]: 39: Hoare triple {39729#(<= 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; {39730#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:55:14,233 INFO L290 TraceCheckUtils]: 40: Hoare triple {39730#(<= 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; {39731#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:55:14,234 INFO L290 TraceCheckUtils]: 41: Hoare triple {39731#(<= 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; {39732#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:55:14,235 INFO L290 TraceCheckUtils]: 42: Hoare triple {39732#(<= 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; {39733#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:55:14,235 INFO L290 TraceCheckUtils]: 43: Hoare triple {39733#(<= 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; {39734#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:55:14,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {39734#(<= 499932 main_~y~0)} assume !(~y~0 > 0); {39696#false} is VALID [2022-04-28 03:55:14,236 INFO L272 TraceCheckUtils]: 45: Hoare triple {39696#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {39696#false} is VALID [2022-04-28 03:55:14,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {39696#false} ~cond := #in~cond; {39696#false} is VALID [2022-04-28 03:55:14,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {39696#false} assume 0 == ~cond; {39696#false} is VALID [2022-04-28 03:55:14,236 INFO L290 TraceCheckUtils]: 48: Hoare triple {39696#false} assume !false; {39696#false} is VALID [2022-04-28 03:55:14,236 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-28 03:55:14,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143446085] [2022-04-28 03:55:14,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143446085] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:14,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967858092] [2022-04-28 03:55:14,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:14,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:14,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:14,244 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-28 03:55:14,247 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-28 03:55:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:14,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:55:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:14,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:15,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {39695#true} call ULTIMATE.init(); {39695#true} is VALID [2022-04-28 03:55:15,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {39695#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(18, 2);call #Ultimate.allocInit(12, 3); {39695#true} is VALID [2022-04-28 03:55:15,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {39695#true} assume true; {39695#true} is VALID [2022-04-28 03:55:15,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39695#true} {39695#true} #53#return; {39695#true} is VALID [2022-04-28 03:55:15,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {39695#true} call #t~ret9 := main(); {39695#true} is VALID [2022-04-28 03:55:15,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {39695#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {39754#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:55:15,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {39754#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [195] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2111 v_main_~x~0_2110)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2111 v_main_~x~0_2110) (< v_main_~x~0_2110 500001)) (and (not (< v_main_~x~0_2111 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2111, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {39758#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:15,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {39758#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [196] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {39758#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:55:15,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {39758#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [197] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse3 (= v_main_~x~0_2113 v_main_~x~0_2112)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse0 (<= 500000 v_main_~x~0_2113))) (or (and (or (not .cse0) (not (< v_main_~x~0_2113 1000000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2113 v_main_~x~0_2112) (= (+ v_main_~x~0_2112 v_main_~y~0_2387) (+ v_main_~x~0_2113 v_main_~y~0_2386)) (< v_main_~x~0_2112 1000001) .cse0))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2113, 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_2112, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {39765#(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-28 03:55:15,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {39765#(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)))} [194] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {39769#(< 999999 main_~y~0)} is VALID [2022-04-28 03:55:15,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {39769#(< 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; {39773#(< 999997 main_~y~0)} is VALID [2022-04-28 03:55:15,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {39773#(< 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; {39777#(< 999995 main_~y~0)} is VALID [2022-04-28 03:55:15,502 INFO L290 TraceCheckUtils]: 12: Hoare triple {39777#(< 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; {39781#(< 999993 main_~y~0)} is VALID [2022-04-28 03:55:15,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {39781#(< 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; {39785#(< 999991 main_~y~0)} is VALID [2022-04-28 03:55:15,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {39785#(< 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; {39789#(< 999989 main_~y~0)} is VALID [2022-04-28 03:55:15,503 INFO L290 TraceCheckUtils]: 15: Hoare triple {39789#(< 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; {39793#(< 999987 main_~y~0)} is VALID [2022-04-28 03:55:15,504 INFO L290 TraceCheckUtils]: 16: Hoare triple {39793#(< 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; {39797#(< 999985 main_~y~0)} is VALID [2022-04-28 03:55:15,504 INFO L290 TraceCheckUtils]: 17: Hoare triple {39797#(< 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; {39801#(< 999983 main_~y~0)} is VALID [2022-04-28 03:55:15,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {39801#(< 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; {39805#(< 999981 main_~y~0)} is VALID [2022-04-28 03:55:15,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {39805#(< 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; {39809#(< 999979 main_~y~0)} is VALID [2022-04-28 03:55:15,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {39809#(< 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; {39813#(< 999977 main_~y~0)} is VALID [2022-04-28 03:55:15,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {39813#(< 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; {39817#(< 999975 main_~y~0)} is VALID [2022-04-28 03:55:15,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {39817#(< 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; {39821#(< 999973 main_~y~0)} is VALID [2022-04-28 03:55:15,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {39821#(< 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; {39825#(< 999971 main_~y~0)} is VALID [2022-04-28 03:55:15,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {39825#(< 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; {39829#(< 999969 main_~y~0)} is VALID [2022-04-28 03:55:15,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {39829#(< 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; {39833#(< 999967 main_~y~0)} is VALID [2022-04-28 03:55:15,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {39833#(< 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; {39837#(< 999965 main_~y~0)} is VALID [2022-04-28 03:55:15,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {39837#(< 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; {39841#(< 999963 main_~y~0)} is VALID [2022-04-28 03:55:15,509 INFO L290 TraceCheckUtils]: 28: Hoare triple {39841#(< 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; {39845#(< 999961 main_~y~0)} is VALID [2022-04-28 03:55:15,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {39845#(< 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; {39849#(< 999959 main_~y~0)} is VALID [2022-04-28 03:55:15,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {39849#(< 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; {39853#(< 999957 main_~y~0)} is VALID [2022-04-28 03:55:15,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {39853#(< 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; {39857#(< 999955 main_~y~0)} is VALID [2022-04-28 03:55:15,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {39857#(< 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; {39861#(< 999953 main_~y~0)} is VALID [2022-04-28 03:55:15,512 INFO L290 TraceCheckUtils]: 33: Hoare triple {39861#(< 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; {39865#(< 999951 main_~y~0)} is VALID [2022-04-28 03:55:15,512 INFO L290 TraceCheckUtils]: 34: Hoare triple {39865#(< 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; {39869#(< 999949 main_~y~0)} is VALID [2022-04-28 03:55:15,513 INFO L290 TraceCheckUtils]: 35: Hoare triple {39869#(< 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; {39873#(< 999947 main_~y~0)} is VALID [2022-04-28 03:55:15,514 INFO L290 TraceCheckUtils]: 36: Hoare triple {39873#(< 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; {39877#(< 999945 main_~y~0)} is VALID [2022-04-28 03:55:15,514 INFO L290 TraceCheckUtils]: 37: Hoare triple {39877#(< 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; {39881#(< 999943 main_~y~0)} is VALID [2022-04-28 03:55:15,514 INFO L290 TraceCheckUtils]: 38: Hoare triple {39881#(< 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; {39885#(< 999941 main_~y~0)} is VALID [2022-04-28 03:55:15,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {39885#(< 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; {39889#(< 999939 main_~y~0)} is VALID [2022-04-28 03:55:15,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {39889#(< 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; {39893#(< 999937 main_~y~0)} is VALID [2022-04-28 03:55:15,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {39893#(< 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; {39897#(< 999935 main_~y~0)} is VALID [2022-04-28 03:55:15,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {39897#(< 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; {39901#(< 999933 main_~y~0)} is VALID [2022-04-28 03:55:15,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {39901#(< 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; {39905#(< 999931 main_~y~0)} is VALID [2022-04-28 03:55:15,517 INFO L290 TraceCheckUtils]: 44: Hoare triple {39905#(< 999931 main_~y~0)} assume !(~y~0 > 0); {39696#false} is VALID [2022-04-28 03:55:15,517 INFO L272 TraceCheckUtils]: 45: Hoare triple {39696#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {39696#false} is VALID [2022-04-28 03:55:15,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {39696#false} ~cond := #in~cond; {39696#false} is VALID [2022-04-28 03:55:15,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {39696#false} assume 0 == ~cond; {39696#false} is VALID [2022-04-28 03:55:15,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {39696#false} assume !false; {39696#false} is VALID [2022-04-28 03:55:15,518 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-28 03:55:15,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:17,674 INFO L290 TraceCheckUtils]: 48: Hoare triple {39696#false} assume !false; {39696#false} is VALID [2022-04-28 03:55:17,674 INFO L290 TraceCheckUtils]: 47: Hoare triple {39696#false} assume 0 == ~cond; {39696#false} is VALID [2022-04-28 03:55:17,675 INFO L290 TraceCheckUtils]: 46: Hoare triple {39696#false} ~cond := #in~cond; {39696#false} is VALID [2022-04-28 03:55:17,675 INFO L272 TraceCheckUtils]: 45: Hoare triple {39696#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {39696#false} is VALID [2022-04-28 03:55:17,675 INFO L290 TraceCheckUtils]: 44: Hoare triple {39933#(< 0 main_~y~0)} assume !(~y~0 > 0); {39696#false} is VALID [2022-04-28 03:55:17,675 INFO L290 TraceCheckUtils]: 43: Hoare triple {39937#(< 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; {39933#(< 0 main_~y~0)} is VALID [2022-04-28 03:55:17,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {39941#(< 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; {39937#(< 2 main_~y~0)} is VALID [2022-04-28 03:55:17,676 INFO L290 TraceCheckUtils]: 41: Hoare triple {39945#(< 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; {39941#(< 4 main_~y~0)} is VALID [2022-04-28 03:55:17,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {39949#(< 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; {39945#(< 6 main_~y~0)} is VALID [2022-04-28 03:55:17,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {39953#(< 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; {39949#(< 8 main_~y~0)} is VALID [2022-04-28 03:55:17,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {39957#(< 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; {39953#(< 10 main_~y~0)} is VALID [2022-04-28 03:55:17,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {39961#(< 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; {39957#(< 12 main_~y~0)} is VALID [2022-04-28 03:55:17,679 INFO L290 TraceCheckUtils]: 36: Hoare triple {39965#(< 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; {39961#(< 14 main_~y~0)} is VALID [2022-04-28 03:55:17,679 INFO L290 TraceCheckUtils]: 35: Hoare triple {39969#(< 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; {39965#(< 16 main_~y~0)} is VALID [2022-04-28 03:55:17,680 INFO L290 TraceCheckUtils]: 34: Hoare triple {39973#(< 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; {39969#(< 18 main_~y~0)} is VALID [2022-04-28 03:55:17,680 INFO L290 TraceCheckUtils]: 33: Hoare triple {39977#(< 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; {39973#(< 20 main_~y~0)} is VALID [2022-04-28 03:55:17,681 INFO L290 TraceCheckUtils]: 32: Hoare triple {39981#(< 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; {39977#(< 22 main_~y~0)} is VALID [2022-04-28 03:55:17,681 INFO L290 TraceCheckUtils]: 31: Hoare triple {39985#(< 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; {39981#(< 24 main_~y~0)} is VALID [2022-04-28 03:55:17,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {39989#(< 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; {39985#(< 26 main_~y~0)} is VALID [2022-04-28 03:55:17,682 INFO L290 TraceCheckUtils]: 29: Hoare triple {39993#(< 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; {39989#(< 28 main_~y~0)} is VALID [2022-04-28 03:55:17,682 INFO L290 TraceCheckUtils]: 28: Hoare triple {39997#(< 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; {39993#(< 30 main_~y~0)} is VALID [2022-04-28 03:55:17,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {40001#(< 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; {39997#(< 32 main_~y~0)} is VALID [2022-04-28 03:55:17,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {40005#(< 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; {40001#(< 34 main_~y~0)} is VALID [2022-04-28 03:55:17,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {40009#(< 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; {40005#(< 36 main_~y~0)} is VALID [2022-04-28 03:55:17,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {40013#(< 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; {40009#(< 38 main_~y~0)} is VALID [2022-04-28 03:55:17,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {40017#(< 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; {40013#(< 40 main_~y~0)} is VALID [2022-04-28 03:55:17,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {40021#(< 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; {40017#(< 42 main_~y~0)} is VALID [2022-04-28 03:55:17,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {40025#(< 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; {40021#(< 44 main_~y~0)} is VALID [2022-04-28 03:55:17,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {40029#(< 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; {40025#(< 46 main_~y~0)} is VALID [2022-04-28 03:55:17,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {40033#(< 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; {40029#(< 48 main_~y~0)} is VALID [2022-04-28 03:55:17,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {40037#(< 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; {40033#(< 50 main_~y~0)} is VALID [2022-04-28 03:55:17,688 INFO L290 TraceCheckUtils]: 17: Hoare triple {40041#(< 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; {40037#(< 52 main_~y~0)} is VALID [2022-04-28 03:55:17,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {40045#(< 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; {40041#(< 54 main_~y~0)} is VALID [2022-04-28 03:55:17,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {40049#(< 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; {40045#(< 56 main_~y~0)} is VALID [2022-04-28 03:55:17,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {40053#(< 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; {40049#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:17,689 INFO L290 TraceCheckUtils]: 13: Hoare triple {40057#(< 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; {40053#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:17,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {40061#(< 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; {40057#(< 62 main_~y~0)} is VALID [2022-04-28 03:55:17,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {40065#(< 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; {40061#(< 64 main_~y~0)} is VALID [2022-04-28 03:55:17,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {40069#(< 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; {40065#(< 66 main_~y~0)} is VALID [2022-04-28 03:55:17,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {40073#(or (< 68 main_~y~0) (< main_~x~0 1000000))} [194] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {40069#(< 68 main_~y~0)} is VALID [2022-04-28 03:55:17,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {40077#(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)))} [197] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post5_235| |v_main_#t~post5_234|)) (.cse2 (= v_main_~y~0_2387 v_main_~y~0_2386)) (.cse3 (= v_main_~x~0_2113 v_main_~x~0_2112)) (.cse4 (= |v_main_#t~post6_235| |v_main_#t~post6_234|)) (.cse0 (<= 500000 v_main_~x~0_2113))) (or (and (or (not .cse0) (not (< v_main_~x~0_2113 1000000))) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (< v_main_~x~0_2113 v_main_~x~0_2112) (= (+ v_main_~x~0_2112 v_main_~y~0_2387) (+ v_main_~x~0_2113 v_main_~y~0_2386)) (< v_main_~x~0_2112 1000001) .cse0))) InVars {main_~y~0=v_main_~y~0_2387, main_#t~post5=|v_main_#t~post5_235|, main_~x~0=v_main_~x~0_2113, 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_2112, main_#t~post6=|v_main_#t~post6_234|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {40073#(or (< 68 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:55:17,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {40077#(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)))} [196] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {40077#(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-28 03:55:17,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {40084#(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)))))} [195] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2111 v_main_~x~0_2110)) (.cse1 (= |v_main_#t~post4_215| |v_main_#t~post4_214|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2111 v_main_~x~0_2110) (< v_main_~x~0_2110 500001)) (and (not (< v_main_~x~0_2111 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_2111, main_#t~post4=|v_main_#t~post4_215|} OutVars{main_~x~0=v_main_~x~0_2110, main_#t~post4=|v_main_#t~post4_214|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {40077#(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-28 03:55:17,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {39695#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {40084#(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-28 03:55:17,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {39695#true} call #t~ret9 := main(); {39695#true} is VALID [2022-04-28 03:55:17,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39695#true} {39695#true} #53#return; {39695#true} is VALID [2022-04-28 03:55:17,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {39695#true} assume true; {39695#true} is VALID [2022-04-28 03:55:17,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {39695#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(18, 2);call #Ultimate.allocInit(12, 3); {39695#true} is VALID [2022-04-28 03:55:17,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {39695#true} call ULTIMATE.init(); {39695#true} is VALID [2022-04-28 03:55:17,694 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-28 03:55:17,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [967858092] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:17,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:17,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 40, 40] total 114 [2022-04-28 03:55:21,544 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:21,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [103097518] [2022-04-28 03:55:21,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [103097518] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:21,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:21,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [101] imperfect sequences [] total 101 [2022-04-28 03:55:21,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789726114] [2022-04-28 03:55:21,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:21,545 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-28 03:55:21,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:21,546 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-28 03:55:21,687 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-28 03:55:21,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2022-04-28 03:55:21,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:21,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2022-04-28 03:55:21,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10897, Invalid=19903, Unknown=0, NotChecked=0, Total=30800 [2022-04-28 03:55:21,690 INFO L87 Difference]: Start difference. First operand 174 states and 178 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-28 03:55:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:39,013 INFO L93 Difference]: Finished difference Result 345 states and 358 transitions. [2022-04-28 03:55:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2022-04-28 03:55:39,014 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-28 03:55:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:55:39,014 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-28 03:55:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2022-04-28 03:55:39,015 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-28 03:55:39,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 200 transitions. [2022-04-28 03:55:39,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 200 transitions. [2022-04-28 03:55:39,175 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-28 03:55:39,177 INFO L225 Difference]: With dead ends: 345 [2022-04-28 03:55:39,177 INFO L226 Difference]: Without dead ends: 179 [2022-04-28 03:55:39,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25463 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=20799, Invalid=54003, Unknown=0, NotChecked=0, Total=74802 [2022-04-28 03:55:39,182 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 463 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7993 mSolverCounterSat, 503 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 8496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 503 IncrementalHoareTripleChecker+Valid, 7993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-28 03:55:39,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 47 Invalid, 8496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [503 Valid, 7993 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-28 03:55:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-04-28 03:55:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2022-04-28 03:55:39,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:55:39,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:39,451 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:39,451 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:39,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:39,452 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2022-04-28 03:55:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2022-04-28 03:55:39,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:39,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:39,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 179 states. [2022-04-28 03:55:39,453 INFO L87 Difference]: Start difference. First operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 179 states. [2022-04-28 03:55:39,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:55:39,454 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2022-04-28 03:55:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2022-04-28 03:55:39,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:55:39,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:55:39,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:55:39,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:55:39,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 172 states have (on average 1.0290697674418605) internal successors, (177), 173 states have internal predecessors, (177), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:55:39,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 183 transitions. [2022-04-28 03:55:39,456 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 183 transitions. Word has length 170 [2022-04-28 03:55:39,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:55:39,457 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 183 transitions. [2022-04-28 03:55:39,457 INFO L496 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-28 03:55:39,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 179 states and 183 transitions. [2022-04-28 03:55:39,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:55:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 183 transitions. [2022-04-28 03:55:39,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-28 03:55:39,607 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:55:39,607 INFO L195 NwaCegarLoop]: trace histogram [64, 63, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:55:39,623 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-28 03:55:39,811 WARN L477 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-28 03:55:39,811 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:55:39,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:55:39,812 INFO L85 PathProgramCache]: Analyzing trace with hash -252581489, now seen corresponding path program 35 times [2022-04-28 03:55:39,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:39,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [218326234] [2022-04-28 03:55:43,880 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:55:43,936 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-28 03:55:44,198 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-28 03:55:44,201 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:55:44,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1284947615, now seen corresponding path program 1 times [2022-04-28 03:55:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:55:44,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513735415] [2022-04-28 03:55:44,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:55:44,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:44,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:55:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:44,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {41810#(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(18, 2);call #Ultimate.allocInit(12, 3); {41769#true} is VALID [2022-04-28 03:55:44,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {41769#true} assume true; {41769#true} is VALID [2022-04-28 03:55:44,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41769#true} {41769#true} #53#return; {41769#true} is VALID [2022-04-28 03:55:44,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {41769#true} call ULTIMATE.init(); {41810#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:55:44,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {41810#(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(18, 2);call #Ultimate.allocInit(12, 3); {41769#true} is VALID [2022-04-28 03:55:44,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {41769#true} assume true; {41769#true} is VALID [2022-04-28 03:55:44,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41769#true} {41769#true} #53#return; {41769#true} is VALID [2022-04-28 03:55:44,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {41769#true} call #t~ret9 := main(); {41769#true} is VALID [2022-04-28 03:55:44,885 INFO L290 TraceCheckUtils]: 5: Hoare triple {41769#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:44,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {41774#(<= 500000 main_~y~0)} [199] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2224 v_main_~x~0_2223)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and (< v_main_~x~0_2223 500001) (< v_main_~x~0_2224 v_main_~x~0_2223)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2224)))) InVars {main_~x~0=v_main_~x~0_2224, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:44,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {41774#(<= 500000 main_~y~0)} [200] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:44,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {41774#(<= 500000 main_~y~0)} [201] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse5 (<= 500000 v_main_~x~0_2226)) (.cse1 (= v_main_~x~0_2226 v_main_~x~0_2225)) (.cse2 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse3 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2226 v_main_~y~0_2524))) (and (= .cse4 (+ v_main_~x~0_2225 v_main_~y~0_2525)) (< v_main_~y~0_2525 v_main_~y~0_2524) (< .cse4 (+ 1000001 v_main_~y~0_2525)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2226 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2226, 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_2225, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:44,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {41774#(<= 500000 main_~y~0)} [198] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:44,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {41774#(<= 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; {41775#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:55:44,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {41775#(<= 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; {41776#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:55:44,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {41776#(<= 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; {41777#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:55:44,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {41777#(<= 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; {41778#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:55:44,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {41778#(<= 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; {41779#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:55:44,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {41779#(<= 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; {41780#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:55:44,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {41780#(<= 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; {41781#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:55:44,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {41781#(<= 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; {41782#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:55:44,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {41782#(<= 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; {41783#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:55:44,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {41783#(<= 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; {41784#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:55:44,892 INFO L290 TraceCheckUtils]: 20: Hoare triple {41784#(<= 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; {41785#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:55:44,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {41785#(<= 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; {41786#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:55:44,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {41786#(<= 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; {41787#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:55:44,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {41787#(<= 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; {41788#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:55:44,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {41788#(<= 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; {41789#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:55:44,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {41789#(<= 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; {41790#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:55:44,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {41790#(<= 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; {41791#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:55:44,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {41791#(<= 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; {41792#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:55:44,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {41792#(<= 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; {41793#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:55:44,896 INFO L290 TraceCheckUtils]: 29: Hoare triple {41793#(<= 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; {41794#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:55:44,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {41794#(<= 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; {41795#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:55:44,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {41795#(<= 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; {41796#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:55:44,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {41796#(<= 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; {41797#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:55:44,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {41797#(<= 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; {41798#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:55:44,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {41798#(<= 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; {41799#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:55:44,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {41799#(<= 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; {41800#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:55:44,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {41800#(<= 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; {41801#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:55:44,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {41801#(<= 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; {41802#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:55:44,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {41802#(<= 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; {41803#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:55:44,901 INFO L290 TraceCheckUtils]: 39: Hoare triple {41803#(<= 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; {41804#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:55:44,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {41804#(<= 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; {41805#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:55:44,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {41805#(<= 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; {41806#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:55:44,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {41806#(<= 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; {41807#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:55:44,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {41807#(<= 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; {41808#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:55:44,904 INFO L290 TraceCheckUtils]: 44: Hoare triple {41808#(<= 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; {41809#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:55:44,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {41809#(<= 499930 main_~y~0)} assume !(~y~0 > 0); {41770#false} is VALID [2022-04-28 03:55:44,904 INFO L272 TraceCheckUtils]: 46: Hoare triple {41770#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {41770#false} is VALID [2022-04-28 03:55:44,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {41770#false} ~cond := #in~cond; {41770#false} is VALID [2022-04-28 03:55:44,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {41770#false} assume 0 == ~cond; {41770#false} is VALID [2022-04-28 03:55:44,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {41770#false} assume !false; {41770#false} is VALID [2022-04-28 03:55:44,904 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-28 03:55:44,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:55:44,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513735415] [2022-04-28 03:55:44,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513735415] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:55:44,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1462693375] [2022-04-28 03:55:44,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:55:44,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:55:44,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:55:44,906 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-28 03:55:44,907 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-28 03:55:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:44,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-28 03:55:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:55:45,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:55:45,577 INFO L272 TraceCheckUtils]: 0: Hoare triple {41769#true} call ULTIMATE.init(); {41769#true} is VALID [2022-04-28 03:55:45,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {41769#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(18, 2);call #Ultimate.allocInit(12, 3); {41769#true} is VALID [2022-04-28 03:55:45,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {41769#true} assume true; {41769#true} is VALID [2022-04-28 03:55:45,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41769#true} {41769#true} #53#return; {41769#true} is VALID [2022-04-28 03:55:45,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {41769#true} call #t~ret9 := main(); {41769#true} is VALID [2022-04-28 03:55:45,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {41769#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:45,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {41774#(<= 500000 main_~y~0)} [199] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2224 v_main_~x~0_2223)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and (< v_main_~x~0_2223 500001) (< v_main_~x~0_2224 v_main_~x~0_2223)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2224)))) InVars {main_~x~0=v_main_~x~0_2224, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:45,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {41774#(<= 500000 main_~y~0)} [200] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:45,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {41774#(<= 500000 main_~y~0)} [201] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse5 (<= 500000 v_main_~x~0_2226)) (.cse1 (= v_main_~x~0_2226 v_main_~x~0_2225)) (.cse2 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse3 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2226 v_main_~y~0_2524))) (and (= .cse4 (+ v_main_~x~0_2225 v_main_~y~0_2525)) (< v_main_~y~0_2525 v_main_~y~0_2524) (< .cse4 (+ 1000001 v_main_~y~0_2525)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2226 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2226, 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_2225, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:45,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {41774#(<= 500000 main_~y~0)} [198] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {41774#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:55:45,580 INFO L290 TraceCheckUtils]: 10: Hoare triple {41774#(<= 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; {41775#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:55:45,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {41775#(<= 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; {41776#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:55:45,581 INFO L290 TraceCheckUtils]: 12: Hoare triple {41776#(<= 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; {41777#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:55:45,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {41777#(<= 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; {41778#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:55:45,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {41778#(<= 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; {41779#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:55:45,583 INFO L290 TraceCheckUtils]: 15: Hoare triple {41779#(<= 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; {41780#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:55:45,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {41780#(<= 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; {41781#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:55:45,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {41781#(<= 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; {41782#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:55:45,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {41782#(<= 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; {41783#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:55:45,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {41783#(<= 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; {41784#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:55:45,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {41784#(<= 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; {41785#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:55:45,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {41785#(<= 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; {41786#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:55:45,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {41786#(<= 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; {41787#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:55:45,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {41787#(<= 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; {41788#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:55:45,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {41788#(<= 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; {41789#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:55:45,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {41789#(<= 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; {41790#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:55:45,588 INFO L290 TraceCheckUtils]: 26: Hoare triple {41790#(<= 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; {41791#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:55:45,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {41791#(<= 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; {41792#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:55:45,589 INFO L290 TraceCheckUtils]: 28: Hoare triple {41792#(<= 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; {41793#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:55:45,589 INFO L290 TraceCheckUtils]: 29: Hoare triple {41793#(<= 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; {41794#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:55:45,590 INFO L290 TraceCheckUtils]: 30: Hoare triple {41794#(<= 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; {41795#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:55:45,590 INFO L290 TraceCheckUtils]: 31: Hoare triple {41795#(<= 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; {41796#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:55:45,591 INFO L290 TraceCheckUtils]: 32: Hoare triple {41796#(<= 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; {41797#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:55:45,591 INFO L290 TraceCheckUtils]: 33: Hoare triple {41797#(<= 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; {41798#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:55:45,592 INFO L290 TraceCheckUtils]: 34: Hoare triple {41798#(<= 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; {41799#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:55:45,592 INFO L290 TraceCheckUtils]: 35: Hoare triple {41799#(<= 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; {41800#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:55:45,593 INFO L290 TraceCheckUtils]: 36: Hoare triple {41800#(<= 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; {41801#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:55:45,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {41801#(<= 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; {41802#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:55:45,594 INFO L290 TraceCheckUtils]: 38: Hoare triple {41802#(<= 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; {41803#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:55:45,594 INFO L290 TraceCheckUtils]: 39: Hoare triple {41803#(<= 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; {41804#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:55:45,595 INFO L290 TraceCheckUtils]: 40: Hoare triple {41804#(<= 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; {41805#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:55:45,595 INFO L290 TraceCheckUtils]: 41: Hoare triple {41805#(<= 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; {41806#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:55:45,595 INFO L290 TraceCheckUtils]: 42: Hoare triple {41806#(<= 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; {41807#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:55:45,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {41807#(<= 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; {41808#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:55:45,596 INFO L290 TraceCheckUtils]: 44: Hoare triple {41808#(<= 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; {41809#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:55:45,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {41809#(<= 499930 main_~y~0)} assume !(~y~0 > 0); {41770#false} is VALID [2022-04-28 03:55:45,597 INFO L272 TraceCheckUtils]: 46: Hoare triple {41770#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {41770#false} is VALID [2022-04-28 03:55:45,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {41770#false} ~cond := #in~cond; {41770#false} is VALID [2022-04-28 03:55:45,597 INFO L290 TraceCheckUtils]: 48: Hoare triple {41770#false} assume 0 == ~cond; {41770#false} is VALID [2022-04-28 03:55:45,597 INFO L290 TraceCheckUtils]: 49: Hoare triple {41770#false} assume !false; {41770#false} is VALID [2022-04-28 03:55:45,597 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-28 03:55:45,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:55:47,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {41770#false} assume !false; {41770#false} is VALID [2022-04-28 03:55:47,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {41770#false} assume 0 == ~cond; {41770#false} is VALID [2022-04-28 03:55:47,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {41770#false} ~cond := #in~cond; {41770#false} is VALID [2022-04-28 03:55:47,491 INFO L272 TraceCheckUtils]: 46: Hoare triple {41770#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {41770#false} is VALID [2022-04-28 03:55:47,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {41973#(< 0 main_~y~0)} assume !(~y~0 > 0); {41770#false} is VALID [2022-04-28 03:55:47,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {41977#(< 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; {41973#(< 0 main_~y~0)} is VALID [2022-04-28 03:55:47,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {41981#(< 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; {41977#(< 2 main_~y~0)} is VALID [2022-04-28 03:55:47,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {41985#(< 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; {41981#(< 4 main_~y~0)} is VALID [2022-04-28 03:55:47,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {41989#(< 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; {41985#(< 6 main_~y~0)} is VALID [2022-04-28 03:55:47,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {41993#(< 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; {41989#(< 8 main_~y~0)} is VALID [2022-04-28 03:55:47,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {41997#(< 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; {41993#(< 10 main_~y~0)} is VALID [2022-04-28 03:55:47,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {42001#(< 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; {41997#(< 12 main_~y~0)} is VALID [2022-04-28 03:55:47,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {42005#(< 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; {42001#(< 14 main_~y~0)} is VALID [2022-04-28 03:55:47,496 INFO L290 TraceCheckUtils]: 36: Hoare triple {42009#(< 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; {42005#(< 16 main_~y~0)} is VALID [2022-04-28 03:55:47,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {42013#(< 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; {42009#(< 18 main_~y~0)} is VALID [2022-04-28 03:55:47,497 INFO L290 TraceCheckUtils]: 34: Hoare triple {42017#(< 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; {42013#(< 20 main_~y~0)} is VALID [2022-04-28 03:55:47,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {42021#(< 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; {42017#(< 22 main_~y~0)} is VALID [2022-04-28 03:55:47,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {42025#(< 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; {42021#(< 24 main_~y~0)} is VALID [2022-04-28 03:55:47,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {42029#(< 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; {42025#(< 26 main_~y~0)} is VALID [2022-04-28 03:55:47,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {42033#(< 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; {42029#(< 28 main_~y~0)} is VALID [2022-04-28 03:55:47,500 INFO L290 TraceCheckUtils]: 29: Hoare triple {42037#(< 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; {42033#(< 30 main_~y~0)} is VALID [2022-04-28 03:55:47,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {42041#(< 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; {42037#(< 32 main_~y~0)} is VALID [2022-04-28 03:55:47,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {42045#(< 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; {42041#(< 34 main_~y~0)} is VALID [2022-04-28 03:55:47,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {42049#(< 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; {42045#(< 36 main_~y~0)} is VALID [2022-04-28 03:55:47,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {42053#(< 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; {42049#(< 38 main_~y~0)} is VALID [2022-04-28 03:55:47,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {42057#(< 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; {42053#(< 40 main_~y~0)} is VALID [2022-04-28 03:55:47,503 INFO L290 TraceCheckUtils]: 23: Hoare triple {42061#(< 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; {42057#(< 42 main_~y~0)} is VALID [2022-04-28 03:55:47,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {42065#(< 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; {42061#(< 44 main_~y~0)} is VALID [2022-04-28 03:55:47,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {42069#(< 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; {42065#(< 46 main_~y~0)} is VALID [2022-04-28 03:55:47,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {42073#(< 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; {42069#(< 48 main_~y~0)} is VALID [2022-04-28 03:55:47,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {42077#(< 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; {42073#(< 50 main_~y~0)} is VALID [2022-04-28 03:55:47,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {42081#(< 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; {42077#(< 52 main_~y~0)} is VALID [2022-04-28 03:55:47,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {42085#(< 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; {42081#(< 54 main_~y~0)} is VALID [2022-04-28 03:55:47,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {42089#(< 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; {42085#(< 56 main_~y~0)} is VALID [2022-04-28 03:55:47,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {42093#(< 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; {42089#(< 58 main_~y~0)} is VALID [2022-04-28 03:55:47,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {42097#(< 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; {42093#(< 60 main_~y~0)} is VALID [2022-04-28 03:55:47,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {42101#(< 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; {42097#(< 62 main_~y~0)} is VALID [2022-04-28 03:55:47,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {42105#(< 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; {42101#(< 64 main_~y~0)} is VALID [2022-04-28 03:55:47,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {42109#(< 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; {42105#(< 66 main_~y~0)} is VALID [2022-04-28 03:55:47,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {42113#(< 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; {42109#(< 68 main_~y~0)} is VALID [2022-04-28 03:55:47,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {42113#(< 70 main_~y~0)} [198] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {42113#(< 70 main_~y~0)} is VALID [2022-04-28 03:55:47,511 INFO L290 TraceCheckUtils]: 8: Hoare triple {42113#(< 70 main_~y~0)} [201] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_242| |v_main_#t~post6_241|)) (.cse5 (<= 500000 v_main_~x~0_2226)) (.cse1 (= v_main_~x~0_2226 v_main_~x~0_2225)) (.cse2 (= v_main_~y~0_2525 v_main_~y~0_2524)) (.cse3 (= |v_main_#t~post5_242| |v_main_#t~post5_241|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2226 v_main_~y~0_2524))) (and (= .cse4 (+ v_main_~x~0_2225 v_main_~y~0_2525)) (< v_main_~y~0_2525 v_main_~y~0_2524) (< .cse4 (+ 1000001 v_main_~y~0_2525)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2226 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2525, main_#t~post5=|v_main_#t~post5_242|, main_~x~0=v_main_~x~0_2226, 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_2225, main_#t~post6=|v_main_#t~post6_241|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {42113#(< 70 main_~y~0)} is VALID [2022-04-28 03:55:47,511 INFO L290 TraceCheckUtils]: 7: Hoare triple {42113#(< 70 main_~y~0)} [200] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42113#(< 70 main_~y~0)} is VALID [2022-04-28 03:55:47,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {42113#(< 70 main_~y~0)} [199] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2224 v_main_~x~0_2223)) (.cse1 (= |v_main_#t~post4_222| |v_main_#t~post4_221|))) (or (and (< v_main_~x~0_2223 500001) (< v_main_~x~0_2224 v_main_~x~0_2223)) (and .cse0 .cse1) (and .cse0 .cse1 (<= 500000 v_main_~x~0_2224)))) InVars {main_~x~0=v_main_~x~0_2224, main_#t~post4=|v_main_#t~post4_222|} OutVars{main_~x~0=v_main_~x~0_2223, main_#t~post4=|v_main_#t~post4_221|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {42113#(< 70 main_~y~0)} is VALID [2022-04-28 03:55:47,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {41769#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {42113#(< 70 main_~y~0)} is VALID [2022-04-28 03:55:47,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {41769#true} call #t~ret9 := main(); {41769#true} is VALID [2022-04-28 03:55:47,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41769#true} {41769#true} #53#return; {41769#true} is VALID [2022-04-28 03:55:47,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {41769#true} assume true; {41769#true} is VALID [2022-04-28 03:55:47,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {41769#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(18, 2);call #Ultimate.allocInit(12, 3); {41769#true} is VALID [2022-04-28 03:55:47,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {41769#true} call ULTIMATE.init(); {41769#true} is VALID [2022-04-28 03:55:47,513 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-28 03:55:47,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1462693375] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:55:47,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:55:47,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 75 [2022-04-28 03:55:50,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:55:50,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [218326234] [2022-04-28 03:55:50,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [218326234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:55:50,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:55:50,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [104] imperfect sequences [] total 104 [2022-04-28 03:55:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936800878] [2022-04-28 03:55:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:55:50,616 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-28 03:55:50,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:55:50,616 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-28 03:55:50,744 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-28 03:55:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-04-28 03:55:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:55:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-04-28 03:55:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7577, Invalid=11883, Unknown=0, NotChecked=0, Total=19460 [2022-04-28 03:55:50,746 INFO L87 Difference]: Start difference. First operand 179 states and 183 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-28 03:56:08,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:08,079 INFO L93 Difference]: Finished difference Result 355 states and 368 transitions. [2022-04-28 03:56:08,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-04-28 03:56:08,079 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-28 03:56:08,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:08,079 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-28 03:56:08,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 205 transitions. [2022-04-28 03:56:08,081 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-28 03:56:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 205 transitions. [2022-04-28 03:56:08,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 205 transitions. [2022-04-28 03:56:08,253 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-28 03:56:08,255 INFO L225 Difference]: With dead ends: 355 [2022-04-28 03:56:08,255 INFO L226 Difference]: Without dead ends: 184 [2022-04-28 03:56:08,258 INFO L412 NwaCegarLoop]: 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-28 03:56:08,258 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 8534 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 9118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 8534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:08,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 72 Invalid, 9118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 8534 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-04-28 03:56:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-28 03:56:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2022-04-28 03:56:08,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:08,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:08,542 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:08,542 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:08,543 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-04-28 03:56:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-04-28 03:56:08,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:08,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:08,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 184 states. [2022-04-28 03:56:08,544 INFO L87 Difference]: Start difference. First operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 184 states. [2022-04-28 03:56:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:08,545 INFO L93 Difference]: Finished difference Result 184 states and 188 transitions. [2022-04-28 03:56:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-04-28 03:56:08,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:08,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:08,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:08,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:08,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 177 states have (on average 1.0282485875706215) internal successors, (182), 178 states have internal predecessors, (182), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:08,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 188 transitions. [2022-04-28 03:56:08,548 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 188 transitions. Word has length 175 [2022-04-28 03:56:08,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:08,548 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 188 transitions. [2022-04-28 03:56:08,548 INFO L496 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-28 03:56:08,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 184 states and 188 transitions. [2022-04-28 03:56:08,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:08,704 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 188 transitions. [2022-04-28 03:56:08,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-28 03:56:08,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:08,705 INFO L195 NwaCegarLoop]: trace histogram [66, 65, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:08,721 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-28 03:56:08,905 WARN L477 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-28 03:56:08,905 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash 2115663486, now seen corresponding path program 36 times [2022-04-28 03:56:08,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:08,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [520952878] [2022-04-28 03:56:12,988 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:56:13,035 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-28 03:56:13,247 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-28 03:56:13,248 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:13,250 INFO L85 PathProgramCache]: Analyzing trace with hash -459385438, now seen corresponding path program 1 times [2022-04-28 03:56:13,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:13,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210295312] [2022-04-28 03:56:13,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:13,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:13,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:13,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:13,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {43901#(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(18, 2);call #Ultimate.allocInit(12, 3); {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {43859#true} assume true; {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43859#true} {43859#true} #53#return; {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {43859#true} call ULTIMATE.init(); {43901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:13,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {43901#(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(18, 2);call #Ultimate.allocInit(12, 3); {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {43859#true} assume true; {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43859#true} {43859#true} #53#return; {43859#true} is VALID [2022-04-28 03:56:13,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {43859#true} call #t~ret9 := main(); {43859#true} is VALID [2022-04-28 03:56:13,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {43859#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:13,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {43864#(<= 500000 main_~y~0)} [203] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2339 v_main_~x~0_2338)) (.cse1 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2339 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_2339 v_main_~x~0_2338) (< v_main_~x~0_2338 500001)))) InVars {main_~x~0=v_main_~x~0_2339, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:13,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {43864#(<= 500000 main_~y~0)} [204] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:13,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {43864#(<= 500000 main_~y~0)} [205] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2341 v_main_~x~0_2340)) (.cse5 (<= 500000 v_main_~x~0_2341)) (.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_#t~post5_249| |v_main_#t~post5_248|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2341 v_main_~y~0_2666))) (and (= (+ v_main_~x~0_2340 v_main_~y~0_2667) .cse4) (< v_main_~y~0_2667 v_main_~y~0_2666) (< .cse4 (+ 1000001 v_main_~y~0_2667)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2341 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2341, 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_2340, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:13,943 INFO L290 TraceCheckUtils]: 9: Hoare triple {43864#(<= 500000 main_~y~0)} [202] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:13,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {43864#(<= 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; {43865#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:56:13,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {43865#(<= 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; {43866#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:56:13,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {43866#(<= 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; {43867#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:56:13,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {43867#(<= 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; {43868#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:56:13,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {43868#(<= 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; {43869#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:56:13,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {43869#(<= 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; {43870#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:56:13,947 INFO L290 TraceCheckUtils]: 16: Hoare triple {43870#(<= 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; {43871#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:56:13,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {43871#(<= 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; {43872#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:56:13,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {43872#(<= 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; {43873#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:56:13,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {43873#(<= 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; {43874#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:56:13,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {43874#(<= 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; {43875#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:56:13,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {43875#(<= 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; {43876#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:56:13,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {43876#(<= 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; {43877#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:56:13,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {43877#(<= 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; {43878#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:56:13,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {43878#(<= 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; {43879#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:56:13,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {43879#(<= 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; {43880#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:56:13,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {43880#(<= 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; {43881#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:56:13,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {43881#(<= 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; {43882#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:56:13,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {43882#(<= 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; {43883#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:56:13,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {43883#(<= 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; {43884#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:56:13,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {43884#(<= 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; {43885#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:56:13,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {43885#(<= 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; {43886#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:56:13,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {43886#(<= 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; {43887#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:56:13,955 INFO L290 TraceCheckUtils]: 33: Hoare triple {43887#(<= 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; {43888#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:56:13,955 INFO L290 TraceCheckUtils]: 34: Hoare triple {43888#(<= 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; {43889#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:56:13,955 INFO L290 TraceCheckUtils]: 35: Hoare triple {43889#(<= 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; {43890#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:56:13,956 INFO L290 TraceCheckUtils]: 36: Hoare triple {43890#(<= 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; {43891#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:56:13,956 INFO L290 TraceCheckUtils]: 37: Hoare triple {43891#(<= 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; {43892#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:56:13,957 INFO L290 TraceCheckUtils]: 38: Hoare triple {43892#(<= 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; {43893#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:56:13,957 INFO L290 TraceCheckUtils]: 39: Hoare triple {43893#(<= 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; {43894#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:56:13,958 INFO L290 TraceCheckUtils]: 40: Hoare triple {43894#(<= 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; {43895#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:56:13,958 INFO L290 TraceCheckUtils]: 41: Hoare triple {43895#(<= 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; {43896#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:56:13,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {43896#(<= 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; {43897#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:56:13,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {43897#(<= 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; {43898#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:56:13,960 INFO L290 TraceCheckUtils]: 44: Hoare triple {43898#(<= 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; {43899#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:56:13,960 INFO L290 TraceCheckUtils]: 45: Hoare triple {43899#(<= 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; {43900#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:56:13,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {43900#(<= 499928 main_~y~0)} assume !(~y~0 > 0); {43860#false} is VALID [2022-04-28 03:56:13,961 INFO L272 TraceCheckUtils]: 47: Hoare triple {43860#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {43860#false} is VALID [2022-04-28 03:56:13,961 INFO L290 TraceCheckUtils]: 48: Hoare triple {43860#false} ~cond := #in~cond; {43860#false} is VALID [2022-04-28 03:56:13,961 INFO L290 TraceCheckUtils]: 49: Hoare triple {43860#false} assume 0 == ~cond; {43860#false} is VALID [2022-04-28 03:56:13,961 INFO L290 TraceCheckUtils]: 50: Hoare triple {43860#false} assume !false; {43860#false} is VALID [2022-04-28 03:56:13,961 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-28 03:56:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210295312] [2022-04-28 03:56:13,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210295312] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136924457] [2022-04-28 03:56:13,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:13,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:13,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:13,962 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-28 03:56:13,963 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-28 03:56:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:14,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 03:56:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:14,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:14,570 INFO L272 TraceCheckUtils]: 0: Hoare triple {43859#true} call ULTIMATE.init(); {43859#true} is VALID [2022-04-28 03:56:14,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {43859#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(18, 2);call #Ultimate.allocInit(12, 3); {43859#true} is VALID [2022-04-28 03:56:14,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {43859#true} assume true; {43859#true} is VALID [2022-04-28 03:56:14,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43859#true} {43859#true} #53#return; {43859#true} is VALID [2022-04-28 03:56:14,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {43859#true} call #t~ret9 := main(); {43859#true} is VALID [2022-04-28 03:56:14,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {43859#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:14,571 INFO L290 TraceCheckUtils]: 6: Hoare triple {43864#(<= 500000 main_~y~0)} [203] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2339 v_main_~x~0_2338)) (.cse1 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2339 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_2339 v_main_~x~0_2338) (< v_main_~x~0_2338 500001)))) InVars {main_~x~0=v_main_~x~0_2339, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:14,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {43864#(<= 500000 main_~y~0)} [204] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:14,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {43864#(<= 500000 main_~y~0)} [205] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2341 v_main_~x~0_2340)) (.cse5 (<= 500000 v_main_~x~0_2341)) (.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_#t~post5_249| |v_main_#t~post5_248|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2341 v_main_~y~0_2666))) (and (= (+ v_main_~x~0_2340 v_main_~y~0_2667) .cse4) (< v_main_~y~0_2667 v_main_~y~0_2666) (< .cse4 (+ 1000001 v_main_~y~0_2667)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2341 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2341, 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_2340, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:14,573 INFO L290 TraceCheckUtils]: 9: Hoare triple {43864#(<= 500000 main_~y~0)} [202] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {43864#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:14,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {43864#(<= 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; {43865#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:56:14,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {43865#(<= 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; {43866#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:56:14,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {43866#(<= 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; {43867#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:56:14,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {43867#(<= 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; {43868#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:56:14,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {43868#(<= 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; {43869#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:56:14,576 INFO L290 TraceCheckUtils]: 15: Hoare triple {43869#(<= 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; {43870#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:56:14,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {43870#(<= 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; {43871#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:56:14,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {43871#(<= 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; {43872#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:56:14,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {43872#(<= 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; {43873#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:56:14,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {43873#(<= 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; {43874#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:56:14,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {43874#(<= 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; {43875#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:56:14,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {43875#(<= 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; {43876#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:56:14,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {43876#(<= 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; {43877#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:56:14,579 INFO L290 TraceCheckUtils]: 23: Hoare triple {43877#(<= 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; {43878#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:56:14,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {43878#(<= 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; {43879#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:56:14,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {43879#(<= 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; {43880#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:56:14,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {43880#(<= 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; {43881#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:56:14,581 INFO L290 TraceCheckUtils]: 27: Hoare triple {43881#(<= 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; {43882#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:56:14,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {43882#(<= 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; {43883#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:56:14,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {43883#(<= 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; {43884#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:56:14,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {43884#(<= 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; {43885#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:56:14,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {43885#(<= 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; {43886#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:56:14,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {43886#(<= 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; {43887#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:56:14,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {43887#(<= 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; {43888#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:56:14,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {43888#(<= 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; {43889#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:56:14,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {43889#(<= 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; {43890#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:56:14,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {43890#(<= 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; {43891#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:56:14,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {43891#(<= 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; {43892#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:56:14,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {43892#(<= 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; {43893#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:56:14,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {43893#(<= 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; {43894#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:56:14,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {43894#(<= 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; {43895#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:56:14,588 INFO L290 TraceCheckUtils]: 41: Hoare triple {43895#(<= 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; {43896#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:56:14,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {43896#(<= 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; {43897#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:56:14,589 INFO L290 TraceCheckUtils]: 43: Hoare triple {43897#(<= 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; {43898#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:56:14,589 INFO L290 TraceCheckUtils]: 44: Hoare triple {43898#(<= 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; {43899#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:56:14,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {43899#(<= 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; {43900#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:56:14,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {43900#(<= 499928 main_~y~0)} assume !(~y~0 > 0); {43860#false} is VALID [2022-04-28 03:56:14,590 INFO L272 TraceCheckUtils]: 47: Hoare triple {43860#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {43860#false} is VALID [2022-04-28 03:56:14,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {43860#false} ~cond := #in~cond; {43860#false} is VALID [2022-04-28 03:56:14,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {43860#false} assume 0 == ~cond; {43860#false} is VALID [2022-04-28 03:56:14,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {43860#false} assume !false; {43860#false} is VALID [2022-04-28 03:56:14,590 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-28 03:56:14,590 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:16,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {43860#false} assume !false; {43860#false} is VALID [2022-04-28 03:56:16,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {43860#false} assume 0 == ~cond; {43860#false} is VALID [2022-04-28 03:56:16,494 INFO L290 TraceCheckUtils]: 48: Hoare triple {43860#false} ~cond := #in~cond; {43860#false} is VALID [2022-04-28 03:56:16,494 INFO L272 TraceCheckUtils]: 47: Hoare triple {43860#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {43860#false} is VALID [2022-04-28 03:56:16,494 INFO L290 TraceCheckUtils]: 46: Hoare triple {44067#(< 0 main_~y~0)} assume !(~y~0 > 0); {43860#false} is VALID [2022-04-28 03:56:16,494 INFO L290 TraceCheckUtils]: 45: Hoare triple {44071#(< 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; {44067#(< 0 main_~y~0)} is VALID [2022-04-28 03:56:16,495 INFO L290 TraceCheckUtils]: 44: Hoare triple {44075#(< 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; {44071#(< 2 main_~y~0)} is VALID [2022-04-28 03:56:16,495 INFO L290 TraceCheckUtils]: 43: Hoare triple {44079#(< 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; {44075#(< 4 main_~y~0)} is VALID [2022-04-28 03:56:16,496 INFO L290 TraceCheckUtils]: 42: Hoare triple {44083#(< 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; {44079#(< 6 main_~y~0)} is VALID [2022-04-28 03:56:16,496 INFO L290 TraceCheckUtils]: 41: Hoare triple {44087#(< 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; {44083#(< 8 main_~y~0)} is VALID [2022-04-28 03:56:16,497 INFO L290 TraceCheckUtils]: 40: Hoare triple {44091#(< 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; {44087#(< 10 main_~y~0)} is VALID [2022-04-28 03:56:16,497 INFO L290 TraceCheckUtils]: 39: Hoare triple {44095#(< 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; {44091#(< 12 main_~y~0)} is VALID [2022-04-28 03:56:16,498 INFO L290 TraceCheckUtils]: 38: Hoare triple {44099#(< 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; {44095#(< 14 main_~y~0)} is VALID [2022-04-28 03:56:16,498 INFO L290 TraceCheckUtils]: 37: Hoare triple {44103#(< 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; {44099#(< 16 main_~y~0)} is VALID [2022-04-28 03:56:16,499 INFO L290 TraceCheckUtils]: 36: Hoare triple {44107#(< 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; {44103#(< 18 main_~y~0)} is VALID [2022-04-28 03:56:16,499 INFO L290 TraceCheckUtils]: 35: Hoare triple {44111#(< 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; {44107#(< 20 main_~y~0)} is VALID [2022-04-28 03:56:16,500 INFO L290 TraceCheckUtils]: 34: Hoare triple {44115#(< 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; {44111#(< 22 main_~y~0)} is VALID [2022-04-28 03:56:16,500 INFO L290 TraceCheckUtils]: 33: Hoare triple {44119#(< 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; {44115#(< 24 main_~y~0)} is VALID [2022-04-28 03:56:16,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {44123#(< 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; {44119#(< 26 main_~y~0)} is VALID [2022-04-28 03:56:16,501 INFO L290 TraceCheckUtils]: 31: Hoare triple {44127#(< 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; {44123#(< 28 main_~y~0)} is VALID [2022-04-28 03:56:16,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {44131#(< 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; {44127#(< 30 main_~y~0)} is VALID [2022-04-28 03:56:16,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {44135#(< 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; {44131#(< 32 main_~y~0)} is VALID [2022-04-28 03:56:16,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {44139#(< 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; {44135#(< 34 main_~y~0)} is VALID [2022-04-28 03:56:16,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {44143#(< 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; {44139#(< 36 main_~y~0)} is VALID [2022-04-28 03:56:16,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {44147#(< 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; {44143#(< 38 main_~y~0)} is VALID [2022-04-28 03:56:16,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {44151#(< 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; {44147#(< 40 main_~y~0)} is VALID [2022-04-28 03:56:16,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {44155#(< 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; {44151#(< 42 main_~y~0)} is VALID [2022-04-28 03:56:16,505 INFO L290 TraceCheckUtils]: 23: Hoare triple {44159#(< 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; {44155#(< 44 main_~y~0)} is VALID [2022-04-28 03:56:16,505 INFO L290 TraceCheckUtils]: 22: Hoare triple {44163#(< 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; {44159#(< 46 main_~y~0)} is VALID [2022-04-28 03:56:16,506 INFO L290 TraceCheckUtils]: 21: Hoare triple {44167#(< 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; {44163#(< 48 main_~y~0)} is VALID [2022-04-28 03:56:16,506 INFO L290 TraceCheckUtils]: 20: Hoare triple {44171#(< 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; {44167#(< 50 main_~y~0)} is VALID [2022-04-28 03:56:16,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {44175#(< 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; {44171#(< 52 main_~y~0)} is VALID [2022-04-28 03:56:16,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {44179#(< 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; {44175#(< 54 main_~y~0)} is VALID [2022-04-28 03:56:16,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {44183#(< 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; {44179#(< 56 main_~y~0)} is VALID [2022-04-28 03:56:16,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {44187#(< 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; {44183#(< 58 main_~y~0)} is VALID [2022-04-28 03:56:16,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {44191#(< 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; {44187#(< 60 main_~y~0)} is VALID [2022-04-28 03:56:16,509 INFO L290 TraceCheckUtils]: 14: Hoare triple {44195#(< 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; {44191#(< 62 main_~y~0)} is VALID [2022-04-28 03:56:16,509 INFO L290 TraceCheckUtils]: 13: Hoare triple {44199#(< 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; {44195#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:16,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {44203#(< 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; {44199#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:16,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {44207#(< 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; {44203#(< 68 main_~y~0)} is VALID [2022-04-28 03:56:16,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {44211#(< 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; {44207#(< 70 main_~y~0)} is VALID [2022-04-28 03:56:16,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {44211#(< 72 main_~y~0)} [202] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {44211#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:16,512 INFO L290 TraceCheckUtils]: 8: Hoare triple {44211#(< 72 main_~y~0)} [205] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2341 v_main_~x~0_2340)) (.cse5 (<= 500000 v_main_~x~0_2341)) (.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_#t~post5_249| |v_main_#t~post5_248|))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse4 (+ v_main_~x~0_2341 v_main_~y~0_2666))) (and (= (+ v_main_~x~0_2340 v_main_~y~0_2667) .cse4) (< v_main_~y~0_2667 v_main_~y~0_2666) (< .cse4 (+ 1000001 v_main_~y~0_2667)) .cse5)) (and .cse0 (or (not .cse5) (not (< v_main_~x~0_2341 1000000))) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_2667, main_#t~post5=|v_main_#t~post5_249|, main_~x~0=v_main_~x~0_2341, 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_2340, main_#t~post6=|v_main_#t~post6_248|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {44211#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:16,512 INFO L290 TraceCheckUtils]: 7: Hoare triple {44211#(< 72 main_~y~0)} [204] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44211#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:16,512 INFO L290 TraceCheckUtils]: 6: Hoare triple {44211#(< 72 main_~y~0)} [203] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2339 v_main_~x~0_2338)) (.cse1 (= |v_main_#t~post4_228| |v_main_#t~post4_227|))) (or (and .cse0 .cse1 (not (< v_main_~x~0_2339 500000))) (and .cse0 .cse1) (and (< v_main_~x~0_2339 v_main_~x~0_2338) (< v_main_~x~0_2338 500001)))) InVars {main_~x~0=v_main_~x~0_2339, main_#t~post4=|v_main_#t~post4_228|} OutVars{main_~x~0=v_main_~x~0_2338, main_#t~post4=|v_main_#t~post4_227|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {44211#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:16,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {43859#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {44211#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:16,513 INFO L272 TraceCheckUtils]: 4: Hoare triple {43859#true} call #t~ret9 := main(); {43859#true} is VALID [2022-04-28 03:56:16,513 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43859#true} {43859#true} #53#return; {43859#true} is VALID [2022-04-28 03:56:16,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {43859#true} assume true; {43859#true} is VALID [2022-04-28 03:56:16,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {43859#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(18, 2);call #Ultimate.allocInit(12, 3); {43859#true} is VALID [2022-04-28 03:56:16,513 INFO L272 TraceCheckUtils]: 0: Hoare triple {43859#true} call ULTIMATE.init(); {43859#true} is VALID [2022-04-28 03:56:16,513 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-28 03:56:16,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136924457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:16,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:16,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 77 [2022-04-28 03:56:19,749 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:19,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [520952878] [2022-04-28 03:56:19,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [520952878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:19,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:19,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [107] imperfect sequences [] total 107 [2022-04-28 03:56:19,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022551040] [2022-04-28 03:56:19,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:19,750 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-28 03:56:19,750 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:19,750 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-28 03:56:19,880 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-28 03:56:19,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-04-28 03:56:19,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:19,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-04-28 03:56:19,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8010, Invalid=12582, Unknown=0, NotChecked=0, Total=20592 [2022-04-28 03:56:19,882 INFO L87 Difference]: Start difference. First operand 184 states and 188 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-28 03:56:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:37,982 INFO L93 Difference]: Finished difference Result 365 states and 378 transitions. [2022-04-28 03:56:37,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-04-28 03:56:37,982 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-28 03:56:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:56:37,982 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-28 03:56:37,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 210 transitions. [2022-04-28 03:56:37,984 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-28 03:56:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 210 transitions. [2022-04-28 03:56:37,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 210 transitions. [2022-04-28 03:56:38,159 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-28 03:56:38,161 INFO L225 Difference]: With dead ends: 365 [2022-04-28 03:56:38,162 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 03:56:38,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 136 SyntacticMatches, 2 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17871 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=18696, Invalid=42560, Unknown=0, NotChecked=0, Total=61256 [2022-04-28 03:56:38,165 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 354 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 8996 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 9458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 8996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:56:38,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 42 Invalid, 9458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 8996 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-04-28 03:56:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 03:56:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-04-28 03:56:38,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:56:38,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:38,459 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:38,460 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:38,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:38,462 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-28 03:56:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-28 03:56:38,462 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:38,462 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:38,463 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 189 states. [2022-04-28 03:56:38,463 INFO L87 Difference]: Start difference. First operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 189 states. [2022-04-28 03:56:38,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:56:38,465 INFO L93 Difference]: Finished difference Result 189 states and 193 transitions. [2022-04-28 03:56:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-28 03:56:38,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:56:38,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:56:38,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:56:38,466 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:56:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 182 states have (on average 1.0274725274725274) internal successors, (187), 183 states have internal predecessors, (187), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:56:38,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2022-04-28 03:56:38,469 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 180 [2022-04-28 03:56:38,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:56:38,469 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2022-04-28 03:56:38,469 INFO L496 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-28 03:56:38,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 193 transitions. [2022-04-28 03:56:38,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:56:38,647 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2022-04-28 03:56:38,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 03:56:38,647 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:56:38,647 INFO L195 NwaCegarLoop]: trace histogram [68, 67, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:56:38,664 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-28 03:56:38,848 WARN L477 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-28 03:56:38,848 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:56:38,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:56:38,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1071472923, now seen corresponding path program 37 times [2022-04-28 03:56:38,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:38,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [997469904] [2022-04-28 03:56:38,993 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-28 03:56:39,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-28 03:56:39,239 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:56:39,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1571476607, now seen corresponding path program 1 times [2022-04-28 03:56:39,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:56:39,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310348564] [2022-04-28 03:56:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:39,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:56:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:56:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:40,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {46048#(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(18, 2);call #Ultimate.allocInit(12, 3); {46005#true} is VALID [2022-04-28 03:56:40,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {46005#true} assume true; {46005#true} is VALID [2022-04-28 03:56:40,012 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46005#true} {46005#true} #53#return; {46005#true} is VALID [2022-04-28 03:56:40,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {46005#true} call ULTIMATE.init(); {46048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:56:40,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {46048#(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(18, 2);call #Ultimate.allocInit(12, 3); {46005#true} is VALID [2022-04-28 03:56:40,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {46005#true} assume true; {46005#true} is VALID [2022-04-28 03:56:40,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46005#true} {46005#true} #53#return; {46005#true} is VALID [2022-04-28 03:56:40,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {46005#true} call #t~ret9 := main(); {46005#true} is VALID [2022-04-28 03:56:40,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {46005#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {46010#(<= 500000 main_~y~0)} [207] L10-2-->L17-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] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {46010#(<= 500000 main_~y~0)} [208] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {46010#(<= 500000 main_~y~0)} [209] L10-2-->L17-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] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {46010#(<= 500000 main_~y~0)} [206] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {46010#(<= 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; {46011#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:56:40,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {46011#(<= 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; {46012#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:56:40,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {46012#(<= 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; {46013#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:56:40,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {46013#(<= 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; {46014#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:56:40,017 INFO L290 TraceCheckUtils]: 14: Hoare triple {46014#(<= 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; {46015#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:56:40,018 INFO L290 TraceCheckUtils]: 15: Hoare triple {46015#(<= 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; {46016#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:56:40,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {46016#(<= 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; {46017#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:56:40,019 INFO L290 TraceCheckUtils]: 17: Hoare triple {46017#(<= 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; {46018#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:56:40,019 INFO L290 TraceCheckUtils]: 18: Hoare triple {46018#(<= 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; {46019#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:56:40,019 INFO L290 TraceCheckUtils]: 19: Hoare triple {46019#(<= 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; {46020#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:56:40,020 INFO L290 TraceCheckUtils]: 20: Hoare triple {46020#(<= 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; {46021#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:56:40,020 INFO L290 TraceCheckUtils]: 21: Hoare triple {46021#(<= 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; {46022#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:56:40,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {46022#(<= 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; {46023#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:56:40,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {46023#(<= 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; {46024#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:56:40,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {46024#(<= 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; {46025#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:56:40,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {46025#(<= 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; {46026#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:56:40,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {46026#(<= 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; {46027#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:56:40,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {46027#(<= 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; {46028#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:56:40,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {46028#(<= 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; {46029#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:56:40,024 INFO L290 TraceCheckUtils]: 29: Hoare triple {46029#(<= 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; {46030#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:56:40,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {46030#(<= 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; {46031#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:56:40,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {46031#(<= 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; {46032#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:56:40,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {46032#(<= 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; {46033#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:56:40,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {46033#(<= 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; {46034#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:56:40,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {46034#(<= 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; {46035#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:56:40,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {46035#(<= 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; {46036#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:56:40,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {46036#(<= 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; {46037#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:56:40,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {46037#(<= 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; {46038#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:56:40,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {46038#(<= 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; {46039#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:56:40,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {46039#(<= 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; {46040#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:56:40,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {46040#(<= 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; {46041#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:56:40,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {46041#(<= 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; {46042#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:56:40,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {46042#(<= 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; {46043#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:56:40,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {46043#(<= 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; {46044#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:56:40,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {46044#(<= 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; {46045#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:56:40,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {46045#(<= 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; {46046#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:56:40,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {46046#(<= 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; {46047#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:56:40,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {46047#(<= 499926 main_~y~0)} assume !(~y~0 > 0); {46006#false} is VALID [2022-04-28 03:56:40,033 INFO L272 TraceCheckUtils]: 48: Hoare triple {46006#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {46006#false} is VALID [2022-04-28 03:56:40,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {46006#false} ~cond := #in~cond; {46006#false} is VALID [2022-04-28 03:56:40,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {46006#false} assume 0 == ~cond; {46006#false} is VALID [2022-04-28 03:56:40,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {46006#false} assume !false; {46006#false} is VALID [2022-04-28 03:56:40,033 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-28 03:56:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:56:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310348564] [2022-04-28 03:56:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310348564] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:56:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052683667] [2022-04-28 03:56:40,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:56:40,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:56:40,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:56:40,035 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-28 03:56:40,035 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-28 03:56:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:40,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-28 03:56:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:56:40,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:56:40,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {46005#true} call ULTIMATE.init(); {46005#true} is VALID [2022-04-28 03:56:40,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {46005#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(18, 2);call #Ultimate.allocInit(12, 3); {46005#true} is VALID [2022-04-28 03:56:40,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {46005#true} assume true; {46005#true} is VALID [2022-04-28 03:56:40,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46005#true} {46005#true} #53#return; {46005#true} is VALID [2022-04-28 03:56:40,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {46005#true} call #t~ret9 := main(); {46005#true} is VALID [2022-04-28 03:56:40,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {46005#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {46010#(<= 500000 main_~y~0)} [207] L10-2-->L17-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] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {46010#(<= 500000 main_~y~0)} [208] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {46010#(<= 500000 main_~y~0)} [209] L10-2-->L17-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] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {46010#(<= 500000 main_~y~0)} [206] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {46010#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:56:40,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {46010#(<= 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; {46011#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:56:40,684 INFO L290 TraceCheckUtils]: 11: Hoare triple {46011#(<= 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; {46012#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:56:40,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {46012#(<= 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; {46013#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:56:40,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {46013#(<= 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; {46014#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:56:40,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {46014#(<= 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; {46015#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:56:40,686 INFO L290 TraceCheckUtils]: 15: Hoare triple {46015#(<= 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; {46016#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:56:40,686 INFO L290 TraceCheckUtils]: 16: Hoare triple {46016#(<= 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; {46017#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:56:40,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {46017#(<= 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; {46018#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:56:40,687 INFO L290 TraceCheckUtils]: 18: Hoare triple {46018#(<= 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; {46019#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:56:40,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {46019#(<= 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; {46020#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:56:40,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {46020#(<= 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; {46021#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:56:40,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {46021#(<= 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; {46022#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:56:40,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {46022#(<= 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; {46023#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:56:40,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {46023#(<= 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; {46024#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:56:40,690 INFO L290 TraceCheckUtils]: 24: Hoare triple {46024#(<= 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; {46025#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:56:40,690 INFO L290 TraceCheckUtils]: 25: Hoare triple {46025#(<= 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; {46026#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:56:40,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {46026#(<= 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; {46027#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:56:40,691 INFO L290 TraceCheckUtils]: 27: Hoare triple {46027#(<= 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; {46028#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:56:40,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {46028#(<= 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; {46029#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:56:40,692 INFO L290 TraceCheckUtils]: 29: Hoare triple {46029#(<= 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; {46030#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:56:40,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {46030#(<= 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; {46031#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:56:40,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {46031#(<= 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; {46032#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:56:40,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {46032#(<= 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; {46033#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:56:40,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {46033#(<= 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; {46034#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:56:40,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {46034#(<= 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; {46035#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:56:40,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {46035#(<= 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; {46036#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:56:40,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {46036#(<= 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; {46037#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:56:40,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {46037#(<= 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; {46038#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:56:40,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {46038#(<= 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; {46039#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:56:40,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {46039#(<= 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; {46040#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:56:40,698 INFO L290 TraceCheckUtils]: 40: Hoare triple {46040#(<= 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; {46041#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:56:40,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {46041#(<= 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; {46042#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:56:40,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {46042#(<= 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; {46043#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:56:40,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {46043#(<= 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; {46044#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:56:40,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {46044#(<= 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; {46045#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:56:40,700 INFO L290 TraceCheckUtils]: 45: Hoare triple {46045#(<= 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; {46046#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:56:40,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {46046#(<= 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; {46047#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:56:40,701 INFO L290 TraceCheckUtils]: 47: Hoare triple {46047#(<= 499926 main_~y~0)} assume !(~y~0 > 0); {46006#false} is VALID [2022-04-28 03:56:40,701 INFO L272 TraceCheckUtils]: 48: Hoare triple {46006#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {46006#false} is VALID [2022-04-28 03:56:40,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {46006#false} ~cond := #in~cond; {46006#false} is VALID [2022-04-28 03:56:40,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {46006#false} assume 0 == ~cond; {46006#false} is VALID [2022-04-28 03:56:40,701 INFO L290 TraceCheckUtils]: 51: Hoare triple {46006#false} assume !false; {46006#false} is VALID [2022-04-28 03:56:40,701 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-28 03:56:40,711 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:56:42,781 INFO L290 TraceCheckUtils]: 51: Hoare triple {46006#false} assume !false; {46006#false} is VALID [2022-04-28 03:56:42,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {46006#false} assume 0 == ~cond; {46006#false} is VALID [2022-04-28 03:56:42,782 INFO L290 TraceCheckUtils]: 49: Hoare triple {46006#false} ~cond := #in~cond; {46006#false} is VALID [2022-04-28 03:56:42,782 INFO L272 TraceCheckUtils]: 48: Hoare triple {46006#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {46006#false} is VALID [2022-04-28 03:56:42,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {46217#(< 0 main_~y~0)} assume !(~y~0 > 0); {46006#false} is VALID [2022-04-28 03:56:42,783 INFO L290 TraceCheckUtils]: 46: Hoare triple {46221#(< 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; {46217#(< 0 main_~y~0)} is VALID [2022-04-28 03:56:42,783 INFO L290 TraceCheckUtils]: 45: Hoare triple {46225#(< 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; {46221#(< 2 main_~y~0)} is VALID [2022-04-28 03:56:42,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {46229#(< 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; {46225#(< 4 main_~y~0)} is VALID [2022-04-28 03:56:42,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {46233#(< 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; {46229#(< 6 main_~y~0)} is VALID [2022-04-28 03:56:42,785 INFO L290 TraceCheckUtils]: 42: Hoare triple {46237#(< 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; {46233#(< 8 main_~y~0)} is VALID [2022-04-28 03:56:42,785 INFO L290 TraceCheckUtils]: 41: Hoare triple {46241#(< 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; {46237#(< 10 main_~y~0)} is VALID [2022-04-28 03:56:42,786 INFO L290 TraceCheckUtils]: 40: Hoare triple {46245#(< 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; {46241#(< 12 main_~y~0)} is VALID [2022-04-28 03:56:42,786 INFO L290 TraceCheckUtils]: 39: Hoare triple {46249#(< 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; {46245#(< 14 main_~y~0)} is VALID [2022-04-28 03:56:42,786 INFO L290 TraceCheckUtils]: 38: Hoare triple {46253#(< 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; {46249#(< 16 main_~y~0)} is VALID [2022-04-28 03:56:42,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {46257#(< 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; {46253#(< 18 main_~y~0)} is VALID [2022-04-28 03:56:42,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {46261#(< 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; {46257#(< 20 main_~y~0)} is VALID [2022-04-28 03:56:42,788 INFO L290 TraceCheckUtils]: 35: Hoare triple {46265#(< 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; {46261#(< 22 main_~y~0)} is VALID [2022-04-28 03:56:42,788 INFO L290 TraceCheckUtils]: 34: Hoare triple {46269#(< 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; {46265#(< 24 main_~y~0)} is VALID [2022-04-28 03:56:42,789 INFO L290 TraceCheckUtils]: 33: Hoare triple {46273#(< 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; {46269#(< 26 main_~y~0)} is VALID [2022-04-28 03:56:42,789 INFO L290 TraceCheckUtils]: 32: Hoare triple {46277#(< 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; {46273#(< 28 main_~y~0)} is VALID [2022-04-28 03:56:42,790 INFO L290 TraceCheckUtils]: 31: Hoare triple {46281#(< 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; {46277#(< 30 main_~y~0)} is VALID [2022-04-28 03:56:42,790 INFO L290 TraceCheckUtils]: 30: Hoare triple {46285#(< 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; {46281#(< 32 main_~y~0)} is VALID [2022-04-28 03:56:42,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {46289#(< 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; {46285#(< 34 main_~y~0)} is VALID [2022-04-28 03:56:42,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {46293#(< 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; {46289#(< 36 main_~y~0)} is VALID [2022-04-28 03:56:42,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {46297#(< 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; {46293#(< 38 main_~y~0)} is VALID [2022-04-28 03:56:42,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {46301#(< 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; {46297#(< 40 main_~y~0)} is VALID [2022-04-28 03:56:42,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {46305#(< 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; {46301#(< 42 main_~y~0)} is VALID [2022-04-28 03:56:42,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {46309#(< 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; {46305#(< 44 main_~y~0)} is VALID [2022-04-28 03:56:42,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {46313#(< 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; {46309#(< 46 main_~y~0)} is VALID [2022-04-28 03:56:42,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {46317#(< 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; {46313#(< 48 main_~y~0)} is VALID [2022-04-28 03:56:42,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {46321#(< 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; {46317#(< 50 main_~y~0)} is VALID [2022-04-28 03:56:42,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {46325#(< 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; {46321#(< 52 main_~y~0)} is VALID [2022-04-28 03:56:42,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {46329#(< 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; {46325#(< 54 main_~y~0)} is VALID [2022-04-28 03:56:42,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {46333#(< 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; {46329#(< 56 main_~y~0)} is VALID [2022-04-28 03:56:42,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {46337#(< 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; {46333#(< 58 main_~y~0)} is VALID [2022-04-28 03:56:42,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {46341#(< 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; {46337#(< 60 main_~y~0)} is VALID [2022-04-28 03:56:42,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {46345#(< 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; {46341#(< 62 main_~y~0)} is VALID [2022-04-28 03:56:42,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {46349#(< 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; {46345#(< 64 main_~y~0)} is VALID [2022-04-28 03:56:42,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {46353#(< 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; {46349#(< 66 main_~y~0)} is VALID [2022-04-28 03:56:42,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {46357#(< 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; {46353#(< 68 main_~y~0)} is VALID [2022-04-28 03:56:42,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {46361#(< 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; {46357#(< 70 main_~y~0)} is VALID [2022-04-28 03:56:42,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {46365#(< 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; {46361#(< 72 main_~y~0)} is VALID [2022-04-28 03:56:42,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {46365#(< 74 main_~y~0)} [206] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {46365#(< 74 main_~y~0)} is VALID [2022-04-28 03:56:42,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {46365#(< 74 main_~y~0)} [209] L10-2-->L17-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] {46365#(< 74 main_~y~0)} is VALID [2022-04-28 03:56:42,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {46365#(< 74 main_~y~0)} [208] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46365#(< 74 main_~y~0)} is VALID [2022-04-28 03:56:42,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {46365#(< 74 main_~y~0)} [207] L10-2-->L17-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] {46365#(< 74 main_~y~0)} is VALID [2022-04-28 03:56:42,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {46005#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {46365#(< 74 main_~y~0)} is VALID [2022-04-28 03:56:42,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {46005#true} call #t~ret9 := main(); {46005#true} is VALID [2022-04-28 03:56:42,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46005#true} {46005#true} #53#return; {46005#true} is VALID [2022-04-28 03:56:42,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {46005#true} assume true; {46005#true} is VALID [2022-04-28 03:56:42,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {46005#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(18, 2);call #Ultimate.allocInit(12, 3); {46005#true} is VALID [2022-04-28 03:56:42,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {46005#true} call ULTIMATE.init(); {46005#true} is VALID [2022-04-28 03:56:42,803 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-28 03:56:42,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052683667] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:56:42,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:56:42,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 79 [2022-04-28 03:56:46,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:56:46,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [997469904] [2022-04-28 03:56:46,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [997469904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:56:46,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:56:46,231 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [110] imperfect sequences [] total 110 [2022-04-28 03:56:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144968982] [2022-04-28 03:56:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:56:46,232 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-28 03:56:46,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:56:46,232 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-28 03:56:46,369 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-28 03:56:46,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-04-28 03:56:46,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:56:46,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-04-28 03:56:46,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8455, Invalid=13301, Unknown=0, NotChecked=0, Total=21756 [2022-04-28 03:56:46,372 INFO L87 Difference]: Start difference. First operand 189 states and 193 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-28 03:57:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:05,648 INFO L93 Difference]: Finished difference Result 375 states and 388 transitions. [2022-04-28 03:57:05,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2022-04-28 03:57:05,648 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-28 03:57:05,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:05,649 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-28 03:57:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 215 transitions. [2022-04-28 03:57:05,650 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-28 03:57:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 215 transitions. [2022-04-28 03:57:05,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 215 transitions. [2022-04-28 03:57:05,824 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-28 03:57:05,826 INFO L225 Difference]: With dead ends: 375 [2022-04-28 03:57:05,826 INFO L226 Difference]: Without dead ends: 194 [2022-04-28 03:57:05,830 INFO L412 NwaCegarLoop]: 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-28 03:57:05,831 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 435 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9567 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 9567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:05,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 52 Invalid, 10110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 9567 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-28 03:57:05,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-04-28 03:57:06,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-04-28 03:57:06,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:06,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:06,150 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:06,150 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:06,153 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2022-04-28 03:57:06,153 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2022-04-28 03:57:06,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:06,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:06,153 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 194 states. [2022-04-28 03:57:06,154 INFO L87 Difference]: Start difference. First operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 194 states. [2022-04-28 03:57:06,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:06,156 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2022-04-28 03:57:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2022-04-28 03:57:06,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:06,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:06,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:06,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:06,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 187 states have (on average 1.0267379679144386) internal successors, (192), 188 states have internal predecessors, (192), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 198 transitions. [2022-04-28 03:57:06,159 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 198 transitions. Word has length 185 [2022-04-28 03:57:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:06,160 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 198 transitions. [2022-04-28 03:57:06,160 INFO L496 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-28 03:57:06,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 194 states and 198 transitions. [2022-04-28 03:57:06,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:06,321 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 198 transitions. [2022-04-28 03:57:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2022-04-28 03:57:06,321 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:06,322 INFO L195 NwaCegarLoop]: trace histogram [70, 69, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:06,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-28 03:57:06,522 WARN L477 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-28 03:57:06,522 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:06,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:06,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1117840398, now seen corresponding path program 38 times [2022-04-28 03:57:06,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:06,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841896819] [2022-04-28 03:57:10,595 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:10,649 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-28 03:57:10,926 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-28 03:57:10,927 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:10,929 INFO L85 PathProgramCache]: Analyzing trace with hash -597954686, now seen corresponding path program 1 times [2022-04-28 03:57:10,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:10,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029267822] [2022-04-28 03:57:10,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:10,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:11,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:11,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {48251#(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(18, 2);call #Ultimate.allocInit(12, 3); {48207#true} is VALID [2022-04-28 03:57:11,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {48207#true} assume true; {48207#true} is VALID [2022-04-28 03:57:11,757 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48207#true} {48207#true} #53#return; {48207#true} is VALID [2022-04-28 03:57:11,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {48207#true} call ULTIMATE.init(); {48251#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:11,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {48251#(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(18, 2);call #Ultimate.allocInit(12, 3); {48207#true} is VALID [2022-04-28 03:57:11,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {48207#true} assume true; {48207#true} is VALID [2022-04-28 03:57:11,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48207#true} {48207#true} #53#return; {48207#true} is VALID [2022-04-28 03:57:11,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {48207#true} call #t~ret9 := main(); {48207#true} is VALID [2022-04-28 03:57:11,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {48207#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:11,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {48212#(<= 500000 main_~y~0)} [211] L10-2-->L17-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] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:11,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {48212#(<= 500000 main_~y~0)} [212] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:11,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {48212#(<= 500000 main_~y~0)} [213] L10-2-->L17-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] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:11,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {48212#(<= 500000 main_~y~0)} [210] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:11,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {48212#(<= 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; {48213#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:57:11,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {48213#(<= 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; {48214#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:57:11,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {48214#(<= 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; {48215#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:57:11,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {48215#(<= 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; {48216#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:57:11,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {48216#(<= 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; {48217#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:57:11,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {48217#(<= 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; {48218#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:57:11,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {48218#(<= 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; {48219#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:57:11,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {48219#(<= 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; {48220#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:57:11,764 INFO L290 TraceCheckUtils]: 18: Hoare triple {48220#(<= 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; {48221#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:57:11,765 INFO L290 TraceCheckUtils]: 19: Hoare triple {48221#(<= 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; {48222#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:57:11,765 INFO L290 TraceCheckUtils]: 20: Hoare triple {48222#(<= 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; {48223#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:57:11,766 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#(<= 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; {48224#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:57:11,766 INFO L290 TraceCheckUtils]: 22: Hoare triple {48224#(<= 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; {48225#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:57:11,767 INFO L290 TraceCheckUtils]: 23: Hoare triple {48225#(<= 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; {48226#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:57:11,767 INFO L290 TraceCheckUtils]: 24: Hoare triple {48226#(<= 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; {48227#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:57:11,768 INFO L290 TraceCheckUtils]: 25: Hoare triple {48227#(<= 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; {48228#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:57:11,768 INFO L290 TraceCheckUtils]: 26: Hoare triple {48228#(<= 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; {48229#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:57:11,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {48229#(<= 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; {48230#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:57:11,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {48230#(<= 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; {48231#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:57:11,769 INFO L290 TraceCheckUtils]: 29: Hoare triple {48231#(<= 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; {48232#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:57:11,770 INFO L290 TraceCheckUtils]: 30: Hoare triple {48232#(<= 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; {48233#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:57:11,771 INFO L290 TraceCheckUtils]: 31: Hoare triple {48233#(<= 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; {48234#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:57:11,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {48234#(<= 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; {48235#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:57:11,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {48235#(<= 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; {48236#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:57:11,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {48236#(<= 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; {48237#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:57:11,774 INFO L290 TraceCheckUtils]: 35: Hoare triple {48237#(<= 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; {48238#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:57:11,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {48238#(<= 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; {48239#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:57:11,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {48239#(<= 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; {48240#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:57:11,776 INFO L290 TraceCheckUtils]: 38: Hoare triple {48240#(<= 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; {48241#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:57:11,776 INFO L290 TraceCheckUtils]: 39: Hoare triple {48241#(<= 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; {48242#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:57:11,777 INFO L290 TraceCheckUtils]: 40: Hoare triple {48242#(<= 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; {48243#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:57:11,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {48243#(<= 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; {48244#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:57:11,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {48244#(<= 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; {48245#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:57:11,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {48245#(<= 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; {48246#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:57:11,780 INFO L290 TraceCheckUtils]: 44: Hoare triple {48246#(<= 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; {48247#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:57:11,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {48247#(<= 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; {48248#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:57:11,781 INFO L290 TraceCheckUtils]: 46: Hoare triple {48248#(<= 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; {48249#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:57:11,781 INFO L290 TraceCheckUtils]: 47: Hoare triple {48249#(<= 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; {48250#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:57:11,782 INFO L290 TraceCheckUtils]: 48: Hoare triple {48250#(<= 499924 main_~y~0)} assume !(~y~0 > 0); {48208#false} is VALID [2022-04-28 03:57:11,782 INFO L272 TraceCheckUtils]: 49: Hoare triple {48208#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {48208#false} is VALID [2022-04-28 03:57:11,782 INFO L290 TraceCheckUtils]: 50: Hoare triple {48208#false} ~cond := #in~cond; {48208#false} is VALID [2022-04-28 03:57:11,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {48208#false} assume 0 == ~cond; {48208#false} is VALID [2022-04-28 03:57:11,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {48208#false} assume !false; {48208#false} is VALID [2022-04-28 03:57:11,782 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-28 03:57:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:11,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029267822] [2022-04-28 03:57:11,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029267822] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:11,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264712979] [2022-04-28 03:57:11,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:11,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:11,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:11,788 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-28 03:57:11,791 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-28 03:57:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:11,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 03:57:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:11,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:12,445 INFO L272 TraceCheckUtils]: 0: Hoare triple {48207#true} call ULTIMATE.init(); {48207#true} is VALID [2022-04-28 03:57:12,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {48207#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(18, 2);call #Ultimate.allocInit(12, 3); {48207#true} is VALID [2022-04-28 03:57:12,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {48207#true} assume true; {48207#true} is VALID [2022-04-28 03:57:12,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48207#true} {48207#true} #53#return; {48207#true} is VALID [2022-04-28 03:57:12,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {48207#true} call #t~ret9 := main(); {48207#true} is VALID [2022-04-28 03:57:12,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {48207#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:12,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {48212#(<= 500000 main_~y~0)} [211] L10-2-->L17-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] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:12,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {48212#(<= 500000 main_~y~0)} [212] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:12,447 INFO L290 TraceCheckUtils]: 8: Hoare triple {48212#(<= 500000 main_~y~0)} [213] L10-2-->L17-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] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:12,447 INFO L290 TraceCheckUtils]: 9: Hoare triple {48212#(<= 500000 main_~y~0)} [210] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {48212#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:12,448 INFO L290 TraceCheckUtils]: 10: Hoare triple {48212#(<= 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; {48213#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:57:12,448 INFO L290 TraceCheckUtils]: 11: Hoare triple {48213#(<= 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; {48214#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:57:12,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {48214#(<= 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; {48215#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:57:12,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {48215#(<= 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; {48216#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:57:12,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {48216#(<= 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; {48217#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:57:12,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {48217#(<= 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; {48218#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:57:12,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {48218#(<= 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; {48219#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:57:12,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {48219#(<= 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; {48220#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:57:12,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {48220#(<= 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; {48221#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:57:12,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {48221#(<= 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; {48222#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:57:12,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {48222#(<= 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; {48223#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:57:12,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {48223#(<= 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; {48224#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:57:12,453 INFO L290 TraceCheckUtils]: 22: Hoare triple {48224#(<= 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; {48225#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:57:12,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {48225#(<= 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; {48226#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:57:12,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {48226#(<= 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; {48227#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:57:12,455 INFO L290 TraceCheckUtils]: 25: Hoare triple {48227#(<= 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; {48228#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:57:12,455 INFO L290 TraceCheckUtils]: 26: Hoare triple {48228#(<= 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; {48229#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:57:12,456 INFO L290 TraceCheckUtils]: 27: Hoare triple {48229#(<= 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; {48230#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:57:12,456 INFO L290 TraceCheckUtils]: 28: Hoare triple {48230#(<= 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; {48231#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:57:12,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {48231#(<= 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; {48232#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:57:12,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {48232#(<= 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; {48233#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:57:12,458 INFO L290 TraceCheckUtils]: 31: Hoare triple {48233#(<= 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; {48234#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:57:12,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {48234#(<= 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; {48235#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:57:12,458 INFO L290 TraceCheckUtils]: 33: Hoare triple {48235#(<= 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; {48236#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:57:12,459 INFO L290 TraceCheckUtils]: 34: Hoare triple {48236#(<= 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; {48237#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:57:12,459 INFO L290 TraceCheckUtils]: 35: Hoare triple {48237#(<= 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; {48238#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:57:12,460 INFO L290 TraceCheckUtils]: 36: Hoare triple {48238#(<= 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; {48239#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:57:12,460 INFO L290 TraceCheckUtils]: 37: Hoare triple {48239#(<= 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; {48240#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:57:12,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {48240#(<= 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; {48241#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:57:12,461 INFO L290 TraceCheckUtils]: 39: Hoare triple {48241#(<= 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; {48242#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:57:12,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {48242#(<= 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; {48243#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:57:12,462 INFO L290 TraceCheckUtils]: 41: Hoare triple {48243#(<= 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; {48244#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:57:12,463 INFO L290 TraceCheckUtils]: 42: Hoare triple {48244#(<= 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; {48245#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:57:12,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {48245#(<= 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; {48246#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:57:12,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {48246#(<= 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; {48247#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:57:12,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {48247#(<= 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; {48248#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:57:12,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {48248#(<= 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; {48249#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:57:12,465 INFO L290 TraceCheckUtils]: 47: Hoare triple {48249#(<= 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; {48250#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:57:12,465 INFO L290 TraceCheckUtils]: 48: Hoare triple {48250#(<= 499924 main_~y~0)} assume !(~y~0 > 0); {48208#false} is VALID [2022-04-28 03:57:12,466 INFO L272 TraceCheckUtils]: 49: Hoare triple {48208#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {48208#false} is VALID [2022-04-28 03:57:12,466 INFO L290 TraceCheckUtils]: 50: Hoare triple {48208#false} ~cond := #in~cond; {48208#false} is VALID [2022-04-28 03:57:12,466 INFO L290 TraceCheckUtils]: 51: Hoare triple {48208#false} assume 0 == ~cond; {48208#false} is VALID [2022-04-28 03:57:12,466 INFO L290 TraceCheckUtils]: 52: Hoare triple {48208#false} assume !false; {48208#false} is VALID [2022-04-28 03:57:12,466 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-28 03:57:12,466 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:14,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {48208#false} assume !false; {48208#false} is VALID [2022-04-28 03:57:14,646 INFO L290 TraceCheckUtils]: 51: Hoare triple {48208#false} assume 0 == ~cond; {48208#false} is VALID [2022-04-28 03:57:14,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {48208#false} ~cond := #in~cond; {48208#false} is VALID [2022-04-28 03:57:14,646 INFO L272 TraceCheckUtils]: 49: Hoare triple {48208#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {48208#false} is VALID [2022-04-28 03:57:14,646 INFO L290 TraceCheckUtils]: 48: Hoare triple {48423#(< 0 main_~y~0)} assume !(~y~0 > 0); {48208#false} is VALID [2022-04-28 03:57:14,647 INFO L290 TraceCheckUtils]: 47: Hoare triple {48427#(< 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; {48423#(< 0 main_~y~0)} is VALID [2022-04-28 03:57:14,647 INFO L290 TraceCheckUtils]: 46: Hoare triple {48431#(< 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; {48427#(< 2 main_~y~0)} is VALID [2022-04-28 03:57:14,648 INFO L290 TraceCheckUtils]: 45: Hoare triple {48435#(< 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; {48431#(< 4 main_~y~0)} is VALID [2022-04-28 03:57:14,648 INFO L290 TraceCheckUtils]: 44: Hoare triple {48439#(< 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; {48435#(< 6 main_~y~0)} is VALID [2022-04-28 03:57:14,649 INFO L290 TraceCheckUtils]: 43: Hoare triple {48443#(< 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; {48439#(< 8 main_~y~0)} is VALID [2022-04-28 03:57:14,649 INFO L290 TraceCheckUtils]: 42: Hoare triple {48447#(< 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; {48443#(< 10 main_~y~0)} is VALID [2022-04-28 03:57:14,650 INFO L290 TraceCheckUtils]: 41: Hoare triple {48451#(< 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; {48447#(< 12 main_~y~0)} is VALID [2022-04-28 03:57:14,650 INFO L290 TraceCheckUtils]: 40: Hoare triple {48455#(< 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; {48451#(< 14 main_~y~0)} is VALID [2022-04-28 03:57:14,651 INFO L290 TraceCheckUtils]: 39: Hoare triple {48459#(< 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; {48455#(< 16 main_~y~0)} is VALID [2022-04-28 03:57:14,651 INFO L290 TraceCheckUtils]: 38: Hoare triple {48463#(< 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; {48459#(< 18 main_~y~0)} is VALID [2022-04-28 03:57:14,652 INFO L290 TraceCheckUtils]: 37: Hoare triple {48467#(< 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; {48463#(< 20 main_~y~0)} is VALID [2022-04-28 03:57:14,652 INFO L290 TraceCheckUtils]: 36: Hoare triple {48471#(< 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; {48467#(< 22 main_~y~0)} is VALID [2022-04-28 03:57:14,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {48475#(< 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; {48471#(< 24 main_~y~0)} is VALID [2022-04-28 03:57:14,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {48479#(< 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; {48475#(< 26 main_~y~0)} is VALID [2022-04-28 03:57:14,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {48483#(< 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; {48479#(< 28 main_~y~0)} is VALID [2022-04-28 03:57:14,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {48487#(< 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; {48483#(< 30 main_~y~0)} is VALID [2022-04-28 03:57:14,655 INFO L290 TraceCheckUtils]: 31: Hoare triple {48491#(< 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; {48487#(< 32 main_~y~0)} is VALID [2022-04-28 03:57:14,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {48495#(< 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; {48491#(< 34 main_~y~0)} is VALID [2022-04-28 03:57:14,656 INFO L290 TraceCheckUtils]: 29: Hoare triple {48499#(< 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; {48495#(< 36 main_~y~0)} is VALID [2022-04-28 03:57:14,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {48503#(< 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; {48499#(< 38 main_~y~0)} is VALID [2022-04-28 03:57:14,657 INFO L290 TraceCheckUtils]: 27: Hoare triple {48507#(< 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; {48503#(< 40 main_~y~0)} is VALID [2022-04-28 03:57:14,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {48511#(< 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; {48507#(< 42 main_~y~0)} is VALID [2022-04-28 03:57:14,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {48515#(< 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; {48511#(< 44 main_~y~0)} is VALID [2022-04-28 03:57:14,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {48519#(< 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; {48515#(< 46 main_~y~0)} is VALID [2022-04-28 03:57:14,658 INFO L290 TraceCheckUtils]: 23: Hoare triple {48523#(< 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; {48519#(< 48 main_~y~0)} is VALID [2022-04-28 03:57:14,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {48527#(< 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; {48523#(< 50 main_~y~0)} is VALID [2022-04-28 03:57:14,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {48531#(< 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; {48527#(< 52 main_~y~0)} is VALID [2022-04-28 03:57:14,660 INFO L290 TraceCheckUtils]: 20: Hoare triple {48535#(< 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; {48531#(< 54 main_~y~0)} is VALID [2022-04-28 03:57:14,660 INFO L290 TraceCheckUtils]: 19: Hoare triple {48539#(< 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; {48535#(< 56 main_~y~0)} is VALID [2022-04-28 03:57:14,661 INFO L290 TraceCheckUtils]: 18: Hoare triple {48543#(< 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; {48539#(< 58 main_~y~0)} is VALID [2022-04-28 03:57:14,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {48547#(< 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; {48543#(< 60 main_~y~0)} is VALID [2022-04-28 03:57:14,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {48551#(< 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; {48547#(< 62 main_~y~0)} is VALID [2022-04-28 03:57:14,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {48555#(< 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; {48551#(< 64 main_~y~0)} is VALID [2022-04-28 03:57:14,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {48559#(< 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; {48555#(< 66 main_~y~0)} is VALID [2022-04-28 03:57:14,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {48563#(< 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; {48559#(< 68 main_~y~0)} is VALID [2022-04-28 03:57:14,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {48567#(< 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; {48563#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:14,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {48571#(< 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; {48567#(< 72 main_~y~0)} is VALID [2022-04-28 03:57:14,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {48575#(< 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; {48571#(< 74 main_~y~0)} is VALID [2022-04-28 03:57:14,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {48575#(< 76 main_~y~0)} [210] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {48575#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:14,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {48575#(< 76 main_~y~0)} [213] L10-2-->L17-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] {48575#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:14,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {48575#(< 76 main_~y~0)} [212] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {48575#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:14,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {48575#(< 76 main_~y~0)} [211] L10-2-->L17-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] {48575#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:14,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {48207#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {48575#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:14,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {48207#true} call #t~ret9 := main(); {48207#true} is VALID [2022-04-28 03:57:14,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48207#true} {48207#true} #53#return; {48207#true} is VALID [2022-04-28 03:57:14,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {48207#true} assume true; {48207#true} is VALID [2022-04-28 03:57:14,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {48207#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(18, 2);call #Ultimate.allocInit(12, 3); {48207#true} is VALID [2022-04-28 03:57:14,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {48207#true} call ULTIMATE.init(); {48207#true} is VALID [2022-04-28 03:57:14,667 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-28 03:57:14,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264712979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:14,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:14,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 81 [2022-04-28 03:57:18,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:18,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841896819] [2022-04-28 03:57:18,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841896819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:18,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:18,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [113] imperfect sequences [] total 113 [2022-04-28 03:57:18,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741702279] [2022-04-28 03:57:18,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:18,255 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-28 03:57:18,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:18,256 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-28 03:57:18,406 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-28 03:57:18,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 113 states [2022-04-28 03:57:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:18,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2022-04-28 03:57:18,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8912, Invalid=14040, Unknown=0, NotChecked=0, Total=22952 [2022-04-28 03:57:18,409 INFO L87 Difference]: Start difference. First operand 194 states and 198 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-28 03:57:38,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:38,780 INFO L93 Difference]: Finished difference Result 385 states and 398 transitions. [2022-04-28 03:57:38,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2022-04-28 03:57:38,781 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-28 03:57:38,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:57:38,781 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-28 03:57:38,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 220 transitions. [2022-04-28 03:57:38,782 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-28 03:57:38,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 220 transitions. [2022-04-28 03:57:38,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 220 transitions. [2022-04-28 03:57:38,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:38,974 INFO L225 Difference]: With dead ends: 385 [2022-04-28 03:57:38,974 INFO L226 Difference]: Without dead ends: 199 [2022-04-28 03:57:38,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 142 SyntacticMatches, 2 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19966 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=20802, Invalid=47580, Unknown=0, NotChecked=0, Total=68382 [2022-04-28 03:57:38,978 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 300 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10192 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 10606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 10192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:57:38,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 72 Invalid, 10606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 10192 Invalid, 0 Unknown, 0 Unchecked, 8.3s Time] [2022-04-28 03:57:38,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-04-28 03:57:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2022-04-28 03:57:39,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:57:39,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:39,286 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:39,286 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:39,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:39,288 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2022-04-28 03:57:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2022-04-28 03:57:39,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:39,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:39,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 199 states. [2022-04-28 03:57:39,289 INFO L87 Difference]: Start difference. First operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 199 states. [2022-04-28 03:57:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:57:39,290 INFO L93 Difference]: Finished difference Result 199 states and 203 transitions. [2022-04-28 03:57:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2022-04-28 03:57:39,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:57:39,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:57:39,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:57:39,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:57:39,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 192 states have (on average 1.0260416666666667) internal successors, (197), 193 states have internal predecessors, (197), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:57:39,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2022-04-28 03:57:39,293 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 190 [2022-04-28 03:57:39,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:57:39,293 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2022-04-28 03:57:39,293 INFO L496 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-28 03:57:39,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 203 transitions. [2022-04-28 03:57:39,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:57:39,457 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2022-04-28 03:57:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-04-28 03:57:39,458 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:57:39,458 INFO L195 NwaCegarLoop]: trace histogram [72, 71, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:57:39,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-28 03:57:39,658 WARN L477 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-28 03:57:39,658 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:57:39,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:57:39,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1009029465, now seen corresponding path program 39 times [2022-04-28 03:57:39,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:39,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604195136] [2022-04-28 03:57:43,718 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 03:57:43,772 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-28 03:57:43,999 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-28 03:57:44,000 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:57:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1096381023, now seen corresponding path program 1 times [2022-04-28 03:57:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:57:44,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195612746] [2022-04-28 03:57:44,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:44,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:57:44,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:57:44,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {50513#(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(18, 2);call #Ultimate.allocInit(12, 3); {50465#true} is VALID [2022-04-28 03:57:44,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {50465#true} assume true; {50465#true} is VALID [2022-04-28 03:57:44,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50465#true} {50465#true} #53#return; {50465#true} is VALID [2022-04-28 03:57:44,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {50465#true} call ULTIMATE.init(); {50513#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:57:44,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {50513#(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(18, 2);call #Ultimate.allocInit(12, 3); {50465#true} is VALID [2022-04-28 03:57:44,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {50465#true} assume true; {50465#true} is VALID [2022-04-28 03:57:44,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50465#true} {50465#true} #53#return; {50465#true} is VALID [2022-04-28 03:57:44,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {50465#true} call #t~ret9 := main(); {50465#true} is VALID [2022-04-28 03:57:44,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {50465#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {50470#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:57:44,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {50470#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [215] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2702 v_main_~x~0_2701)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and (< v_main_~x~0_2702 v_main_~x~0_2701) (< v_main_~x~0_2701 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2702 500000))))) InVars {main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2701, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50471#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:57:44,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {50471#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [216] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50471#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:57:44,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {50471#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [217] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2704)) (.cse0 (= v_main_~x~0_2704 v_main_~x~0_2703)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse4 (= v_main_~y~0_3117 v_main_~y~0_3116))) (or (and .cse0 (or (not (< v_main_~x~0_2704 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_2703 v_main_~y~0_3117) (+ v_main_~x~0_2704 v_main_~y~0_3116)) .cse1 (< v_main_~x~0_2704 v_main_~x~0_2703) (< v_main_~x~0_2703 1000001)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2704, 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_2703, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50472#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:57:44,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {50472#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [214] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:44,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {50473#(<= 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; {50474#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:57:44,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {50474#(<= 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; {50475#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:57:44,904 INFO L290 TraceCheckUtils]: 12: Hoare triple {50475#(<= 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; {50476#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:57:44,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {50476#(<= 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; {50477#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:57:44,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {50477#(<= 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; {50478#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:57:44,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {50478#(<= 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; {50479#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:57:44,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {50479#(<= 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; {50480#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:57:44,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {50480#(<= 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; {50481#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:57:44,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {50481#(<= 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; {50482#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:57:44,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {50482#(<= 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; {50483#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:57:44,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {50483#(<= 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; {50484#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:57:44,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {50484#(<= 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; {50485#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:57:44,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {50485#(<= 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; {50486#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:57:44,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {50486#(<= 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; {50487#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:57:44,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {50487#(<= 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; {50488#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:57:44,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {50488#(<= 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; {50489#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:57:44,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {50489#(<= 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; {50490#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:57:44,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {50490#(<= 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; {50491#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:57:44,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {50491#(<= 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; {50492#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:57:44,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {50492#(<= 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; {50493#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:57:44,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {50493#(<= 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; {50494#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:57:44,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {50494#(<= 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; {50495#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:57:44,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {50495#(<= 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; {50496#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:57:44,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {50496#(<= 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; {50497#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:57:44,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {50497#(<= 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; {50498#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:57:44,915 INFO L290 TraceCheckUtils]: 35: Hoare triple {50498#(<= 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; {50499#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:57:44,915 INFO L290 TraceCheckUtils]: 36: Hoare triple {50499#(<= 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; {50500#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:57:44,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {50500#(<= 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; {50501#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:57:44,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {50501#(<= 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; {50502#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:57:44,916 INFO L290 TraceCheckUtils]: 39: Hoare triple {50502#(<= 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; {50503#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:57:44,917 INFO L290 TraceCheckUtils]: 40: Hoare triple {50503#(<= 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; {50504#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:57:44,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {50504#(<= 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; {50505#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:57:44,918 INFO L290 TraceCheckUtils]: 42: Hoare triple {50505#(<= 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; {50506#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:57:44,918 INFO L290 TraceCheckUtils]: 43: Hoare triple {50506#(<= 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; {50507#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:57:44,919 INFO L290 TraceCheckUtils]: 44: Hoare triple {50507#(<= 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; {50508#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:57:44,919 INFO L290 TraceCheckUtils]: 45: Hoare triple {50508#(<= 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; {50509#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:57:44,920 INFO L290 TraceCheckUtils]: 46: Hoare triple {50509#(<= 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; {50510#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:57:44,920 INFO L290 TraceCheckUtils]: 47: Hoare triple {50510#(<= 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; {50511#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:57:44,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {50511#(<= 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; {50512#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:57:44,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {50512#(<= 499922 main_~y~0)} assume !(~y~0 > 0); {50466#false} is VALID [2022-04-28 03:57:44,921 INFO L272 TraceCheckUtils]: 50: Hoare triple {50466#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {50466#false} is VALID [2022-04-28 03:57:44,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {50466#false} ~cond := #in~cond; {50466#false} is VALID [2022-04-28 03:57:44,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {50466#false} assume 0 == ~cond; {50466#false} is VALID [2022-04-28 03:57:44,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {50466#false} assume !false; {50466#false} is VALID [2022-04-28 03:57:44,921 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:57:44,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:57:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195612746] [2022-04-28 03:57:44,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195612746] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:57:44,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546185642] [2022-04-28 03:57:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:57:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:57:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:57:44,923 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-28 03:57:44,924 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-28 03:57:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:44,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 03:57:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:57:45,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:57:45,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {50465#true} call ULTIMATE.init(); {50465#true} is VALID [2022-04-28 03:57:45,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {50465#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(18, 2);call #Ultimate.allocInit(12, 3); {50465#true} is VALID [2022-04-28 03:57:45,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {50465#true} assume true; {50465#true} is VALID [2022-04-28 03:57:45,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50465#true} {50465#true} #53#return; {50465#true} is VALID [2022-04-28 03:57:45,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {50465#true} call #t~ret9 := main(); {50465#true} is VALID [2022-04-28 03:57:45,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {50465#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:45,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {50473#(<= 500000 main_~y~0)} [215] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2702 v_main_~x~0_2701)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and (< v_main_~x~0_2702 v_main_~x~0_2701) (< v_main_~x~0_2701 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2702 500000))))) InVars {main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2701, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:45,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {50473#(<= 500000 main_~y~0)} [216] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:45,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {50473#(<= 500000 main_~y~0)} [217] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2704)) (.cse0 (= v_main_~x~0_2704 v_main_~x~0_2703)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse4 (= v_main_~y~0_3117 v_main_~y~0_3116))) (or (and .cse0 (or (not (< v_main_~x~0_2704 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_2703 v_main_~y~0_3117) (+ v_main_~x~0_2704 v_main_~y~0_3116)) .cse1 (< v_main_~x~0_2704 v_main_~x~0_2703) (< v_main_~x~0_2703 1000001)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2704, 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_2703, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:45,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {50473#(<= 500000 main_~y~0)} [214] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {50473#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:57:45,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {50473#(<= 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; {50474#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:57:45,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {50474#(<= 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; {50475#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:57:45,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {50475#(<= 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; {50476#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:57:45,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {50476#(<= 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; {50477#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:57:45,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {50477#(<= 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; {50478#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:57:45,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {50478#(<= 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; {50479#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:57:45,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {50479#(<= 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; {50480#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:57:45,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {50480#(<= 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; {50481#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:57:45,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {50481#(<= 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; {50482#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:57:45,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {50482#(<= 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; {50483#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:57:45,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {50483#(<= 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; {50484#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:57:45,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {50484#(<= 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; {50485#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:57:45,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {50485#(<= 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; {50486#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:57:45,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {50486#(<= 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; {50487#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:57:45,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {50487#(<= 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; {50488#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:57:45,565 INFO L290 TraceCheckUtils]: 25: Hoare triple {50488#(<= 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; {50489#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:57:45,565 INFO L290 TraceCheckUtils]: 26: Hoare triple {50489#(<= 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; {50490#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:57:45,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {50490#(<= 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; {50491#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:57:45,566 INFO L290 TraceCheckUtils]: 28: Hoare triple {50491#(<= 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; {50492#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:57:45,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {50492#(<= 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; {50493#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:57:45,567 INFO L290 TraceCheckUtils]: 30: Hoare triple {50493#(<= 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; {50494#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:57:45,568 INFO L290 TraceCheckUtils]: 31: Hoare triple {50494#(<= 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; {50495#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:57:45,568 INFO L290 TraceCheckUtils]: 32: Hoare triple {50495#(<= 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; {50496#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:57:45,569 INFO L290 TraceCheckUtils]: 33: Hoare triple {50496#(<= 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; {50497#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:57:45,569 INFO L290 TraceCheckUtils]: 34: Hoare triple {50497#(<= 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; {50498#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:57:45,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {50498#(<= 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; {50499#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:57:45,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {50499#(<= 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; {50500#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:57:45,571 INFO L290 TraceCheckUtils]: 37: Hoare triple {50500#(<= 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; {50501#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:57:45,571 INFO L290 TraceCheckUtils]: 38: Hoare triple {50501#(<= 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; {50502#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:57:45,572 INFO L290 TraceCheckUtils]: 39: Hoare triple {50502#(<= 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; {50503#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:57:45,572 INFO L290 TraceCheckUtils]: 40: Hoare triple {50503#(<= 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; {50504#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:57:45,572 INFO L290 TraceCheckUtils]: 41: Hoare triple {50504#(<= 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; {50505#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:57:45,573 INFO L290 TraceCheckUtils]: 42: Hoare triple {50505#(<= 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; {50506#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:57:45,573 INFO L290 TraceCheckUtils]: 43: Hoare triple {50506#(<= 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; {50507#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:57:45,574 INFO L290 TraceCheckUtils]: 44: Hoare triple {50507#(<= 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; {50508#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:57:45,574 INFO L290 TraceCheckUtils]: 45: Hoare triple {50508#(<= 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; {50509#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:57:45,575 INFO L290 TraceCheckUtils]: 46: Hoare triple {50509#(<= 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; {50510#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:57:45,575 INFO L290 TraceCheckUtils]: 47: Hoare triple {50510#(<= 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; {50511#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:57:45,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {50511#(<= 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; {50512#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:57:45,576 INFO L290 TraceCheckUtils]: 49: Hoare triple {50512#(<= 499922 main_~y~0)} assume !(~y~0 > 0); {50466#false} is VALID [2022-04-28 03:57:45,576 INFO L272 TraceCheckUtils]: 50: Hoare triple {50466#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {50466#false} is VALID [2022-04-28 03:57:45,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {50466#false} ~cond := #in~cond; {50466#false} is VALID [2022-04-28 03:57:45,576 INFO L290 TraceCheckUtils]: 52: Hoare triple {50466#false} assume 0 == ~cond; {50466#false} is VALID [2022-04-28 03:57:45,576 INFO L290 TraceCheckUtils]: 53: Hoare triple {50466#false} assume !false; {50466#false} is VALID [2022-04-28 03:57:45,577 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-28 03:57:45,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:57:47,860 INFO L290 TraceCheckUtils]: 53: Hoare triple {50466#false} assume !false; {50466#false} is VALID [2022-04-28 03:57:47,861 INFO L290 TraceCheckUtils]: 52: Hoare triple {50466#false} assume 0 == ~cond; {50466#false} is VALID [2022-04-28 03:57:47,861 INFO L290 TraceCheckUtils]: 51: Hoare triple {50466#false} ~cond := #in~cond; {50466#false} is VALID [2022-04-28 03:57:47,861 INFO L272 TraceCheckUtils]: 50: Hoare triple {50466#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {50466#false} is VALID [2022-04-28 03:57:47,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {50688#(< 0 main_~y~0)} assume !(~y~0 > 0); {50466#false} is VALID [2022-04-28 03:57:47,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {50692#(< 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; {50688#(< 0 main_~y~0)} is VALID [2022-04-28 03:57:47,862 INFO L290 TraceCheckUtils]: 47: Hoare triple {50696#(< 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; {50692#(< 2 main_~y~0)} is VALID [2022-04-28 03:57:47,862 INFO L290 TraceCheckUtils]: 46: Hoare triple {50700#(< 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; {50696#(< 4 main_~y~0)} is VALID [2022-04-28 03:57:47,863 INFO L290 TraceCheckUtils]: 45: Hoare triple {50704#(< 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; {50700#(< 6 main_~y~0)} is VALID [2022-04-28 03:57:47,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {50708#(< 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; {50704#(< 8 main_~y~0)} is VALID [2022-04-28 03:57:47,864 INFO L290 TraceCheckUtils]: 43: Hoare triple {50712#(< 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; {50708#(< 10 main_~y~0)} is VALID [2022-04-28 03:57:47,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {50716#(< 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; {50712#(< 12 main_~y~0)} is VALID [2022-04-28 03:57:47,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {50720#(< 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; {50716#(< 14 main_~y~0)} is VALID [2022-04-28 03:57:47,865 INFO L290 TraceCheckUtils]: 40: Hoare triple {50724#(< 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; {50720#(< 16 main_~y~0)} is VALID [2022-04-28 03:57:47,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {50728#(< 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; {50724#(< 18 main_~y~0)} is VALID [2022-04-28 03:57:47,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {50732#(< 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; {50728#(< 20 main_~y~0)} is VALID [2022-04-28 03:57:47,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {50736#(< 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; {50732#(< 22 main_~y~0)} is VALID [2022-04-28 03:57:47,867 INFO L290 TraceCheckUtils]: 36: Hoare triple {50740#(< 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; {50736#(< 24 main_~y~0)} is VALID [2022-04-28 03:57:47,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {50744#(< 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; {50740#(< 26 main_~y~0)} is VALID [2022-04-28 03:57:47,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {50748#(< 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; {50744#(< 28 main_~y~0)} is VALID [2022-04-28 03:57:47,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {50752#(< 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; {50748#(< 30 main_~y~0)} is VALID [2022-04-28 03:57:47,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {50756#(< 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; {50752#(< 32 main_~y~0)} is VALID [2022-04-28 03:57:47,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {50760#(< 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; {50756#(< 34 main_~y~0)} is VALID [2022-04-28 03:57:47,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {50764#(< 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; {50760#(< 36 main_~y~0)} is VALID [2022-04-28 03:57:47,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {50768#(< 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; {50764#(< 38 main_~y~0)} is VALID [2022-04-28 03:57:47,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {50772#(< 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; {50768#(< 40 main_~y~0)} is VALID [2022-04-28 03:57:47,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {50776#(< 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; {50772#(< 42 main_~y~0)} is VALID [2022-04-28 03:57:47,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {50780#(< 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; {50776#(< 44 main_~y~0)} is VALID [2022-04-28 03:57:47,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {50784#(< 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; {50780#(< 46 main_~y~0)} is VALID [2022-04-28 03:57:47,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {50788#(< 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; {50784#(< 48 main_~y~0)} is VALID [2022-04-28 03:57:47,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {50792#(< 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; {50788#(< 50 main_~y~0)} is VALID [2022-04-28 03:57:47,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {50796#(< 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; {50792#(< 52 main_~y~0)} is VALID [2022-04-28 03:57:47,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {50800#(< 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; {50796#(< 54 main_~y~0)} is VALID [2022-04-28 03:57:47,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {50804#(< 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; {50800#(< 56 main_~y~0)} is VALID [2022-04-28 03:57:47,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {50808#(< 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; {50804#(< 58 main_~y~0)} is VALID [2022-04-28 03:57:47,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {50812#(< 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; {50808#(< 60 main_~y~0)} is VALID [2022-04-28 03:57:47,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {50816#(< 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; {50812#(< 62 main_~y~0)} is VALID [2022-04-28 03:57:47,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {50820#(< 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; {50816#(< 64 main_~y~0)} is VALID [2022-04-28 03:57:47,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {50824#(< 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; {50820#(< 66 main_~y~0)} is VALID [2022-04-28 03:57:47,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {50828#(< 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; {50824#(< 68 main_~y~0)} is VALID [2022-04-28 03:57:47,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {50832#(< 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; {50828#(< 70 main_~y~0)} is VALID [2022-04-28 03:57:47,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {50836#(< 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; {50832#(< 72 main_~y~0)} is VALID [2022-04-28 03:57:47,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {50840#(< 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; {50836#(< 74 main_~y~0)} is VALID [2022-04-28 03:57:47,879 INFO L290 TraceCheckUtils]: 10: Hoare triple {50844#(< 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; {50840#(< 76 main_~y~0)} is VALID [2022-04-28 03:57:47,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {50844#(< 78 main_~y~0)} [214] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {50844#(< 78 main_~y~0)} is VALID [2022-04-28 03:57:47,880 INFO L290 TraceCheckUtils]: 8: Hoare triple {50844#(< 78 main_~y~0)} [217] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2704)) (.cse0 (= v_main_~x~0_2704 v_main_~x~0_2703)) (.cse2 (= |v_main_#t~post6_270| |v_main_#t~post6_269|)) (.cse3 (= |v_main_#t~post5_270| |v_main_#t~post5_269|)) (.cse4 (= v_main_~y~0_3117 v_main_~y~0_3116))) (or (and .cse0 (or (not (< v_main_~x~0_2704 1000000)) (not .cse1)) .cse2 .cse3 .cse4) (and (= (+ v_main_~x~0_2703 v_main_~y~0_3117) (+ v_main_~x~0_2704 v_main_~y~0_3116)) .cse1 (< v_main_~x~0_2704 v_main_~x~0_2703) (< v_main_~x~0_2703 1000001)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3117, main_#t~post5=|v_main_#t~post5_270|, main_~x~0=v_main_~x~0_2704, 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_2703, main_#t~post6=|v_main_#t~post6_269|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {50844#(< 78 main_~y~0)} is VALID [2022-04-28 03:57:47,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {50844#(< 78 main_~y~0)} [216] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50844#(< 78 main_~y~0)} is VALID [2022-04-28 03:57:47,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {50844#(< 78 main_~y~0)} [215] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2702 v_main_~x~0_2701)) (.cse1 (= |v_main_#t~post4_246| |v_main_#t~post4_245|))) (or (and (< v_main_~x~0_2702 v_main_~x~0_2701) (< v_main_~x~0_2701 500001)) (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2702 500000))))) InVars {main_~x~0=v_main_~x~0_2702, main_#t~post4=|v_main_#t~post4_246|} OutVars{main_~x~0=v_main_~x~0_2701, main_#t~post4=|v_main_#t~post4_245|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {50844#(< 78 main_~y~0)} is VALID [2022-04-28 03:57:47,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {50465#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {50844#(< 78 main_~y~0)} is VALID [2022-04-28 03:57:47,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {50465#true} call #t~ret9 := main(); {50465#true} is VALID [2022-04-28 03:57:47,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50465#true} {50465#true} #53#return; {50465#true} is VALID [2022-04-28 03:57:47,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {50465#true} assume true; {50465#true} is VALID [2022-04-28 03:57:47,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {50465#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(18, 2);call #Ultimate.allocInit(12, 3); {50465#true} is VALID [2022-04-28 03:57:47,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {50465#true} call ULTIMATE.init(); {50465#true} is VALID [2022-04-28 03:57:47,882 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-28 03:57:47,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546185642] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:57:47,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:57:47,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 42, 42] total 86 [2022-04-28 03:57:51,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:57:51,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604195136] [2022-04-28 03:57:51,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604195136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:57:51,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:57:51,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [116] imperfect sequences [] total 116 [2022-04-28 03:57:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556074617] [2022-04-28 03:57:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:57:51,637 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-28 03:57:51,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:57:51,637 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-28 03:57:51,783 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-28 03:57:51,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 116 states [2022-04-28 03:57:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:57:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2022-04-28 03:57:51,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9627, Invalid=15495, Unknown=0, NotChecked=0, Total=25122 [2022-04-28 03:57:51,786 INFO L87 Difference]: Start difference. First operand 199 states and 203 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-28 03:58:13,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:13,630 INFO L93 Difference]: Finished difference Result 535 states and 548 transitions. [2022-04-28 03:58:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-04-28 03:58:13,631 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-28 03:58:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:13,631 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-28 03:58:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 225 transitions. [2022-04-28 03:58:13,632 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-28 03:58:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 225 transitions. [2022-04-28 03:58:13,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 225 transitions. [2022-04-28 03:58:13,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:13,835 INFO L225 Difference]: With dead ends: 535 [2022-04-28 03:58:13,835 INFO L226 Difference]: Without dead ends: 344 [2022-04-28 03:58:13,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21722 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=22148, Invalid=51564, Unknown=0, NotChecked=0, Total=73712 [2022-04-28 03:58:13,839 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 234 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 11015 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 11286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 11015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:13,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 52 Invalid, 11286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 11015 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-28 03:58:13,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-04-28 03:58:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2022-04-28 03:58:14,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:14,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 344 states. Second operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:14,533 INFO L74 IsIncluded]: Start isIncluded. First operand 344 states. Second operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:14,533 INFO L87 Difference]: Start difference. First operand 344 states. Second operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:14,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:14,539 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2022-04-28 03:58:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 349 transitions. [2022-04-28 03:58:14,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:14,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:14,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 344 states. [2022-04-28 03:58:14,540 INFO L87 Difference]: Start difference. First operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 344 states. [2022-04-28 03:58:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:14,557 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2022-04-28 03:58:14,557 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 349 transitions. [2022-04-28 03:58:14,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:14,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:14,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:14,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 337 states have (on average 1.0178041543026706) internal successors, (343), 338 states have internal predecessors, (343), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 349 transitions. [2022-04-28 03:58:14,565 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 349 transitions. Word has length 195 [2022-04-28 03:58:14,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:14,565 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 349 transitions. [2022-04-28 03:58:14,565 INFO L496 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-28 03:58:14,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 344 states and 349 transitions. [2022-04-28 03:58:14,908 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:14,909 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 349 transitions. [2022-04-28 03:58:14,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-04-28 03:58:14,909 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:14,909 INFO L195 NwaCegarLoop]: trace histogram [73, 72, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:14,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2022-04-28 03:58:15,110 WARN L477 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-28 03:58:15,110 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:15,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1263005025, now seen corresponding path program 40 times [2022-04-28 03:58:15,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:15,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1128230426] [2022-04-28 03:58:15,225 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-28 03:58:15,454 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-28 03:58:15,455 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:15,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1185738398, now seen corresponding path program 1 times [2022-04-28 03:58:15,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:15,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479551509] [2022-04-28 03:58:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:15,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {53668#(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(18, 2);call #Ultimate.allocInit(12, 3); {53622#true} is VALID [2022-04-28 03:58:16,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {53622#true} assume true; {53622#true} is VALID [2022-04-28 03:58:16,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53622#true} {53622#true} #53#return; {53622#true} is VALID [2022-04-28 03:58:16,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {53622#true} call ULTIMATE.init(); {53668#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:16,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {53668#(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(18, 2);call #Ultimate.allocInit(12, 3); {53622#true} is VALID [2022-04-28 03:58:16,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {53622#true} assume true; {53622#true} is VALID [2022-04-28 03:58:16,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53622#true} {53622#true} #53#return; {53622#true} is VALID [2022-04-28 03:58:16,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {53622#true} call #t~ret9 := main(); {53622#true} is VALID [2022-04-28 03:58:16,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {53622#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {53627#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:16,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {53627#(<= 500000 main_~y~0)} [219] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2829 v_main_~x~0_2828)) (.cse1 (= |v_main_#t~post4_252| |v_main_#t~post4_251|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2828 500001) (< v_main_~x~0_2829 v_main_~x~0_2828)) (and .cse0 (<= 500000 v_main_~x~0_2829) .cse1))) InVars {main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} OutVars{main_~x~0=v_main_~x~0_2828, main_#t~post4=|v_main_#t~post4_251|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {53627#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:16,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {53627#(<= 500000 main_~y~0)} [220] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53627#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:16,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {53627#(<= 500000 main_~y~0)} [221] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2831)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse3 (= v_main_~x~0_2831 v_main_~x~0_2830)) (.cse4 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2831 1000000))) .cse2 .cse3 .cse4) (and (< v_main_~x~0_2830 1000001) .cse1 (< v_main_~x~0_2831 v_main_~x~0_2830) (= (+ v_main_~x~0_2830 v_main_~y~0_3275) (+ v_main_~x~0_2831 v_main_~y~0_3274))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2831, 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_2830, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53627#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:16,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {53627#(<= 500000 main_~y~0)} [218] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {53627#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:16,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {53627#(<= 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; {53628#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:58:16,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {53628#(<= 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; {53629#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:58:16,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {53629#(<= 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; {53630#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:58:16,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {53630#(<= 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; {53631#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:58:16,331 INFO L290 TraceCheckUtils]: 14: Hoare triple {53631#(<= 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; {53632#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:58:16,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {53632#(<= 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; {53633#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:58:16,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {53633#(<= 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; {53634#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:58:16,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {53634#(<= 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; {53635#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:58:16,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {53635#(<= 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; {53636#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:58:16,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {53636#(<= 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; {53637#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:58:16,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {53637#(<= 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; {53638#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:58:16,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {53638#(<= 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; {53639#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:58:16,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {53639#(<= 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; {53640#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:58:16,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {53640#(<= 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; {53641#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:58:16,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {53641#(<= 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; {53642#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:58:16,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {53642#(<= 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; {53643#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:58:16,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {53643#(<= 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; {53644#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:58:16,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {53644#(<= 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; {53645#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:58:16,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {53645#(<= 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; {53646#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:58:16,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {53646#(<= 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; {53647#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:58:16,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {53647#(<= 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; {53648#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:58:16,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {53648#(<= 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; {53649#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:58:16,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {53649#(<= 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; {53650#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:58:16,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {53650#(<= 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; {53651#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:58:16,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {53651#(<= 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; {53652#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:58:16,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {53652#(<= 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; {53653#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:58:16,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {53653#(<= 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; {53654#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:58:16,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {53654#(<= 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; {53655#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:58:16,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {53655#(<= 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; {53656#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:58:16,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {53656#(<= 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; {53657#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:58:16,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {53657#(<= 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; {53658#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:58:16,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {53658#(<= 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; {53659#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:58:16,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {53659#(<= 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; {53660#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:58:16,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {53660#(<= 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; {53661#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:58:16,345 INFO L290 TraceCheckUtils]: 44: Hoare triple {53661#(<= 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; {53662#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:58:16,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {53662#(<= 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; {53663#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:58:16,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {53663#(<= 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; {53664#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:58:16,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {53664#(<= 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; {53665#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:58:16,347 INFO L290 TraceCheckUtils]: 48: Hoare triple {53665#(<= 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; {53666#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:58:16,347 INFO L290 TraceCheckUtils]: 49: Hoare triple {53666#(<= 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; {53667#(<= 499920 main_~y~0)} is VALID [2022-04-28 03:58:16,348 INFO L290 TraceCheckUtils]: 50: Hoare triple {53667#(<= 499920 main_~y~0)} assume !(~y~0 > 0); {53623#false} is VALID [2022-04-28 03:58:16,348 INFO L272 TraceCheckUtils]: 51: Hoare triple {53623#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {53623#false} is VALID [2022-04-28 03:58:16,348 INFO L290 TraceCheckUtils]: 52: Hoare triple {53623#false} ~cond := #in~cond; {53623#false} is VALID [2022-04-28 03:58:16,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {53623#false} assume 0 == ~cond; {53623#false} is VALID [2022-04-28 03:58:16,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {53623#false} assume !false; {53623#false} is VALID [2022-04-28 03:58:16,348 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-28 03:58:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:16,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479551509] [2022-04-28 03:58:16,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479551509] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:16,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60074066] [2022-04-28 03:58:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:16,352 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-28 03:58:16,360 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-28 03:58:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 03:58:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:16,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:17,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {53622#true} call ULTIMATE.init(); {53622#true} is VALID [2022-04-28 03:58:17,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {53622#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(18, 2);call #Ultimate.allocInit(12, 3); {53622#true} is VALID [2022-04-28 03:58:17,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {53622#true} assume true; {53622#true} is VALID [2022-04-28 03:58:17,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53622#true} {53622#true} #53#return; {53622#true} is VALID [2022-04-28 03:58:17,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {53622#true} call #t~ret9 := main(); {53622#true} is VALID [2022-04-28 03:58:17,873 INFO L290 TraceCheckUtils]: 5: Hoare triple {53622#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {53687#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:58:17,874 INFO L290 TraceCheckUtils]: 6: Hoare triple {53687#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [219] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2829 v_main_~x~0_2828)) (.cse1 (= |v_main_#t~post4_252| |v_main_#t~post4_251|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2828 500001) (< v_main_~x~0_2829 v_main_~x~0_2828)) (and .cse0 (<= 500000 v_main_~x~0_2829) .cse1))) InVars {main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} OutVars{main_~x~0=v_main_~x~0_2828, main_#t~post4=|v_main_#t~post4_251|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {53691#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:17,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {53691#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [220] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {53691#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:58:17,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {53691#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [221] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2831)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse3 (= v_main_~x~0_2831 v_main_~x~0_2830)) (.cse4 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2831 1000000))) .cse2 .cse3 .cse4) (and (< v_main_~x~0_2830 1000001) .cse1 (< v_main_~x~0_2831 v_main_~x~0_2830) (= (+ v_main_~x~0_2830 v_main_~y~0_3275) (+ v_main_~x~0_2831 v_main_~y~0_3274))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2831, 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_2830, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {53698#(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-28 03:58:17,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {53698#(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)))} [218] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {53702#(< 999999 main_~y~0)} is VALID [2022-04-28 03:58:17,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {53702#(< 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; {53706#(< 999997 main_~y~0)} is VALID [2022-04-28 03:58:17,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {53706#(< 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; {53710#(< 999995 main_~y~0)} is VALID [2022-04-28 03:58:17,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {53710#(< 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; {53714#(< 999993 main_~y~0)} is VALID [2022-04-28 03:58:17,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {53714#(< 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; {53718#(< 999991 main_~y~0)} is VALID [2022-04-28 03:58:17,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {53718#(< 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; {53722#(< 999989 main_~y~0)} is VALID [2022-04-28 03:58:17,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {53722#(< 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; {53726#(< 999987 main_~y~0)} is VALID [2022-04-28 03:58:17,879 INFO L290 TraceCheckUtils]: 16: Hoare triple {53726#(< 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; {53730#(< 999985 main_~y~0)} is VALID [2022-04-28 03:58:17,879 INFO L290 TraceCheckUtils]: 17: Hoare triple {53730#(< 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; {53734#(< 999983 main_~y~0)} is VALID [2022-04-28 03:58:17,879 INFO L290 TraceCheckUtils]: 18: Hoare triple {53734#(< 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; {53738#(< 999981 main_~y~0)} is VALID [2022-04-28 03:58:17,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {53738#(< 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; {53742#(< 999979 main_~y~0)} is VALID [2022-04-28 03:58:17,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {53742#(< 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; {53746#(< 999977 main_~y~0)} is VALID [2022-04-28 03:58:17,881 INFO L290 TraceCheckUtils]: 21: Hoare triple {53746#(< 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; {53750#(< 999975 main_~y~0)} is VALID [2022-04-28 03:58:17,881 INFO L290 TraceCheckUtils]: 22: Hoare triple {53750#(< 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; {53754#(< 999973 main_~y~0)} is VALID [2022-04-28 03:58:17,882 INFO L290 TraceCheckUtils]: 23: Hoare triple {53754#(< 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; {53758#(< 999971 main_~y~0)} is VALID [2022-04-28 03:58:17,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {53758#(< 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; {53762#(< 999969 main_~y~0)} is VALID [2022-04-28 03:58:17,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {53762#(< 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; {53766#(< 999967 main_~y~0)} is VALID [2022-04-28 03:58:17,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {53766#(< 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; {53770#(< 999965 main_~y~0)} is VALID [2022-04-28 03:58:17,884 INFO L290 TraceCheckUtils]: 27: Hoare triple {53770#(< 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; {53774#(< 999963 main_~y~0)} is VALID [2022-04-28 03:58:17,884 INFO L290 TraceCheckUtils]: 28: Hoare triple {53774#(< 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; {53778#(< 999961 main_~y~0)} is VALID [2022-04-28 03:58:17,885 INFO L290 TraceCheckUtils]: 29: Hoare triple {53778#(< 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; {53782#(< 999959 main_~y~0)} is VALID [2022-04-28 03:58:17,885 INFO L290 TraceCheckUtils]: 30: Hoare triple {53782#(< 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; {53786#(< 999957 main_~y~0)} is VALID [2022-04-28 03:58:17,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {53786#(< 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; {53790#(< 999955 main_~y~0)} is VALID [2022-04-28 03:58:17,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {53790#(< 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; {53794#(< 999953 main_~y~0)} is VALID [2022-04-28 03:58:17,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {53794#(< 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; {53798#(< 999951 main_~y~0)} is VALID [2022-04-28 03:58:17,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {53798#(< 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; {53802#(< 999949 main_~y~0)} is VALID [2022-04-28 03:58:17,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {53802#(< 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; {53806#(< 999947 main_~y~0)} is VALID [2022-04-28 03:58:17,888 INFO L290 TraceCheckUtils]: 36: Hoare triple {53806#(< 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; {53810#(< 999945 main_~y~0)} is VALID [2022-04-28 03:58:17,888 INFO L290 TraceCheckUtils]: 37: Hoare triple {53810#(< 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; {53814#(< 999943 main_~y~0)} is VALID [2022-04-28 03:58:17,889 INFO L290 TraceCheckUtils]: 38: Hoare triple {53814#(< 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; {53818#(< 999941 main_~y~0)} is VALID [2022-04-28 03:58:17,889 INFO L290 TraceCheckUtils]: 39: Hoare triple {53818#(< 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; {53822#(< 999939 main_~y~0)} is VALID [2022-04-28 03:58:17,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {53822#(< 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; {53826#(< 999937 main_~y~0)} is VALID [2022-04-28 03:58:17,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {53826#(< 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; {53830#(< 999935 main_~y~0)} is VALID [2022-04-28 03:58:17,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {53830#(< 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; {53834#(< 999933 main_~y~0)} is VALID [2022-04-28 03:58:17,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {53834#(< 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; {53838#(< 999931 main_~y~0)} is VALID [2022-04-28 03:58:17,892 INFO L290 TraceCheckUtils]: 44: Hoare triple {53838#(< 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; {53842#(< 999929 main_~y~0)} is VALID [2022-04-28 03:58:17,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {53842#(< 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; {53846#(< 999927 main_~y~0)} is VALID [2022-04-28 03:58:17,892 INFO L290 TraceCheckUtils]: 46: Hoare triple {53846#(< 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; {53850#(< 999925 main_~y~0)} is VALID [2022-04-28 03:58:17,893 INFO L290 TraceCheckUtils]: 47: Hoare triple {53850#(< 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; {53854#(< 999923 main_~y~0)} is VALID [2022-04-28 03:58:17,893 INFO L290 TraceCheckUtils]: 48: Hoare triple {53854#(< 999923 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {53858#(< 999921 main_~y~0)} is VALID [2022-04-28 03:58:17,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {53858#(< 999921 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~0 := #t~post7 - 1;havoc #t~post7;#t~post8 := ~z~0;~z~0 := 1 + #t~post8;havoc #t~post8;~y~0 := ~y~0 - 2; {53862#(< 999919 main_~y~0)} is VALID [2022-04-28 03:58:17,894 INFO L290 TraceCheckUtils]: 50: Hoare triple {53862#(< 999919 main_~y~0)} assume !(~y~0 > 0); {53623#false} is VALID [2022-04-28 03:58:17,894 INFO L272 TraceCheckUtils]: 51: Hoare triple {53623#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {53623#false} is VALID [2022-04-28 03:58:17,894 INFO L290 TraceCheckUtils]: 52: Hoare triple {53623#false} ~cond := #in~cond; {53623#false} is VALID [2022-04-28 03:58:17,894 INFO L290 TraceCheckUtils]: 53: Hoare triple {53623#false} assume 0 == ~cond; {53623#false} is VALID [2022-04-28 03:58:17,894 INFO L290 TraceCheckUtils]: 54: Hoare triple {53623#false} assume !false; {53623#false} is VALID [2022-04-28 03:58:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:17,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:20,562 INFO L290 TraceCheckUtils]: 54: Hoare triple {53623#false} assume !false; {53623#false} is VALID [2022-04-28 03:58:20,562 INFO L290 TraceCheckUtils]: 53: Hoare triple {53623#false} assume 0 == ~cond; {53623#false} is VALID [2022-04-28 03:58:20,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {53623#false} ~cond := #in~cond; {53623#false} is VALID [2022-04-28 03:58:20,562 INFO L272 TraceCheckUtils]: 51: Hoare triple {53623#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {53623#false} is VALID [2022-04-28 03:58:20,563 INFO L290 TraceCheckUtils]: 50: Hoare triple {53890#(< 0 main_~y~0)} assume !(~y~0 > 0); {53623#false} is VALID [2022-04-28 03:58:20,563 INFO L290 TraceCheckUtils]: 49: Hoare triple {53894#(< 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; {53890#(< 0 main_~y~0)} is VALID [2022-04-28 03:58:20,564 INFO L290 TraceCheckUtils]: 48: Hoare triple {53898#(< 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; {53894#(< 2 main_~y~0)} is VALID [2022-04-28 03:58:20,564 INFO L290 TraceCheckUtils]: 47: Hoare triple {53902#(< 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; {53898#(< 4 main_~y~0)} is VALID [2022-04-28 03:58:20,565 INFO L290 TraceCheckUtils]: 46: Hoare triple {53906#(< 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; {53902#(< 6 main_~y~0)} is VALID [2022-04-28 03:58:20,565 INFO L290 TraceCheckUtils]: 45: Hoare triple {53910#(< 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; {53906#(< 8 main_~y~0)} is VALID [2022-04-28 03:58:20,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {53914#(< 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; {53910#(< 10 main_~y~0)} is VALID [2022-04-28 03:58:20,566 INFO L290 TraceCheckUtils]: 43: Hoare triple {53918#(< 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; {53914#(< 12 main_~y~0)} is VALID [2022-04-28 03:58:20,567 INFO L290 TraceCheckUtils]: 42: Hoare triple {53922#(< 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; {53918#(< 14 main_~y~0)} is VALID [2022-04-28 03:58:20,567 INFO L290 TraceCheckUtils]: 41: Hoare triple {53926#(< 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; {53922#(< 16 main_~y~0)} is VALID [2022-04-28 03:58:20,568 INFO L290 TraceCheckUtils]: 40: Hoare triple {53930#(< 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; {53926#(< 18 main_~y~0)} is VALID [2022-04-28 03:58:20,568 INFO L290 TraceCheckUtils]: 39: Hoare triple {53934#(< 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; {53930#(< 20 main_~y~0)} is VALID [2022-04-28 03:58:20,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {53938#(< 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; {53934#(< 22 main_~y~0)} is VALID [2022-04-28 03:58:20,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {53942#(< 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; {53938#(< 24 main_~y~0)} is VALID [2022-04-28 03:58:20,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {53946#(< 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; {53942#(< 26 main_~y~0)} is VALID [2022-04-28 03:58:20,570 INFO L290 TraceCheckUtils]: 35: Hoare triple {53950#(< 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; {53946#(< 28 main_~y~0)} is VALID [2022-04-28 03:58:20,571 INFO L290 TraceCheckUtils]: 34: Hoare triple {53954#(< 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; {53950#(< 30 main_~y~0)} is VALID [2022-04-28 03:58:20,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {53958#(< 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; {53954#(< 32 main_~y~0)} is VALID [2022-04-28 03:58:20,572 INFO L290 TraceCheckUtils]: 32: Hoare triple {53962#(< 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; {53958#(< 34 main_~y~0)} is VALID [2022-04-28 03:58:20,572 INFO L290 TraceCheckUtils]: 31: Hoare triple {53966#(< 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; {53962#(< 36 main_~y~0)} is VALID [2022-04-28 03:58:20,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {53970#(< 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; {53966#(< 38 main_~y~0)} is VALID [2022-04-28 03:58:20,573 INFO L290 TraceCheckUtils]: 29: Hoare triple {53974#(< 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; {53970#(< 40 main_~y~0)} is VALID [2022-04-28 03:58:20,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {53978#(< 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; {53974#(< 42 main_~y~0)} is VALID [2022-04-28 03:58:20,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {53982#(< 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; {53978#(< 44 main_~y~0)} is VALID [2022-04-28 03:58:20,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {53986#(< 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; {53982#(< 46 main_~y~0)} is VALID [2022-04-28 03:58:20,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {53990#(< 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; {53986#(< 48 main_~y~0)} is VALID [2022-04-28 03:58:20,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {53994#(< 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; {53990#(< 50 main_~y~0)} is VALID [2022-04-28 03:58:20,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {53998#(< 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; {53994#(< 52 main_~y~0)} is VALID [2022-04-28 03:58:20,577 INFO L290 TraceCheckUtils]: 22: Hoare triple {54002#(< 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; {53998#(< 54 main_~y~0)} is VALID [2022-04-28 03:58:20,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {54006#(< 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; {54002#(< 56 main_~y~0)} is VALID [2022-04-28 03:58:20,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {54010#(< 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; {54006#(< 58 main_~y~0)} is VALID [2022-04-28 03:58:20,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {54014#(< 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; {54010#(< 60 main_~y~0)} is VALID [2022-04-28 03:58:20,579 INFO L290 TraceCheckUtils]: 18: Hoare triple {54018#(< 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; {54014#(< 62 main_~y~0)} is VALID [2022-04-28 03:58:20,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {54022#(< 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; {54018#(< 64 main_~y~0)} is VALID [2022-04-28 03:58:20,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {54026#(< 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; {54022#(< 66 main_~y~0)} is VALID [2022-04-28 03:58:20,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {54030#(< 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; {54026#(< 68 main_~y~0)} is VALID [2022-04-28 03:58:20,581 INFO L290 TraceCheckUtils]: 14: Hoare triple {54034#(< 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; {54030#(< 70 main_~y~0)} is VALID [2022-04-28 03:58:20,581 INFO L290 TraceCheckUtils]: 13: Hoare triple {54038#(< 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; {54034#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:20,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {54042#(< 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; {54038#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:20,582 INFO L290 TraceCheckUtils]: 11: Hoare triple {54046#(< 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; {54042#(< 76 main_~y~0)} is VALID [2022-04-28 03:58:20,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {54050#(< 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; {54046#(< 78 main_~y~0)} is VALID [2022-04-28 03:58:20,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {54054#(or (< main_~x~0 1000000) (< 80 main_~y~0))} [218] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {54050#(< 80 main_~y~0)} is VALID [2022-04-28 03:58:20,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {54058#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} [221] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_2831)) (.cse0 (= |v_main_#t~post6_277| |v_main_#t~post6_276|)) (.cse2 (= v_main_~y~0_3275 v_main_~y~0_3274)) (.cse3 (= v_main_~x~0_2831 v_main_~x~0_2830)) (.cse4 (= |v_main_#t~post5_277| |v_main_#t~post5_276|))) (or (and .cse0 (or (not .cse1) (not (< v_main_~x~0_2831 1000000))) .cse2 .cse3 .cse4) (and (< v_main_~x~0_2830 1000001) .cse1 (< v_main_~x~0_2831 v_main_~x~0_2830) (= (+ v_main_~x~0_2830 v_main_~y~0_3275) (+ v_main_~x~0_2831 v_main_~y~0_3274))) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_3275, main_#t~post5=|v_main_#t~post5_277|, main_~x~0=v_main_~x~0_2831, 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_2830, main_#t~post6=|v_main_#t~post6_276|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {54054#(or (< main_~x~0 1000000) (< 80 main_~y~0))} is VALID [2022-04-28 03:58:20,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {54058#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} [220] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {54058#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} is VALID [2022-04-28 03:58:20,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {54065#(and (<= 0 (+ main_~y~0 499919)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} [219] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2829 v_main_~x~0_2828)) (.cse1 (= |v_main_#t~post4_252| |v_main_#t~post4_251|))) (or (and .cse0 .cse1) (and (< v_main_~x~0_2828 500001) (< v_main_~x~0_2829 v_main_~x~0_2828)) (and .cse0 (<= 500000 v_main_~x~0_2829) .cse1))) InVars {main_~x~0=v_main_~x~0_2829, main_#t~post4=|v_main_#t~post4_252|} OutVars{main_~x~0=v_main_~x~0_2828, main_#t~post4=|v_main_#t~post4_251|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {54058#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} is VALID [2022-04-28 03:58:20,586 INFO L290 TraceCheckUtils]: 5: Hoare triple {53622#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {54065#(and (<= 0 (+ main_~y~0 499919)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ main_~y~0 999920))) (or (< main_~x~0 1000000) (< 80 main_~y~0)))} is VALID [2022-04-28 03:58:20,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {53622#true} call #t~ret9 := main(); {53622#true} is VALID [2022-04-28 03:58:20,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53622#true} {53622#true} #53#return; {53622#true} is VALID [2022-04-28 03:58:20,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {53622#true} assume true; {53622#true} is VALID [2022-04-28 03:58:20,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {53622#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(18, 2);call #Ultimate.allocInit(12, 3); {53622#true} is VALID [2022-04-28 03:58:20,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {53622#true} call ULTIMATE.init(); {53622#true} is VALID [2022-04-28 03:58:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 822 backedges. 0 proven. 822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:58:20,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60074066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:20,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:20,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 46, 46] total 132 [2022-04-28 03:58:25,651 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:25,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1128230426] [2022-04-28 03:58:25,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1128230426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:25,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:25,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [118] imperfect sequences [] total 118 [2022-04-28 03:58:25,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114270116] [2022-04-28 03:58:25,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:25,652 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 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 198 [2022-04-28 03:58:25,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:25,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:25,794 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:25,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-04-28 03:58:25,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:25,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-04-28 03:58:25,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14771, Invalid=27049, Unknown=0, NotChecked=0, Total=41820 [2022-04-28 03:58:25,797 INFO L87 Difference]: Start difference. First operand 344 states and 349 transitions. Second operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:49,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:49,438 INFO L93 Difference]: Finished difference Result 543 states and 559 transitions. [2022-04-28 03:58:49,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2022-04-28 03:58:49,439 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 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 198 [2022-04-28 03:58:49,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:58:49,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:49,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 230 transitions. [2022-04-28 03:58:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:49,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 230 transitions. [2022-04-28 03:58:49,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 230 transitions. [2022-04-28 03:58:49,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:49,634 INFO L225 Difference]: With dead ends: 543 [2022-04-28 03:58:49,634 INFO L226 Difference]: Without dead ends: 351 [2022-04-28 03:58:49,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34752 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=28218, Invalid=73862, Unknown=0, NotChecked=0, Total=102080 [2022-04-28 03:58:49,643 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 541 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 10931 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 10931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-04-28 03:58:49,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 47 Invalid, 11443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 10931 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-04-28 03:58:49,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-04-28 03:58:49,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 207. [2022-04-28 03:58:49,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:58:49,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:49,975 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:49,975 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:49,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:49,981 INFO L93 Difference]: Finished difference Result 351 states and 356 transitions. [2022-04-28 03:58:49,981 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 356 transitions. [2022-04-28 03:58:49,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:49,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:49,981 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 351 states. [2022-04-28 03:58:49,982 INFO L87 Difference]: Start difference. First operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 351 states. [2022-04-28 03:58:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:58:49,987 INFO L93 Difference]: Finished difference Result 351 states and 356 transitions. [2022-04-28 03:58:49,987 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 356 transitions. [2022-04-28 03:58:49,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:58:49,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:58:49,988 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:58:49,988 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:58:49,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 200 states have (on average 1.025) internal successors, (205), 201 states have internal predecessors, (205), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:58:49,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 211 transitions. [2022-04-28 03:58:49,991 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 211 transitions. Word has length 198 [2022-04-28 03:58:49,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:58:49,991 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 211 transitions. [2022-04-28 03:58:49,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 118 states have (on average 1.6440677966101696) internal successors, (194), 117 states have internal predecessors, (194), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:49,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 211 transitions. [2022-04-28 03:58:50,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:50,167 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 211 transitions. [2022-04-28 03:58:50,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-28 03:58:50,168 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:58:50,168 INFO L195 NwaCegarLoop]: trace histogram [75, 74, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:58:50,184 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-28 03:58:50,368 WARN L477 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-28 03:58:50,369 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:58:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:58:50,369 INFO L85 PathProgramCache]: Analyzing trace with hash -2051541736, now seen corresponding path program 41 times [2022-04-28 03:58:50,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:50,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946012662] [2022-04-28 03:58:50,494 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-28 03:58:50,689 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-28 03:58:50,690 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:58:50,693 INFO L85 PathProgramCache]: Analyzing trace with hash -184588351, now seen corresponding path program 1 times [2022-04-28 03:58:50,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:58:50,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161411009] [2022-04-28 03:58:50,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:50,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:58:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:51,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:58:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:51,556 INFO L290 TraceCheckUtils]: 0: Hoare triple {56638#(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(18, 2);call #Ultimate.allocInit(12, 3); {56591#true} is VALID [2022-04-28 03:58:51,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {56591#true} assume true; {56591#true} is VALID [2022-04-28 03:58:51,556 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56591#true} {56591#true} #53#return; {56591#true} is VALID [2022-04-28 03:58:51,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {56591#true} call ULTIMATE.init(); {56638#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:58:51,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {56638#(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(18, 2);call #Ultimate.allocInit(12, 3); {56591#true} is VALID [2022-04-28 03:58:51,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {56591#true} assume true; {56591#true} is VALID [2022-04-28 03:58:51,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56591#true} {56591#true} #53#return; {56591#true} is VALID [2022-04-28 03:58:51,558 INFO L272 TraceCheckUtils]: 4: Hoare triple {56591#true} call #t~ret9 := main(); {56591#true} is VALID [2022-04-28 03:58:51,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {56591#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:51,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {56596#(<= 500000 main_~y~0)} [223] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2959 500000))) (and (< v_main_~x~0_2958 500001) (< v_main_~x~0_2959 v_main_~x~0_2958)))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:51,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {56596#(<= 500000 main_~y~0)} [224] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:51,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {56596#(<= 500000 main_~y~0)} [225] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse1 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse2 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse3 (= v_main_~y~0_3436 v_main_~y~0_3435)) (.cse4 (<= 500000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3435))) (and .cse4 (< v_main_~y~0_3436 v_main_~y~0_3435) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3436)) (< .cse5 (+ 1000001 v_main_~y~0_3436)))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2961 1000000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3435, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:51,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {56596#(<= 500000 main_~y~0)} [222] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:51,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {56596#(<= 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; {56597#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:58:51,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {56597#(<= 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; {56598#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:58:51,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {56598#(<= 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; {56599#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:58:51,562 INFO L290 TraceCheckUtils]: 13: Hoare triple {56599#(<= 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; {56600#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:58:51,562 INFO L290 TraceCheckUtils]: 14: Hoare triple {56600#(<= 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; {56601#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:58:51,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {56601#(<= 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; {56602#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:58:51,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {56602#(<= 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; {56603#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:58:51,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {56603#(<= 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; {56604#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:58:51,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {56604#(<= 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; {56605#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:58:51,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {56605#(<= 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; {56606#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:58:51,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {56606#(<= 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; {56607#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:58:51,566 INFO L290 TraceCheckUtils]: 21: Hoare triple {56607#(<= 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; {56608#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:58:51,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {56608#(<= 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; {56609#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:58:51,567 INFO L290 TraceCheckUtils]: 23: Hoare triple {56609#(<= 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; {56610#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:58:51,567 INFO L290 TraceCheckUtils]: 24: Hoare triple {56610#(<= 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; {56611#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:58:51,568 INFO L290 TraceCheckUtils]: 25: Hoare triple {56611#(<= 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; {56612#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:58:51,568 INFO L290 TraceCheckUtils]: 26: Hoare triple {56612#(<= 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; {56613#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:58:51,568 INFO L290 TraceCheckUtils]: 27: Hoare triple {56613#(<= 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; {56614#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:58:51,569 INFO L290 TraceCheckUtils]: 28: Hoare triple {56614#(<= 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; {56615#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:58:51,569 INFO L290 TraceCheckUtils]: 29: Hoare triple {56615#(<= 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; {56616#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:58:51,570 INFO L290 TraceCheckUtils]: 30: Hoare triple {56616#(<= 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; {56617#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:58:51,570 INFO L290 TraceCheckUtils]: 31: Hoare triple {56617#(<= 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; {56618#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:58:51,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {56618#(<= 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; {56619#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:58:51,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {56619#(<= 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; {56620#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:58:51,572 INFO L290 TraceCheckUtils]: 34: Hoare triple {56620#(<= 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; {56621#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:58:51,572 INFO L290 TraceCheckUtils]: 35: Hoare triple {56621#(<= 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; {56622#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:58:51,573 INFO L290 TraceCheckUtils]: 36: Hoare triple {56622#(<= 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; {56623#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:58:51,573 INFO L290 TraceCheckUtils]: 37: Hoare triple {56623#(<= 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; {56624#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:58:51,574 INFO L290 TraceCheckUtils]: 38: Hoare triple {56624#(<= 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; {56625#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:58:51,574 INFO L290 TraceCheckUtils]: 39: Hoare triple {56625#(<= 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; {56626#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:58:51,575 INFO L290 TraceCheckUtils]: 40: Hoare triple {56626#(<= 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; {56627#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:58:51,575 INFO L290 TraceCheckUtils]: 41: Hoare triple {56627#(<= 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; {56628#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:58:51,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {56628#(<= 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; {56629#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:58:51,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {56629#(<= 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; {56630#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:58:51,577 INFO L290 TraceCheckUtils]: 44: Hoare triple {56630#(<= 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; {56631#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:58:51,577 INFO L290 TraceCheckUtils]: 45: Hoare triple {56631#(<= 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; {56632#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:58:51,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {56632#(<= 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; {56633#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:58:51,578 INFO L290 TraceCheckUtils]: 47: Hoare triple {56633#(<= 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; {56634#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:58:51,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {56634#(<= 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; {56635#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:58:51,579 INFO L290 TraceCheckUtils]: 49: Hoare triple {56635#(<= 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; {56636#(<= 499920 main_~y~0)} is VALID [2022-04-28 03:58:51,579 INFO L290 TraceCheckUtils]: 50: Hoare triple {56636#(<= 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; {56637#(<= 499918 main_~y~0)} is VALID [2022-04-28 03:58:51,580 INFO L290 TraceCheckUtils]: 51: Hoare triple {56637#(<= 499918 main_~y~0)} assume !(~y~0 > 0); {56592#false} is VALID [2022-04-28 03:58:51,580 INFO L272 TraceCheckUtils]: 52: Hoare triple {56592#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {56592#false} is VALID [2022-04-28 03:58:51,580 INFO L290 TraceCheckUtils]: 53: Hoare triple {56592#false} ~cond := #in~cond; {56592#false} is VALID [2022-04-28 03:58:51,580 INFO L290 TraceCheckUtils]: 54: Hoare triple {56592#false} assume 0 == ~cond; {56592#false} is VALID [2022-04-28 03:58:51,580 INFO L290 TraceCheckUtils]: 55: Hoare triple {56592#false} assume !false; {56592#false} is VALID [2022-04-28 03:58:51,580 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-28 03:58:51,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:58:51,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161411009] [2022-04-28 03:58:51,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161411009] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:58:51,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728998970] [2022-04-28 03:58:51,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:58:51,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:58:51,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:58:51,582 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-28 03:58:51,583 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-28 03:58:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:51,656 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-28 03:58:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:58:51,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:58:52,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {56591#true} call ULTIMATE.init(); {56591#true} is VALID [2022-04-28 03:58:52,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {56591#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(18, 2);call #Ultimate.allocInit(12, 3); {56591#true} is VALID [2022-04-28 03:58:52,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {56591#true} assume true; {56591#true} is VALID [2022-04-28 03:58:52,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56591#true} {56591#true} #53#return; {56591#true} is VALID [2022-04-28 03:58:52,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {56591#true} call #t~ret9 := main(); {56591#true} is VALID [2022-04-28 03:58:52,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {56591#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:52,295 INFO L290 TraceCheckUtils]: 6: Hoare triple {56596#(<= 500000 main_~y~0)} [223] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2959 500000))) (and (< v_main_~x~0_2958 500001) (< v_main_~x~0_2959 v_main_~x~0_2958)))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:52,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {56596#(<= 500000 main_~y~0)} [224] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:52,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {56596#(<= 500000 main_~y~0)} [225] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse1 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse2 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse3 (= v_main_~y~0_3436 v_main_~y~0_3435)) (.cse4 (<= 500000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3435))) (and .cse4 (< v_main_~y~0_3436 v_main_~y~0_3435) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3436)) (< .cse5 (+ 1000001 v_main_~y~0_3436)))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2961 1000000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3435, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:52,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {56596#(<= 500000 main_~y~0)} [222] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {56596#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:58:52,297 INFO L290 TraceCheckUtils]: 10: Hoare triple {56596#(<= 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; {56597#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:58:52,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {56597#(<= 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; {56598#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:58:52,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {56598#(<= 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; {56599#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:58:52,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {56599#(<= 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; {56600#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:58:52,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {56600#(<= 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; {56601#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:58:52,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {56601#(<= 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; {56602#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:58:52,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {56602#(<= 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; {56603#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:58:52,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {56603#(<= 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; {56604#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:58:52,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {56604#(<= 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; {56605#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:58:52,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {56605#(<= 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; {56606#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:58:52,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {56606#(<= 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; {56607#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:58:52,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {56607#(<= 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; {56608#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:58:52,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {56608#(<= 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; {56609#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:58:52,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {56609#(<= 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; {56610#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:58:52,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {56610#(<= 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; {56611#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:58:52,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {56611#(<= 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; {56612#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:58:52,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {56612#(<= 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; {56613#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:58:52,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {56613#(<= 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; {56614#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:58:52,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {56614#(<= 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; {56615#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:58:52,306 INFO L290 TraceCheckUtils]: 29: Hoare triple {56615#(<= 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; {56616#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:58:52,307 INFO L290 TraceCheckUtils]: 30: Hoare triple {56616#(<= 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; {56617#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:58:52,307 INFO L290 TraceCheckUtils]: 31: Hoare triple {56617#(<= 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; {56618#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:58:52,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {56618#(<= 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; {56619#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:58:52,308 INFO L290 TraceCheckUtils]: 33: Hoare triple {56619#(<= 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; {56620#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:58:52,308 INFO L290 TraceCheckUtils]: 34: Hoare triple {56620#(<= 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; {56621#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:58:52,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {56621#(<= 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; {56622#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:58:52,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {56622#(<= 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; {56623#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:58:52,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {56623#(<= 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; {56624#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:58:52,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {56624#(<= 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; {56625#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:58:52,311 INFO L290 TraceCheckUtils]: 39: Hoare triple {56625#(<= 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; {56626#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:58:52,311 INFO L290 TraceCheckUtils]: 40: Hoare triple {56626#(<= 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; {56627#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:58:52,312 INFO L290 TraceCheckUtils]: 41: Hoare triple {56627#(<= 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; {56628#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:58:52,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {56628#(<= 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; {56629#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:58:52,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {56629#(<= 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; {56630#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:58:52,313 INFO L290 TraceCheckUtils]: 44: Hoare triple {56630#(<= 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; {56631#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:58:52,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {56631#(<= 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; {56632#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:58:52,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {56632#(<= 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; {56633#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:58:52,315 INFO L290 TraceCheckUtils]: 47: Hoare triple {56633#(<= 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; {56634#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:58:52,315 INFO L290 TraceCheckUtils]: 48: Hoare triple {56634#(<= 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; {56635#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:58:52,316 INFO L290 TraceCheckUtils]: 49: Hoare triple {56635#(<= 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; {56636#(<= 499920 main_~y~0)} is VALID [2022-04-28 03:58:52,316 INFO L290 TraceCheckUtils]: 50: Hoare triple {56636#(<= 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; {56637#(<= 499918 main_~y~0)} is VALID [2022-04-28 03:58:52,316 INFO L290 TraceCheckUtils]: 51: Hoare triple {56637#(<= 499918 main_~y~0)} assume !(~y~0 > 0); {56592#false} is VALID [2022-04-28 03:58:52,317 INFO L272 TraceCheckUtils]: 52: Hoare triple {56592#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {56592#false} is VALID [2022-04-28 03:58:52,317 INFO L290 TraceCheckUtils]: 53: Hoare triple {56592#false} ~cond := #in~cond; {56592#false} is VALID [2022-04-28 03:58:52,317 INFO L290 TraceCheckUtils]: 54: Hoare triple {56592#false} assume 0 == ~cond; {56592#false} is VALID [2022-04-28 03:58:52,317 INFO L290 TraceCheckUtils]: 55: Hoare triple {56592#false} assume !false; {56592#false} is VALID [2022-04-28 03:58:52,317 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-28 03:58:52,317 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:58:54,763 INFO L290 TraceCheckUtils]: 55: Hoare triple {56592#false} assume !false; {56592#false} is VALID [2022-04-28 03:58:54,763 INFO L290 TraceCheckUtils]: 54: Hoare triple {56592#false} assume 0 == ~cond; {56592#false} is VALID [2022-04-28 03:58:54,763 INFO L290 TraceCheckUtils]: 53: Hoare triple {56592#false} ~cond := #in~cond; {56592#false} is VALID [2022-04-28 03:58:54,763 INFO L272 TraceCheckUtils]: 52: Hoare triple {56592#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {56592#false} is VALID [2022-04-28 03:58:54,763 INFO L290 TraceCheckUtils]: 51: Hoare triple {56819#(< 0 main_~y~0)} assume !(~y~0 > 0); {56592#false} is VALID [2022-04-28 03:58:54,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {56823#(< 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; {56819#(< 0 main_~y~0)} is VALID [2022-04-28 03:58:54,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {56827#(< 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; {56823#(< 2 main_~y~0)} is VALID [2022-04-28 03:58:54,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {56831#(< 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; {56827#(< 4 main_~y~0)} is VALID [2022-04-28 03:58:54,766 INFO L290 TraceCheckUtils]: 47: Hoare triple {56835#(< 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; {56831#(< 6 main_~y~0)} is VALID [2022-04-28 03:58:54,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {56839#(< 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; {56835#(< 8 main_~y~0)} is VALID [2022-04-28 03:58:54,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {56843#(< 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; {56839#(< 10 main_~y~0)} is VALID [2022-04-28 03:58:54,768 INFO L290 TraceCheckUtils]: 44: Hoare triple {56847#(< 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; {56843#(< 12 main_~y~0)} is VALID [2022-04-28 03:58:54,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {56851#(< 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; {56847#(< 14 main_~y~0)} is VALID [2022-04-28 03:58:54,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {56855#(< 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; {56851#(< 16 main_~y~0)} is VALID [2022-04-28 03:58:54,769 INFO L290 TraceCheckUtils]: 41: Hoare triple {56859#(< 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; {56855#(< 18 main_~y~0)} is VALID [2022-04-28 03:58:54,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {56863#(< 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; {56859#(< 20 main_~y~0)} is VALID [2022-04-28 03:58:54,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {56867#(< 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; {56863#(< 22 main_~y~0)} is VALID [2022-04-28 03:58:54,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {56871#(< 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; {56867#(< 24 main_~y~0)} is VALID [2022-04-28 03:58:54,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {56875#(< 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; {56871#(< 26 main_~y~0)} is VALID [2022-04-28 03:58:54,772 INFO L290 TraceCheckUtils]: 36: Hoare triple {56879#(< 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; {56875#(< 28 main_~y~0)} is VALID [2022-04-28 03:58:54,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {56883#(< 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; {56879#(< 30 main_~y~0)} is VALID [2022-04-28 03:58:54,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {56887#(< 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; {56883#(< 32 main_~y~0)} is VALID [2022-04-28 03:58:54,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {56891#(< 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; {56887#(< 34 main_~y~0)} is VALID [2022-04-28 03:58:54,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {56895#(< 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; {56891#(< 36 main_~y~0)} is VALID [2022-04-28 03:58:54,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {56899#(< 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; {56895#(< 38 main_~y~0)} is VALID [2022-04-28 03:58:54,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {56903#(< 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; {56899#(< 40 main_~y~0)} is VALID [2022-04-28 03:58:54,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {56907#(< 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; {56903#(< 42 main_~y~0)} is VALID [2022-04-28 03:58:54,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {56911#(< 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; {56907#(< 44 main_~y~0)} is VALID [2022-04-28 03:58:54,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {56915#(< 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; {56911#(< 46 main_~y~0)} is VALID [2022-04-28 03:58:54,777 INFO L290 TraceCheckUtils]: 26: Hoare triple {56919#(< 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; {56915#(< 48 main_~y~0)} is VALID [2022-04-28 03:58:54,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {56923#(< 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; {56919#(< 50 main_~y~0)} is VALID [2022-04-28 03:58:54,778 INFO L290 TraceCheckUtils]: 24: Hoare triple {56927#(< 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; {56923#(< 52 main_~y~0)} is VALID [2022-04-28 03:58:54,778 INFO L290 TraceCheckUtils]: 23: Hoare triple {56931#(< 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; {56927#(< 54 main_~y~0)} is VALID [2022-04-28 03:58:54,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {56935#(< 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; {56931#(< 56 main_~y~0)} is VALID [2022-04-28 03:58:54,779 INFO L290 TraceCheckUtils]: 21: Hoare triple {56939#(< 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; {56935#(< 58 main_~y~0)} is VALID [2022-04-28 03:58:54,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {56943#(< 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; {56939#(< 60 main_~y~0)} is VALID [2022-04-28 03:58:54,780 INFO L290 TraceCheckUtils]: 19: Hoare triple {56947#(< 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; {56943#(< 62 main_~y~0)} is VALID [2022-04-28 03:58:54,781 INFO L290 TraceCheckUtils]: 18: Hoare triple {56951#(< 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; {56947#(< 64 main_~y~0)} is VALID [2022-04-28 03:58:54,781 INFO L290 TraceCheckUtils]: 17: Hoare triple {56955#(< 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; {56951#(< 66 main_~y~0)} is VALID [2022-04-28 03:58:54,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {56959#(< 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; {56955#(< 68 main_~y~0)} is VALID [2022-04-28 03:58:54,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {56963#(< 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; {56959#(< 70 main_~y~0)} is VALID [2022-04-28 03:58:54,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {56967#(< 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; {56963#(< 72 main_~y~0)} is VALID [2022-04-28 03:58:54,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {56971#(< 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; {56967#(< 74 main_~y~0)} is VALID [2022-04-28 03:58:54,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {56975#(< 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; {56971#(< 76 main_~y~0)} is VALID [2022-04-28 03:58:54,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {56979#(< 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; {56975#(< 78 main_~y~0)} is VALID [2022-04-28 03:58:54,784 INFO L290 TraceCheckUtils]: 10: Hoare triple {56983#(< 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; {56979#(< 80 main_~y~0)} is VALID [2022-04-28 03:58:54,785 INFO L290 TraceCheckUtils]: 9: Hoare triple {56983#(< 82 main_~y~0)} [222] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {56983#(< 82 main_~y~0)} is VALID [2022-04-28 03:58:54,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {56983#(< 82 main_~y~0)} [225] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2961 v_main_~x~0_2960)) (.cse1 (= |v_main_#t~post5_284| |v_main_#t~post5_283|)) (.cse2 (= |v_main_#t~post6_284| |v_main_#t~post6_283|)) (.cse3 (= v_main_~y~0_3436 v_main_~y~0_3435)) (.cse4 (<= 500000 v_main_~x~0_2961))) (or (and .cse0 .cse1 .cse2 .cse3) (let ((.cse5 (+ v_main_~x~0_2961 v_main_~y~0_3435))) (and .cse4 (< v_main_~y~0_3436 v_main_~y~0_3435) (= .cse5 (+ v_main_~x~0_2960 v_main_~y~0_3436)) (< .cse5 (+ 1000001 v_main_~y~0_3436)))) (and .cse0 .cse1 .cse2 .cse3 (or (not (< v_main_~x~0_2961 1000000)) (not .cse4))))) InVars {main_~y~0=v_main_~y~0_3436, main_#t~post5=|v_main_#t~post5_284|, main_~x~0=v_main_~x~0_2961, main_#t~post6=|v_main_#t~post6_284|} OutVars{main_~y~0=v_main_~y~0_3435, main_#t~post5=|v_main_#t~post5_283|, main_~x~0=v_main_~x~0_2960, main_#t~post6=|v_main_#t~post6_283|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {56983#(< 82 main_~y~0)} is VALID [2022-04-28 03:58:54,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {56983#(< 82 main_~y~0)} [224] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56983#(< 82 main_~y~0)} is VALID [2022-04-28 03:58:54,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {56983#(< 82 main_~y~0)} [223] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_2959 v_main_~x~0_2958)) (.cse1 (= |v_main_#t~post4_259| |v_main_#t~post4_258|))) (or (and .cse0 .cse1) (and .cse0 .cse1 (not (< v_main_~x~0_2959 500000))) (and (< v_main_~x~0_2958 500001) (< v_main_~x~0_2959 v_main_~x~0_2958)))) InVars {main_~x~0=v_main_~x~0_2959, main_#t~post4=|v_main_#t~post4_259|} OutVars{main_~x~0=v_main_~x~0_2958, main_#t~post4=|v_main_#t~post4_258|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {56983#(< 82 main_~y~0)} is VALID [2022-04-28 03:58:54,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {56591#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {56983#(< 82 main_~y~0)} is VALID [2022-04-28 03:58:54,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {56591#true} call #t~ret9 := main(); {56591#true} is VALID [2022-04-28 03:58:54,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56591#true} {56591#true} #53#return; {56591#true} is VALID [2022-04-28 03:58:54,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {56591#true} assume true; {56591#true} is VALID [2022-04-28 03:58:54,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {56591#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(18, 2);call #Ultimate.allocInit(12, 3); {56591#true} is VALID [2022-04-28 03:58:54,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {56591#true} call ULTIMATE.init(); {56591#true} is VALID [2022-04-28 03:58:54,787 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-28 03:58:54,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728998970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:58:54,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:58:54,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 44, 44] total 87 [2022-04-28 03:58:58,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:58:58,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946012662] [2022-04-28 03:58:58,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946012662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:58:58,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:58:58,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [121] imperfect sequences [] total 121 [2022-04-28 03:58:58,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441183198] [2022-04-28 03:58:58,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:58:58,783 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 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 203 [2022-04-28 03:58:58,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:58:58,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:58:58,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:58:58,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2022-04-28 03:58:58,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:58:58,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2022-04-28 03:58:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10268, Invalid=16138, Unknown=0, NotChecked=0, Total=26406 [2022-04-28 03:58:58,930 INFO L87 Difference]: Start difference. First operand 207 states and 211 transitions. Second operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:21,843 INFO L93 Difference]: Finished difference Result 411 states and 424 transitions. [2022-04-28 03:59:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2022-04-28 03:59:21,843 INFO L78 Accepts]: Start accepts. Automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 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 203 [2022-04-28 03:59:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 03:59:21,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:21,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 233 transitions. [2022-04-28 03:59:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:21,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 233 transitions. [2022-04-28 03:59:21,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 233 transitions. [2022-04-28 03:59:22,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 233 edges. 233 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:22,038 INFO L225 Difference]: With dead ends: 411 [2022-04-28 03:59:22,038 INFO L226 Difference]: Without dead ends: 212 [2022-04-28 03:59:22,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 150 SyntacticMatches, 2 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23000 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=23952, Invalid=54728, Unknown=0, NotChecked=0, Total=78680 [2022-04-28 03:59:22,045 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 11540 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 11981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 11540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2022-04-28 03:59:22,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 47 Invalid, 11981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 11540 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2022-04-28 03:59:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-28 03:59:22,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-04-28 03:59:22,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 03:59:22,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:59:22,374 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:59:22,374 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:59:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:22,376 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-28 03:59:22,376 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:59:22,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:22,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:22,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 212 states. [2022-04-28 03:59:22,376 INFO L87 Difference]: Start difference. First operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 212 states. [2022-04-28 03:59:22,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 03:59:22,381 INFO L93 Difference]: Finished difference Result 212 states and 216 transitions. [2022-04-28 03:59:22,381 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:59:22,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 03:59:22,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 03:59:22,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 03:59:22,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 03:59:22,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 205 states have (on average 1.024390243902439) internal successors, (210), 206 states have internal predecessors, (210), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 03:59:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 216 transitions. [2022-04-28 03:59:22,385 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 216 transitions. Word has length 203 [2022-04-28 03:59:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 03:59:22,386 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 216 transitions. [2022-04-28 03:59:22,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 1.6446280991735538) internal successors, (199), 120 states have internal predecessors, (199), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:22,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 212 states and 216 transitions. [2022-04-28 03:59:22,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:22,574 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 216 transitions. [2022-04-28 03:59:22,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2022-04-28 03:59:22,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 03:59:22,575 INFO L195 NwaCegarLoop]: trace histogram [77, 76, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 03:59:22,591 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-28 03:59:22,779 WARN L477 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-28 03:59:22,779 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 03:59:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 03:59:22,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1904809707, now seen corresponding path program 42 times [2022-04-28 03:59:22,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:22,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1384299133] [2022-04-28 03:59:22,892 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-28 03:59:23,119 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-28 03:59:23,121 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 03:59:23,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1730263874, now seen corresponding path program 1 times [2022-04-28 03:59:23,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 03:59:23,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042745936] [2022-04-28 03:59:23,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:23,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 03:59:23,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:24,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 03:59:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:24,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {59049#(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(18, 2);call #Ultimate.allocInit(12, 3); {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {58998#true} assume true; {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {58998#true} {58998#true} #53#return; {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {58998#true} call ULTIMATE.init(); {59049#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 03:59:24,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {59049#(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(18, 2);call #Ultimate.allocInit(12, 3); {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {58998#true} assume true; {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58998#true} {58998#true} #53#return; {58998#true} is VALID [2022-04-28 03:59:24,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {58998#true} call #t~ret9 := main(); {58998#true} is VALID [2022-04-28 03:59:24,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {58998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59003#(and (<= 500000 main_~y~0) (= main_~x~0 0))} is VALID [2022-04-28 03:59:24,231 INFO L290 TraceCheckUtils]: 6: Hoare triple {59003#(and (<= 500000 main_~y~0) (= main_~x~0 0))} [227] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3091 v_main_~x~0_3090)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and (< v_main_~x~0_3091 v_main_~x~0_3090) (< v_main_~x~0_3090 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_3091) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3091, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3090, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59004#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:59:24,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {59004#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [228] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59004#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:59:24,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {59004#(and (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [229] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3093)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~y~0_3601 v_main_~y~0_3600)) (.cse3 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and .cse0 (= (+ v_main_~x~0_3092 v_main_~y~0_3601) (+ v_main_~x~0_3093 v_main_~y~0_3600)) (< v_main_~x~0_3092 1000001) (< v_main_~x~0_3093 v_main_~x~0_3092)) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 (or (not .cse0) (not (< v_main_~x~0_3093 1000000))) .cse2 .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3601, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3093, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3600, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3092, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59005#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} is VALID [2022-04-28 03:59:24,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {59005#(or (<= 500000 main_~y~0) (<= main_~x~0 main_~y~0))} [226] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {59006#(<= 500000 main_~y~0)} is VALID [2022-04-28 03:59:24,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {59006#(<= 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; {59007#(<= 499998 main_~y~0)} is VALID [2022-04-28 03:59:24,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {59007#(<= 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; {59008#(<= 499996 main_~y~0)} is VALID [2022-04-28 03:59:24,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {59008#(<= 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; {59009#(<= 499994 main_~y~0)} is VALID [2022-04-28 03:59:24,235 INFO L290 TraceCheckUtils]: 13: Hoare triple {59009#(<= 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; {59010#(<= 499992 main_~y~0)} is VALID [2022-04-28 03:59:24,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {59010#(<= 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; {59011#(<= 499990 main_~y~0)} is VALID [2022-04-28 03:59:24,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {59011#(<= 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; {59012#(<= 499988 main_~y~0)} is VALID [2022-04-28 03:59:24,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {59012#(<= 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; {59013#(<= 499986 main_~y~0)} is VALID [2022-04-28 03:59:24,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {59013#(<= 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; {59014#(<= 499984 main_~y~0)} is VALID [2022-04-28 03:59:24,237 INFO L290 TraceCheckUtils]: 18: Hoare triple {59014#(<= 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; {59015#(<= 499982 main_~y~0)} is VALID [2022-04-28 03:59:24,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {59015#(<= 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; {59016#(<= 499980 main_~y~0)} is VALID [2022-04-28 03:59:24,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {59016#(<= 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; {59017#(<= 499978 main_~y~0)} is VALID [2022-04-28 03:59:24,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {59017#(<= 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; {59018#(<= 499976 main_~y~0)} is VALID [2022-04-28 03:59:24,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {59018#(<= 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; {59019#(<= 499974 main_~y~0)} is VALID [2022-04-28 03:59:24,239 INFO L290 TraceCheckUtils]: 23: Hoare triple {59019#(<= 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; {59020#(<= 499972 main_~y~0)} is VALID [2022-04-28 03:59:24,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {59020#(<= 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; {59021#(<= 499970 main_~y~0)} is VALID [2022-04-28 03:59:24,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {59021#(<= 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; {59022#(<= 499968 main_~y~0)} is VALID [2022-04-28 03:59:24,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {59022#(<= 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; {59023#(<= 499966 main_~y~0)} is VALID [2022-04-28 03:59:24,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {59023#(<= 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; {59024#(<= 499964 main_~y~0)} is VALID [2022-04-28 03:59:24,242 INFO L290 TraceCheckUtils]: 28: Hoare triple {59024#(<= 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; {59025#(<= 499962 main_~y~0)} is VALID [2022-04-28 03:59:24,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {59025#(<= 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; {59026#(<= 499960 main_~y~0)} is VALID [2022-04-28 03:59:24,243 INFO L290 TraceCheckUtils]: 30: Hoare triple {59026#(<= 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; {59027#(<= 499958 main_~y~0)} is VALID [2022-04-28 03:59:24,243 INFO L290 TraceCheckUtils]: 31: Hoare triple {59027#(<= 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; {59028#(<= 499956 main_~y~0)} is VALID [2022-04-28 03:59:24,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {59028#(<= 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; {59029#(<= 499954 main_~y~0)} is VALID [2022-04-28 03:59:24,244 INFO L290 TraceCheckUtils]: 33: Hoare triple {59029#(<= 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; {59030#(<= 499952 main_~y~0)} is VALID [2022-04-28 03:59:24,244 INFO L290 TraceCheckUtils]: 34: Hoare triple {59030#(<= 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; {59031#(<= 499950 main_~y~0)} is VALID [2022-04-28 03:59:24,245 INFO L290 TraceCheckUtils]: 35: Hoare triple {59031#(<= 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; {59032#(<= 499948 main_~y~0)} is VALID [2022-04-28 03:59:24,245 INFO L290 TraceCheckUtils]: 36: Hoare triple {59032#(<= 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; {59033#(<= 499946 main_~y~0)} is VALID [2022-04-28 03:59:24,246 INFO L290 TraceCheckUtils]: 37: Hoare triple {59033#(<= 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; {59034#(<= 499944 main_~y~0)} is VALID [2022-04-28 03:59:24,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {59034#(<= 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; {59035#(<= 499942 main_~y~0)} is VALID [2022-04-28 03:59:24,247 INFO L290 TraceCheckUtils]: 39: Hoare triple {59035#(<= 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; {59036#(<= 499940 main_~y~0)} is VALID [2022-04-28 03:59:24,247 INFO L290 TraceCheckUtils]: 40: Hoare triple {59036#(<= 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; {59037#(<= 499938 main_~y~0)} is VALID [2022-04-28 03:59:24,248 INFO L290 TraceCheckUtils]: 41: Hoare triple {59037#(<= 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; {59038#(<= 499936 main_~y~0)} is VALID [2022-04-28 03:59:24,248 INFO L290 TraceCheckUtils]: 42: Hoare triple {59038#(<= 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; {59039#(<= 499934 main_~y~0)} is VALID [2022-04-28 03:59:24,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {59039#(<= 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; {59040#(<= 499932 main_~y~0)} is VALID [2022-04-28 03:59:24,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {59040#(<= 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; {59041#(<= 499930 main_~y~0)} is VALID [2022-04-28 03:59:24,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {59041#(<= 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; {59042#(<= 499928 main_~y~0)} is VALID [2022-04-28 03:59:24,250 INFO L290 TraceCheckUtils]: 46: Hoare triple {59042#(<= 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; {59043#(<= 499926 main_~y~0)} is VALID [2022-04-28 03:59:24,250 INFO L290 TraceCheckUtils]: 47: Hoare triple {59043#(<= 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; {59044#(<= 499924 main_~y~0)} is VALID [2022-04-28 03:59:24,251 INFO L290 TraceCheckUtils]: 48: Hoare triple {59044#(<= 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; {59045#(<= 499922 main_~y~0)} is VALID [2022-04-28 03:59:24,251 INFO L290 TraceCheckUtils]: 49: Hoare triple {59045#(<= 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; {59046#(<= 499920 main_~y~0)} is VALID [2022-04-28 03:59:24,252 INFO L290 TraceCheckUtils]: 50: Hoare triple {59046#(<= 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; {59047#(<= 499918 main_~y~0)} is VALID [2022-04-28 03:59:24,252 INFO L290 TraceCheckUtils]: 51: Hoare triple {59047#(<= 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; {59048#(<= 499916 main_~y~0)} is VALID [2022-04-28 03:59:24,253 INFO L290 TraceCheckUtils]: 52: Hoare triple {59048#(<= 499916 main_~y~0)} assume !(~y~0 > 0); {58999#false} is VALID [2022-04-28 03:59:24,253 INFO L272 TraceCheckUtils]: 53: Hoare triple {58999#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {58999#false} is VALID [2022-04-28 03:59:24,253 INFO L290 TraceCheckUtils]: 54: Hoare triple {58999#false} ~cond := #in~cond; {58999#false} is VALID [2022-04-28 03:59:24,253 INFO L290 TraceCheckUtils]: 55: Hoare triple {58999#false} assume 0 == ~cond; {58999#false} is VALID [2022-04-28 03:59:24,253 INFO L290 TraceCheckUtils]: 56: Hoare triple {58999#false} assume !false; {58999#false} is VALID [2022-04-28 03:59:24,253 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:24,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 03:59:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042745936] [2022-04-28 03:59:24,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042745936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 03:59:24,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579472858] [2022-04-28 03:59:24,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 03:59:24,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 03:59:24,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 03:59:24,254 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-28 03:59:24,255 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-28 03:59:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:24,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-28 03:59:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 03:59:24,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 03:59:25,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {58998#true} call ULTIMATE.init(); {58998#true} is VALID [2022-04-28 03:59:25,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {58998#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(18, 2);call #Ultimate.allocInit(12, 3); {58998#true} is VALID [2022-04-28 03:59:25,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {58998#true} assume true; {58998#true} is VALID [2022-04-28 03:59:25,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58998#true} {58998#true} #53#return; {58998#true} is VALID [2022-04-28 03:59:25,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {58998#true} call #t~ret9 := main(); {58998#true} is VALID [2022-04-28 03:59:25,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {58998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59068#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} is VALID [2022-04-28 03:59:25,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {59068#(and (<= 500000 main_~y~0) (<= main_~x~0 0))} [227] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3091 v_main_~x~0_3090)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and (< v_main_~x~0_3091 v_main_~x~0_3090) (< v_main_~x~0_3090 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_3091) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3091, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3090, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59072#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:25,851 INFO L290 TraceCheckUtils]: 7: Hoare triple {59072#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [228] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59072#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} is VALID [2022-04-28 03:59:25,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {59072#(and (<= 500000 main_~y~0) (< main_~x~0 500001))} [229] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3093)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~y~0_3601 v_main_~y~0_3600)) (.cse3 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and .cse0 (= (+ v_main_~x~0_3092 v_main_~y~0_3601) (+ v_main_~x~0_3093 v_main_~y~0_3600)) (< v_main_~x~0_3092 1000001) (< v_main_~x~0_3093 v_main_~x~0_3092)) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 (or (not .cse0) (not (< v_main_~x~0_3093 1000000))) .cse2 .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3601, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3093, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3600, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3092, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59079#(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-28 03:59:25,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {59079#(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)))} [226] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {59083#(< 999999 main_~y~0)} is VALID [2022-04-28 03:59:25,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {59083#(< 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; {59087#(< 999997 main_~y~0)} is VALID [2022-04-28 03:59:25,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {59087#(< 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; {59091#(< 999995 main_~y~0)} is VALID [2022-04-28 03:59:25,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {59091#(< 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; {59095#(< 999993 main_~y~0)} is VALID [2022-04-28 03:59:25,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {59095#(< 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; {59099#(< 999991 main_~y~0)} is VALID [2022-04-28 03:59:25,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {59099#(< 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; {59103#(< 999989 main_~y~0)} is VALID [2022-04-28 03:59:25,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {59103#(< 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; {59107#(< 999987 main_~y~0)} is VALID [2022-04-28 03:59:25,856 INFO L290 TraceCheckUtils]: 16: Hoare triple {59107#(< 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; {59111#(< 999985 main_~y~0)} is VALID [2022-04-28 03:59:25,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {59111#(< 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; {59115#(< 999983 main_~y~0)} is VALID [2022-04-28 03:59:25,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {59115#(< 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; {59119#(< 999981 main_~y~0)} is VALID [2022-04-28 03:59:25,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {59119#(< 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; {59123#(< 999979 main_~y~0)} is VALID [2022-04-28 03:59:25,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {59123#(< 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; {59127#(< 999977 main_~y~0)} is VALID [2022-04-28 03:59:25,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {59127#(< 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; {59131#(< 999975 main_~y~0)} is VALID [2022-04-28 03:59:25,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {59131#(< 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; {59135#(< 999973 main_~y~0)} is VALID [2022-04-28 03:59:25,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {59135#(< 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; {59139#(< 999971 main_~y~0)} is VALID [2022-04-28 03:59:25,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {59139#(< 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; {59143#(< 999969 main_~y~0)} is VALID [2022-04-28 03:59:25,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {59143#(< 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; {59147#(< 999967 main_~y~0)} is VALID [2022-04-28 03:59:25,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {59147#(< 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; {59151#(< 999965 main_~y~0)} is VALID [2022-04-28 03:59:25,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {59151#(< 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; {59155#(< 999963 main_~y~0)} is VALID [2022-04-28 03:59:25,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {59155#(< 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; {59159#(< 999961 main_~y~0)} is VALID [2022-04-28 03:59:25,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {59159#(< 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; {59163#(< 999959 main_~y~0)} is VALID [2022-04-28 03:59:25,862 INFO L290 TraceCheckUtils]: 30: Hoare triple {59163#(< 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; {59167#(< 999957 main_~y~0)} is VALID [2022-04-28 03:59:25,863 INFO L290 TraceCheckUtils]: 31: Hoare triple {59167#(< 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; {59171#(< 999955 main_~y~0)} is VALID [2022-04-28 03:59:25,863 INFO L290 TraceCheckUtils]: 32: Hoare triple {59171#(< 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; {59175#(< 999953 main_~y~0)} is VALID [2022-04-28 03:59:25,864 INFO L290 TraceCheckUtils]: 33: Hoare triple {59175#(< 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; {59179#(< 999951 main_~y~0)} is VALID [2022-04-28 03:59:25,864 INFO L290 TraceCheckUtils]: 34: Hoare triple {59179#(< 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; {59183#(< 999949 main_~y~0)} is VALID [2022-04-28 03:59:25,865 INFO L290 TraceCheckUtils]: 35: Hoare triple {59183#(< 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; {59187#(< 999947 main_~y~0)} is VALID [2022-04-28 03:59:25,865 INFO L290 TraceCheckUtils]: 36: Hoare triple {59187#(< 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; {59191#(< 999945 main_~y~0)} is VALID [2022-04-28 03:59:25,866 INFO L290 TraceCheckUtils]: 37: Hoare triple {59191#(< 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; {59195#(< 999943 main_~y~0)} is VALID [2022-04-28 03:59:25,866 INFO L290 TraceCheckUtils]: 38: Hoare triple {59195#(< 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; {59199#(< 999941 main_~y~0)} is VALID [2022-04-28 03:59:25,866 INFO L290 TraceCheckUtils]: 39: Hoare triple {59199#(< 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; {59203#(< 999939 main_~y~0)} is VALID [2022-04-28 03:59:25,867 INFO L290 TraceCheckUtils]: 40: Hoare triple {59203#(< 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; {59207#(< 999937 main_~y~0)} is VALID [2022-04-28 03:59:25,867 INFO L290 TraceCheckUtils]: 41: Hoare triple {59207#(< 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; {59211#(< 999935 main_~y~0)} is VALID [2022-04-28 03:59:25,868 INFO L290 TraceCheckUtils]: 42: Hoare triple {59211#(< 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; {59215#(< 999933 main_~y~0)} is VALID [2022-04-28 03:59:25,868 INFO L290 TraceCheckUtils]: 43: Hoare triple {59215#(< 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; {59219#(< 999931 main_~y~0)} is VALID [2022-04-28 03:59:25,869 INFO L290 TraceCheckUtils]: 44: Hoare triple {59219#(< 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; {59223#(< 999929 main_~y~0)} is VALID [2022-04-28 03:59:25,869 INFO L290 TraceCheckUtils]: 45: Hoare triple {59223#(< 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; {59227#(< 999927 main_~y~0)} is VALID [2022-04-28 03:59:25,870 INFO L290 TraceCheckUtils]: 46: Hoare triple {59227#(< 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; {59231#(< 999925 main_~y~0)} is VALID [2022-04-28 03:59:25,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {59231#(< 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; {59235#(< 999923 main_~y~0)} is VALID [2022-04-28 03:59:25,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {59235#(< 999923 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~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#(< 999921 main_~y~0)} is VALID [2022-04-28 03:59:25,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {59239#(< 999921 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~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#(< 999919 main_~y~0)} is VALID [2022-04-28 03:59:25,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {59243#(< 999919 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~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#(< 999917 main_~y~0)} is VALID [2022-04-28 03:59:25,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {59247#(< 999917 main_~y~0)} assume !!(~y~0 > 0);#t~post7 := ~x~0;~x~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#(< 999915 main_~y~0)} is VALID [2022-04-28 03:59:25,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {59251#(< 999915 main_~y~0)} assume !(~y~0 > 0); {58999#false} is VALID [2022-04-28 03:59:25,872 INFO L272 TraceCheckUtils]: 53: Hoare triple {58999#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {58999#false} is VALID [2022-04-28 03:59:25,873 INFO L290 TraceCheckUtils]: 54: Hoare triple {58999#false} ~cond := #in~cond; {58999#false} is VALID [2022-04-28 03:59:25,873 INFO L290 TraceCheckUtils]: 55: Hoare triple {58999#false} assume 0 == ~cond; {58999#false} is VALID [2022-04-28 03:59:25,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {58999#false} assume !false; {58999#false} is VALID [2022-04-28 03:59:25,873 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:25,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 03:59:28,834 INFO L290 TraceCheckUtils]: 56: Hoare triple {58999#false} assume !false; {58999#false} is VALID [2022-04-28 03:59:28,834 INFO L290 TraceCheckUtils]: 55: Hoare triple {58999#false} assume 0 == ~cond; {58999#false} is VALID [2022-04-28 03:59:28,834 INFO L290 TraceCheckUtils]: 54: Hoare triple {58999#false} ~cond := #in~cond; {58999#false} is VALID [2022-04-28 03:59:28,835 INFO L272 TraceCheckUtils]: 53: Hoare triple {58999#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {58999#false} is VALID [2022-04-28 03:59:28,835 INFO L290 TraceCheckUtils]: 52: Hoare triple {59279#(< 0 main_~y~0)} assume !(~y~0 > 0); {58999#false} is VALID [2022-04-28 03:59:28,835 INFO L290 TraceCheckUtils]: 51: Hoare triple {59283#(< 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; {59279#(< 0 main_~y~0)} is VALID [2022-04-28 03:59:28,836 INFO L290 TraceCheckUtils]: 50: Hoare triple {59287#(< 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; {59283#(< 2 main_~y~0)} is VALID [2022-04-28 03:59:28,836 INFO L290 TraceCheckUtils]: 49: Hoare triple {59291#(< 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; {59287#(< 4 main_~y~0)} is VALID [2022-04-28 03:59:28,837 INFO L290 TraceCheckUtils]: 48: Hoare triple {59295#(< 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; {59291#(< 6 main_~y~0)} is VALID [2022-04-28 03:59:28,837 INFO L290 TraceCheckUtils]: 47: Hoare triple {59299#(< 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; {59295#(< 8 main_~y~0)} is VALID [2022-04-28 03:59:28,838 INFO L290 TraceCheckUtils]: 46: Hoare triple {59303#(< 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; {59299#(< 10 main_~y~0)} is VALID [2022-04-28 03:59:28,838 INFO L290 TraceCheckUtils]: 45: Hoare triple {59307#(< 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; {59303#(< 12 main_~y~0)} is VALID [2022-04-28 03:59:28,839 INFO L290 TraceCheckUtils]: 44: Hoare triple {59311#(< 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; {59307#(< 14 main_~y~0)} is VALID [2022-04-28 03:59:28,839 INFO L290 TraceCheckUtils]: 43: Hoare triple {59315#(< 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; {59311#(< 16 main_~y~0)} is VALID [2022-04-28 03:59:28,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {59319#(< 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; {59315#(< 18 main_~y~0)} is VALID [2022-04-28 03:59:28,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {59323#(< 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; {59319#(< 20 main_~y~0)} is VALID [2022-04-28 03:59:28,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {59327#(< 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; {59323#(< 22 main_~y~0)} is VALID [2022-04-28 03:59:28,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {59331#(< 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; {59327#(< 24 main_~y~0)} is VALID [2022-04-28 03:59:28,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {59335#(< 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; {59331#(< 26 main_~y~0)} is VALID [2022-04-28 03:59:28,842 INFO L290 TraceCheckUtils]: 37: Hoare triple {59339#(< 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; {59335#(< 28 main_~y~0)} is VALID [2022-04-28 03:59:28,842 INFO L290 TraceCheckUtils]: 36: Hoare triple {59343#(< 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; {59339#(< 30 main_~y~0)} is VALID [2022-04-28 03:59:28,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {59347#(< 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; {59343#(< 32 main_~y~0)} is VALID [2022-04-28 03:59:28,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {59351#(< 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; {59347#(< 34 main_~y~0)} is VALID [2022-04-28 03:59:28,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {59355#(< 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; {59351#(< 36 main_~y~0)} is VALID [2022-04-28 03:59:28,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {59359#(< 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; {59355#(< 38 main_~y~0)} is VALID [2022-04-28 03:59:28,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {59363#(< 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; {59359#(< 40 main_~y~0)} is VALID [2022-04-28 03:59:28,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {59367#(< 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; {59363#(< 42 main_~y~0)} is VALID [2022-04-28 03:59:28,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {59371#(< 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; {59367#(< 44 main_~y~0)} is VALID [2022-04-28 03:59:28,846 INFO L290 TraceCheckUtils]: 28: Hoare triple {59375#(< 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; {59371#(< 46 main_~y~0)} is VALID [2022-04-28 03:59:28,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {59379#(< 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; {59375#(< 48 main_~y~0)} is VALID [2022-04-28 03:59:28,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {59383#(< 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; {59379#(< 50 main_~y~0)} is VALID [2022-04-28 03:59:28,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {59387#(< 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; {59383#(< 52 main_~y~0)} is VALID [2022-04-28 03:59:28,848 INFO L290 TraceCheckUtils]: 24: Hoare triple {59391#(< 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; {59387#(< 54 main_~y~0)} is VALID [2022-04-28 03:59:28,848 INFO L290 TraceCheckUtils]: 23: Hoare triple {59395#(< 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; {59391#(< 56 main_~y~0)} is VALID [2022-04-28 03:59:28,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {59399#(< 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; {59395#(< 58 main_~y~0)} is VALID [2022-04-28 03:59:28,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {59403#(< 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; {59399#(< 60 main_~y~0)} is VALID [2022-04-28 03:59:28,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {59407#(< 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; {59403#(< 62 main_~y~0)} is VALID [2022-04-28 03:59:28,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {59411#(< 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; {59407#(< 64 main_~y~0)} is VALID [2022-04-28 03:59:28,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {59415#(< 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; {59411#(< 66 main_~y~0)} is VALID [2022-04-28 03:59:28,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {59419#(< 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; {59415#(< 68 main_~y~0)} is VALID [2022-04-28 03:59:28,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {59423#(< 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; {59419#(< 70 main_~y~0)} is VALID [2022-04-28 03:59:28,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {59427#(< 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; {59423#(< 72 main_~y~0)} is VALID [2022-04-28 03:59:28,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {59431#(< 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; {59427#(< 74 main_~y~0)} is VALID [2022-04-28 03:59:28,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {59435#(< 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; {59431#(< 76 main_~y~0)} is VALID [2022-04-28 03:59:28,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {59439#(< 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; {59435#(< 78 main_~y~0)} is VALID [2022-04-28 03:59:28,854 INFO L290 TraceCheckUtils]: 11: Hoare triple {59443#(< 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; {59439#(< 80 main_~y~0)} is VALID [2022-04-28 03:59:28,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {59447#(< 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; {59443#(< 82 main_~y~0)} is VALID [2022-04-28 03:59:28,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {59451#(or (< 84 main_~y~0) (< main_~x~0 1000000))} [226] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {59447#(< 84 main_~y~0)} is VALID [2022-04-28 03:59:28,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {59455#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} [229] L10-2-->L17-1_primed: Formula: (let ((.cse0 (<= 500000 v_main_~x~0_3093)) (.cse1 (= |v_main_#t~post6_291| |v_main_#t~post6_290|)) (.cse2 (= v_main_~y~0_3601 v_main_~y~0_3600)) (.cse3 (= v_main_~x~0_3093 v_main_~x~0_3092))) (or (and .cse0 (= (+ v_main_~x~0_3092 v_main_~y~0_3601) (+ v_main_~x~0_3093 v_main_~y~0_3600)) (< v_main_~x~0_3092 1000001) (< v_main_~x~0_3093 v_main_~x~0_3092)) (and (= |v_main_#t~post5_290| |v_main_#t~post5_291|) .cse1 (or (not .cse0) (not (< v_main_~x~0_3093 1000000))) .cse2 .cse3) (and (= |v_main_#t~post5_291| |v_main_#t~post5_290|) .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_3601, main_#t~post5=|v_main_#t~post5_291|, main_~x~0=v_main_~x~0_3093, main_#t~post6=|v_main_#t~post6_291|} OutVars{main_~y~0=v_main_~y~0_3600, main_#t~post5=|v_main_#t~post5_290|, main_~x~0=v_main_~x~0_3092, main_#t~post6=|v_main_#t~post6_290|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {59451#(or (< 84 main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-28 03:59:28,856 INFO L290 TraceCheckUtils]: 7: Hoare triple {59455#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} [228] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {59455#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:59:28,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {59462#(and (<= 0 (+ main_~y~0 499915)) (or (< 84 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999916 main_~y~0))))} [227] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= v_main_~x~0_3091 v_main_~x~0_3090)) (.cse1 (= |v_main_#t~post4_265| |v_main_#t~post4_264|))) (or (and (< v_main_~x~0_3091 v_main_~x~0_3090) (< v_main_~x~0_3090 500001)) (and .cse0 .cse1) (and (<= 500000 v_main_~x~0_3091) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3091, main_#t~post4=|v_main_#t~post4_265|} OutVars{main_~x~0=v_main_~x~0_3090, main_#t~post4=|v_main_#t~post4_264|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {59455#(and (or (<= 1000000 main_~x~0) (not (<= 500000 main_~x~0)) (< main_~x~0 (+ 999916 main_~y~0))) (or (< 84 main_~y~0) (< main_~x~0 1000000)))} is VALID [2022-04-28 03:59:28,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {58998#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {59462#(and (<= 0 (+ main_~y~0 499915)) (or (< 84 main_~y~0) (< main_~x~0 1000000)) (or (<= 1000000 main_~x~0) (< main_~x~0 (+ 999916 main_~y~0))))} is VALID [2022-04-28 03:59:28,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {58998#true} call #t~ret9 := main(); {58998#true} is VALID [2022-04-28 03:59:28,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {58998#true} {58998#true} #53#return; {58998#true} is VALID [2022-04-28 03:59:28,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {58998#true} assume true; {58998#true} is VALID [2022-04-28 03:59:28,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {58998#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(18, 2);call #Ultimate.allocInit(12, 3); {58998#true} is VALID [2022-04-28 03:59:28,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {58998#true} call ULTIMATE.init(); {58998#true} is VALID [2022-04-28 03:59:28,858 INFO L134 CoverageAnalysis]: Checked inductivity of 905 backedges. 0 proven. 905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 03:59:28,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579472858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 03:59:28,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 03:59:28,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 141 [2022-04-28 03:59:34,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 03:59:34,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1384299133] [2022-04-28 03:59:34,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1384299133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 03:59:34,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 03:59:34,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [124] imperfect sequences [] total 124 [2022-04-28 03:59:34,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610095978] [2022-04-28 03:59:34,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 03:59:34,398 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 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 208 [2022-04-28 03:59:34,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 03:59:34,398 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 03:59:34,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 03:59:34,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 124 states [2022-04-28 03:59:34,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 03:59:34,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2022-04-28 03:59:34,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16641, Invalid=31101, Unknown=0, NotChecked=0, Total=47742 [2022-04-28 03:59:34,551 INFO L87 Difference]: Start difference. First operand 212 states and 216 transitions. Second operand has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:01,392 INFO L93 Difference]: Finished difference Result 571 states and 584 transitions. [2022-04-28 04:00:01,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2022-04-28 04:00:01,393 INFO L78 Accepts]: Start accepts. Automaton has has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 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 208 [2022-04-28 04:00:01,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:00:01,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:01,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 238 transitions. [2022-04-28 04:00:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 238 transitions. [2022-04-28 04:00:01,396 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 238 transitions. [2022-04-28 04:00:01,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:01,595 INFO L225 Difference]: With dead ends: 571 [2022-04-28 04:00:01,595 INFO L226 Difference]: Without dead ends: 367 [2022-04-28 04:00:01,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 338 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39626 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=31444, Invalid=83816, Unknown=0, NotChecked=0, Total=115260 [2022-04-28 04:00:01,602 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 409 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 12584 mSolverCounterSat, 449 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 13033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 449 IncrementalHoareTripleChecker+Valid, 12584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:00:01,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 77 Invalid, 13033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [449 Valid, 12584 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-04-28 04:00:01,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2022-04-28 04:00:02,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2022-04-28 04:00:02,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:00:02,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 367 states. Second operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:00:02,285 INFO L74 IsIncluded]: Start isIncluded. First operand 367 states. Second operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:00:02,285 INFO L87 Difference]: Start difference. First operand 367 states. Second operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:00:02,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:02,289 INFO L93 Difference]: Finished difference Result 367 states and 372 transitions. [2022-04-28 04:00:02,289 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 372 transitions. [2022-04-28 04:00:02,290 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:02,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:02,290 INFO L74 IsIncluded]: Start isIncluded. First operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 367 states. [2022-04-28 04:00:02,290 INFO L87 Difference]: Start difference. First operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 367 states. [2022-04-28 04:00:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:00:02,294 INFO L93 Difference]: Finished difference Result 367 states and 372 transitions. [2022-04-28 04:00:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 372 transitions. [2022-04-28 04:00:02,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:00:02,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:00:02,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:00:02,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:00:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 360 states have (on average 1.0166666666666666) internal successors, (366), 361 states have internal predecessors, (366), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:00:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 372 transitions. [2022-04-28 04:00:02,300 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 372 transitions. Word has length 208 [2022-04-28 04:00:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:00:02,300 INFO L495 AbstractCegarLoop]: Abstraction has 367 states and 372 transitions. [2022-04-28 04:00:02,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 124 states, 124 states have (on average 1.6451612903225807) internal successors, (204), 123 states have internal predecessors, (204), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:02,300 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 367 states and 372 transitions. [2022-04-28 04:00:02,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 372 edges. 372 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:02,602 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 372 transitions. [2022-04-28 04:00:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2022-04-28 04:00:02,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:00:02,615 INFO L195 NwaCegarLoop]: trace histogram [78, 77, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:00:02,632 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-28 04:00:02,815 WARN L477 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-28 04:00:02,815 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:00:02,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:00:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash -60538295, now seen corresponding path program 43 times [2022-04-28 04:00:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:02,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1309676879] [2022-04-28 04:00:06,886 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:00:06,935 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-28 04:00:07,152 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-28 04:00:07,153 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:00:07,155 INFO L85 PathProgramCache]: Analyzing trace with hash 159496673, now seen corresponding path program 1 times [2022-04-28 04:00:07,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:00:07,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925927700] [2022-04-28 04:00:07,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:07,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:00:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:08,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:00:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:08,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {62462#(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(18, 2);call #Ultimate.allocInit(12, 3); {62413#true} is VALID [2022-04-28 04:00:08,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {62413#true} assume true; {62413#true} is VALID [2022-04-28 04:00:08,228 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62413#true} {62413#true} #53#return; {62413#true} is VALID [2022-04-28 04:00:08,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {62413#true} call ULTIMATE.init(); {62462#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:00:08,231 INFO L290 TraceCheckUtils]: 1: Hoare triple {62462#(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(18, 2);call #Ultimate.allocInit(12, 3); {62413#true} is VALID [2022-04-28 04:00:08,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {62413#true} assume true; {62413#true} is VALID [2022-04-28 04:00:08,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62413#true} {62413#true} #53#return; {62413#true} is VALID [2022-04-28 04:00:08,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {62413#true} call #t~ret9 := main(); {62413#true} is VALID [2022-04-28 04:00:08,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {62413#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {62418#(<= 500000 main_~y~0)} [231] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_272| |v_main_#t~post4_271|)) (.cse1 (= v_main_~x~0_3227 v_main_~x~0_3226))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3226 500001) (< v_main_~x~0_3227 v_main_~x~0_3226)) (and (not (< v_main_~x~0_3227 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3227, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3226, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {62418#(<= 500000 main_~y~0)} [232] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {62418#(<= 500000 main_~y~0)} [233] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3229)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse3 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse4 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (let ((.cse0 (+ v_main_~x~0_3229 v_main_~y~0_3769))) (and (= (+ v_main_~x~0_3228 v_main_~y~0_3770) .cse0) (< .cse0 (+ 1000001 v_main_~y~0_3770)) .cse1 (< v_main_~y~0_3770 v_main_~y~0_3769))) (and .cse2 .cse3 (= v_main_~y~0_3769 v_main_~y~0_3770) (or (not (< v_main_~x~0_3229 1000000)) (not .cse1)) .cse4) (and .cse2 .cse3 (= v_main_~y~0_3770 v_main_~y~0_3769) .cse4))) InVars {main_~y~0=v_main_~y~0_3770, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3229, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3769, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3228, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {62418#(<= 500000 main_~y~0)} [230] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,239 INFO L290 TraceCheckUtils]: 10: Hoare triple {62418#(<= 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; {62419#(<= 499998 main_~y~0)} is VALID [2022-04-28 04:00:08,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {62419#(<= 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; {62420#(<= 499996 main_~y~0)} is VALID [2022-04-28 04:00:08,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {62420#(<= 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; {62421#(<= 499994 main_~y~0)} is VALID [2022-04-28 04:00:08,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {62421#(<= 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; {62422#(<= 499992 main_~y~0)} is VALID [2022-04-28 04:00:08,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {62422#(<= 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; {62423#(<= 499990 main_~y~0)} is VALID [2022-04-28 04:00:08,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {62423#(<= 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; {62424#(<= 499988 main_~y~0)} is VALID [2022-04-28 04:00:08,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {62424#(<= 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; {62425#(<= 499986 main_~y~0)} is VALID [2022-04-28 04:00:08,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {62425#(<= 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; {62426#(<= 499984 main_~y~0)} is VALID [2022-04-28 04:00:08,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {62426#(<= 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; {62427#(<= 499982 main_~y~0)} is VALID [2022-04-28 04:00:08,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {62427#(<= 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; {62428#(<= 499980 main_~y~0)} is VALID [2022-04-28 04:00:08,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {62428#(<= 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; {62429#(<= 499978 main_~y~0)} is VALID [2022-04-28 04:00:08,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {62429#(<= 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; {62430#(<= 499976 main_~y~0)} is VALID [2022-04-28 04:00:08,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {62430#(<= 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; {62431#(<= 499974 main_~y~0)} is VALID [2022-04-28 04:00:08,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {62431#(<= 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; {62432#(<= 499972 main_~y~0)} is VALID [2022-04-28 04:00:08,254 INFO L290 TraceCheckUtils]: 24: Hoare triple {62432#(<= 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; {62433#(<= 499970 main_~y~0)} is VALID [2022-04-28 04:00:08,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {62433#(<= 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; {62434#(<= 499968 main_~y~0)} is VALID [2022-04-28 04:00:08,257 INFO L290 TraceCheckUtils]: 26: Hoare triple {62434#(<= 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; {62435#(<= 499966 main_~y~0)} is VALID [2022-04-28 04:00:08,258 INFO L290 TraceCheckUtils]: 27: Hoare triple {62435#(<= 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; {62436#(<= 499964 main_~y~0)} is VALID [2022-04-28 04:00:08,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {62436#(<= 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; {62437#(<= 499962 main_~y~0)} is VALID [2022-04-28 04:00:08,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {62437#(<= 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; {62438#(<= 499960 main_~y~0)} is VALID [2022-04-28 04:00:08,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {62438#(<= 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; {62439#(<= 499958 main_~y~0)} is VALID [2022-04-28 04:00:08,260 INFO L290 TraceCheckUtils]: 31: Hoare triple {62439#(<= 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; {62440#(<= 499956 main_~y~0)} is VALID [2022-04-28 04:00:08,260 INFO L290 TraceCheckUtils]: 32: Hoare triple {62440#(<= 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; {62441#(<= 499954 main_~y~0)} is VALID [2022-04-28 04:00:08,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {62441#(<= 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; {62442#(<= 499952 main_~y~0)} is VALID [2022-04-28 04:00:08,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {62442#(<= 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; {62443#(<= 499950 main_~y~0)} is VALID [2022-04-28 04:00:08,262 INFO L290 TraceCheckUtils]: 35: Hoare triple {62443#(<= 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; {62444#(<= 499948 main_~y~0)} is VALID [2022-04-28 04:00:08,262 INFO L290 TraceCheckUtils]: 36: Hoare triple {62444#(<= 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; {62445#(<= 499946 main_~y~0)} is VALID [2022-04-28 04:00:08,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {62445#(<= 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; {62446#(<= 499944 main_~y~0)} is VALID [2022-04-28 04:00:08,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {62446#(<= 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; {62447#(<= 499942 main_~y~0)} is VALID [2022-04-28 04:00:08,264 INFO L290 TraceCheckUtils]: 39: Hoare triple {62447#(<= 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; {62448#(<= 499940 main_~y~0)} is VALID [2022-04-28 04:00:08,264 INFO L290 TraceCheckUtils]: 40: Hoare triple {62448#(<= 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; {62449#(<= 499938 main_~y~0)} is VALID [2022-04-28 04:00:08,264 INFO L290 TraceCheckUtils]: 41: Hoare triple {62449#(<= 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; {62450#(<= 499936 main_~y~0)} is VALID [2022-04-28 04:00:08,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {62450#(<= 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; {62451#(<= 499934 main_~y~0)} is VALID [2022-04-28 04:00:08,265 INFO L290 TraceCheckUtils]: 43: Hoare triple {62451#(<= 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; {62452#(<= 499932 main_~y~0)} is VALID [2022-04-28 04:00:08,266 INFO L290 TraceCheckUtils]: 44: Hoare triple {62452#(<= 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; {62453#(<= 499930 main_~y~0)} is VALID [2022-04-28 04:00:08,266 INFO L290 TraceCheckUtils]: 45: Hoare triple {62453#(<= 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; {62454#(<= 499928 main_~y~0)} is VALID [2022-04-28 04:00:08,267 INFO L290 TraceCheckUtils]: 46: Hoare triple {62454#(<= 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; {62455#(<= 499926 main_~y~0)} is VALID [2022-04-28 04:00:08,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {62455#(<= 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; {62456#(<= 499924 main_~y~0)} is VALID [2022-04-28 04:00:08,268 INFO L290 TraceCheckUtils]: 48: Hoare triple {62456#(<= 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; {62457#(<= 499922 main_~y~0)} is VALID [2022-04-28 04:00:08,268 INFO L290 TraceCheckUtils]: 49: Hoare triple {62457#(<= 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; {62458#(<= 499920 main_~y~0)} is VALID [2022-04-28 04:00:08,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {62458#(<= 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; {62459#(<= 499918 main_~y~0)} is VALID [2022-04-28 04:00:08,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {62459#(<= 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; {62460#(<= 499916 main_~y~0)} is VALID [2022-04-28 04:00:08,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {62460#(<= 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; {62461#(<= 499914 main_~y~0)} is VALID [2022-04-28 04:00:08,270 INFO L290 TraceCheckUtils]: 53: Hoare triple {62461#(<= 499914 main_~y~0)} assume !(~y~0 > 0); {62414#false} is VALID [2022-04-28 04:00:08,270 INFO L272 TraceCheckUtils]: 54: Hoare triple {62414#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {62414#false} is VALID [2022-04-28 04:00:08,270 INFO L290 TraceCheckUtils]: 55: Hoare triple {62414#false} ~cond := #in~cond; {62414#false} is VALID [2022-04-28 04:00:08,270 INFO L290 TraceCheckUtils]: 56: Hoare triple {62414#false} assume 0 == ~cond; {62414#false} is VALID [2022-04-28 04:00:08,270 INFO L290 TraceCheckUtils]: 57: Hoare triple {62414#false} assume !false; {62414#false} is VALID [2022-04-28 04:00:08,271 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-28 04:00:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:00:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925927700] [2022-04-28 04:00:08,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925927700] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 04:00:08,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2000856979] [2022-04-28 04:00:08,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:00:08,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:00:08,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:00:08,272 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-28 04:00:08,273 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-28 04:00:08,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:08,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 46 conjunts are in the unsatisfiable core [2022-04-28 04:00:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:00:08,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:00:08,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {62413#true} call ULTIMATE.init(); {62413#true} is VALID [2022-04-28 04:00:08,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {62413#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(18, 2);call #Ultimate.allocInit(12, 3); {62413#true} is VALID [2022-04-28 04:00:08,983 INFO L290 TraceCheckUtils]: 2: Hoare triple {62413#true} assume true; {62413#true} is VALID [2022-04-28 04:00:08,983 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62413#true} {62413#true} #53#return; {62413#true} is VALID [2022-04-28 04:00:08,983 INFO L272 TraceCheckUtils]: 4: Hoare triple {62413#true} call #t~ret9 := main(); {62413#true} is VALID [2022-04-28 04:00:08,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {62413#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {62418#(<= 500000 main_~y~0)} [231] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_272| |v_main_#t~post4_271|)) (.cse1 (= v_main_~x~0_3227 v_main_~x~0_3226))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3226 500001) (< v_main_~x~0_3227 v_main_~x~0_3226)) (and (not (< v_main_~x~0_3227 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3227, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3226, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {62418#(<= 500000 main_~y~0)} [232] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {62418#(<= 500000 main_~y~0)} [233] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3229)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse3 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse4 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (let ((.cse0 (+ v_main_~x~0_3229 v_main_~y~0_3769))) (and (= (+ v_main_~x~0_3228 v_main_~y~0_3770) .cse0) (< .cse0 (+ 1000001 v_main_~y~0_3770)) .cse1 (< v_main_~y~0_3770 v_main_~y~0_3769))) (and .cse2 .cse3 (= v_main_~y~0_3769 v_main_~y~0_3770) (or (not (< v_main_~x~0_3229 1000000)) (not .cse1)) .cse4) (and .cse2 .cse3 (= v_main_~y~0_3770 v_main_~y~0_3769) .cse4))) InVars {main_~y~0=v_main_~y~0_3770, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3229, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3769, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3228, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {62418#(<= 500000 main_~y~0)} [230] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {62418#(<= 500000 main_~y~0)} is VALID [2022-04-28 04:00:08,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {62418#(<= 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; {62419#(<= 499998 main_~y~0)} is VALID [2022-04-28 04:00:08,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {62419#(<= 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; {62420#(<= 499996 main_~y~0)} is VALID [2022-04-28 04:00:08,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {62420#(<= 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; {62421#(<= 499994 main_~y~0)} is VALID [2022-04-28 04:00:08,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {62421#(<= 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; {62422#(<= 499992 main_~y~0)} is VALID [2022-04-28 04:00:08,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {62422#(<= 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; {62423#(<= 499990 main_~y~0)} is VALID [2022-04-28 04:00:08,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {62423#(<= 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; {62424#(<= 499988 main_~y~0)} is VALID [2022-04-28 04:00:08,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {62424#(<= 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; {62425#(<= 499986 main_~y~0)} is VALID [2022-04-28 04:00:08,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {62425#(<= 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; {62426#(<= 499984 main_~y~0)} is VALID [2022-04-28 04:00:08,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {62426#(<= 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; {62427#(<= 499982 main_~y~0)} is VALID [2022-04-28 04:00:08,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {62427#(<= 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; {62428#(<= 499980 main_~y~0)} is VALID [2022-04-28 04:00:08,990 INFO L290 TraceCheckUtils]: 20: Hoare triple {62428#(<= 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; {62429#(<= 499978 main_~y~0)} is VALID [2022-04-28 04:00:08,991 INFO L290 TraceCheckUtils]: 21: Hoare triple {62429#(<= 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; {62430#(<= 499976 main_~y~0)} is VALID [2022-04-28 04:00:08,991 INFO L290 TraceCheckUtils]: 22: Hoare triple {62430#(<= 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; {62431#(<= 499974 main_~y~0)} is VALID [2022-04-28 04:00:08,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {62431#(<= 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; {62432#(<= 499972 main_~y~0)} is VALID [2022-04-28 04:00:08,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {62432#(<= 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; {62433#(<= 499970 main_~y~0)} is VALID [2022-04-28 04:00:08,993 INFO L290 TraceCheckUtils]: 25: Hoare triple {62433#(<= 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; {62434#(<= 499968 main_~y~0)} is VALID [2022-04-28 04:00:08,993 INFO L290 TraceCheckUtils]: 26: Hoare triple {62434#(<= 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; {62435#(<= 499966 main_~y~0)} is VALID [2022-04-28 04:00:08,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {62435#(<= 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; {62436#(<= 499964 main_~y~0)} is VALID [2022-04-28 04:00:08,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {62436#(<= 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; {62437#(<= 499962 main_~y~0)} is VALID [2022-04-28 04:00:08,995 INFO L290 TraceCheckUtils]: 29: Hoare triple {62437#(<= 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; {62438#(<= 499960 main_~y~0)} is VALID [2022-04-28 04:00:08,995 INFO L290 TraceCheckUtils]: 30: Hoare triple {62438#(<= 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; {62439#(<= 499958 main_~y~0)} is VALID [2022-04-28 04:00:08,996 INFO L290 TraceCheckUtils]: 31: Hoare triple {62439#(<= 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; {62440#(<= 499956 main_~y~0)} is VALID [2022-04-28 04:00:08,996 INFO L290 TraceCheckUtils]: 32: Hoare triple {62440#(<= 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; {62441#(<= 499954 main_~y~0)} is VALID [2022-04-28 04:00:08,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {62441#(<= 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; {62442#(<= 499952 main_~y~0)} is VALID [2022-04-28 04:00:08,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {62442#(<= 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; {62443#(<= 499950 main_~y~0)} is VALID [2022-04-28 04:00:08,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {62443#(<= 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; {62444#(<= 499948 main_~y~0)} is VALID [2022-04-28 04:00:08,998 INFO L290 TraceCheckUtils]: 36: Hoare triple {62444#(<= 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; {62445#(<= 499946 main_~y~0)} is VALID [2022-04-28 04:00:08,998 INFO L290 TraceCheckUtils]: 37: Hoare triple {62445#(<= 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; {62446#(<= 499944 main_~y~0)} is VALID [2022-04-28 04:00:08,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {62446#(<= 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; {62447#(<= 499942 main_~y~0)} is VALID [2022-04-28 04:00:08,999 INFO L290 TraceCheckUtils]: 39: Hoare triple {62447#(<= 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; {62448#(<= 499940 main_~y~0)} is VALID [2022-04-28 04:00:09,000 INFO L290 TraceCheckUtils]: 40: Hoare triple {62448#(<= 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; {62449#(<= 499938 main_~y~0)} is VALID [2022-04-28 04:00:09,000 INFO L290 TraceCheckUtils]: 41: Hoare triple {62449#(<= 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; {62450#(<= 499936 main_~y~0)} is VALID [2022-04-28 04:00:09,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {62450#(<= 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; {62451#(<= 499934 main_~y~0)} is VALID [2022-04-28 04:00:09,001 INFO L290 TraceCheckUtils]: 43: Hoare triple {62451#(<= 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; {62452#(<= 499932 main_~y~0)} is VALID [2022-04-28 04:00:09,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {62452#(<= 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; {62453#(<= 499930 main_~y~0)} is VALID [2022-04-28 04:00:09,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {62453#(<= 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; {62454#(<= 499928 main_~y~0)} is VALID [2022-04-28 04:00:09,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {62454#(<= 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; {62455#(<= 499926 main_~y~0)} is VALID [2022-04-28 04:00:09,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {62455#(<= 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; {62456#(<= 499924 main_~y~0)} is VALID [2022-04-28 04:00:09,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {62456#(<= 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; {62457#(<= 499922 main_~y~0)} is VALID [2022-04-28 04:00:09,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {62457#(<= 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; {62458#(<= 499920 main_~y~0)} is VALID [2022-04-28 04:00:09,005 INFO L290 TraceCheckUtils]: 50: Hoare triple {62458#(<= 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; {62459#(<= 499918 main_~y~0)} is VALID [2022-04-28 04:00:09,005 INFO L290 TraceCheckUtils]: 51: Hoare triple {62459#(<= 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; {62460#(<= 499916 main_~y~0)} is VALID [2022-04-28 04:00:09,006 INFO L290 TraceCheckUtils]: 52: Hoare triple {62460#(<= 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; {62461#(<= 499914 main_~y~0)} is VALID [2022-04-28 04:00:09,006 INFO L290 TraceCheckUtils]: 53: Hoare triple {62461#(<= 499914 main_~y~0)} assume !(~y~0 > 0); {62414#false} is VALID [2022-04-28 04:00:09,006 INFO L272 TraceCheckUtils]: 54: Hoare triple {62414#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {62414#false} is VALID [2022-04-28 04:00:09,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {62414#false} ~cond := #in~cond; {62414#false} is VALID [2022-04-28 04:00:09,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {62414#false} assume 0 == ~cond; {62414#false} is VALID [2022-04-28 04:00:09,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {62414#false} assume !false; {62414#false} is VALID [2022-04-28 04:00:09,006 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-28 04:00:09,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:00:11,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {62414#false} assume !false; {62414#false} is VALID [2022-04-28 04:00:11,602 INFO L290 TraceCheckUtils]: 56: Hoare triple {62414#false} assume 0 == ~cond; {62414#false} is VALID [2022-04-28 04:00:11,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {62414#false} ~cond := #in~cond; {62414#false} is VALID [2022-04-28 04:00:11,602 INFO L272 TraceCheckUtils]: 54: Hoare triple {62414#false} call __VERIFIER_assert((if 0 == (if ~z~0 < 0 && 0 != ~z~0 % 2 then ~z~0 % 2 - 2 else ~z~0 % 2) then 1 else 0)); {62414#false} is VALID [2022-04-28 04:00:11,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {62649#(< 0 main_~y~0)} assume !(~y~0 > 0); {62414#false} is VALID [2022-04-28 04:00:11,603 INFO L290 TraceCheckUtils]: 52: Hoare triple {62653#(< 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; {62649#(< 0 main_~y~0)} is VALID [2022-04-28 04:00:11,603 INFO L290 TraceCheckUtils]: 51: Hoare triple {62657#(< 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; {62653#(< 2 main_~y~0)} is VALID [2022-04-28 04:00:11,604 INFO L290 TraceCheckUtils]: 50: Hoare triple {62661#(< 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; {62657#(< 4 main_~y~0)} is VALID [2022-04-28 04:00:11,604 INFO L290 TraceCheckUtils]: 49: Hoare triple {62665#(< 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; {62661#(< 6 main_~y~0)} is VALID [2022-04-28 04:00:11,605 INFO L290 TraceCheckUtils]: 48: Hoare triple {62669#(< 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; {62665#(< 8 main_~y~0)} is VALID [2022-04-28 04:00:11,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {62673#(< 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; {62669#(< 10 main_~y~0)} is VALID [2022-04-28 04:00:11,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {62677#(< 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; {62673#(< 12 main_~y~0)} is VALID [2022-04-28 04:00:11,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {62681#(< 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; {62677#(< 14 main_~y~0)} is VALID [2022-04-28 04:00:11,607 INFO L290 TraceCheckUtils]: 44: Hoare triple {62685#(< 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; {62681#(< 16 main_~y~0)} is VALID [2022-04-28 04:00:11,607 INFO L290 TraceCheckUtils]: 43: Hoare triple {62689#(< 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; {62685#(< 18 main_~y~0)} is VALID [2022-04-28 04:00:11,608 INFO L290 TraceCheckUtils]: 42: Hoare triple {62693#(< 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; {62689#(< 20 main_~y~0)} is VALID [2022-04-28 04:00:11,608 INFO L290 TraceCheckUtils]: 41: Hoare triple {62697#(< 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; {62693#(< 22 main_~y~0)} is VALID [2022-04-28 04:00:11,609 INFO L290 TraceCheckUtils]: 40: Hoare triple {62701#(< 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; {62697#(< 24 main_~y~0)} is VALID [2022-04-28 04:00:11,609 INFO L290 TraceCheckUtils]: 39: Hoare triple {62705#(< 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; {62701#(< 26 main_~y~0)} is VALID [2022-04-28 04:00:11,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {62709#(< 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; {62705#(< 28 main_~y~0)} is VALID [2022-04-28 04:00:11,610 INFO L290 TraceCheckUtils]: 37: Hoare triple {62713#(< 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; {62709#(< 30 main_~y~0)} is VALID [2022-04-28 04:00:11,610 INFO L290 TraceCheckUtils]: 36: Hoare triple {62717#(< 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; {62713#(< 32 main_~y~0)} is VALID [2022-04-28 04:00:11,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {62721#(< 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; {62717#(< 34 main_~y~0)} is VALID [2022-04-28 04:00:11,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {62725#(< 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; {62721#(< 36 main_~y~0)} is VALID [2022-04-28 04:00:11,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {62729#(< 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; {62725#(< 38 main_~y~0)} is VALID [2022-04-28 04:00:11,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {62733#(< 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; {62729#(< 40 main_~y~0)} is VALID [2022-04-28 04:00:11,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {62737#(< 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; {62733#(< 42 main_~y~0)} is VALID [2022-04-28 04:00:11,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {62741#(< 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; {62737#(< 44 main_~y~0)} is VALID [2022-04-28 04:00:11,614 INFO L290 TraceCheckUtils]: 29: Hoare triple {62745#(< 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; {62741#(< 46 main_~y~0)} is VALID [2022-04-28 04:00:11,614 INFO L290 TraceCheckUtils]: 28: Hoare triple {62749#(< 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; {62745#(< 48 main_~y~0)} is VALID [2022-04-28 04:00:11,615 INFO L290 TraceCheckUtils]: 27: Hoare triple {62753#(< 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; {62749#(< 50 main_~y~0)} is VALID [2022-04-28 04:00:11,615 INFO L290 TraceCheckUtils]: 26: Hoare triple {62757#(< 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; {62753#(< 52 main_~y~0)} is VALID [2022-04-28 04:00:11,616 INFO L290 TraceCheckUtils]: 25: Hoare triple {62761#(< 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; {62757#(< 54 main_~y~0)} is VALID [2022-04-28 04:00:11,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {62765#(< 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; {62761#(< 56 main_~y~0)} is VALID [2022-04-28 04:00:11,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {62769#(< 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; {62765#(< 58 main_~y~0)} is VALID [2022-04-28 04:00:11,617 INFO L290 TraceCheckUtils]: 22: Hoare triple {62773#(< 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; {62769#(< 60 main_~y~0)} is VALID [2022-04-28 04:00:11,617 INFO L290 TraceCheckUtils]: 21: Hoare triple {62777#(< 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; {62773#(< 62 main_~y~0)} is VALID [2022-04-28 04:00:11,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {62781#(< 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; {62777#(< 64 main_~y~0)} is VALID [2022-04-28 04:00:11,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {62785#(< 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; {62781#(< 66 main_~y~0)} is VALID [2022-04-28 04:00:11,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {62789#(< 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; {62785#(< 68 main_~y~0)} is VALID [2022-04-28 04:00:11,619 INFO L290 TraceCheckUtils]: 17: Hoare triple {62793#(< 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; {62789#(< 70 main_~y~0)} is VALID [2022-04-28 04:00:11,620 INFO L290 TraceCheckUtils]: 16: Hoare triple {62797#(< 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; {62793#(< 72 main_~y~0)} is VALID [2022-04-28 04:00:11,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {62801#(< 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; {62797#(< 74 main_~y~0)} is VALID [2022-04-28 04:00:11,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {62805#(< 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; {62801#(< 76 main_~y~0)} is VALID [2022-04-28 04:00:11,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {62809#(< 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; {62805#(< 78 main_~y~0)} is VALID [2022-04-28 04:00:11,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {62813#(< 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; {62809#(< 80 main_~y~0)} is VALID [2022-04-28 04:00:11,622 INFO L290 TraceCheckUtils]: 11: Hoare triple {62817#(< 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; {62813#(< 82 main_~y~0)} is VALID [2022-04-28 04:00:11,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {62821#(< 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; {62817#(< 84 main_~y~0)} is VALID [2022-04-28 04:00:11,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {62821#(< 86 main_~y~0)} [230] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_6 1000000)) InVars {main_~x~0=v_main_~x~0_6} OutVars{main_~x~0=v_main_~x~0_6} AuxVars[] AssignedVars[] {62821#(< 86 main_~y~0)} is VALID [2022-04-28 04:00:11,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {62821#(< 86 main_~y~0)} [233] L10-2-->L17-1_primed: Formula: (let ((.cse1 (<= 500000 v_main_~x~0_3229)) (.cse2 (= |v_main_#t~post6_298| |v_main_#t~post6_297|)) (.cse3 (= |v_main_#t~post5_298| |v_main_#t~post5_297|)) (.cse4 (= v_main_~x~0_3229 v_main_~x~0_3228))) (or (let ((.cse0 (+ v_main_~x~0_3229 v_main_~y~0_3769))) (and (= (+ v_main_~x~0_3228 v_main_~y~0_3770) .cse0) (< .cse0 (+ 1000001 v_main_~y~0_3770)) .cse1 (< v_main_~y~0_3770 v_main_~y~0_3769))) (and .cse2 .cse3 (= v_main_~y~0_3769 v_main_~y~0_3770) (or (not (< v_main_~x~0_3229 1000000)) (not .cse1)) .cse4) (and .cse2 .cse3 (= v_main_~y~0_3770 v_main_~y~0_3769) .cse4))) InVars {main_~y~0=v_main_~y~0_3770, main_#t~post5=|v_main_#t~post5_298|, main_~x~0=v_main_~x~0_3229, main_#t~post6=|v_main_#t~post6_298|} OutVars{main_~y~0=v_main_~y~0_3769, main_#t~post5=|v_main_#t~post5_297|, main_~x~0=v_main_~x~0_3228, main_#t~post6=|v_main_#t~post6_297|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {62821#(< 86 main_~y~0)} is VALID [2022-04-28 04:00:11,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {62821#(< 86 main_~y~0)} [232] L17-1_primed-->L10-2: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {62821#(< 86 main_~y~0)} is VALID [2022-04-28 04:00:11,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {62821#(< 86 main_~y~0)} [231] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_272| |v_main_#t~post4_271|)) (.cse1 (= v_main_~x~0_3227 v_main_~x~0_3226))) (or (and .cse0 .cse1) (and (< v_main_~x~0_3226 500001) (< v_main_~x~0_3227 v_main_~x~0_3226)) (and (not (< v_main_~x~0_3227 500000)) .cse0 .cse1))) InVars {main_~x~0=v_main_~x~0_3227, main_#t~post4=|v_main_#t~post4_272|} OutVars{main_~x~0=v_main_~x~0_3226, main_#t~post4=|v_main_#t~post4_271|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {62821#(< 86 main_~y~0)} is VALID [2022-04-28 04:00:11,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {62413#true} ~x~0 := 0;~y~0 := 500000;~z~0 := 0;~x~0 := 0; {62821#(< 86 main_~y~0)} is VALID [2022-04-28 04:00:11,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {62413#true} call #t~ret9 := main(); {62413#true} is VALID [2022-04-28 04:00:11,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62413#true} {62413#true} #53#return; {62413#true} is VALID [2022-04-28 04:00:11,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {62413#true} assume true; {62413#true} is VALID [2022-04-28 04:00:11,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {62413#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(18, 2);call #Ultimate.allocInit(12, 3); {62413#true} is VALID [2022-04-28 04:00:11,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {62413#true} call ULTIMATE.init(); {62413#true} is VALID [2022-04-28 04:00:11,625 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-28 04:00:11,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2000856979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:00:11,625 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 04:00:11,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 91 [2022-04-28 04:00:15,917 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:00:15,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1309676879] [2022-04-28 04:00:15,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1309676879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:00:15,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:00:15,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [126] imperfect sequences [] total 126 [2022-04-28 04:00:15,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835545750] [2022-04-28 04:00:15,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:00:15,918 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 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 211 [2022-04-28 04:00:15,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:00:15,918 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:00:16,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:00:16,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-04-28 04:00:16,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:00:16,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-04-28 04:00:16,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11195, Invalid=17535, Unknown=0, NotChecked=0, Total=28730 [2022-04-28 04:00:16,076 INFO L87 Difference]: Start difference. First operand 367 states and 372 transitions. Second operand has 126 states, 126 states have (on average 1.6428571428571428) internal successors, (207), 125 states have internal predecessors, (207), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)