/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 13:01:20,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 13:01:20,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 13:01:20,913 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 13:01:20,914 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 13:01:20,915 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 13:01:20,916 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 13:01:20,918 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 13:01:20,919 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 13:01:20,920 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 13:01:20,921 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 13:01:20,922 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 13:01:20,922 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 13:01:20,923 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 13:01:20,924 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 13:01:20,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 13:01:20,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 13:01:20,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 13:01:20,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 13:01:20,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 13:01:20,931 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 13:01:20,932 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 13:01:20,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 13:01:20,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 13:01:20,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 13:01:20,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 13:01:20,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 13:01:20,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 13:01:20,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 13:01:20,938 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 13:01:20,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 13:01:20,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 13:01:20,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 13:01:20,940 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 13:01:20,941 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 13:01:20,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 13:01:20,942 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 13:01:20,942 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 13:01:20,942 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 13:01:20,943 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 13:01:20,943 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 13:01:20,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 13:01:20,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 13:01:20,957 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 13:01:20,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 13:01:20,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 13:01:20,959 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 13:01:20,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:20,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 13:01:20,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 13:01:20,961 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 13:01:20,961 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 13:01:20,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 13:01:20,961 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 13:01:20,961 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 13:01:21,213 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 13:01:21,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 13:01:21,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 13:01:21,240 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 13:01:21,240 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 13:01:21,242 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-15 13:01:21,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094c46917/9e051871c19a4e868709000fe50b1cd4/FLAG01a1c1278 [2022-04-15 13:01:21,715 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 13:01:21,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/mono-crafted_13.c [2022-04-15 13:01:21,722 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094c46917/9e051871c19a4e868709000fe50b1cd4/FLAG01a1c1278 [2022-04-15 13:01:21,736 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/094c46917/9e051871c19a4e868709000fe50b1cd4 [2022-04-15 13:01:21,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 13:01:21,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 13:01:21,742 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:21,742 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 13:01:21,748 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 13:01:21,750 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,751 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4434194 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21, skipping insertion in model container [2022-04-15 13:01:21,752 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 13:01:21,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 13:01:21,912 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_13.c[319,332] [2022-04-15 13:01:21,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:21,932 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 13:01:21,942 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_13.c[319,332] [2022-04-15 13:01:21,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 13:01:21,958 INFO L208 MainTranslator]: Completed translation [2022-04-15 13:01:21,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21 WrapperNode [2022-04-15 13:01:21,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 13:01:21,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 13:01:21,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 13:01:21,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 13:01:21,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 13:01:21,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 13:01:21,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 13:01:21,987 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 13:01:21,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (1/1) ... [2022-04-15 13:01:21,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 13:01:22,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:22,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 13:01:22,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 13:01:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 13:01:22,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 13:01:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 13:01:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 13:01:22,057 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 13:01:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 13:01:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 13:01:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 13:01:22,058 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 13:01:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 13:01:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 13:01:22,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 13:01:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 13:01:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 13:01:22,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 13:01:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 13:01:22,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 13:01:22,116 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 13:01:22,119 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 13:01:22,290 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 13:01:22,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 13:01:22,296 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 13:01:22,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:22 BoogieIcfgContainer [2022-04-15 13:01:22,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 13:01:22,300 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 13:01:22,300 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 13:01:22,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 13:01:22,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:01:21" (1/3) ... [2022-04-15 13:01:22,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1547e4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:22, skipping insertion in model container [2022-04-15 13:01:22,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:01:21" (2/3) ... [2022-04-15 13:01:22,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1547e4af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:01:22, skipping insertion in model container [2022-04-15 13:01:22,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:01:22" (3/3) ... [2022-04-15 13:01:22,320 INFO L111 eAbstractionObserver]: Analyzing ICFG mono-crafted_13.c [2022-04-15 13:01:22,327 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 13:01:22,327 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 13:01:22,401 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 13:01:22,406 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 13:01:22,407 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 13:01:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 13:01:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:01:22,449 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:22,450 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:22,451 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:22,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:22,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 1 times [2022-04-15 13:01:22,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:22,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2096501753] [2022-04-15 13:01:22,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:22,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1168619535, now seen corresponding path program 2 times [2022-04-15 13:01:22,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:22,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317379567] [2022-04-15 13:01:22,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:22,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 13:01:22,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 13:01:22,691 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 13:01:22,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:22,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-15 13:01:22,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 13:01:22,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #52#return; {24#true} is VALID [2022-04-15 13:01:22,695 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-15 13:01:22,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {24#true} is VALID [2022-04-15 13:01:22,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-15 13:01:22,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} assume !true; {25#false} is VALID [2022-04-15 13:01:22,697 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {25#false} is VALID [2022-04-15 13:01:22,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-15 13:01:22,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-15 13:01:22,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 13:01:22,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:22,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:22,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317379567] [2022-04-15 13:01:22,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317379567] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:22,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:22,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:22,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:22,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2096501753] [2022-04-15 13:01:22,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2096501753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:22,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:22,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 13:01:22,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788173603] [2022-04-15 13:01:22,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:22,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:01:22,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:22,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:22,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:22,744 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 13:01:22,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:22,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 13:01:22,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:22,772 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:22,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:22,873 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 13:01:22,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 13:01:22,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:01:22,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:22,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 13:01:22,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:22,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-15 13:01:22,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-15 13:01:22,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:22,963 INFO L225 Difference]: With dead ends: 34 [2022-04-15 13:01:22,963 INFO L226 Difference]: Without dead ends: 14 [2022-04-15 13:01:22,966 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 13:01:22,970 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:22,971 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-15 13:01:23,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-15 13:01:23,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:23,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,008 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,008 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,013 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 13:01:23,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 13:01:23,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:01:23,015 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-15 13:01:23,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,018 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2022-04-15 13:01:23,019 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 13:01:23,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:23,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:23,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-04-15 13:01:23,027 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2022-04-15 13:01:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:23,028 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-04-15 13:01:23,029 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,029 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 16 transitions. [2022-04-15 13:01:23,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-04-15 13:01:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 13:01:23,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:23,053 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:23,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 13:01:23,056 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:23,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:23,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 1 times [2022-04-15 13:01:23,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1680464196] [2022-04-15 13:01:23,065 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 13:01:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1458605129, now seen corresponding path program 2 times [2022-04-15 13:01:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:23,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531684449] [2022-04-15 13:01:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:23,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:23,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:23,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 13:01:23,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:01:23,158 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 13:01:23,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {156#true} call ULTIMATE.init(); {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:23,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {156#true} is VALID [2022-04-15 13:01:23,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {156#true} assume true; {156#true} is VALID [2022-04-15 13:01:23,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {156#true} {156#true} #52#return; {156#true} is VALID [2022-04-15 13:01:23,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {156#true} call #t~ret7 := main(); {156#true} is VALID [2022-04-15 13:01:23,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {156#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {161#(= main_~x~0 0)} is VALID [2022-04-15 13:01:23,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {161#(= main_~x~0 0)} assume !(~x~0 < 1000000); {157#false} is VALID [2022-04-15 13:01:23,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {157#false} assume !(~y~0 > ~z~0); {157#false} is VALID [2022-04-15 13:01:23,164 INFO L272 TraceCheckUtils]: 8: Hoare triple {157#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {157#false} is VALID [2022-04-15 13:01:23,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {157#false} ~cond := #in~cond; {157#false} is VALID [2022-04-15 13:01:23,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {157#false} assume 0 == ~cond; {157#false} is VALID [2022-04-15 13:01:23,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {157#false} assume !false; {157#false} is VALID [2022-04-15 13:01:23,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:23,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:23,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531684449] [2022-04-15 13:01:23,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531684449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:23,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:23,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:23,172 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:23,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1680464196] [2022-04-15 13:01:23,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1680464196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:23,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:23,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255907247] [2022-04-15 13:01:23,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:23,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:01:23,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:23,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,189 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,189 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 13:01:23,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 13:01:23,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 13:01:23,191 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,273 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2022-04-15 13:01:23,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 13:01:23,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 13:01:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:23,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-15 13:01:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 13:01:23,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-15 13:01:23,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-15 13:01:23,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,314 INFO L225 Difference]: With dead ends: 24 [2022-04-15 13:01:23,314 INFO L226 Difference]: Without dead ends: 16 [2022-04-15 13:01:23,315 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 13:01:23,318 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:23,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 21 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-15 13:01:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-15 13:01:23,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:23,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,326 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,327 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,329 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 13:01:23,329 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:01:23,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:01:23,331 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-15 13:01:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,333 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-04-15 13:01:23,333 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:01:23,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:23,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:23,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 13:01:23,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-04-15 13:01:23,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:23,336 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 13:01:23,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 13:01:23,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,357 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 13:01:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 13:01:23,358 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:23,358 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:23,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 13:01:23,358 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1316432198, now seen corresponding path program 1 times [2022-04-15 13:01:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080304551] [2022-04-15 13:01:23,497 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 13:01:23,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1148992352, now seen corresponding path program 1 times [2022-04-15 13:01:23,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:23,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859196498] [2022-04-15 13:01:23,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:23,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:23,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:23,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 13:01:23,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 13:01:23,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 13:01:23,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:23,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {285#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {279#true} is VALID [2022-04-15 13:01:23,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {279#true} assume true; {279#true} is VALID [2022-04-15 13:01:23,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {279#true} {279#true} #52#return; {279#true} is VALID [2022-04-15 13:01:23,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {279#true} call #t~ret7 := main(); {279#true} is VALID [2022-04-15 13:01:23,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:23,592 INFO L290 TraceCheckUtils]: 6: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [58] L10-2-->L17-1_primed: Formula: (or (and (<= v_main_~x~0_In_1 v_main_~x~0_Out_2) (= |v_main_#t~post4_Out_2| 0) (< v_main_~x~0_Out_2 50001)) (= v_main_~x~0_In_1 v_main_~x~0_Out_2)) InVars {main_~x~0=v_main_~x~0_In_1} OutVars{main_~x~0=v_main_~x~0_Out_2, main_#t~post4=|v_main_#t~post4_Out_2|} AuxVars[] AssignedVars[main_~x~0, main_#t~post4] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:23,593 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [57] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:23,594 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !(~y~0 > ~z~0); {280#false} is VALID [2022-04-15 13:01:23,594 INFO L272 TraceCheckUtils]: 9: Hoare triple {280#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {280#false} is VALID [2022-04-15 13:01:23,594 INFO L290 TraceCheckUtils]: 10: Hoare triple {280#false} ~cond := #in~cond; {280#false} is VALID [2022-04-15 13:01:23,594 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#false} assume 0 == ~cond; {280#false} is VALID [2022-04-15 13:01:23,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {280#false} assume !false; {280#false} is VALID [2022-04-15 13:01:23,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:23,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:23,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859196498] [2022-04-15 13:01:23,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859196498] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:23,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:23,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 13:01:23,666 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:23,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080304551] [2022-04-15 13:01:23,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080304551] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:23,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:23,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 13:01:23,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446344826] [2022-04-15 13:01:23,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:23,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:01:23,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:23,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 13:01:23,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 13:01:23,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 13:01:23,682 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,827 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 13:01:23,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 13:01:23,827 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-15 13:01:23,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:23,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 13:01:23,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 30 transitions. [2022-04-15 13:01:23,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 30 transitions. [2022-04-15 13:01:23,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,862 INFO L225 Difference]: With dead ends: 26 [2022-04-15 13:01:23,862 INFO L226 Difference]: Without dead ends: 20 [2022-04-15 13:01:23,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 13:01:23,864 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 15 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:23,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 13:01:23,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-15 13:01:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-04-15 13:01:23,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:23,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,878 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,878 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,880 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:01:23,880 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:01:23,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:01:23,881 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-15 13:01:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:23,882 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-04-15 13:01:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:01:23,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:23,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:23,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:23,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-04-15 13:01:23,884 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-04-15 13:01:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:23,884 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-04-15 13:01:23,884 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:23,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 23 transitions. [2022-04-15 13:01:23,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:23,907 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-04-15 13:01:23,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 13:01:23,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:23,908 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:23,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 13:01:23,908 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:23,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:23,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1342594849, now seen corresponding path program 1 times [2022-04-15 13:01:23,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:23,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [383098236] [2022-04-15 13:01:31,790 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:31,792 INFO L85 PathProgramCache]: Analyzing trace with hash -257826045, now seen corresponding path program 1 times [2022-04-15 13:01:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:31,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047969867] [2022-04-15 13:01:31,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:31,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:31,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:31,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {437#(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); {428#true} is VALID [2022-04-15 13:01:31,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 13:01:31,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 13:01:31,897 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {437#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:31,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {437#(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); {428#true} is VALID [2022-04-15 13:01:31,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 13:01:31,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 13:01:31,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 13:01:31,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:31,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post4_In_1| |v_main_#t~post4_Out_4|))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_Out_2) v_main_~y~0_In_1) (- 2)))) (and (<= (+ v_main_~x~0_In_2 (* 2 .cse0)) v_main_~x~0_Out_4) .cse1 (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_4 50002)) (< v_main_~x~0_Out_4 1000002)) (< v_main_~x~0_Out_4 50001)) (= (mod (+ v_main_~y~0_In_1 v_main_~y~0_Out_2) 2) 0))) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2) .cse1))) InVars {main_#t~post4=|v_main_#t~post4_In_1|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {434#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 49999 main_~y~0)))} is VALID [2022-04-15 13:01:31,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {434#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 49999 main_~y~0)))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {435#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:31,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {435#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {436#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:31,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {436#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 13:01:31,901 INFO L272 TraceCheckUtils]: 10: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 13:01:31,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 13:01:31,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 13:01:31,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 13:01:31,902 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:31,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047969867] [2022-04-15 13:01:31,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047969867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:31,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059352027] [2022-04-15 13:01:31,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:31,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:31,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:31,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:31,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 13:01:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:31,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 13:01:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:31,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:32,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 13:01:32,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 13:01:32,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 13:01:32,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 13:01:32,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 13:01:32,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:32,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [60] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post4_In_1| |v_main_#t~post4_Out_4|))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_Out_2) v_main_~y~0_In_1) (- 2)))) (and (<= (+ v_main_~x~0_In_2 (* 2 .cse0)) v_main_~x~0_Out_4) .cse1 (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_4 50002)) (< v_main_~x~0_Out_4 1000002)) (< v_main_~x~0_Out_4 50001)) (= (mod (+ v_main_~y~0_In_1 v_main_~y~0_Out_2) 2) 0))) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2) .cse1))) InVars {main_#t~post4=|v_main_#t~post4_In_1|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:32,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:32,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {466#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:32,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {466#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 13:01:32,290 INFO L272 TraceCheckUtils]: 10: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 13:01:32,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 13:01:32,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 13:01:32,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 13:01:32,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:32,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:32,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {429#false} assume !false; {429#false} is VALID [2022-04-15 13:01:32,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {429#false} assume 0 == ~cond; {429#false} is VALID [2022-04-15 13:01:32,651 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#false} ~cond := #in~cond; {429#false} is VALID [2022-04-15 13:01:32,651 INFO L272 TraceCheckUtils]: 10: Hoare triple {429#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {429#false} is VALID [2022-04-15 13:01:32,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {494#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {429#false} is VALID [2022-04-15 13:01:32,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {498#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {494#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:32,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {498#(< (+ main_~z~0 1) main_~y~0)} [59] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {498#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:32,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {498#(< (+ main_~z~0 1) main_~y~0)} [60] L10-2-->L17-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post4_In_1| |v_main_#t~post4_Out_4|))) (or (let ((.cse0 (div (+ (* (- 1) v_main_~y~0_Out_2) v_main_~y~0_In_1) (- 2)))) (and (<= (+ v_main_~x~0_In_2 (* 2 .cse0)) v_main_~x~0_Out_4) .cse1 (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_4 50002)) (< v_main_~x~0_Out_4 1000002)) (< v_main_~x~0_Out_4 50001)) (= (mod (+ v_main_~y~0_In_1 v_main_~y~0_Out_2) 2) 0))) (and (= v_main_~x~0_In_2 v_main_~x~0_Out_4) (= v_main_~y~0_In_1 v_main_~y~0_Out_2) .cse1))) InVars {main_#t~post4=|v_main_#t~post4_In_1|, main_~y~0=v_main_~y~0_In_1, main_~x~0=v_main_~x~0_In_2} OutVars{main_#t~post4=|v_main_#t~post4_Out_4|, main_~y~0=v_main_~y~0_Out_2, main_~x~0=v_main_~x~0_Out_4} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {498#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:32,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {428#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {498#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:32,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {428#true} call #t~ret7 := main(); {428#true} is VALID [2022-04-15 13:01:32,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {428#true} {428#true} #52#return; {428#true} is VALID [2022-04-15 13:01:32,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {428#true} assume true; {428#true} is VALID [2022-04-15 13:01:32,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {428#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {428#true} is VALID [2022-04-15 13:01:32,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {428#true} call ULTIMATE.init(); {428#true} is VALID [2022-04-15 13:01:32,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:32,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059352027] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:32,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2022-04-15 13:01:33,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:33,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [383098236] [2022-04-15 13:01:33,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [383098236] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:33,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:33,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:01:33,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508805119] [2022-04-15 13:01:33,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:33,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:01:33,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:33,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:33,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:01:33,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:33,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:01:33,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2022-04-15 13:01:33,249 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:33,383 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2022-04-15 13:01:33,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 13:01:33,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 13:01:33,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:33,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-15 13:01:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 33 transitions. [2022-04-15 13:01:33,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 33 transitions. [2022-04-15 13:01:33,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:33,432 INFO L225 Difference]: With dead ends: 33 [2022-04-15 13:01:33,432 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 13:01:33,432 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2022-04-15 13:01:33,433 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:33,433 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 17 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-15 13:01:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 13:01:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-15 13:01:33,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:33,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,473 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,473 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:33,474 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 13:01:33,474 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 13:01:33,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:33,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:33,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:01:33,475 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 13:01:33,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:33,477 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-04-15 13:01:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 13:01:33,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:33,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:33,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:33,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2022-04-15 13:01:33,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 19 [2022-04-15 13:01:33,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:33,479 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2022-04-15 13:01:33,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 10 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:33,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 32 transitions. [2022-04-15 13:01:33,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-04-15 13:01:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 13:01:33,532 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:33,532 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:33,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:33,733 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:33,733 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:33,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:33,734 INFO L85 PathProgramCache]: Analyzing trace with hash 952217402, now seen corresponding path program 2 times [2022-04-15 13:01:33,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:33,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1343604826] [2022-04-15 13:01:34,439 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:34,441 INFO L85 PathProgramCache]: Analyzing trace with hash 707834691, now seen corresponding path program 1 times [2022-04-15 13:01:34,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:34,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089477721] [2022-04-15 13:01:34,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:34,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:34,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#(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); {705#true} is VALID [2022-04-15 13:01:34,548 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 13:01:34,548 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {705#true} {705#true} #52#return; {705#true} is VALID [2022-04-15 13:01:34,549 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {714#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:34,549 INFO L290 TraceCheckUtils]: 1: Hoare triple {714#(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); {705#true} is VALID [2022-04-15 13:01:34,549 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 13:01:34,549 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #52#return; {705#true} is VALID [2022-04-15 13:01:34,549 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret7 := main(); {705#true} is VALID [2022-04-15 13:01:34,550 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {710#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:34,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {710#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_In_2 4))) (let ((.cse1 (div (+ .cse0 (* (- 4) v_main_~y~0_Out_4)) (- 8)))) (and (= (mod (+ (* v_main_~y~0_Out_4 4) .cse0) 8) 0) (<= 0 .cse1) (= (* |v_main_#t~post4_Out_6| 8) (* |v_main_#t~post4_In_2| 8)) (or (and (not (< v_main_~x~0_Out_6 50002)) (< v_main_~x~0_Out_6 1000002)) (< v_main_~x~0_Out_6 50001)) (<= (+ v_main_~x~0_In_3 (* 2 .cse1)) v_main_~x~0_Out_6)))) (and (= |v_main_#t~post4_In_2| |v_main_#t~post4_Out_6|) (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_#t~post4=|v_main_#t~post4_In_2|, main_~y~0=v_main_~y~0_In_2, main_~x~0=v_main_~x~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {711#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} is VALID [2022-04-15 13:01:34,552 INFO L290 TraceCheckUtils]: 7: Hoare triple {711#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} [61] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {712#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:34,553 INFO L290 TraceCheckUtils]: 8: Hoare triple {712#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {713#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:34,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {706#false} is VALID [2022-04-15 13:01:34,555 INFO L272 TraceCheckUtils]: 10: Hoare triple {706#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {706#false} is VALID [2022-04-15 13:01:34,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {706#false} ~cond := #in~cond; {706#false} is VALID [2022-04-15 13:01:34,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#false} assume 0 == ~cond; {706#false} is VALID [2022-04-15 13:01:34,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-15 13:01:34,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:34,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089477721] [2022-04-15 13:01:34,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089477721] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:34,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858833096] [2022-04-15 13:01:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:34,558 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:34,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 13:01:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:34,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 13:01:34,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:34,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:35,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2022-04-15 13:01:35,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#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); {705#true} is VALID [2022-04-15 13:01:35,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 13:01:35,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #52#return; {705#true} is VALID [2022-04-15 13:01:35,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret7 := main(); {705#true} is VALID [2022-04-15 13:01:35,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {733#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:35,383 INFO L290 TraceCheckUtils]: 6: Hoare triple {733#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [62] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_In_2 4))) (let ((.cse1 (div (+ .cse0 (* (- 4) v_main_~y~0_Out_4)) (- 8)))) (and (= (mod (+ (* v_main_~y~0_Out_4 4) .cse0) 8) 0) (<= 0 .cse1) (= (* |v_main_#t~post4_Out_6| 8) (* |v_main_#t~post4_In_2| 8)) (or (and (not (< v_main_~x~0_Out_6 50002)) (< v_main_~x~0_Out_6 1000002)) (< v_main_~x~0_Out_6 50001)) (<= (+ v_main_~x~0_In_3 (* 2 .cse1)) v_main_~x~0_Out_6)))) (and (= |v_main_#t~post4_In_2| |v_main_#t~post4_Out_6|) (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_#t~post4=|v_main_#t~post4_In_2|, main_~y~0=v_main_~y~0_In_2, main_~x~0=v_main_~x~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {737#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_21 Int)) (and (<= 50000 v_main_~y~0_21) (= (mod (+ (* v_main_~y~0_21 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} is VALID [2022-04-15 13:01:35,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {737#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_21 Int)) (and (<= 50000 v_main_~y~0_21) (= (mod (+ (* v_main_~y~0_21 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} [61] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {741#(and (<= main_~z~0 0) (exists ((v_main_~y~0_21 Int)) (and (<= 50000 v_main_~y~0_21) (= (mod (+ (* v_main_~y~0_21 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} is VALID [2022-04-15 13:01:35,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {741#(and (<= main_~z~0 0) (exists ((v_main_~y~0_21 Int)) (and (<= 50000 v_main_~y~0_21) (= (mod (+ (* v_main_~y~0_21 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {745#(and (<= main_~z~0 0) (exists ((v_main_~y~0_21 Int) (v_main_~y~0_22 Int)) (and (= (mod (+ (* v_main_~y~0_21 4) (* v_main_~y~0_22 4)) 8) 0) (<= v_main_~y~0_22 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_21) (<= 0 (div (+ (* v_main_~y~0_22 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} is VALID [2022-04-15 13:01:35,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {745#(and (<= main_~z~0 0) (exists ((v_main_~y~0_21 Int) (v_main_~y~0_22 Int)) (and (= (mod (+ (* v_main_~y~0_21 4) (* v_main_~y~0_22 4)) 8) 0) (<= v_main_~y~0_22 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_21) (<= 0 (div (+ (* v_main_~y~0_22 (- 4)) (* v_main_~y~0_21 4)) (- 8))))))} assume !(~y~0 > ~z~0); {706#false} is VALID [2022-04-15 13:01:35,390 INFO L272 TraceCheckUtils]: 10: Hoare triple {706#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {706#false} is VALID [2022-04-15 13:01:35,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {706#false} ~cond := #in~cond; {706#false} is VALID [2022-04-15 13:01:35,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#false} assume 0 == ~cond; {706#false} is VALID [2022-04-15 13:01:35,390 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-15 13:01:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:35,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:37,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {706#false} assume !false; {706#false} is VALID [2022-04-15 13:01:37,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {706#false} assume 0 == ~cond; {706#false} is VALID [2022-04-15 13:01:37,964 INFO L290 TraceCheckUtils]: 11: Hoare triple {706#false} ~cond := #in~cond; {706#false} is VALID [2022-04-15 13:01:37,964 INFO L272 TraceCheckUtils]: 10: Hoare triple {706#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {706#false} is VALID [2022-04-15 13:01:37,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {706#false} is VALID [2022-04-15 13:01:37,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {777#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {773#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:37,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {781#(or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0))} [61] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {777#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:37,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {777#(< (+ main_~z~0 1) main_~y~0)} [62] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* v_main_~y~0_In_2 4))) (let ((.cse1 (div (+ .cse0 (* (- 4) v_main_~y~0_Out_4)) (- 8)))) (and (= (mod (+ (* v_main_~y~0_Out_4 4) .cse0) 8) 0) (<= 0 .cse1) (= (* |v_main_#t~post4_Out_6| 8) (* |v_main_#t~post4_In_2| 8)) (or (and (not (< v_main_~x~0_Out_6 50002)) (< v_main_~x~0_Out_6 1000002)) (< v_main_~x~0_Out_6 50001)) (<= (+ v_main_~x~0_In_3 (* 2 .cse1)) v_main_~x~0_Out_6)))) (and (= |v_main_#t~post4_In_2| |v_main_#t~post4_Out_6|) (= v_main_~x~0_In_3 v_main_~x~0_Out_6) (= v_main_~y~0_In_2 v_main_~y~0_Out_4))) InVars {main_#t~post4=|v_main_#t~post4_In_2|, main_~y~0=v_main_~y~0_In_2, main_~x~0=v_main_~x~0_In_3} OutVars{main_#t~post4=|v_main_#t~post4_Out_6|, main_~y~0=v_main_~y~0_Out_4, main_~x~0=v_main_~x~0_Out_6} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {781#(or (< main_~x~0 1000000) (< (+ main_~z~0 1) main_~y~0))} is VALID [2022-04-15 13:01:37,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {705#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {777#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:37,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {705#true} call #t~ret7 := main(); {705#true} is VALID [2022-04-15 13:01:37,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {705#true} {705#true} #52#return; {705#true} is VALID [2022-04-15 13:01:37,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {705#true} assume true; {705#true} is VALID [2022-04-15 13:01:37,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {705#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); {705#true} is VALID [2022-04-15 13:01:37,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {705#true} call ULTIMATE.init(); {705#true} is VALID [2022-04-15 13:01:37,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:37,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858833096] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:37,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:37,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 14 [2022-04-15 13:01:38,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:38,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1343604826] [2022-04-15 13:01:38,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1343604826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:38,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:38,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 13:01:38,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066261347] [2022-04-15 13:01:38,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:38,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-15 13:01:38,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:38,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:38,589 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 13:01:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:38,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 13:01:38,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=237, Unknown=0, NotChecked=0, Total=380 [2022-04-15 13:01:38,591 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:38,804 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-15 13:01:38,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 13:01:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 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 21 [2022-04-15 13:01:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:38,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 13:01:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 39 transitions. [2022-04-15 13:01:38,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 39 transitions. [2022-04-15 13:01:38,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:38,871 INFO L225 Difference]: With dead ends: 41 [2022-04-15 13:01:38,871 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 13:01:38,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=164, Invalid=298, Unknown=0, NotChecked=0, Total=462 [2022-04-15 13:01:38,872 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 35 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:38,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 35 Unchecked, 0.0s Time] [2022-04-15 13:01:38,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 13:01:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 13:01:38,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:38,975 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,975 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,975 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:38,977 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 13:01:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 13:01:38,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:38,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:38,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:01:38,979 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 36 states. [2022-04-15 13:01:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:38,980 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 13:01:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 13:01:38,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:38,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:38,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:38,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 30 states have internal predecessors, (43), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 13:01:38,983 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 21 [2022-04-15 13:01:38,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:38,983 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-04-15 13:01:38,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:38,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 47 transitions. [2022-04-15 13:01:39,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 13:01:39,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 13:01:39,091 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:39,091 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:39,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 13:01:39,291 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:39,292 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:39,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:39,292 INFO L85 PathProgramCache]: Analyzing trace with hash -510493847, now seen corresponding path program 3 times [2022-04-15 13:01:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:39,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649736636] [2022-04-15 13:01:40,066 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:40,068 INFO L85 PathProgramCache]: Analyzing trace with hash 374288448, now seen corresponding path program 1 times [2022-04-15 13:01:40,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:40,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998302683] [2022-04-15 13:01:40,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:40,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:40,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:40,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:40,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {1048#(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); {1039#true} is VALID [2022-04-15 13:01:40,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {1039#true} assume true; {1039#true} is VALID [2022-04-15 13:01:40,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1039#true} {1039#true} #52#return; {1039#true} is VALID [2022-04-15 13:01:40,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {1039#true} call ULTIMATE.init(); {1048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:40,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {1048#(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); {1039#true} is VALID [2022-04-15 13:01:40,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {1039#true} assume true; {1039#true} is VALID [2022-04-15 13:01:40,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1039#true} {1039#true} #52#return; {1039#true} is VALID [2022-04-15 13:01:40,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {1039#true} call #t~ret7 := main(); {1039#true} is VALID [2022-04-15 13:01:40,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {1039#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1044#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:40,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {1044#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= |v_main_#t~post4_In_3| |v_main_#t~post4_Out_8|)) (let ((.cse1 (* v_main_~y~0_In_3 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_Out_6) .cse1) (- 8)))) (and (<= 0 .cse0) (or (and (< v_main_~x~0_Out_8 1000002) (not (< v_main_~x~0_Out_8 50002))) (< v_main_~x~0_Out_8 50001)) (= (mod (+ (* v_main_~y~0_Out_6 4) .cse1) 8) 0) (= (* |v_main_#t~post4_Out_8| 8) (* |v_main_#t~post4_In_3| 8)) (<= (+ (* 2 .cse0) v_main_~x~0_In_4) v_main_~x~0_Out_8))))) InVars {main_#t~post4=|v_main_#t~post4_In_3|, main_~y~0=v_main_~y~0_In_3, main_~x~0=v_main_~x~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1045#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:40,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1045#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:40,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {1045#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1046#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:40,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {1046#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1047#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:40,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {1047#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !(~y~0 > ~z~0); {1040#false} is VALID [2022-04-15 13:01:40,188 INFO L272 TraceCheckUtils]: 11: Hoare triple {1040#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1040#false} is VALID [2022-04-15 13:01:40,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {1040#false} ~cond := #in~cond; {1040#false} is VALID [2022-04-15 13:01:40,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#false} assume 0 == ~cond; {1040#false} is VALID [2022-04-15 13:01:40,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {1040#false} assume !false; {1040#false} is VALID [2022-04-15 13:01:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:40,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998302683] [2022-04-15 13:01:40,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998302683] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:40,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12438969] [2022-04-15 13:01:40,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:40,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:40,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:40,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:40,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 13:01:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:40,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 13:01:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:40,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:41,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {1039#true} call ULTIMATE.init(); {1039#true} is VALID [2022-04-15 13:01:41,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {1039#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); {1039#true} is VALID [2022-04-15 13:01:41,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {1039#true} assume true; {1039#true} is VALID [2022-04-15 13:01:41,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1039#true} {1039#true} #52#return; {1039#true} is VALID [2022-04-15 13:01:41,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {1039#true} call #t~ret7 := main(); {1039#true} is VALID [2022-04-15 13:01:41,226 INFO L290 TraceCheckUtils]: 5: Hoare triple {1039#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1067#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:41,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1067#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [64] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= |v_main_#t~post4_In_3| |v_main_#t~post4_Out_8|)) (let ((.cse1 (* v_main_~y~0_In_3 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_Out_6) .cse1) (- 8)))) (and (<= 0 .cse0) (or (and (< v_main_~x~0_Out_8 1000002) (not (< v_main_~x~0_Out_8 50002))) (< v_main_~x~0_Out_8 50001)) (= (mod (+ (* v_main_~y~0_Out_6 4) .cse1) 8) 0) (= (* |v_main_#t~post4_Out_8| 8) (* |v_main_#t~post4_In_3| 8)) (<= (+ (* 2 .cse0) v_main_~x~0_In_4) v_main_~x~0_Out_8))))) InVars {main_#t~post4=|v_main_#t~post4_In_3|, main_~y~0=v_main_~y~0_In_3, main_~x~0=v_main_~x~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1071#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_33 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_33 4)) (- 8))) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_33 4) (* main_~y~0 4)) 8) 0))))} is VALID [2022-04-15 13:01:41,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1071#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_33 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_33 4)) (- 8))) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_33 4) (* main_~y~0 4)) 8) 0))))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1075#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_33 4)) (- 8))) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_33 4) (* main_~y~0 4)) 8) 0))))} is VALID [2022-04-15 13:01:41,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_33 4)) (- 8))) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_33 4) (* main_~y~0 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1079#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int) (v_main_~y~0_34 Int)) (and (<= v_main_~y~0_34 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_34 4) (* v_main_~y~0_33 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_34 (- 4)) (* v_main_~y~0_33 4)) (- 8))))))} is VALID [2022-04-15 13:01:41,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int) (v_main_~y~0_34 Int)) (and (<= v_main_~y~0_34 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_34 4) (* v_main_~y~0_33 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_34 (- 4)) (* v_main_~y~0_33 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1083#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int) (v_main_~y~0_34 Int)) (and (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_34 4) (* v_main_~y~0_33 4)) 8) 0) (<= v_main_~y~0_34 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_34 (- 4)) (* v_main_~y~0_33 4)) (- 8))))))} is VALID [2022-04-15 13:01:41,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {1083#(and (<= main_~z~0 0) (exists ((v_main_~y~0_33 Int) (v_main_~y~0_34 Int)) (and (<= 50000 v_main_~y~0_33) (= (mod (+ (* v_main_~y~0_34 4) (* v_main_~y~0_33 4)) 8) 0) (<= v_main_~y~0_34 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_34 (- 4)) (* v_main_~y~0_33 4)) (- 8))))))} assume !(~y~0 > ~z~0); {1040#false} is VALID [2022-04-15 13:01:41,236 INFO L272 TraceCheckUtils]: 11: Hoare triple {1040#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1040#false} is VALID [2022-04-15 13:01:41,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {1040#false} ~cond := #in~cond; {1040#false} is VALID [2022-04-15 13:01:41,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#false} assume 0 == ~cond; {1040#false} is VALID [2022-04-15 13:01:41,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1040#false} assume !false; {1040#false} is VALID [2022-04-15 13:01:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:41,237 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:41,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {1040#false} assume !false; {1040#false} is VALID [2022-04-15 13:01:41,593 INFO L290 TraceCheckUtils]: 13: Hoare triple {1040#false} assume 0 == ~cond; {1040#false} is VALID [2022-04-15 13:01:41,593 INFO L290 TraceCheckUtils]: 12: Hoare triple {1040#false} ~cond := #in~cond; {1040#false} is VALID [2022-04-15 13:01:41,593 INFO L272 TraceCheckUtils]: 11: Hoare triple {1040#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1040#false} is VALID [2022-04-15 13:01:41,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {1111#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1040#false} is VALID [2022-04-15 13:01:41,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {1115#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1111#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:41,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {1119#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1115#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:41,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {1123#(or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0))} [63] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1119#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:41,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {1119#(< (+ main_~z~0 2) main_~y~0)} [64] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_3 v_main_~y~0_Out_6) (= v_main_~x~0_In_4 v_main_~x~0_Out_8) (= |v_main_#t~post4_In_3| |v_main_#t~post4_Out_8|)) (let ((.cse1 (* v_main_~y~0_In_3 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_Out_6) .cse1) (- 8)))) (and (<= 0 .cse0) (or (and (< v_main_~x~0_Out_8 1000002) (not (< v_main_~x~0_Out_8 50002))) (< v_main_~x~0_Out_8 50001)) (= (mod (+ (* v_main_~y~0_Out_6 4) .cse1) 8) 0) (= (* |v_main_#t~post4_Out_8| 8) (* |v_main_#t~post4_In_3| 8)) (<= (+ (* 2 .cse0) v_main_~x~0_In_4) v_main_~x~0_Out_8))))) InVars {main_#t~post4=|v_main_#t~post4_In_3|, main_~y~0=v_main_~y~0_In_3, main_~x~0=v_main_~x~0_In_4} OutVars{main_#t~post4=|v_main_#t~post4_Out_8|, main_~y~0=v_main_~y~0_Out_6, main_~x~0=v_main_~x~0_Out_8} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1123#(or (< main_~x~0 1000000) (< (+ main_~z~0 2) main_~y~0))} is VALID [2022-04-15 13:01:41,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {1039#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1119#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:41,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1039#true} call #t~ret7 := main(); {1039#true} is VALID [2022-04-15 13:01:41,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1039#true} {1039#true} #52#return; {1039#true} is VALID [2022-04-15 13:01:41,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1039#true} assume true; {1039#true} is VALID [2022-04-15 13:01:41,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {1039#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); {1039#true} is VALID [2022-04-15 13:01:41,598 INFO L272 TraceCheckUtils]: 0: Hoare triple {1039#true} call ULTIMATE.init(); {1039#true} is VALID [2022-04-15 13:01:41,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:41,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12438969] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:41,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:41,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2022-04-15 13:01:41,757 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:41,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649736636] [2022-04-15 13:01:41,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649736636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:41,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 13:01:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890838695] [2022-04-15 13:01:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:41,758 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:01:41,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:41,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:41,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:41,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 13:01:41,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:41,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 13:01:41,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=256, Unknown=0, NotChecked=0, Total=420 [2022-04-15 13:01:41,784 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:42,214 INFO L93 Difference]: Finished difference Result 64 states and 93 transitions. [2022-04-15 13:01:42,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 13:01:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-15 13:01:42,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 13:01:42,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 13:01:42,218 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-15 13:01:42,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:42,264 INFO L225 Difference]: With dead ends: 64 [2022-04-15 13:01:42,264 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 13:01:42,265 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2022-04-15 13:01:42,266 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:42,266 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 24 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 13:01:42,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 13:01:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-04-15 13:01:42,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:42,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,331 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,331 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:42,332 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 13:01:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 13:01:42,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:42,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:42,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:01:42,335 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-15 13:01:42,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:42,344 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 13:01:42,344 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 13:01:42,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:42,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:42,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:42,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:42,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-04-15 13:01:42,345 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 22 [2022-04-15 13:01:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:42,346 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-04-15 13:01:42,346 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:42,346 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 32 transitions. [2022-04-15 13:01:42,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:42,397 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-04-15 13:01:42,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 13:01:42,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:42,398 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:42,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:42,619 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:42,619 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:42,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:42,619 INFO L85 PathProgramCache]: Analyzing trace with hash 29002067, now seen corresponding path program 4 times [2022-04-15 13:01:42,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:42,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644655728] [2022-04-15 13:01:43,267 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:43,270 INFO L85 PathProgramCache]: Analyzing trace with hash 359191648, now seen corresponding path program 1 times [2022-04-15 13:01:43,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:43,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515343217] [2022-04-15 13:01:43,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:43,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:43,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:43,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {1441#(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); {1430#true} is VALID [2022-04-15 13:01:43,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 13:01:43,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1430#true} {1430#true} #52#return; {1430#true} is VALID [2022-04-15 13:01:43,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1441#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:43,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {1441#(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); {1430#true} is VALID [2022-04-15 13:01:43,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 13:01:43,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #52#return; {1430#true} is VALID [2022-04-15 13:01:43,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret7 := main(); {1430#true} is VALID [2022-04-15 13:01:43,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1435#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:43,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {1435#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [66] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_5 v_main_~x~0_Out_10) (= |v_main_#t~post4_In_4| |v_main_#t~post4_Out_10|)) (let ((.cse1 (* 2 v_main_~y~0_In_4))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_Out_8)) (- 4)))) (and (<= (+ v_main_~x~0_In_5 (* 2 .cse0)) v_main_~x~0_Out_10) (= (mod (+ .cse1 (* 2 v_main_~y~0_Out_8)) 4) 0) (or (< v_main_~x~0_Out_10 50001) (and (not (< v_main_~x~0_Out_10 50002)) (< v_main_~x~0_Out_10 1000002))) (= (* |v_main_#t~post4_In_4| 2) (* 2 |v_main_#t~post4_Out_10|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_4|, main_~y~0=v_main_~y~0_In_4, main_~x~0=v_main_~x~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1436#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:43,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1436#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [65] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1436#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:43,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {1436#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1437#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:43,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1437#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1438#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:43,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {1438#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1439#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:43,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {1439#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1440#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:43,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {1440#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !(~y~0 > ~z~0); {1431#false} is VALID [2022-04-15 13:01:43,381 INFO L272 TraceCheckUtils]: 13: Hoare triple {1431#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1431#false} is VALID [2022-04-15 13:01:43,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-15 13:01:43,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-15 13:01:43,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-15 13:01:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:43,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515343217] [2022-04-15 13:01:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515343217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:43,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808224059] [2022-04-15 13:01:43,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:43,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:43,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:43,383 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:43,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 13:01:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:43,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 13:01:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:43,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:44,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-15 13:01:44,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#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); {1430#true} is VALID [2022-04-15 13:01:44,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 13:01:44,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #52#return; {1430#true} is VALID [2022-04-15 13:01:44,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret7 := main(); {1430#true} is VALID [2022-04-15 13:01:44,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1460#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:45,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {1460#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [66] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_5 v_main_~x~0_Out_10) (= |v_main_#t~post4_In_4| |v_main_#t~post4_Out_10|)) (let ((.cse1 (* 2 v_main_~y~0_In_4))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_Out_8)) (- 4)))) (and (<= (+ v_main_~x~0_In_5 (* 2 .cse0)) v_main_~x~0_Out_10) (= (mod (+ .cse1 (* 2 v_main_~y~0_Out_8)) 4) 0) (or (< v_main_~x~0_Out_10 50001) (and (not (< v_main_~x~0_Out_10 50002)) (< v_main_~x~0_Out_10 1000002))) (= (* |v_main_#t~post4_In_4| 2) (* 2 |v_main_#t~post4_Out_10|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_4|, main_~y~0=v_main_~y~0_In_4, main_~x~0=v_main_~x~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1464#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_47 Int)) (and (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_47 2)) 4) 0) (<= 50000 v_main_~y~0_47) (<= 0 (div (+ (* v_main_~y~0_47 2) (* (- 2) main_~y~0)) (- 4))))))} is VALID [2022-04-15 13:01:45,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {1464#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_47 Int)) (and (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_47 2)) 4) 0) (<= 50000 v_main_~y~0_47) (<= 0 (div (+ (* v_main_~y~0_47 2) (* (- 2) main_~y~0)) (- 4))))))} [65] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1468#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int)) (and (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_47 2)) 4) 0) (<= 50000 v_main_~y~0_47) (<= 0 (div (+ (* v_main_~y~0_47 2) (* (- 2) main_~y~0)) (- 4))))))} is VALID [2022-04-15 13:01:45,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {1468#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int)) (and (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_47 2)) 4) 0) (<= 50000 v_main_~y~0_47) (<= 0 (div (+ (* v_main_~y~0_47 2) (* (- 2) main_~y~0)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1472#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= v_main_~y~0_48 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0))))} is VALID [2022-04-15 13:01:45,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= v_main_~y~0_48 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1476#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0) (<= v_main_~y~0_48 (+ main_~y~0 2)))))} is VALID [2022-04-15 13:01:45,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {1476#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0) (<= v_main_~y~0_48 (+ main_~y~0 2)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1480#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= v_main_~y~0_48 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0))))} is VALID [2022-04-15 13:01:45,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {1480#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= v_main_~y~0_48 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1484#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0) (<= v_main_~y~0_48 (+ main_~y~0 4)))))} is VALID [2022-04-15 13:01:45,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {1484#(and (<= main_~z~0 0) (exists ((v_main_~y~0_47 Int) (v_main_~y~0_48 Int)) (and (<= 0 (div (+ (* v_main_~y~0_48 (- 2)) (* v_main_~y~0_47 2)) (- 4))) (<= 50000 v_main_~y~0_47) (= (mod (+ (* v_main_~y~0_47 2) (* v_main_~y~0_48 2)) 4) 0) (<= v_main_~y~0_48 (+ main_~y~0 4)))))} assume !(~y~0 > ~z~0); {1431#false} is VALID [2022-04-15 13:01:45,015 INFO L272 TraceCheckUtils]: 13: Hoare triple {1431#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1431#false} is VALID [2022-04-15 13:01:45,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-15 13:01:45,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-15 13:01:45,015 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-15 13:01:45,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:45,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:45,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {1431#false} assume !false; {1431#false} is VALID [2022-04-15 13:01:45,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {1431#false} assume 0 == ~cond; {1431#false} is VALID [2022-04-15 13:01:45,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {1431#false} ~cond := #in~cond; {1431#false} is VALID [2022-04-15 13:01:45,420 INFO L272 TraceCheckUtils]: 13: Hoare triple {1431#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1431#false} is VALID [2022-04-15 13:01:45,420 INFO L290 TraceCheckUtils]: 12: Hoare triple {1512#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1431#false} is VALID [2022-04-15 13:01:45,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1516#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1512#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:45,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1516#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:45,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {1524#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1520#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:45,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {1528#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1524#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:01:45,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(or (< main_~x~0 1000000) (< (+ main_~z~0 4) main_~y~0))} [65] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1528#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:01:45,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {1528#(< (+ main_~z~0 4) main_~y~0)} [66] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_4 v_main_~y~0_Out_8) (= v_main_~x~0_In_5 v_main_~x~0_Out_10) (= |v_main_#t~post4_In_4| |v_main_#t~post4_Out_10|)) (let ((.cse1 (* 2 v_main_~y~0_In_4))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_Out_8)) (- 4)))) (and (<= (+ v_main_~x~0_In_5 (* 2 .cse0)) v_main_~x~0_Out_10) (= (mod (+ .cse1 (* 2 v_main_~y~0_Out_8)) 4) 0) (or (< v_main_~x~0_Out_10 50001) (and (not (< v_main_~x~0_Out_10 50002)) (< v_main_~x~0_Out_10 1000002))) (= (* |v_main_#t~post4_In_4| 2) (* 2 |v_main_#t~post4_Out_10|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_4|, main_~y~0=v_main_~y~0_In_4, main_~x~0=v_main_~x~0_In_5} OutVars{main_#t~post4=|v_main_#t~post4_Out_10|, main_~y~0=v_main_~y~0_Out_8, main_~x~0=v_main_~x~0_Out_10} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1532#(or (< main_~x~0 1000000) (< (+ main_~z~0 4) main_~y~0))} is VALID [2022-04-15 13:01:45,424 INFO L290 TraceCheckUtils]: 5: Hoare triple {1430#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1528#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:01:45,424 INFO L272 TraceCheckUtils]: 4: Hoare triple {1430#true} call #t~ret7 := main(); {1430#true} is VALID [2022-04-15 13:01:45,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1430#true} {1430#true} #52#return; {1430#true} is VALID [2022-04-15 13:01:45,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {1430#true} assume true; {1430#true} is VALID [2022-04-15 13:01:45,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {1430#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); {1430#true} is VALID [2022-04-15 13:01:45,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {1430#true} call ULTIMATE.init(); {1430#true} is VALID [2022-04-15 13:01:45,425 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:45,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808224059] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:45,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:45,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 22 [2022-04-15 13:01:45,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644655728] [2022-04-15 13:01:45,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644655728] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:45,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 13:01:45,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972901113] [2022-04-15 13:01:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:45,655 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:01:45,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:45,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:45,676 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:45,676 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 13:01:45,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:45,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 13:01:45,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=326, Invalid=486, Unknown=0, NotChecked=0, Total=812 [2022-04-15 13:01:45,677 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,226 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-04-15 13:01:46,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 13:01:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-15 13:01:46,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:46,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2022-04-15 13:01:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 52 transitions. [2022-04-15 13:01:46,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 52 transitions. [2022-04-15 13:01:46,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:46,276 INFO L225 Difference]: With dead ends: 56 [2022-04-15 13:01:46,276 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 13:01:46,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=638, Invalid=1084, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 13:01:46,278 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:46,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:01:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 13:01:46,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-04-15 13:01:46,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:46,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,357 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,357 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,358 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 13:01:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 13:01:46,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:46,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:46,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:01:46,359 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 13:01:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:46,360 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 13:01:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 13:01:46,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:46,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:46,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:46,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:46,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-04-15 13:01:46,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 28 [2022-04-15 13:01:46,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:46,362 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-04-15 13:01:46,362 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 states have internal predecessors, (24), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:46,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 38 transitions. [2022-04-15 13:01:46,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:46,408 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-04-15 13:01:46,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 13:01:46,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:46,409 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:46,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:46,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:46,610 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:46,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:46,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1166296381, now seen corresponding path program 5 times [2022-04-15 13:01:46,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:46,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1051822219] [2022-04-15 13:01:47,124 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:47,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1900609408, now seen corresponding path program 1 times [2022-04-15 13:01:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:47,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178821304] [2022-04-15 13:01:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:47,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:47,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {1855#(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); {1841#true} is VALID [2022-04-15 13:01:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-15 13:01:47,285 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1841#true} {1841#true} #52#return; {1841#true} is VALID [2022-04-15 13:01:47,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {1841#true} call ULTIMATE.init(); {1855#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:47,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {1855#(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); {1841#true} is VALID [2022-04-15 13:01:47,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-15 13:01:47,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#true} {1841#true} #52#return; {1841#true} is VALID [2022-04-15 13:01:47,286 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#true} call #t~ret7 := main(); {1841#true} is VALID [2022-04-15 13:01:47,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1846#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:47,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {1846#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_10))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_In_5)) 4))) (and (= (* 2 |v_main_#t~post4_Out_12|) (* |v_main_#t~post4_In_5| 2)) (or (< v_main_~x~0_Out_12 50001) (and (not (< v_main_~x~0_Out_12 50002)) (< v_main_~x~0_Out_12 1000002))) (<= (+ v_main_~x~0_In_6 (* .cse0 2)) v_main_~x~0_Out_12) (= (mod (+ (* 2 v_main_~y~0_In_5) .cse1) 4) 0) (<= 0 .cse0)))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= |v_main_#t~post4_In_5| |v_main_#t~post4_Out_12|))) InVars {main_#t~post4=|v_main_#t~post4_In_5|, main_~y~0=v_main_~y~0_In_5, main_~x~0=v_main_~x~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1847#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 50000 main_~y~0)))} is VALID [2022-04-15 13:01:47,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {1847#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 50000 main_~y~0)))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1848#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:47,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {1848#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1849#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:47,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {1849#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1850#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:47,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {1850#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1851#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:47,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {1851#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1852#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:47,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {1852#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1853#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:47,302 INFO L290 TraceCheckUtils]: 13: Hoare triple {1853#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1854#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:01:47,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {1854#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !(~y~0 > ~z~0); {1842#false} is VALID [2022-04-15 13:01:47,306 INFO L272 TraceCheckUtils]: 15: Hoare triple {1842#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1842#false} is VALID [2022-04-15 13:01:47,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1842#false} ~cond := #in~cond; {1842#false} is VALID [2022-04-15 13:01:47,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {1842#false} assume 0 == ~cond; {1842#false} is VALID [2022-04-15 13:01:47,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {1842#false} assume !false; {1842#false} is VALID [2022-04-15 13:01:47,307 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:47,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:47,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178821304] [2022-04-15 13:01:47,307 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178821304] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:47,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028465345] [2022-04-15 13:01:47,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:47,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:47,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:47,309 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:47,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-15 13:01:47,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 13:01:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:47,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:49,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {1841#true} call ULTIMATE.init(); {1841#true} is VALID [2022-04-15 13:01:49,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#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); {1841#true} is VALID [2022-04-15 13:01:49,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-15 13:01:49,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#true} {1841#true} #52#return; {1841#true} is VALID [2022-04-15 13:01:49,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#true} call #t~ret7 := main(); {1841#true} is VALID [2022-04-15 13:01:49,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1874#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:49,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {1874#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [68] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_10))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_In_5)) 4))) (and (= (* 2 |v_main_#t~post4_Out_12|) (* |v_main_#t~post4_In_5| 2)) (or (< v_main_~x~0_Out_12 50001) (and (not (< v_main_~x~0_Out_12 50002)) (< v_main_~x~0_Out_12 1000002))) (<= (+ v_main_~x~0_In_6 (* .cse0 2)) v_main_~x~0_Out_12) (= (mod (+ (* 2 v_main_~y~0_In_5) .cse1) 4) 0) (<= 0 .cse0)))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= |v_main_#t~post4_In_5| |v_main_#t~post4_Out_12|))) InVars {main_#t~post4=|v_main_#t~post4_In_5|, main_~y~0=v_main_~y~0_In_5, main_~x~0=v_main_~x~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1878#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_67 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_67 (- 2)) (* main_~y~0 2)) 4)))))} is VALID [2022-04-15 13:01:49,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {1878#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_67 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_67 (- 2)) (* main_~y~0 2)) 4)))))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1882#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_67 (- 2)) (* main_~y~0 2)) 4)))))} is VALID [2022-04-15 13:01:49,674 INFO L290 TraceCheckUtils]: 8: Hoare triple {1882#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* main_~y~0 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_67 (- 2)) (* main_~y~0 2)) 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1886#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (<= v_main_~y~0_68 (+ main_~y~0 1)) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)))))} is VALID [2022-04-15 13:01:49,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {1886#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (<= v_main_~y~0_68 (+ main_~y~0 1)) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1890#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= v_main_~y~0_68 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)))))} is VALID [2022-04-15 13:01:49,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {1890#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= v_main_~y~0_68 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1894#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 3)))))} is VALID [2022-04-15 13:01:49,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 3)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1898#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 4)))))} is VALID [2022-04-15 13:01:49,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {1898#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1902#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ 5 main_~y~0)))))} is VALID [2022-04-15 13:01:49,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {1902#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ 5 main_~y~0)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1906#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 6)))))} is VALID [2022-04-15 13:01:49,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {1906#(and (<= main_~z~0 0) (exists ((v_main_~y~0_67 Int) (v_main_~y~0_68 Int)) (and (<= 50000 v_main_~y~0_67) (= (mod (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_68 2) (* v_main_~y~0_67 (- 2))) 4)) (<= v_main_~y~0_68 (+ main_~y~0 6)))))} assume !(~y~0 > ~z~0); {1842#false} is VALID [2022-04-15 13:01:49,698 INFO L272 TraceCheckUtils]: 15: Hoare triple {1842#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1842#false} is VALID [2022-04-15 13:01:49,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {1842#false} ~cond := #in~cond; {1842#false} is VALID [2022-04-15 13:01:49,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {1842#false} assume 0 == ~cond; {1842#false} is VALID [2022-04-15 13:01:49,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {1842#false} assume !false; {1842#false} is VALID [2022-04-15 13:01:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:49,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:50,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {1842#false} assume !false; {1842#false} is VALID [2022-04-15 13:01:50,236 INFO L290 TraceCheckUtils]: 17: Hoare triple {1842#false} assume 0 == ~cond; {1842#false} is VALID [2022-04-15 13:01:50,237 INFO L290 TraceCheckUtils]: 16: Hoare triple {1842#false} ~cond := #in~cond; {1842#false} is VALID [2022-04-15 13:01:50,237 INFO L272 TraceCheckUtils]: 15: Hoare triple {1842#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {1842#false} is VALID [2022-04-15 13:01:50,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {1934#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {1842#false} is VALID [2022-04-15 13:01:50,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {1938#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1934#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:50,239 INFO L290 TraceCheckUtils]: 12: Hoare triple {1942#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1938#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:50,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {1946#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1942#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:50,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {1950#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1946#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:01:50,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {1954#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1950#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:01:50,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {1958#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {1954#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:50,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {1962#(or (< main_~x~0 1000000) (< (+ main_~z~0 6) main_~y~0))} [67] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {1958#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:01:50,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {1958#(< (+ main_~z~0 6) main_~y~0)} [68] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_10))) (let ((.cse0 (div (+ .cse1 (* (- 2) v_main_~y~0_In_5)) 4))) (and (= (* 2 |v_main_#t~post4_Out_12|) (* |v_main_#t~post4_In_5| 2)) (or (< v_main_~x~0_Out_12 50001) (and (not (< v_main_~x~0_Out_12 50002)) (< v_main_~x~0_Out_12 1000002))) (<= (+ v_main_~x~0_In_6 (* .cse0 2)) v_main_~x~0_Out_12) (= (mod (+ (* 2 v_main_~y~0_In_5) .cse1) 4) 0) (<= 0 .cse0)))) (and (= v_main_~y~0_In_5 v_main_~y~0_Out_10) (= v_main_~x~0_In_6 v_main_~x~0_Out_12) (= |v_main_#t~post4_In_5| |v_main_#t~post4_Out_12|))) InVars {main_#t~post4=|v_main_#t~post4_In_5|, main_~y~0=v_main_~y~0_In_5, main_~x~0=v_main_~x~0_In_6} OutVars{main_#t~post4=|v_main_#t~post4_Out_12|, main_~y~0=v_main_~y~0_Out_10, main_~x~0=v_main_~x~0_Out_12} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {1962#(or (< main_~x~0 1000000) (< (+ main_~z~0 6) main_~y~0))} is VALID [2022-04-15 13:01:50,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {1841#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {1958#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:01:50,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {1841#true} call #t~ret7 := main(); {1841#true} is VALID [2022-04-15 13:01:50,245 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1841#true} {1841#true} #52#return; {1841#true} is VALID [2022-04-15 13:01:50,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {1841#true} assume true; {1841#true} is VALID [2022-04-15 13:01:50,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {1841#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); {1841#true} is VALID [2022-04-15 13:01:50,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {1841#true} call ULTIMATE.init(); {1841#true} is VALID [2022-04-15 13:01:50,248 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:50,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028465345] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:50,248 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:50,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 29 [2022-04-15 13:01:51,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:51,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1051822219] [2022-04-15 13:01:51,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1051822219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:51,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:51,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 13:01:51,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039939785] [2022-04-15 13:01:51,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 13:01:51,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:51,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:51,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:51,848 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 13:01:51,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:51,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 13:01:51,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=596, Invalid=886, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 13:01:51,849 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:52,258 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 13:01:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 13:01:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-15 13:01:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. [2022-04-15 13:01:52,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 50 transitions. [2022-04-15 13:01:52,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 50 transitions. [2022-04-15 13:01:52,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:52,353 INFO L225 Difference]: With dead ends: 63 [2022-04-15 13:01:52,354 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 13:01:52,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=753, Invalid=1317, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 13:01:52,355 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:52,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 37 Invalid, 0 Unknown, 33 Unchecked, 0.0s Time] [2022-04-15 13:01:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 13:01:52,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-15 13:01:52,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:52,497 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,497 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,497 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:52,501 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-15 13:01:52,501 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-15 13:01:52,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:52,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:52,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 13:01:52,501 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 13:01:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:52,503 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-04-15 13:01:52,503 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-04-15 13:01:52,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:52,504 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:52,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:52,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-04-15 13:01:52,506 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 34 [2022-04-15 13:01:52,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:52,506 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-04-15 13:01:52,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.5) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:52,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 59 transitions. [2022-04-15 13:01:52,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:52,640 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-04-15 13:01:52,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 13:01:52,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:52,641 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:52,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:52,842 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:52,842 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:52,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:52,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1830987206, now seen corresponding path program 6 times [2022-04-15 13:01:52,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:52,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1248821020] [2022-04-15 13:01:53,508 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash -351735005, now seen corresponding path program 1 times [2022-04-15 13:01:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418362162] [2022-04-15 13:01:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:53,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:53,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {2370#(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); {2356#true} is VALID [2022-04-15 13:01:53,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {2356#true} assume true; {2356#true} is VALID [2022-04-15 13:01:53,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2356#true} {2356#true} #52#return; {2356#true} is VALID [2022-04-15 13:01:53,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {2356#true} call ULTIMATE.init(); {2370#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:53,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {2370#(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); {2356#true} is VALID [2022-04-15 13:01:53,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {2356#true} assume true; {2356#true} is VALID [2022-04-15 13:01:53,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2356#true} {2356#true} #52#return; {2356#true} is VALID [2022-04-15 13:01:53,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {2356#true} call #t~ret7 := main(); {2356#true} is VALID [2022-04-15 13:01:53,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {2356#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2361#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:53,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {2361#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_6| |v_main_#t~post4_Out_14|))) (or (and .cse0 (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (let ((.cse1 (div (+ v_main_~y~0_In_6 (* (- 1) v_main_~y~0_Out_12)) (- 2)))) (and (<= (+ v_main_~x~0_In_7 (* .cse1 2)) v_main_~x~0_Out_14) .cse0 (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_12 v_main_~y~0_In_6) 2) 0) (or (< v_main_~x~0_Out_14 50001) (and (< v_main_~x~0_Out_14 1000002) (not (< v_main_~x~0_Out_14 50002)))))))) InVars {main_#t~post4=|v_main_#t~post4_In_6|, main_~y~0=v_main_~y~0_In_6, main_~x~0=v_main_~x~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2362#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:53,694 INFO L290 TraceCheckUtils]: 7: Hoare triple {2362#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [69] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2362#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:53,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2362#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2363#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:53,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2363#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2364#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:53,699 INFO L290 TraceCheckUtils]: 10: Hoare triple {2364#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2365#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:53,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2365#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2366#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:53,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {2366#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2367#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:01:53,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {2367#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2368#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:01:53,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {2368#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2369#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:01:53,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {2369#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !(~y~0 > ~z~0); {2357#false} is VALID [2022-04-15 13:01:53,702 INFO L272 TraceCheckUtils]: 16: Hoare triple {2357#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2357#false} is VALID [2022-04-15 13:01:53,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {2357#false} ~cond := #in~cond; {2357#false} is VALID [2022-04-15 13:01:53,702 INFO L290 TraceCheckUtils]: 18: Hoare triple {2357#false} assume 0 == ~cond; {2357#false} is VALID [2022-04-15 13:01:53,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {2357#false} assume !false; {2357#false} is VALID [2022-04-15 13:01:53,702 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:53,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:53,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418362162] [2022-04-15 13:01:53,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418362162] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:53,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387210487] [2022-04-15 13:01:53,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:53,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:53,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:53,704 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:53,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 13:01:53,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:53,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 13:01:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:53,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:54,168 INFO L272 TraceCheckUtils]: 0: Hoare triple {2356#true} call ULTIMATE.init(); {2356#true} is VALID [2022-04-15 13:01:54,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {2356#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); {2356#true} is VALID [2022-04-15 13:01:54,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {2356#true} assume true; {2356#true} is VALID [2022-04-15 13:01:54,168 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2356#true} {2356#true} #52#return; {2356#true} is VALID [2022-04-15 13:01:54,168 INFO L272 TraceCheckUtils]: 4: Hoare triple {2356#true} call #t~ret7 := main(); {2356#true} is VALID [2022-04-15 13:01:54,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {2356#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:54,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [70] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_6| |v_main_#t~post4_Out_14|))) (or (and .cse0 (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (let ((.cse1 (div (+ v_main_~y~0_In_6 (* (- 1) v_main_~y~0_Out_12)) (- 2)))) (and (<= (+ v_main_~x~0_In_7 (* .cse1 2)) v_main_~x~0_Out_14) .cse0 (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_12 v_main_~y~0_In_6) 2) 0) (or (< v_main_~x~0_Out_14 50001) (and (< v_main_~x~0_Out_14 1000002) (not (< v_main_~x~0_Out_14 50002)))))))) InVars {main_#t~post4=|v_main_#t~post4_In_6|, main_~y~0=v_main_~y~0_In_6, main_~x~0=v_main_~x~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:54,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [69] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:54,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {2389#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2399#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:54,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {2399#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2403#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:01:54,173 INFO L290 TraceCheckUtils]: 10: Hoare triple {2403#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2407#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:54,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {2407#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2411#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:54,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {2411#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2415#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:54,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {2415#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2419#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:01:54,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {2419#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2423#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:01:54,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {2423#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !(~y~0 > ~z~0); {2357#false} is VALID [2022-04-15 13:01:54,179 INFO L272 TraceCheckUtils]: 16: Hoare triple {2357#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2357#false} is VALID [2022-04-15 13:01:54,179 INFO L290 TraceCheckUtils]: 17: Hoare triple {2357#false} ~cond := #in~cond; {2357#false} is VALID [2022-04-15 13:01:54,179 INFO L290 TraceCheckUtils]: 18: Hoare triple {2357#false} assume 0 == ~cond; {2357#false} is VALID [2022-04-15 13:01:54,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {2357#false} assume !false; {2357#false} is VALID [2022-04-15 13:01:54,179 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:54,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:54,696 INFO L290 TraceCheckUtils]: 19: Hoare triple {2357#false} assume !false; {2357#false} is VALID [2022-04-15 13:01:54,696 INFO L290 TraceCheckUtils]: 18: Hoare triple {2357#false} assume 0 == ~cond; {2357#false} is VALID [2022-04-15 13:01:54,696 INFO L290 TraceCheckUtils]: 17: Hoare triple {2357#false} ~cond := #in~cond; {2357#false} is VALID [2022-04-15 13:01:54,696 INFO L272 TraceCheckUtils]: 16: Hoare triple {2357#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2357#false} is VALID [2022-04-15 13:01:54,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {2451#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2357#false} is VALID [2022-04-15 13:01:54,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {2455#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2451#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:54,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {2459#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2455#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:54,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2463#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2459#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:54,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2467#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2463#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:01:54,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {2471#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2467#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:01:54,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {2475#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2471#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:54,701 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2475#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:01:54,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {2479#(< (+ 7 main_~z~0) main_~y~0)} [69] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2479#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:54,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {2479#(< (+ 7 main_~z~0) main_~y~0)} [70] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_6| |v_main_#t~post4_Out_14|))) (or (and .cse0 (= v_main_~x~0_In_7 v_main_~x~0_Out_14) (= v_main_~y~0_In_6 v_main_~y~0_Out_12)) (let ((.cse1 (div (+ v_main_~y~0_In_6 (* (- 1) v_main_~y~0_Out_12)) (- 2)))) (and (<= (+ v_main_~x~0_In_7 (* .cse1 2)) v_main_~x~0_Out_14) .cse0 (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_12 v_main_~y~0_In_6) 2) 0) (or (< v_main_~x~0_Out_14 50001) (and (< v_main_~x~0_Out_14 1000002) (not (< v_main_~x~0_Out_14 50002)))))))) InVars {main_#t~post4=|v_main_#t~post4_In_6|, main_~y~0=v_main_~y~0_In_6, main_~x~0=v_main_~x~0_In_7} OutVars{main_#t~post4=|v_main_#t~post4_Out_14|, main_~y~0=v_main_~y~0_Out_12, main_~x~0=v_main_~x~0_Out_14} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2479#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:54,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {2356#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2479#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:54,704 INFO L272 TraceCheckUtils]: 4: Hoare triple {2356#true} call #t~ret7 := main(); {2356#true} is VALID [2022-04-15 13:01:54,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2356#true} {2356#true} #52#return; {2356#true} is VALID [2022-04-15 13:01:54,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {2356#true} assume true; {2356#true} is VALID [2022-04-15 13:01:54,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {2356#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); {2356#true} is VALID [2022-04-15 13:01:54,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {2356#true} call ULTIMATE.init(); {2356#true} is VALID [2022-04-15 13:01:54,704 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:54,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387210487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:54,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:54,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2022-04-15 13:01:54,958 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:54,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1248821020] [2022-04-15 13:01:54,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1248821020] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:54,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:54,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 13:01:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963165747] [2022-04-15 13:01:54,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:54,959 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-15 13:01:54,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:54,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:54,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:54,994 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 13:01:54,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:54,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 13:01:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=568, Invalid=764, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 13:01:54,995 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:55,811 INFO L93 Difference]: Finished difference Result 102 states and 123 transitions. [2022-04-15 13:01:55,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 13:01:55,811 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 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 35 [2022-04-15 13:01:55,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 13:01:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 60 transitions. [2022-04-15 13:01:55,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 60 transitions. [2022-04-15 13:01:55,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:55,874 INFO L225 Difference]: With dead ends: 102 [2022-04-15 13:01:55,874 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 13:01:55,875 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1142, Invalid=1828, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 13:01:55,876 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:01:55,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 13:01:55,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 13:01:55,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 42. [2022-04-15 13:01:55,994 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:01:55,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,995 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,995 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:55,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:55,996 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 13:01:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 13:01:55,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:55,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:55,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 13:01:55,997 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-15 13:01:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:55,999 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 13:01:55,999 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 13:01:55,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:01:55,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:01:55,999 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:01:55,999 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:01:56,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.1081081081081081) internal successors, (41), 37 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:56,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-04-15 13:01:56,001 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 35 [2022-04-15 13:01:56,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:01:56,001 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-04-15 13:01:56,001 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 20 states have internal predecessors, (31), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:56,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 45 transitions. [2022-04-15 13:01:56,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-04-15 13:01:56,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 13:01:56,090 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:01:56,090 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:01:56,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 13:01:56,295 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:56,296 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:01:56,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:01:56,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1931368732, now seen corresponding path program 7 times [2022-04-15 13:01:56,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:56,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679987059] [2022-04-15 13:01:56,879 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:01:56,881 INFO L85 PathProgramCache]: Analyzing trace with hash 121352963, now seen corresponding path program 1 times [2022-04-15 13:01:56,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:01:56,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538418663] [2022-04-15 13:01:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:56,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:01:56,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:01:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:57,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {2972#(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); {2955#true} is VALID [2022-04-15 13:01:57,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {2955#true} assume true; {2955#true} is VALID [2022-04-15 13:01:57,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2955#true} {2955#true} #52#return; {2955#true} is VALID [2022-04-15 13:01:57,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {2955#true} call ULTIMATE.init(); {2972#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:01:57,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2972#(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); {2955#true} is VALID [2022-04-15 13:01:57,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#true} assume true; {2955#true} is VALID [2022-04-15 13:01:57,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#true} {2955#true} #52#return; {2955#true} is VALID [2022-04-15 13:01:57,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#true} call #t~ret7 := main(); {2955#true} is VALID [2022-04-15 13:01:57,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2960#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:57,082 INFO L290 TraceCheckUtils]: 6: Hoare triple {2960#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* 2 v_main_~y~0_In_7))) (let ((.cse1 (div (+ (* (- 2) v_main_~y~0_Out_14) .cse0) (- 4)))) (and (or (< v_main_~x~0_Out_16 50001) (and (not (< v_main_~x~0_Out_16 50002)) (< v_main_~x~0_Out_16 1000002))) (= (mod (+ (* 2 v_main_~y~0_Out_14) .cse0) 4) 0) (= (* |v_main_#t~post4_In_7| 2) (* 2 |v_main_#t~post4_Out_16|)) (<= (+ v_main_~x~0_In_8 (* 2 .cse1)) v_main_~x~0_Out_16) (<= 0 .cse1)))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= |v_main_#t~post4_In_7| |v_main_#t~post4_Out_16|) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_#t~post4=|v_main_#t~post4_In_7|, main_~y~0=v_main_~y~0_In_7, main_~x~0=v_main_~x~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2961#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 49999 main_~y~0)))} is VALID [2022-04-15 13:01:57,083 INFO L290 TraceCheckUtils]: 7: Hoare triple {2961#(and (= main_~z~0 0) (or (<= main_~x~0 0) (<= 49999 main_~y~0)))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2962#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:57,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {2962#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2963#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:57,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {2963#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2964#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:57,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {2964#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2965#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:57,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2966#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:57,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {2966#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2967#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:01:57,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {2967#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2968#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:01:57,095 INFO L290 TraceCheckUtils]: 14: Hoare triple {2968#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2969#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:01:57,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {2969#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2970#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:01:57,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {2970#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {2971#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:01:57,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {2971#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {2956#false} is VALID [2022-04-15 13:01:57,098 INFO L272 TraceCheckUtils]: 18: Hoare triple {2956#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2956#false} is VALID [2022-04-15 13:01:57,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2956#false} ~cond := #in~cond; {2956#false} is VALID [2022-04-15 13:01:57,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {2956#false} assume 0 == ~cond; {2956#false} is VALID [2022-04-15 13:01:57,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {2956#false} assume !false; {2956#false} is VALID [2022-04-15 13:01:57,102 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:57,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:01:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538418663] [2022-04-15 13:01:57,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538418663] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:01:57,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379213913] [2022-04-15 13:01:57,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:01:57,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:01:57,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:01:57,108 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:01:57,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 13:01:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:57,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 13:01:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:01:57,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:01:57,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {2955#true} call ULTIMATE.init(); {2955#true} is VALID [2022-04-15 13:01:57,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {2955#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); {2955#true} is VALID [2022-04-15 13:01:57,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#true} assume true; {2955#true} is VALID [2022-04-15 13:01:57,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#true} {2955#true} #52#return; {2955#true} is VALID [2022-04-15 13:01:57,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#true} call #t~ret7 := main(); {2955#true} is VALID [2022-04-15 13:01:57,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:57,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [72] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* 2 v_main_~y~0_In_7))) (let ((.cse1 (div (+ (* (- 2) v_main_~y~0_Out_14) .cse0) (- 4)))) (and (or (< v_main_~x~0_Out_16 50001) (and (not (< v_main_~x~0_Out_16 50002)) (< v_main_~x~0_Out_16 1000002))) (= (mod (+ (* 2 v_main_~y~0_Out_14) .cse0) 4) 0) (= (* |v_main_#t~post4_In_7| 2) (* 2 |v_main_#t~post4_Out_16|)) (<= (+ v_main_~x~0_In_8 (* 2 .cse1)) v_main_~x~0_Out_16) (<= 0 .cse1)))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= |v_main_#t~post4_In_7| |v_main_#t~post4_Out_16|) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_#t~post4=|v_main_#t~post4_In_7|, main_~y~0=v_main_~y~0_In_7, main_~x~0=v_main_~x~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:57,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:01:57,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {2991#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3001#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:01:57,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {3001#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3005#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:01:57,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {3005#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3009#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:01:57,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {3009#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3013#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:01:57,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {3013#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3017#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:01:57,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {3017#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3021#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:01:57,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {3021#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3025#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:01:57,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {3025#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3029#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:01:57,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {3029#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3033#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:01:57,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {3033#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !(~y~0 > ~z~0); {2956#false} is VALID [2022-04-15 13:01:57,550 INFO L272 TraceCheckUtils]: 18: Hoare triple {2956#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2956#false} is VALID [2022-04-15 13:01:57,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {2956#false} ~cond := #in~cond; {2956#false} is VALID [2022-04-15 13:01:57,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {2956#false} assume 0 == ~cond; {2956#false} is VALID [2022-04-15 13:01:57,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {2956#false} assume !false; {2956#false} is VALID [2022-04-15 13:01:57,550 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:57,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:01:58,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {2956#false} assume !false; {2956#false} is VALID [2022-04-15 13:01:58,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {2956#false} assume 0 == ~cond; {2956#false} is VALID [2022-04-15 13:01:58,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2956#false} ~cond := #in~cond; {2956#false} is VALID [2022-04-15 13:01:58,079 INFO L272 TraceCheckUtils]: 18: Hoare triple {2956#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {2956#false} is VALID [2022-04-15 13:01:58,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {3061#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {2956#false} is VALID [2022-04-15 13:01:58,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {3065#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3061#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:01:58,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {3069#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3065#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:01:58,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {3073#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3069#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:01:58,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {3077#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3073#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:01:58,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {3081#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3077#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:01:58,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {3085#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3081#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:58,088 INFO L290 TraceCheckUtils]: 10: Hoare triple {3089#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3085#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:01:58,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {3093#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3089#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:01:58,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {3097#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3093#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:01:58,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {3097#(< (+ main_~z~0 9) main_~y~0)} [71] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3097#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:01:58,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {3097#(< (+ main_~z~0 9) main_~y~0)} [72] L10-2-->L17-1_primed: Formula: (or (let ((.cse0 (* 2 v_main_~y~0_In_7))) (let ((.cse1 (div (+ (* (- 2) v_main_~y~0_Out_14) .cse0) (- 4)))) (and (or (< v_main_~x~0_Out_16 50001) (and (not (< v_main_~x~0_Out_16 50002)) (< v_main_~x~0_Out_16 1000002))) (= (mod (+ (* 2 v_main_~y~0_Out_14) .cse0) 4) 0) (= (* |v_main_#t~post4_In_7| 2) (* 2 |v_main_#t~post4_Out_16|)) (<= (+ v_main_~x~0_In_8 (* 2 .cse1)) v_main_~x~0_Out_16) (<= 0 .cse1)))) (and (= v_main_~y~0_In_7 v_main_~y~0_Out_14) (= |v_main_#t~post4_In_7| |v_main_#t~post4_Out_16|) (= v_main_~x~0_In_8 v_main_~x~0_Out_16))) InVars {main_#t~post4=|v_main_#t~post4_In_7|, main_~y~0=v_main_~y~0_In_7, main_~x~0=v_main_~x~0_In_8} OutVars{main_#t~post4=|v_main_#t~post4_Out_16|, main_~y~0=v_main_~y~0_Out_14, main_~x~0=v_main_~x~0_Out_16} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3097#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:01:58,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {2955#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3097#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:01:58,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {2955#true} call #t~ret7 := main(); {2955#true} is VALID [2022-04-15 13:01:58,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2955#true} {2955#true} #52#return; {2955#true} is VALID [2022-04-15 13:01:58,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {2955#true} assume true; {2955#true} is VALID [2022-04-15 13:01:58,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {2955#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); {2955#true} is VALID [2022-04-15 13:01:58,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {2955#true} call ULTIMATE.init(); {2955#true} is VALID [2022-04-15 13:01:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:01:58,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379213913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:01:58,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:01:58,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 35 [2022-04-15 13:01:59,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:01:59,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679987059] [2022-04-15 13:01:59,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679987059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:01:59,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:01:59,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:01:59,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100797880] [2022-04-15 13:01:59,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:01:59,366 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 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 41 [2022-04-15 13:01:59,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:01:59,367 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:59,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:01:59,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:01:59,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:01:59,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:01:59,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=898, Invalid=1264, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 13:01:59,442 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:59,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:01:59,931 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2022-04-15 13:01:59,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:01:59,931 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 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 41 [2022-04-15 13:01:59,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:01:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:59,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-15 13:01:59,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:01:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 57 transitions. [2022-04-15 13:01:59,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 57 transitions. [2022-04-15 13:02:00,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:00,035 INFO L225 Difference]: With dead ends: 77 [2022-04-15 13:02:00,035 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 13:02:00,036 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1176, Invalid=2016, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 13:02:00,036 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:00,037 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 38 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 46 Unchecked, 0.0s Time] [2022-04-15 13:02:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 13:02:00,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-04-15 13:02:00,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:00,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:00,297 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:00,297 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:00,301 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 13:02:00,301 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-15 13:02:00,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:00,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:00,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 13:02:00,302 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 72 states. [2022-04-15 13:02:00,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:00,303 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-04-15 13:02:00,303 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-04-15 13:02:00,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:00,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:00,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:00,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:00,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.1379310344827587) internal successors, (66), 58 states have internal predecessors, (66), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-04-15 13:02:00,305 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 41 [2022-04-15 13:02:00,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:00,305 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-04-15 13:02:00,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 24 states have internal predecessors, (37), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:00,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 70 transitions. [2022-04-15 13:02:00,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:00,477 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-15 13:02:00,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 13:02:00,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:00,480 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:00,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 13:02:00,683 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:00,684 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:00,684 INFO L85 PathProgramCache]: Analyzing trace with hash -221573689, now seen corresponding path program 8 times [2022-04-15 13:02:00,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:00,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845834252] [2022-04-15 13:02:01,409 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:02:01,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1188063360, now seen corresponding path program 1 times [2022-04-15 13:02:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:01,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465641271] [2022-04-15 13:02:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:01,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:01,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:01,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {3596#(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); {3580#true} is VALID [2022-04-15 13:02:01,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 13:02:01,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3580#true} {3580#true} #52#return; {3580#true} is VALID [2022-04-15 13:02:01,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3596#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:01,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {3596#(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); {3580#true} is VALID [2022-04-15 13:02:01,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 13:02:01,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #52#return; {3580#true} is VALID [2022-04-15 13:02:01,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret7 := main(); {3580#true} is VALID [2022-04-15 13:02:01,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:01,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_8| |v_main_#t~post4_Out_18|))) (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) .cse0 (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (let ((.cse1 (div (+ v_main_~y~0_Out_16 (* (- 1) v_main_~y~0_In_8)) 2))) (and (or (< v_main_~x~0_Out_18 50001) (and (< v_main_~x~0_Out_18 1000002) (not (< v_main_~x~0_Out_18 50002)))) (= (mod (+ v_main_~y~0_Out_16 v_main_~y~0_In_8) 2) 0) (<= 0 .cse1) .cse0 (<= (+ v_main_~x~0_In_9 (* .cse1 2)) v_main_~x~0_Out_18))))) InVars {main_#t~post4=|v_main_#t~post4_In_8|, main_~y~0=v_main_~y~0_In_8, main_~x~0=v_main_~x~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_~y~0=v_main_~y~0_Out_16, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:01,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [73] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:01,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {3585#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3586#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:02:01,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {3586#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3587#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:02:01,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {3587#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3588#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:02:01,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {3588#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3589#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:02:01,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {3589#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3590#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:02:01,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {3590#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3591#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:02:01,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {3591#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3592#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:02:01,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {3592#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3593#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:02:01,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {3593#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3594#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:02:01,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {3594#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3595#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:02:01,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {3595#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {3581#false} is VALID [2022-04-15 13:02:01,592 INFO L272 TraceCheckUtils]: 19: Hoare triple {3581#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3581#false} is VALID [2022-04-15 13:02:01,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {3581#false} ~cond := #in~cond; {3581#false} is VALID [2022-04-15 13:02:01,592 INFO L290 TraceCheckUtils]: 21: Hoare triple {3581#false} assume 0 == ~cond; {3581#false} is VALID [2022-04-15 13:02:01,592 INFO L290 TraceCheckUtils]: 22: Hoare triple {3581#false} assume !false; {3581#false} is VALID [2022-04-15 13:02:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465641271] [2022-04-15 13:02:01,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465641271] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:01,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219551738] [2022-04-15 13:02:01,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:01,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:01,594 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:01,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 13:02:01,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:01,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 13:02:01,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:01,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:03,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3580#true} is VALID [2022-04-15 13:02:03,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {3580#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); {3580#true} is VALID [2022-04-15 13:02:03,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 13:02:03,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #52#return; {3580#true} is VALID [2022-04-15 13:02:03,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret7 := main(); {3580#true} is VALID [2022-04-15 13:02:03,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3615#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:03,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {3615#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [74] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_8| |v_main_#t~post4_Out_18|))) (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) .cse0 (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (let ((.cse1 (div (+ v_main_~y~0_Out_16 (* (- 1) v_main_~y~0_In_8)) 2))) (and (or (< v_main_~x~0_Out_18 50001) (and (< v_main_~x~0_Out_18 1000002) (not (< v_main_~x~0_Out_18 50002)))) (= (mod (+ v_main_~y~0_Out_16 v_main_~y~0_In_8) 2) 0) (<= 0 .cse1) .cse0 (<= (+ v_main_~x~0_In_9 (* .cse1 2)) v_main_~x~0_Out_18))))) InVars {main_#t~post4=|v_main_#t~post4_In_8|, main_~y~0=v_main_~y~0_In_8, main_~x~0=v_main_~x~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_~y~0=v_main_~y~0_Out_16, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3619#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} is VALID [2022-04-15 13:02:03,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {3619#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} [73] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3623#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} is VALID [2022-04-15 13:02:03,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {3623#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3627#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49999) main_~y~0) 2)))} is VALID [2022-04-15 13:02:03,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {3627#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49999) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3631#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49998)) 2)))} is VALID [2022-04-15 13:02:03,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {3631#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49998)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3635#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49997)) 2)))} is VALID [2022-04-15 13:02:03,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {3635#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49997)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3639#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49996)) 2)))} is VALID [2022-04-15 13:02:03,622 INFO L290 TraceCheckUtils]: 12: Hoare triple {3639#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49996)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3643#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49995) main_~y~0) 2)))} is VALID [2022-04-15 13:02:03,623 INFO L290 TraceCheckUtils]: 13: Hoare triple {3643#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49995) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3647#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49994) main_~y~0) 2)))} is VALID [2022-04-15 13:02:03,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {3647#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49994) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3651#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49993)) 2)))} is VALID [2022-04-15 13:02:03,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {3651#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49993)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3655#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49992)) 2)))} is VALID [2022-04-15 13:02:03,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {3655#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49992)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3659#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49991)) 2)))} is VALID [2022-04-15 13:02:03,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {3659#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49991)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3663#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49990)) 2)))} is VALID [2022-04-15 13:02:03,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {3663#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49990)) 2)))} assume !(~y~0 > ~z~0); {3581#false} is VALID [2022-04-15 13:02:03,629 INFO L272 TraceCheckUtils]: 19: Hoare triple {3581#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3581#false} is VALID [2022-04-15 13:02:03,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {3581#false} ~cond := #in~cond; {3581#false} is VALID [2022-04-15 13:02:03,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {3581#false} assume 0 == ~cond; {3581#false} is VALID [2022-04-15 13:02:03,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {3581#false} assume !false; {3581#false} is VALID [2022-04-15 13:02:03,629 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:03,630 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:02:04,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {3581#false} assume !false; {3581#false} is VALID [2022-04-15 13:02:04,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {3581#false} assume 0 == ~cond; {3581#false} is VALID [2022-04-15 13:02:04,459 INFO L290 TraceCheckUtils]: 20: Hoare triple {3581#false} ~cond := #in~cond; {3581#false} is VALID [2022-04-15 13:02:04,459 INFO L272 TraceCheckUtils]: 19: Hoare triple {3581#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {3581#false} is VALID [2022-04-15 13:02:04,459 INFO L290 TraceCheckUtils]: 18: Hoare triple {3691#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {3581#false} is VALID [2022-04-15 13:02:04,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {3695#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3691#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:02:04,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {3699#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3695#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:02:04,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {3703#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3699#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:02:04,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {3707#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3703#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:02:04,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {3711#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3707#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:02:04,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {3715#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3711#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:02:04,464 INFO L290 TraceCheckUtils]: 11: Hoare triple {3719#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3715#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:02:04,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {3723#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3719#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:02:04,466 INFO L290 TraceCheckUtils]: 9: Hoare triple {3727#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3723#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:02:04,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {3731#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {3727#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:02:04,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {3735#(or (< main_~x~0 1000000) (< (+ main_~z~0 10) main_~y~0))} [73] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {3731#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:02:04,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {3731#(< (+ main_~z~0 10) main_~y~0)} [74] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_8| |v_main_#t~post4_Out_18|))) (or (and (= v_main_~x~0_In_9 v_main_~x~0_Out_18) .cse0 (= v_main_~y~0_In_8 v_main_~y~0_Out_16)) (let ((.cse1 (div (+ v_main_~y~0_Out_16 (* (- 1) v_main_~y~0_In_8)) 2))) (and (or (< v_main_~x~0_Out_18 50001) (and (< v_main_~x~0_Out_18 1000002) (not (< v_main_~x~0_Out_18 50002)))) (= (mod (+ v_main_~y~0_Out_16 v_main_~y~0_In_8) 2) 0) (<= 0 .cse1) .cse0 (<= (+ v_main_~x~0_In_9 (* .cse1 2)) v_main_~x~0_Out_18))))) InVars {main_#t~post4=|v_main_#t~post4_In_8|, main_~y~0=v_main_~y~0_In_8, main_~x~0=v_main_~x~0_In_9} OutVars{main_#t~post4=|v_main_#t~post4_Out_18|, main_~y~0=v_main_~y~0_Out_16, main_~x~0=v_main_~x~0_Out_18} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {3735#(or (< main_~x~0 1000000) (< (+ main_~z~0 10) main_~y~0))} is VALID [2022-04-15 13:02:04,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {3731#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:02:04,469 INFO L272 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret7 := main(); {3580#true} is VALID [2022-04-15 13:02:04,469 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #52#return; {3580#true} is VALID [2022-04-15 13:02:04,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 13:02:04,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {3580#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); {3580#true} is VALID [2022-04-15 13:02:04,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3580#true} is VALID [2022-04-15 13:02:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:04,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219551738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:02:04,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:02:04,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 39 [2022-04-15 13:02:04,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:02:04,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845834252] [2022-04-15 13:02:04,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845834252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:02:04,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:02:04,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 13:02:04,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552093700] [2022-04-15 13:02:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:02:04,840 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 13:02:04,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:02:04,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:04,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:04,875 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 13:02:04,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:04,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 13:02:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1034, Invalid=1416, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 13:02:04,877 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:06,141 INFO L93 Difference]: Finished difference Result 123 states and 143 transitions. [2022-04-15 13:02:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 13:02:06,141 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-15 13:02:06,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:02:06,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 65 transitions. [2022-04-15 13:02:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 65 transitions. [2022-04-15 13:02:06,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 65 transitions. [2022-04-15 13:02:06,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:06,215 INFO L225 Difference]: With dead ends: 123 [2022-04-15 13:02:06,215 INFO L226 Difference]: Without dead ends: 68 [2022-04-15 13:02:06,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1955, Invalid=3157, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 13:02:06,217 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 44 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:02:06,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 54 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 13:02:06,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-04-15 13:02:06,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 48. [2022-04-15 13:02:06,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:02:06,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,379 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,379 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:06,381 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 13:02:06,381 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 13:02:06,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:06,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:06,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 13:02:06,381 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 68 states. [2022-04-15 13:02:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:02:06,383 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2022-04-15 13:02:06,383 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 13:02:06,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:02:06,383 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:02:06,383 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:02:06,383 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:02:06,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 43 states have internal predecessors, (47), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-04-15 13:02:06,384 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 42 [2022-04-15 13:02:06,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:02:06,384 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-04-15 13:02:06,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 24 states have internal predecessors, (38), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:02:06,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 51 transitions. [2022-04-15 13:02:06,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:02:06,491 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-04-15 13:02:06,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 13:02:06,491 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:02:06,492 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:02:06,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 13:02:06,692 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-15 13:02:06,692 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:02:06,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:02:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 677502578, now seen corresponding path program 9 times [2022-04-15 13:02:06,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:02:06,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865590267] [2022-04-15 13:02:41,894 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:02:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1076729053, now seen corresponding path program 1 times [2022-04-15 13:02:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:02:41,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640212533] [2022-04-15 13:02:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:02:41,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:42,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:02:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:42,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {4309#(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); {4292#true} is VALID [2022-04-15 13:02:42,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {4292#true} assume true; {4292#true} is VALID [2022-04-15 13:02:42,091 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4292#true} {4292#true} #52#return; {4292#true} is VALID [2022-04-15 13:02:42,092 INFO L272 TraceCheckUtils]: 0: Hoare triple {4292#true} call ULTIMATE.init(); {4309#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:02:42,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {4309#(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); {4292#true} is VALID [2022-04-15 13:02:42,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {4292#true} assume true; {4292#true} is VALID [2022-04-15 13:02:42,092 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4292#true} {4292#true} #52#return; {4292#true} is VALID [2022-04-15 13:02:42,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {4292#true} call #t~ret7 := main(); {4292#true} is VALID [2022-04-15 13:02:42,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {4292#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:42,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= |v_main_#t~post4_In_9| |v_main_#t~post4_Out_20|)) (let ((.cse0 (* 2 v_main_~y~0_Out_18))) (let ((.cse1 (div (+ .cse0 (* (- 2) v_main_~y~0_In_9)) 4))) (and (= (mod (+ .cse0 (* 2 v_main_~y~0_In_9)) 4) 0) (= (* 2 |v_main_#t~post4_Out_20|) (* |v_main_#t~post4_In_9| 2)) (or (< v_main_~x~0_Out_20 50001) (and (< v_main_~x~0_Out_20 1000002) (not (< v_main_~x~0_Out_20 50002)))) (<= 0 .cse1) (<= (+ v_main_~x~0_In_10 (* .cse1 2)) v_main_~x~0_Out_20))))) InVars {main_#t~post4=|v_main_#t~post4_In_9|, main_~y~0=v_main_~y~0_In_9, main_~x~0=v_main_~x~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:42,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:42,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {4297#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4298#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:02:42,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {4298#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4299#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:02:42,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {4299#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4300#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:02:42,099 INFO L290 TraceCheckUtils]: 11: Hoare triple {4300#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4301#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:02:42,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {4301#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4302#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:02:42,101 INFO L290 TraceCheckUtils]: 13: Hoare triple {4302#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4303#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:02:42,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {4303#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4304#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:02:42,102 INFO L290 TraceCheckUtils]: 15: Hoare triple {4304#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4305#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:02:42,103 INFO L290 TraceCheckUtils]: 16: Hoare triple {4305#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4306#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:02:42,104 INFO L290 TraceCheckUtils]: 17: Hoare triple {4306#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4307#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:02:42,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {4307#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4308#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:02:42,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {4308#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !(~y~0 > ~z~0); {4293#false} is VALID [2022-04-15 13:02:42,105 INFO L272 TraceCheckUtils]: 20: Hoare triple {4293#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4293#false} is VALID [2022-04-15 13:02:42,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {4293#false} ~cond := #in~cond; {4293#false} is VALID [2022-04-15 13:02:42,105 INFO L290 TraceCheckUtils]: 22: Hoare triple {4293#false} assume 0 == ~cond; {4293#false} is VALID [2022-04-15 13:02:42,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {4293#false} assume !false; {4293#false} is VALID [2022-04-15 13:02:42,106 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:02:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640212533] [2022-04-15 13:02:42,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640212533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:02:42,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2008468636] [2022-04-15 13:02:42,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:02:42,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:02:42,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:02:42,112 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:02:42,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 13:02:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:42,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 13:02:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:02:42,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:02:45,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {4292#true} call ULTIMATE.init(); {4292#true} is VALID [2022-04-15 13:02:45,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {4292#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); {4292#true} is VALID [2022-04-15 13:02:45,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {4292#true} assume true; {4292#true} is VALID [2022-04-15 13:02:45,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4292#true} {4292#true} #52#return; {4292#true} is VALID [2022-04-15 13:02:45,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {4292#true} call #t~ret7 := main(); {4292#true} is VALID [2022-04-15 13:02:45,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {4292#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4328#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:02:45,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {4328#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [76] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= |v_main_#t~post4_In_9| |v_main_#t~post4_Out_20|)) (let ((.cse0 (* 2 v_main_~y~0_Out_18))) (let ((.cse1 (div (+ .cse0 (* (- 2) v_main_~y~0_In_9)) 4))) (and (= (mod (+ .cse0 (* 2 v_main_~y~0_In_9)) 4) 0) (= (* 2 |v_main_#t~post4_Out_20|) (* |v_main_#t~post4_In_9| 2)) (or (< v_main_~x~0_Out_20 50001) (and (< v_main_~x~0_Out_20 1000002) (not (< v_main_~x~0_Out_20 50002)))) (<= 0 .cse1) (<= (+ v_main_~x~0_In_10 (* .cse1 2)) v_main_~x~0_Out_20))))) InVars {main_#t~post4=|v_main_#t~post4_In_9|, main_~y~0=v_main_~y~0_In_9, main_~x~0=v_main_~x~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4332#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_191 Int)) (and (<= 50000 v_main_~y~0_191) (<= 0 (div (+ (* main_~y~0 2) (* (- 2) v_main_~y~0_191)) 4)) (= (mod (+ (* v_main_~y~0_191 2) (* main_~y~0 2)) 4) 0))))} is VALID [2022-04-15 13:02:45,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {4332#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_191 Int)) (and (<= 50000 v_main_~y~0_191) (<= 0 (div (+ (* main_~y~0 2) (* (- 2) v_main_~y~0_191)) 4)) (= (mod (+ (* v_main_~y~0_191 2) (* main_~y~0 2)) 4) 0))))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4336#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int)) (and (<= 50000 v_main_~y~0_191) (<= 0 (div (+ (* main_~y~0 2) (* (- 2) v_main_~y~0_191)) 4)) (= (mod (+ (* v_main_~y~0_191 2) (* main_~y~0 2)) 4) 0))))} is VALID [2022-04-15 13:02:45,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {4336#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int)) (and (<= 50000 v_main_~y~0_191) (<= 0 (div (+ (* main_~y~0 2) (* (- 2) v_main_~y~0_191)) 4)) (= (mod (+ (* v_main_~y~0_191 2) (* main_~y~0 2)) 4) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4340#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 1)))))} is VALID [2022-04-15 13:02:45,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 1)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4344#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {4344#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4348#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4348#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4352#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 4)))))} is VALID [2022-04-15 13:02:45,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {4352#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4356#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ 5 main_~y~0)))))} is VALID [2022-04-15 13:02:45,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {4356#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ 5 main_~y~0)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4360#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= v_main_~y~0_192 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {4360#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= v_main_~y~0_192 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4364#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ 7 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {4364#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ 7 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4368#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 8)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {4368#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 8)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4372#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 9)))))} is VALID [2022-04-15 13:02:45,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {4372#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 9)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4376#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 10)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} is VALID [2022-04-15 13:02:45,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {4376#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= v_main_~y~0_192 (+ main_~y~0 10)) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4380#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 11)))))} is VALID [2022-04-15 13:02:45,406 INFO L290 TraceCheckUtils]: 19: Hoare triple {4380#(and (<= main_~z~0 0) (exists ((v_main_~y~0_191 Int) (v_main_~y~0_192 Int)) (and (= (mod (+ (* v_main_~y~0_192 2) (* v_main_~y~0_191 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_192 2) (* (- 2) v_main_~y~0_191)) 4)) (<= 50000 v_main_~y~0_191) (<= v_main_~y~0_192 (+ main_~y~0 11)))))} assume !(~y~0 > ~z~0); {4293#false} is VALID [2022-04-15 13:02:45,406 INFO L272 TraceCheckUtils]: 20: Hoare triple {4293#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4293#false} is VALID [2022-04-15 13:02:45,407 INFO L290 TraceCheckUtils]: 21: Hoare triple {4293#false} ~cond := #in~cond; {4293#false} is VALID [2022-04-15 13:02:45,407 INFO L290 TraceCheckUtils]: 22: Hoare triple {4293#false} assume 0 == ~cond; {4293#false} is VALID [2022-04-15 13:02:45,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {4293#false} assume !false; {4293#false} is VALID [2022-04-15 13:02:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:02:45,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:03,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {4293#false} assume !false; {4293#false} is VALID [2022-04-15 13:03:03,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {4293#false} assume 0 == ~cond; {4293#false} is VALID [2022-04-15 13:03:03,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {4293#false} ~cond := #in~cond; {4293#false} is VALID [2022-04-15 13:03:03,426 INFO L272 TraceCheckUtils]: 20: Hoare triple {4293#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4293#false} is VALID [2022-04-15 13:03:03,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {4408#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4293#false} is VALID [2022-04-15 13:03:03,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {4412#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4408#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:03:03,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {4416#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4412#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:03:03,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {4420#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4416#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:03:03,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {4424#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4420#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:03:03,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {4428#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4424#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:03:03,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {4432#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4428#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:03,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {4436#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4432#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:03:03,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {4440#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4436#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:03,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {4444#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4440#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:03:03,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4448#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4444#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:03:03,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {4452#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4448#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:03:03,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {4456#(or (< main_~x~0 1000000) (< (+ main_~z~0 11) main_~y~0))} [75] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4452#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:03:03,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {4452#(< (+ main_~z~0 11) main_~y~0)} [76] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~y~0_In_9 v_main_~y~0_Out_18) (= v_main_~x~0_In_10 v_main_~x~0_Out_20) (= |v_main_#t~post4_In_9| |v_main_#t~post4_Out_20|)) (let ((.cse0 (* 2 v_main_~y~0_Out_18))) (let ((.cse1 (div (+ .cse0 (* (- 2) v_main_~y~0_In_9)) 4))) (and (= (mod (+ .cse0 (* 2 v_main_~y~0_In_9)) 4) 0) (= (* 2 |v_main_#t~post4_Out_20|) (* |v_main_#t~post4_In_9| 2)) (or (< v_main_~x~0_Out_20 50001) (and (< v_main_~x~0_Out_20 1000002) (not (< v_main_~x~0_Out_20 50002)))) (<= 0 .cse1) (<= (+ v_main_~x~0_In_10 (* .cse1 2)) v_main_~x~0_Out_20))))) InVars {main_#t~post4=|v_main_#t~post4_In_9|, main_~y~0=v_main_~y~0_In_9, main_~x~0=v_main_~x~0_In_10} OutVars{main_#t~post4=|v_main_#t~post4_Out_20|, main_~y~0=v_main_~y~0_Out_18, main_~x~0=v_main_~x~0_Out_20} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4456#(or (< main_~x~0 1000000) (< (+ main_~z~0 11) main_~y~0))} is VALID [2022-04-15 13:03:03,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {4292#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4452#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:03:03,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {4292#true} call #t~ret7 := main(); {4292#true} is VALID [2022-04-15 13:03:03,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4292#true} {4292#true} #52#return; {4292#true} is VALID [2022-04-15 13:03:03,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {4292#true} assume true; {4292#true} is VALID [2022-04-15 13:03:03,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {4292#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); {4292#true} is VALID [2022-04-15 13:03:03,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {4292#true} call ULTIMATE.init(); {4292#true} is VALID [2022-04-15 13:03:03,440 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:03,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2008468636] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:03,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:03,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 15] total 42 [2022-04-15 13:03:04,111 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:04,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865590267] [2022-04-15 13:03:04,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865590267] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:04,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:04,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 13:03:04,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903587300] [2022-04-15 13:03:04,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-15 13:03:04,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:04,112 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:04,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:04,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 13:03:04,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:04,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 13:03:04,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1252, Invalid=1718, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 13:03:04,159 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:07,015 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-04-15 13:03:07,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 13:03:07,016 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 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 47 [2022-04-15 13:03:07,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:07,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 69 transitions. [2022-04-15 13:03:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 69 transitions. [2022-04-15 13:03:07,018 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 69 transitions. [2022-04-15 13:03:07,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:07,109 INFO L225 Difference]: With dead ends: 93 [2022-04-15 13:03:07,110 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 13:03:07,111 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=2391, Invalid=3929, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 13:03:07,112 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 37 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:07,112 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 49 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 13:03:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 13:03:07,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-04-15 13:03:07,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:07,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,266 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,266 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:07,268 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 13:03:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 13:03:07,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:07,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:07,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:03:07,268 INFO L87 Difference]: Start difference. First operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 53 states. [2022-04-15 13:03:07,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:07,269 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 13:03:07,269 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 13:03:07,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:07,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:07,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:07,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:07,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 48 states have internal predecessors, (52), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-04-15 13:03:07,271 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 47 [2022-04-15 13:03:07,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:07,271 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-04-15 13:03:07,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 27 states have internal predecessors, (43), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:07,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 56 transitions. [2022-04-15 13:03:07,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:07,393 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-04-15 13:03:07,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-04-15 13:03:07,394 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:07,394 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:07,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:07,595 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:07,596 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:07,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:07,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1949250309, now seen corresponding path program 10 times [2022-04-15 13:03:07,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:07,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [865749380] [2022-04-15 13:03:08,827 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:03:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1628554336, now seen corresponding path program 1 times [2022-04-15 13:03:08,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:08,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548401642] [2022-04-15 13:03:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:09,266 INFO L290 TraceCheckUtils]: 0: Hoare triple {4961#(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); {4941#true} is VALID [2022-04-15 13:03:09,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {4941#true} assume true; {4941#true} is VALID [2022-04-15 13:03:09,266 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4941#true} {4941#true} #52#return; {4941#true} is VALID [2022-04-15 13:03:09,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {4941#true} call ULTIMATE.init(); {4961#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:09,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {4961#(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); {4941#true} is VALID [2022-04-15 13:03:09,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {4941#true} assume true; {4941#true} is VALID [2022-04-15 13:03:09,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4941#true} {4941#true} #52#return; {4941#true} is VALID [2022-04-15 13:03:09,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {4941#true} call #t~ret7 := main(); {4941#true} is VALID [2022-04-15 13:03:09,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {4941#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4946#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:09,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {4946#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_20))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_In_10) .cse1) 4))) (and (<= 0 .cse0) (or (< v_main_~x~0_Out_22 50001) (and (not (< v_main_~x~0_Out_22 50002)) (< v_main_~x~0_Out_22 1000002))) (= (* 2 |v_main_#t~post4_In_10|) (* 2 |v_main_#t~post4_Out_22|)) (= (mod (+ (* 2 v_main_~y~0_In_10) .cse1) 4) 0) (<= (+ v_main_~x~0_In_11 (* .cse0 2)) v_main_~x~0_Out_22)))) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= |v_main_#t~post4_In_10| |v_main_#t~post4_Out_22|) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_#t~post4=|v_main_#t~post4_In_10|, main_~y~0=v_main_~y~0_In_10, main_~x~0=v_main_~x~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_~y~0=v_main_~y~0_Out_20, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4947#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= 50000 main_~y~0)))} is VALID [2022-04-15 13:03:09,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {4947#(or (<= main_~x~0 0) (and (= main_~z~0 0) (<= 50000 main_~y~0)))} [77] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4948#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:09,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4949#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:09,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {4949#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4950#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:09,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {4950#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4951#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:09,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {4951#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4952#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:09,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {4952#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4953#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:09,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {4953#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4954#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:09,276 INFO L290 TraceCheckUtils]: 14: Hoare triple {4954#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4955#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:09,277 INFO L290 TraceCheckUtils]: 15: Hoare triple {4955#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4956#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:09,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {4956#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4957#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:09,278 INFO L290 TraceCheckUtils]: 17: Hoare triple {4957#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4958#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:09,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {4958#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4959#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:09,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {4959#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4960#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:09,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {4960#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !(~y~0 > ~z~0); {4942#false} is VALID [2022-04-15 13:03:09,281 INFO L272 TraceCheckUtils]: 21: Hoare triple {4942#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4942#false} is VALID [2022-04-15 13:03:09,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {4942#false} ~cond := #in~cond; {4942#false} is VALID [2022-04-15 13:03:09,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {4942#false} assume 0 == ~cond; {4942#false} is VALID [2022-04-15 13:03:09,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {4942#false} assume !false; {4942#false} is VALID [2022-04-15 13:03:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:09,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548401642] [2022-04-15 13:03:09,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548401642] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:09,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863332915] [2022-04-15 13:03:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:09,283 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:09,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 13:03:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:09,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 13:03:09,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:09,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:10,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {4941#true} call ULTIMATE.init(); {4941#true} is VALID [2022-04-15 13:03:10,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {4941#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); {4941#true} is VALID [2022-04-15 13:03:10,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {4941#true} assume true; {4941#true} is VALID [2022-04-15 13:03:10,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4941#true} {4941#true} #52#return; {4941#true} is VALID [2022-04-15 13:03:10,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {4941#true} call #t~ret7 := main(); {4941#true} is VALID [2022-04-15 13:03:10,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {4941#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:10,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [78] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_20))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_In_10) .cse1) 4))) (and (<= 0 .cse0) (or (< v_main_~x~0_Out_22 50001) (and (not (< v_main_~x~0_Out_22 50002)) (< v_main_~x~0_Out_22 1000002))) (= (* 2 |v_main_#t~post4_In_10|) (* 2 |v_main_#t~post4_Out_22|)) (= (mod (+ (* 2 v_main_~y~0_In_10) .cse1) 4) 0) (<= (+ v_main_~x~0_In_11 (* .cse0 2)) v_main_~x~0_Out_22)))) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= |v_main_#t~post4_In_10| |v_main_#t~post4_Out_22|) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_#t~post4=|v_main_#t~post4_In_10|, main_~y~0=v_main_~y~0_In_10, main_~x~0=v_main_~x~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_~y~0=v_main_~y~0_Out_20, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:10,225 INFO L290 TraceCheckUtils]: 7: Hoare triple {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [77] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:10,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {4980#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4990#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:10,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {4990#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4994#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:03:10,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {4994#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {4998#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:10,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {4998#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5002#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:10,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {5002#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5006#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:10,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {5006#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5010#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:10,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {5010#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5014#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:10,233 INFO L290 TraceCheckUtils]: 15: Hoare triple {5014#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5018#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:10,234 INFO L290 TraceCheckUtils]: 16: Hoare triple {5018#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5022#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:10,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {5022#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5026#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:03:10,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {5026#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5030#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:10,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {5030#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5034#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:10,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {5034#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !(~y~0 > ~z~0); {4942#false} is VALID [2022-04-15 13:03:10,238 INFO L272 TraceCheckUtils]: 21: Hoare triple {4942#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4942#false} is VALID [2022-04-15 13:03:10,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {4942#false} ~cond := #in~cond; {4942#false} is VALID [2022-04-15 13:03:10,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {4942#false} assume 0 == ~cond; {4942#false} is VALID [2022-04-15 13:03:10,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {4942#false} assume !false; {4942#false} is VALID [2022-04-15 13:03:10,238 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:10,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:11,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {4942#false} assume !false; {4942#false} is VALID [2022-04-15 13:03:11,724 INFO L290 TraceCheckUtils]: 23: Hoare triple {4942#false} assume 0 == ~cond; {4942#false} is VALID [2022-04-15 13:03:11,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {4942#false} ~cond := #in~cond; {4942#false} is VALID [2022-04-15 13:03:11,724 INFO L272 TraceCheckUtils]: 21: Hoare triple {4942#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {4942#false} is VALID [2022-04-15 13:03:11,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {5062#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {4942#false} is VALID [2022-04-15 13:03:11,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {5066#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5062#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:03:11,728 INFO L290 TraceCheckUtils]: 18: Hoare triple {5070#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5066#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:03:11,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {5074#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5070#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:03:11,730 INFO L290 TraceCheckUtils]: 16: Hoare triple {5078#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5074#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:03:11,731 INFO L290 TraceCheckUtils]: 15: Hoare triple {5082#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5078#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:03:11,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {5086#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5082#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:11,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {5090#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5086#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:03:11,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {5094#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5090#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:11,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {5098#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5094#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:03:11,735 INFO L290 TraceCheckUtils]: 10: Hoare triple {5102#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5098#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:03:11,736 INFO L290 TraceCheckUtils]: 9: Hoare triple {5106#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5102#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:03:11,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {5110#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5106#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:03:11,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {5110#(< (+ main_~z~0 12) main_~y~0)} [77] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5110#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:03:11,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5110#(< (+ main_~z~0 12) main_~y~0)} [78] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* 2 v_main_~y~0_Out_20))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_In_10) .cse1) 4))) (and (<= 0 .cse0) (or (< v_main_~x~0_Out_22 50001) (and (not (< v_main_~x~0_Out_22 50002)) (< v_main_~x~0_Out_22 1000002))) (= (* 2 |v_main_#t~post4_In_10|) (* 2 |v_main_#t~post4_Out_22|)) (= (mod (+ (* 2 v_main_~y~0_In_10) .cse1) 4) 0) (<= (+ v_main_~x~0_In_11 (* .cse0 2)) v_main_~x~0_Out_22)))) (and (= v_main_~y~0_In_10 v_main_~y~0_Out_20) (= |v_main_#t~post4_In_10| |v_main_#t~post4_Out_22|) (= v_main_~x~0_In_11 v_main_~x~0_Out_22))) InVars {main_#t~post4=|v_main_#t~post4_In_10|, main_~y~0=v_main_~y~0_In_10, main_~x~0=v_main_~x~0_In_11} OutVars{main_#t~post4=|v_main_#t~post4_Out_22|, main_~y~0=v_main_~y~0_Out_20, main_~x~0=v_main_~x~0_Out_22} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5110#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:03:11,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {4941#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5110#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:03:11,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {4941#true} call #t~ret7 := main(); {4941#true} is VALID [2022-04-15 13:03:11,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4941#true} {4941#true} #52#return; {4941#true} is VALID [2022-04-15 13:03:11,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {4941#true} assume true; {4941#true} is VALID [2022-04-15 13:03:11,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {4941#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); {4941#true} is VALID [2022-04-15 13:03:11,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {4941#true} call ULTIMATE.init(); {4941#true} is VALID [2022-04-15 13:03:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:11,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863332915] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:11,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:11,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 44 [2022-04-15 13:03:17,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:17,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [865749380] [2022-04-15 13:03:17,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [865749380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:17,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:17,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 13:03:17,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348616939] [2022-04-15 13:03:17,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:17,746 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 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 52 [2022-04-15 13:03:17,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:17,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:17,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:17,922 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 13:03:17,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:17,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 13:03:17,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1492, Invalid=2048, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 13:03:17,924 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:19,071 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-04-15 13:03:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 13:03:19,071 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 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 52 [2022-04-15 13:03:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. [2022-04-15 13:03:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 68 transitions. [2022-04-15 13:03:19,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 68 transitions. [2022-04-15 13:03:19,254 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-15 13:03:19,256 INFO L225 Difference]: With dead ends: 99 [2022-04-15 13:03:19,256 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 13:03:19,257 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1779 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1962, Invalid=3294, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 13:03:19,258 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:19,258 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 33 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 41 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-04-15 13:03:19,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 13:03:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2022-04-15 13:03:19,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:19,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,590 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,590 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:19,592 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-04-15 13:03:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-04-15 13:03:19,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:19,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:19,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 13:03:19,593 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 94 states. [2022-04-15 13:03:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:19,594 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-04-15 13:03:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2022-04-15 13:03:19,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:19,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:19,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:19,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.103896103896104) internal successors, (85), 77 states have internal predecessors, (85), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-04-15 13:03:19,597 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 52 [2022-04-15 13:03:19,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:19,597 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-04-15 13:03:19,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.5) internal successors, (48), 31 states have internal predecessors, (48), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:19,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 89 transitions. [2022-04-15 13:03:19,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:19,932 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-04-15 13:03:19,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 13:03:19,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:19,932 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:19,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:20,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 13:03:20,133 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:20,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash -261679672, now seen corresponding path program 11 times [2022-04-15 13:03:20,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:20,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1910521644] [2022-04-15 13:03:21,407 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:03:21,409 INFO L85 PathProgramCache]: Analyzing trace with hash 769489731, now seen corresponding path program 1 times [2022-04-15 13:03:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:21,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837720728] [2022-04-15 13:03:21,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:21,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:21,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:21,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {5749#(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); {5729#true} is VALID [2022-04-15 13:03:21,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {5729#true} assume true; {5729#true} is VALID [2022-04-15 13:03:21,953 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5729#true} {5729#true} #52#return; {5729#true} is VALID [2022-04-15 13:03:21,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {5729#true} call ULTIMATE.init(); {5749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:21,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {5749#(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); {5729#true} is VALID [2022-04-15 13:03:21,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {5729#true} assume true; {5729#true} is VALID [2022-04-15 13:03:21,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5729#true} {5729#true} #52#return; {5729#true} is VALID [2022-04-15 13:03:21,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {5729#true} call #t~ret7 := main(); {5729#true} is VALID [2022-04-15 13:03:21,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {5729#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5734#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:21,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {5734#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_11| |v_main_#t~post4_Out_24|))) (or (and .cse0 (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_22) v_main_~y~0_In_11) (- 2)))) (and (= (mod (+ v_main_~y~0_Out_22 v_main_~y~0_In_11) 2) 0) .cse0 (<= (+ v_main_~x~0_In_12 (* .cse1 2)) v_main_~x~0_Out_24) (<= 0 .cse1) (or (< v_main_~x~0_Out_24 50001) (and (not (< v_main_~x~0_Out_24 50002)) (< v_main_~x~0_Out_24 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_11|, main_~y~0=v_main_~y~0_In_11, main_~x~0=v_main_~x~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_24} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5735#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:21,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {5735#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5735#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:21,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {5735#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5736#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:21,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {5736#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5737#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:21,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {5737#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5738#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:21,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {5738#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5739#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:21,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {5739#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5740#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:21,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {5740#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5741#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:21,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {5741#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5742#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:21,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {5742#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5743#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:21,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {5743#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5744#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:21,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {5744#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5745#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:21,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {5745#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5746#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:21,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {5746#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5747#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:03:21,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {5747#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5748#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:03:21,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {5748#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !(~y~0 > ~z~0); {5730#false} is VALID [2022-04-15 13:03:21,974 INFO L272 TraceCheckUtils]: 22: Hoare triple {5730#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5730#false} is VALID [2022-04-15 13:03:21,974 INFO L290 TraceCheckUtils]: 23: Hoare triple {5730#false} ~cond := #in~cond; {5730#false} is VALID [2022-04-15 13:03:21,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {5730#false} assume 0 == ~cond; {5730#false} is VALID [2022-04-15 13:03:21,974 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#false} assume !false; {5730#false} is VALID [2022-04-15 13:03:21,974 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:21,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837720728] [2022-04-15 13:03:21,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837720728] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:21,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66600246] [2022-04-15 13:03:21,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:21,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:21,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:21,976 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 13:03:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 13:03:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:22,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:23,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {5729#true} call ULTIMATE.init(); {5729#true} is VALID [2022-04-15 13:03:23,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {5729#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); {5729#true} is VALID [2022-04-15 13:03:23,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {5729#true} assume true; {5729#true} is VALID [2022-04-15 13:03:23,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5729#true} {5729#true} #52#return; {5729#true} is VALID [2022-04-15 13:03:23,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {5729#true} call #t~ret7 := main(); {5729#true} is VALID [2022-04-15 13:03:23,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {5729#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:23,155 INFO L290 TraceCheckUtils]: 6: Hoare triple {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_11| |v_main_#t~post4_Out_24|))) (or (and .cse0 (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_22) v_main_~y~0_In_11) (- 2)))) (and (= (mod (+ v_main_~y~0_Out_22 v_main_~y~0_In_11) 2) 0) .cse0 (<= (+ v_main_~x~0_In_12 (* .cse1 2)) v_main_~x~0_Out_24) (<= 0 .cse1) (or (< v_main_~x~0_Out_24 50001) (and (not (< v_main_~x~0_Out_24 50002)) (< v_main_~x~0_Out_24 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_11|, main_~y~0=v_main_~y~0_In_11, main_~x~0=v_main_~x~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_24} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:23,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:23,157 INFO L290 TraceCheckUtils]: 8: Hoare triple {5768#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5778#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:23,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {5778#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5782#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:03:23,159 INFO L290 TraceCheckUtils]: 10: Hoare triple {5782#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5786#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:23,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {5786#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5790#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:23,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {5790#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5794#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:23,163 INFO L290 TraceCheckUtils]: 13: Hoare triple {5794#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5798#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:23,164 INFO L290 TraceCheckUtils]: 14: Hoare triple {5798#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5802#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:23,165 INFO L290 TraceCheckUtils]: 15: Hoare triple {5802#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5806#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:23,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {5806#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5810#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:23,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {5810#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5814#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:03:23,168 INFO L290 TraceCheckUtils]: 18: Hoare triple {5814#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5818#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:23,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {5818#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5822#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:23,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {5822#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5826#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:03:23,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {5826#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !(~y~0 > ~z~0); {5730#false} is VALID [2022-04-15 13:03:23,171 INFO L272 TraceCheckUtils]: 22: Hoare triple {5730#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5730#false} is VALID [2022-04-15 13:03:23,171 INFO L290 TraceCheckUtils]: 23: Hoare triple {5730#false} ~cond := #in~cond; {5730#false} is VALID [2022-04-15 13:03:23,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {5730#false} assume 0 == ~cond; {5730#false} is VALID [2022-04-15 13:03:23,171 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#false} assume !false; {5730#false} is VALID [2022-04-15 13:03:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:23,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:25,119 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#false} assume !false; {5730#false} is VALID [2022-04-15 13:03:25,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {5730#false} assume 0 == ~cond; {5730#false} is VALID [2022-04-15 13:03:25,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {5730#false} ~cond := #in~cond; {5730#false} is VALID [2022-04-15 13:03:25,120 INFO L272 TraceCheckUtils]: 22: Hoare triple {5730#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {5730#false} is VALID [2022-04-15 13:03:25,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {5854#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {5730#false} is VALID [2022-04-15 13:03:25,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {5858#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5854#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:03:25,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {5862#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5858#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:03:25,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {5866#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5862#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:03:25,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {5870#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5866#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:03:25,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {5874#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5870#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:03:25,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {5878#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5874#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:25,129 INFO L290 TraceCheckUtils]: 14: Hoare triple {5882#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5878#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:03:25,129 INFO L290 TraceCheckUtils]: 13: Hoare triple {5886#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5882#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:25,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {5890#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5886#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:03:25,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {5894#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5890#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:03:25,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {5898#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5894#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:03:25,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {5902#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5898#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:03:25,134 INFO L290 TraceCheckUtils]: 8: Hoare triple {5906#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {5902#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:03:25,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {5906#(< (+ main_~z~0 13) main_~y~0)} [79] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {5906#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:03:25,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {5906#(< (+ main_~z~0 13) main_~y~0)} [80] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_11| |v_main_#t~post4_Out_24|))) (or (and .cse0 (= v_main_~y~0_In_11 v_main_~y~0_Out_22) (= v_main_~x~0_In_12 v_main_~x~0_Out_24)) (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_22) v_main_~y~0_In_11) (- 2)))) (and (= (mod (+ v_main_~y~0_Out_22 v_main_~y~0_In_11) 2) 0) .cse0 (<= (+ v_main_~x~0_In_12 (* .cse1 2)) v_main_~x~0_Out_24) (<= 0 .cse1) (or (< v_main_~x~0_Out_24 50001) (and (not (< v_main_~x~0_Out_24 50002)) (< v_main_~x~0_Out_24 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_11|, main_~y~0=v_main_~y~0_In_11, main_~x~0=v_main_~x~0_In_12} OutVars{main_#t~post4=|v_main_#t~post4_Out_24|, main_~y~0=v_main_~y~0_Out_22, main_~x~0=v_main_~x~0_Out_24} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {5906#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:03:25,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {5729#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {5906#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:03:25,137 INFO L272 TraceCheckUtils]: 4: Hoare triple {5729#true} call #t~ret7 := main(); {5729#true} is VALID [2022-04-15 13:03:25,137 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5729#true} {5729#true} #52#return; {5729#true} is VALID [2022-04-15 13:03:25,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {5729#true} assume true; {5729#true} is VALID [2022-04-15 13:03:25,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {5729#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); {5729#true} is VALID [2022-04-15 13:03:25,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {5729#true} call ULTIMATE.init(); {5729#true} is VALID [2022-04-15 13:03:25,138 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:25,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66600246] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:25,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:25,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 46 [2022-04-15 13:03:25,843 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:25,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1910521644] [2022-04-15 13:03:25,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1910521644] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:25,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:25,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 13:03:25,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113218937] [2022-04-15 13:03:25,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:25,844 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 13:03:25,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:25,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:25,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:25,905 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 13:03:25,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:25,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 13:03:25,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1576, Invalid=2084, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 13:03:25,907 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:29,485 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2022-04-15 13:03:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 13:03:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-15 13:03:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 78 transitions. [2022-04-15 13:03:29,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 78 transitions. [2022-04-15 13:03:29,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 78 transitions. [2022-04-15 13:03:29,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:29,601 INFO L225 Difference]: With dead ends: 162 [2022-04-15 13:03:29,601 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 13:03:29,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2163 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3119, Invalid=5071, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 13:03:29,604 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:29,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 34 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 13:03:29,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 13:03:29,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 60. [2022-04-15 13:03:29,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:29,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,857 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,857 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:29,858 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 13:03:29,858 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 13:03:29,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:29,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:29,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-15 13:03:29,859 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-15 13:03:29,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:29,861 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 13:03:29,861 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 13:03:29,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:29,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:29,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:29,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 55 states have internal predecessors, (59), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-04-15 13:03:29,862 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 53 [2022-04-15 13:03:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:29,863 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-04-15 13:03:29,863 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 32 states have internal predecessors, (49), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:29,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 63 transitions. [2022-04-15 13:03:30,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-04-15 13:03:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 13:03:30,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:30,044 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:30,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-15 13:03:30,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 13:03:30,245 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash -647504098, now seen corresponding path program 12 times [2022-04-15 13:03:30,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:30,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [11435726] [2022-04-15 13:03:39,956 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:03:39,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1770945757, now seen corresponding path program 1 times [2022-04-15 13:03:39,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:39,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54891490] [2022-04-15 13:03:39,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:39,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:40,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {6649#(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); {6628#true} is VALID [2022-04-15 13:03:40,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {6628#true} assume true; {6628#true} is VALID [2022-04-15 13:03:40,450 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6628#true} {6628#true} #52#return; {6628#true} is VALID [2022-04-15 13:03:40,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {6628#true} call ULTIMATE.init(); {6649#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:40,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {6649#(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); {6628#true} is VALID [2022-04-15 13:03:40,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {6628#true} assume true; {6628#true} is VALID [2022-04-15 13:03:40,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6628#true} {6628#true} #52#return; {6628#true} is VALID [2022-04-15 13:03:40,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {6628#true} call #t~ret7 := main(); {6628#true} is VALID [2022-04-15 13:03:40,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {6628#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:40,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_12| |v_main_#t~post4_Out_26|))) (or (and .cse0 (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (let ((.cse1 (div (+ v_main_~y~0_Out_24 (* (- 1) v_main_~y~0_In_12)) 2))) (and .cse0 (= 0 (mod (+ v_main_~y~0_Out_24 v_main_~y~0_In_12) 2)) (<= (+ v_main_~x~0_In_13 (* .cse1 2)) v_main_~x~0_Out_26) (or (< v_main_~x~0_Out_26 50001) (and (not (< v_main_~x~0_Out_26 50002)) (< v_main_~x~0_Out_26 1000002))) (<= 0 .cse1))))) InVars {main_#t~post4=|v_main_#t~post4_In_12|, main_~y~0=v_main_~y~0_In_12, main_~x~0=v_main_~x~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_~y~0=v_main_~y~0_Out_24, main_~x~0=v_main_~x~0_Out_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:40,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [81] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:40,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {6633#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6634#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:40,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {6634#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6635#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:40,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {6635#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6636#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:40,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {6636#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6637#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:40,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {6637#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6638#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:40,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {6638#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6639#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:40,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {6639#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6640#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:40,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {6640#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6641#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:40,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {6641#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6642#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:40,462 INFO L290 TraceCheckUtils]: 17: Hoare triple {6642#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6643#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:40,464 INFO L290 TraceCheckUtils]: 18: Hoare triple {6643#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6644#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:40,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {6644#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6645#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:40,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {6645#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6646#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:03:40,466 INFO L290 TraceCheckUtils]: 21: Hoare triple {6646#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6647#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:03:40,467 INFO L290 TraceCheckUtils]: 22: Hoare triple {6647#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6648#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:03:40,468 INFO L290 TraceCheckUtils]: 23: Hoare triple {6648#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !(~y~0 > ~z~0); {6629#false} is VALID [2022-04-15 13:03:40,468 INFO L272 TraceCheckUtils]: 24: Hoare triple {6629#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6629#false} is VALID [2022-04-15 13:03:40,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {6629#false} ~cond := #in~cond; {6629#false} is VALID [2022-04-15 13:03:40,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {6629#false} assume 0 == ~cond; {6629#false} is VALID [2022-04-15 13:03:40,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {6629#false} assume !false; {6629#false} is VALID [2022-04-15 13:03:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54891490] [2022-04-15 13:03:40,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54891490] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:40,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427602464] [2022-04-15 13:03:40,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:40,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:40,470 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:40,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 13:03:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:40,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 13:03:40,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:40,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:03:41,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {6628#true} call ULTIMATE.init(); {6628#true} is VALID [2022-04-15 13:03:41,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {6628#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); {6628#true} is VALID [2022-04-15 13:03:41,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {6628#true} assume true; {6628#true} is VALID [2022-04-15 13:03:41,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6628#true} {6628#true} #52#return; {6628#true} is VALID [2022-04-15 13:03:41,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {6628#true} call #t~ret7 := main(); {6628#true} is VALID [2022-04-15 13:03:41,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {6628#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:41,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [82] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_12| |v_main_#t~post4_Out_26|))) (or (and .cse0 (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (let ((.cse1 (div (+ v_main_~y~0_Out_24 (* (- 1) v_main_~y~0_In_12)) 2))) (and .cse0 (= 0 (mod (+ v_main_~y~0_Out_24 v_main_~y~0_In_12) 2)) (<= (+ v_main_~x~0_In_13 (* .cse1 2)) v_main_~x~0_Out_26) (or (< v_main_~x~0_Out_26 50001) (and (not (< v_main_~x~0_Out_26 50002)) (< v_main_~x~0_Out_26 1000002))) (<= 0 .cse1))))) InVars {main_#t~post4=|v_main_#t~post4_In_12|, main_~y~0=v_main_~y~0_In_12, main_~x~0=v_main_~x~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_~y~0=v_main_~y~0_Out_24, main_~x~0=v_main_~x~0_Out_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:41,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [81] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:41,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {6668#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6678#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:41,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {6678#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6682#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:03:41,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {6682#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6686#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:41,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {6686#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6690#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:41,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {6690#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6694#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:41,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {6694#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6698#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:41,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {6698#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6702#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:41,707 INFO L290 TraceCheckUtils]: 15: Hoare triple {6702#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6706#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:41,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {6706#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6710#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:41,710 INFO L290 TraceCheckUtils]: 17: Hoare triple {6710#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6714#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:03:41,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {6714#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6718#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:41,712 INFO L290 TraceCheckUtils]: 19: Hoare triple {6718#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6722#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:41,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {6722#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6726#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:03:41,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {6726#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6730#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:03:41,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {6730#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6734#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:03:41,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {6734#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !(~y~0 > ~z~0); {6629#false} is VALID [2022-04-15 13:03:41,717 INFO L272 TraceCheckUtils]: 24: Hoare triple {6629#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6629#false} is VALID [2022-04-15 13:03:41,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {6629#false} ~cond := #in~cond; {6629#false} is VALID [2022-04-15 13:03:41,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {6629#false} assume 0 == ~cond; {6629#false} is VALID [2022-04-15 13:03:41,717 INFO L290 TraceCheckUtils]: 27: Hoare triple {6629#false} assume !false; {6629#false} is VALID [2022-04-15 13:03:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:41,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:03:44,213 INFO L290 TraceCheckUtils]: 27: Hoare triple {6629#false} assume !false; {6629#false} is VALID [2022-04-15 13:03:44,213 INFO L290 TraceCheckUtils]: 26: Hoare triple {6629#false} assume 0 == ~cond; {6629#false} is VALID [2022-04-15 13:03:44,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {6629#false} ~cond := #in~cond; {6629#false} is VALID [2022-04-15 13:03:44,213 INFO L272 TraceCheckUtils]: 24: Hoare triple {6629#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {6629#false} is VALID [2022-04-15 13:03:44,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {6762#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {6629#false} is VALID [2022-04-15 13:03:44,216 INFO L290 TraceCheckUtils]: 22: Hoare triple {6766#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6762#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:03:44,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {6770#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6766#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:03:44,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {6774#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6770#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:03:44,220 INFO L290 TraceCheckUtils]: 19: Hoare triple {6778#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6774#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:03:44,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {6782#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6778#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:03:44,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {6786#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6782#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:44,223 INFO L290 TraceCheckUtils]: 16: Hoare triple {6790#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6786#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:03:44,224 INFO L290 TraceCheckUtils]: 15: Hoare triple {6794#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6790#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:03:44,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {6798#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6794#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:03:44,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {6802#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6798#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:03:44,227 INFO L290 TraceCheckUtils]: 12: Hoare triple {6806#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6802#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:03:44,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {6810#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6806#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:03:44,229 INFO L290 TraceCheckUtils]: 10: Hoare triple {6814#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6810#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:03:44,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {6818#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6814#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:03:44,232 INFO L290 TraceCheckUtils]: 8: Hoare triple {6822#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {6818#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:03:44,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {6822#(< (+ main_~z~0 15) main_~y~0)} [81] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {6822#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:03:44,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {6822#(< (+ main_~z~0 15) main_~y~0)} [82] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_12| |v_main_#t~post4_Out_26|))) (or (and .cse0 (= v_main_~x~0_In_13 v_main_~x~0_Out_26) (= v_main_~y~0_In_12 v_main_~y~0_Out_24)) (let ((.cse1 (div (+ v_main_~y~0_Out_24 (* (- 1) v_main_~y~0_In_12)) 2))) (and .cse0 (= 0 (mod (+ v_main_~y~0_Out_24 v_main_~y~0_In_12) 2)) (<= (+ v_main_~x~0_In_13 (* .cse1 2)) v_main_~x~0_Out_26) (or (< v_main_~x~0_Out_26 50001) (and (not (< v_main_~x~0_Out_26 50002)) (< v_main_~x~0_Out_26 1000002))) (<= 0 .cse1))))) InVars {main_#t~post4=|v_main_#t~post4_In_12|, main_~y~0=v_main_~y~0_In_12, main_~x~0=v_main_~x~0_In_13} OutVars{main_#t~post4=|v_main_#t~post4_Out_26|, main_~y~0=v_main_~y~0_Out_24, main_~x~0=v_main_~x~0_Out_26} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {6822#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:03:44,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {6628#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {6822#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:03:44,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {6628#true} call #t~ret7 := main(); {6628#true} is VALID [2022-04-15 13:03:44,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6628#true} {6628#true} #52#return; {6628#true} is VALID [2022-04-15 13:03:44,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {6628#true} assume true; {6628#true} is VALID [2022-04-15 13:03:44,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {6628#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); {6628#true} is VALID [2022-04-15 13:03:44,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {6628#true} call ULTIMATE.init(); {6628#true} is VALID [2022-04-15 13:03:44,235 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:44,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427602464] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:03:44,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:03:44,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 51 [2022-04-15 13:03:45,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:03:45,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [11435726] [2022-04-15 13:03:45,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [11435726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:03:45,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:03:45,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 13:03:45,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505286483] [2022-04-15 13:03:45,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:03:45,053 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 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 59 [2022-04-15 13:03:45,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:03:45,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:45,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:45,130 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 13:03:45,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:45,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 13:03:45,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1973, Invalid=2583, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 13:03:45,132 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:49,841 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-04-15 13:03:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 13:03:49,841 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 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 59 [2022-04-15 13:03:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:03:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 81 transitions. [2022-04-15 13:03:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:49,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 81 transitions. [2022-04-15 13:03:49,844 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 81 transitions. [2022-04-15 13:03:49,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:03:49,972 INFO L225 Difference]: With dead ends: 117 [2022-04-15 13:03:49,972 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 13:03:49,973 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2658 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3857, Invalid=6243, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 13:03:49,974 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 81 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 13:03:49,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 34 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 13:03:49,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 13:03:50,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-15 13:03:50,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:03:50,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:50,194 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:50,195 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:50,195 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 13:03:50,195 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 13:03:50,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:50,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:50,196 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 13:03:50,196 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 65 states. [2022-04-15 13:03:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:03:50,197 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 13:03:50,197 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 13:03:50,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:03:50,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:03:50,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:03:50,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:03:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:50,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2022-04-15 13:03:50,199 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 59 [2022-04-15 13:03:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:03:50,199 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2022-04-15 13:03:50,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5277777777777777) internal successors, (55), 35 states have internal predecessors, (55), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:03:50,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 68 transitions. [2022-04-15 13:03:50,409 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-15 13:03:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2022-04-15 13:03:50,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 13:03:50,410 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:03:50,410 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:03:50,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 13:03:50,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 13:03:50,610 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:03:50,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:03:50,611 INFO L85 PathProgramCache]: Analyzing trace with hash 2043708111, now seen corresponding path program 13 times [2022-04-15 13:03:50,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:03:50,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591146286] [2022-04-15 13:03:52,179 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:03:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -615789472, now seen corresponding path program 1 times [2022-04-15 13:03:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:03:52,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789821508] [2022-04-15 13:03:52,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:03:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:03:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:52,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {7449#(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); {7426#true} is VALID [2022-04-15 13:03:52,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {7426#true} assume true; {7426#true} is VALID [2022-04-15 13:03:52,740 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7426#true} {7426#true} #52#return; {7426#true} is VALID [2022-04-15 13:03:52,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {7426#true} call ULTIMATE.init(); {7449#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:03:52,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {7449#(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); {7426#true} is VALID [2022-04-15 13:03:52,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {7426#true} assume true; {7426#true} is VALID [2022-04-15 13:03:52,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7426#true} {7426#true} #52#return; {7426#true} is VALID [2022-04-15 13:03:52,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {7426#true} call #t~ret7 := main(); {7426#true} is VALID [2022-04-15 13:03:52,742 INFO L290 TraceCheckUtils]: 5: Hoare triple {7426#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7431#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:03:52,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {7431#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= |v_main_#t~post4_In_13| |v_main_#t~post4_Out_28|)) (let ((.cse1 (* 2 v_main_~y~0_In_13))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_Out_26) .cse1) (- 4)))) (and (<= (+ v_main_~x~0_In_14 (* .cse0 2)) v_main_~x~0_Out_28) (= (mod (+ (* 2 v_main_~y~0_Out_26) .cse1) 4) 0) (or (< v_main_~x~0_Out_28 50001) (and (not (< v_main_~x~0_Out_28 50002)) (< v_main_~x~0_Out_28 1000002))) (= (* 2 |v_main_#t~post4_Out_28|) (* 2 |v_main_#t~post4_In_13|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_13|, main_~y~0=v_main_~y~0_In_13, main_~x~0=v_main_~x~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_28} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7432#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:52,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {7432#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7432#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:03:52,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {7432#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7433#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:52,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {7433#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7434#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:03:52,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {7434#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7435#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:03:52,751 INFO L290 TraceCheckUtils]: 11: Hoare triple {7435#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7436#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:03:52,753 INFO L290 TraceCheckUtils]: 12: Hoare triple {7436#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7437#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:03:52,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {7437#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7438#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:03:52,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {7438#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7439#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:03:52,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {7439#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7440#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:03:52,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {7440#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7441#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:03:52,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {7441#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7442#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:03:52,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {7442#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7443#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:03:52,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {7443#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7444#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:03:52,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {7444#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7445#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:03:52,765 INFO L290 TraceCheckUtils]: 21: Hoare triple {7445#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7446#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:03:52,767 INFO L290 TraceCheckUtils]: 22: Hoare triple {7446#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7447#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:03:52,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {7447#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7448#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:03:52,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {7448#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !(~y~0 > ~z~0); {7427#false} is VALID [2022-04-15 13:03:52,769 INFO L272 TraceCheckUtils]: 25: Hoare triple {7427#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7427#false} is VALID [2022-04-15 13:03:52,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {7427#false} ~cond := #in~cond; {7427#false} is VALID [2022-04-15 13:03:52,769 INFO L290 TraceCheckUtils]: 27: Hoare triple {7427#false} assume 0 == ~cond; {7427#false} is VALID [2022-04-15 13:03:52,769 INFO L290 TraceCheckUtils]: 28: Hoare triple {7427#false} assume !false; {7427#false} is VALID [2022-04-15 13:03:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:03:52,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:03:52,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789821508] [2022-04-15 13:03:52,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789821508] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:03:52,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000709683] [2022-04-15 13:03:52,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:03:52,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:03:52,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:03:52,772 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:03:52,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 13:03:52,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:52,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 13:03:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:03:52,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:01,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {7426#true} call ULTIMATE.init(); {7426#true} is VALID [2022-04-15 13:04:01,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {7426#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); {7426#true} is VALID [2022-04-15 13:04:01,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {7426#true} assume true; {7426#true} is VALID [2022-04-15 13:04:01,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7426#true} {7426#true} #52#return; {7426#true} is VALID [2022-04-15 13:04:01,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {7426#true} call #t~ret7 := main(); {7426#true} is VALID [2022-04-15 13:04:01,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {7426#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7468#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:04:01,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {7468#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [84] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= |v_main_#t~post4_In_13| |v_main_#t~post4_Out_28|)) (let ((.cse1 (* 2 v_main_~y~0_In_13))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_Out_26) .cse1) (- 4)))) (and (<= (+ v_main_~x~0_In_14 (* .cse0 2)) v_main_~x~0_Out_28) (= (mod (+ (* 2 v_main_~y~0_Out_26) .cse1) 4) 0) (or (< v_main_~x~0_Out_28 50001) (and (not (< v_main_~x~0_Out_28 50002)) (< v_main_~x~0_Out_28 1000002))) (= (* 2 |v_main_#t~post4_Out_28|) (* 2 |v_main_#t~post4_In_13|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_13|, main_~y~0=v_main_~y~0_In_13, main_~x~0=v_main_~x~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_28} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7472#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_373 Int)) (and (= 0 (mod (+ (* v_main_~y~0_373 2) (* main_~y~0 2)) 4)) (<= 50000 v_main_~y~0_373) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) main_~y~0)) (- 4))))))} is VALID [2022-04-15 13:04:01,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {7472#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_373 Int)) (and (= 0 (mod (+ (* v_main_~y~0_373 2) (* main_~y~0 2)) 4)) (<= 50000 v_main_~y~0_373) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) main_~y~0)) (- 4))))))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7476#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int)) (and (= 0 (mod (+ (* v_main_~y~0_373 2) (* main_~y~0 2)) 4)) (<= 50000 v_main_~y~0_373) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) main_~y~0)) (- 4))))))} is VALID [2022-04-15 13:04:01,507 INFO L290 TraceCheckUtils]: 8: Hoare triple {7476#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int)) (and (= 0 (mod (+ (* v_main_~y~0_373 2) (* main_~y~0 2)) 4)) (<= 50000 v_main_~y~0_373) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) main_~y~0)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7480#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {7480#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7484#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {7484#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7488#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,521 INFO L290 TraceCheckUtils]: 11: Hoare triple {7488#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 3)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7492#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))) (<= v_main_~y~0_374 (+ main_~y~0 4)))))} is VALID [2022-04-15 13:04:01,524 INFO L290 TraceCheckUtils]: 12: Hoare triple {7492#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))) (<= v_main_~y~0_374 (+ main_~y~0 4)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7496#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {7496#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7500#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 6)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {7500#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 6)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7504#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ 7 main_~y~0)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {7504#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ 7 main_~y~0)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7508#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {7508#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7512#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {7512#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7516#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {7516#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7520#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 11)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {7520#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 11)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7524#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {7524#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7528#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 13)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,589 INFO L290 TraceCheckUtils]: 21: Hoare triple {7528#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 13)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7532#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))) (<= v_main_~y~0_374 (+ main_~y~0 14)))))} is VALID [2022-04-15 13:04:01,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {7532#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))) (<= v_main_~y~0_374 (+ main_~y~0 14)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7536#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 15)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {7536#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= v_main_~y~0_374 (+ main_~y~0 15)) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7540#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} is VALID [2022-04-15 13:04:01,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {7540#(and (<= main_~z~0 0) (exists ((v_main_~y~0_373 Int) (v_main_~y~0_374 Int)) (and (<= v_main_~y~0_374 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_373) (= (mod (+ (* v_main_~y~0_373 2) (* v_main_~y~0_374 2)) 4) 0) (<= 0 (div (+ (* v_main_~y~0_373 2) (* (- 2) v_main_~y~0_374)) (- 4))))))} assume !(~y~0 > ~z~0); {7427#false} is VALID [2022-04-15 13:04:01,611 INFO L272 TraceCheckUtils]: 25: Hoare triple {7427#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7427#false} is VALID [2022-04-15 13:04:01,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {7427#false} ~cond := #in~cond; {7427#false} is VALID [2022-04-15 13:04:01,611 INFO L290 TraceCheckUtils]: 27: Hoare triple {7427#false} assume 0 == ~cond; {7427#false} is VALID [2022-04-15 13:04:01,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {7427#false} assume !false; {7427#false} is VALID [2022-04-15 13:04:01,611 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:01,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:05,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {7427#false} assume !false; {7427#false} is VALID [2022-04-15 13:04:05,299 INFO L290 TraceCheckUtils]: 27: Hoare triple {7427#false} assume 0 == ~cond; {7427#false} is VALID [2022-04-15 13:04:05,299 INFO L290 TraceCheckUtils]: 26: Hoare triple {7427#false} ~cond := #in~cond; {7427#false} is VALID [2022-04-15 13:04:05,299 INFO L272 TraceCheckUtils]: 25: Hoare triple {7427#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {7427#false} is VALID [2022-04-15 13:04:05,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {7568#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {7427#false} is VALID [2022-04-15 13:04:05,302 INFO L290 TraceCheckUtils]: 23: Hoare triple {7572#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7568#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:04:05,303 INFO L290 TraceCheckUtils]: 22: Hoare triple {7576#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7572#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:04:05,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {7580#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7576#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:04:05,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {7584#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7580#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:04:05,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {7588#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7584#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:04:05,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {7592#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7588#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:04:05,310 INFO L290 TraceCheckUtils]: 17: Hoare triple {7596#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7592#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:04:05,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {7600#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7596#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:04:05,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7600#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:04:05,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {7608#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7604#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:04:05,315 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7608#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:04:05,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {7616#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7612#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:04:05,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {7620#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7616#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:04:05,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {7624#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7620#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:04:05,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {7628#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7624#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:04:05,321 INFO L290 TraceCheckUtils]: 8: Hoare triple {7632#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {7628#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:04:05,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {7636#(or (< main_~x~0 1000000) (< (+ main_~z~0 16) main_~y~0))} [83] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {7632#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:04:05,323 INFO L290 TraceCheckUtils]: 6: Hoare triple {7632#(< (+ main_~z~0 16) main_~y~0)} [84] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_14 v_main_~x~0_Out_28) (= v_main_~y~0_In_13 v_main_~y~0_Out_26) (= |v_main_#t~post4_In_13| |v_main_#t~post4_Out_28|)) (let ((.cse1 (* 2 v_main_~y~0_In_13))) (let ((.cse0 (div (+ (* (- 2) v_main_~y~0_Out_26) .cse1) (- 4)))) (and (<= (+ v_main_~x~0_In_14 (* .cse0 2)) v_main_~x~0_Out_28) (= (mod (+ (* 2 v_main_~y~0_Out_26) .cse1) 4) 0) (or (< v_main_~x~0_Out_28 50001) (and (not (< v_main_~x~0_Out_28 50002)) (< v_main_~x~0_Out_28 1000002))) (= (* 2 |v_main_#t~post4_Out_28|) (* 2 |v_main_#t~post4_In_13|)) (<= 0 .cse0))))) InVars {main_#t~post4=|v_main_#t~post4_In_13|, main_~y~0=v_main_~y~0_In_13, main_~x~0=v_main_~x~0_In_14} OutVars{main_#t~post4=|v_main_#t~post4_Out_28|, main_~y~0=v_main_~y~0_Out_26, main_~x~0=v_main_~x~0_Out_28} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {7636#(or (< main_~x~0 1000000) (< (+ main_~z~0 16) main_~y~0))} is VALID [2022-04-15 13:04:05,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {7426#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {7632#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:04:05,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {7426#true} call #t~ret7 := main(); {7426#true} is VALID [2022-04-15 13:04:05,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7426#true} {7426#true} #52#return; {7426#true} is VALID [2022-04-15 13:04:05,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {7426#true} assume true; {7426#true} is VALID [2022-04-15 13:04:05,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {7426#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); {7426#true} is VALID [2022-04-15 13:04:05,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {7426#true} call ULTIMATE.init(); {7426#true} is VALID [2022-04-15 13:04:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:05,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000709683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:05,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:05,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 20] total 58 [2022-04-15 13:04:06,316 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:06,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591146286] [2022-04-15 13:04:06,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591146286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:06,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:06,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 13:04:06,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543683962] [2022-04-15 13:04:06,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:06,317 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 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 64 [2022-04-15 13:04:06,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:06,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:06,395 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-15 13:04:06,395 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 13:04:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:06,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 13:04:06,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2474, Invalid=3378, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 13:04:06,397 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,222 INFO L93 Difference]: Finished difference Result 128 states and 140 transitions. [2022-04-15 13:04:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 13:04:12,222 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 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 64 [2022-04-15 13:04:12,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:12,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 88 transitions. [2022-04-15 13:04:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 88 transitions. [2022-04-15 13:04:12,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 88 transitions. [2022-04-15 13:04:12,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:12,392 INFO L225 Difference]: With dead ends: 128 [2022-04-15 13:04:12,392 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 13:04:12,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3380 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=4808, Invalid=8074, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 13:04:12,394 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 131 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:12,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 34 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 13:04:12,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 13:04:12,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-15 13:04:12,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:12,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,616 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,616 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,618 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 13:04:12,618 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 13:04:12,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:12,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:12,618 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 13:04:12,619 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-15 13:04:12,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:12,620 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 13:04:12,620 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 13:04:12,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:12,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:12,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:12,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0606060606060606) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 74 transitions. [2022-04-15 13:04:12,622 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 74 transitions. Word has length 64 [2022-04-15 13:04:12,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:12,622 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 74 transitions. [2022-04-15 13:04:12,622 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.5) internal successors, (60), 39 states have internal predecessors, (60), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:12,622 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 74 transitions. [2022-04-15 13:04:12,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 74 transitions. [2022-04-15 13:04:12,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 13:04:12,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:12,871 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:12,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:13,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-15 13:04:13,071 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:13,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:13,072 INFO L85 PathProgramCache]: Analyzing trace with hash -2009533767, now seen corresponding path program 14 times [2022-04-15 13:04:13,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:13,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1263361510] [2022-04-15 13:04:14,871 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:04:14,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2075547776, now seen corresponding path program 1 times [2022-04-15 13:04:14,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:04:14,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799611285] [2022-04-15 13:04:14,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:14,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:04:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:04:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {8319#(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); {8293#true} is VALID [2022-04-15 13:04:15,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {8293#true} assume true; {8293#true} is VALID [2022-04-15 13:04:15,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8293#true} {8293#true} #52#return; {8293#true} is VALID [2022-04-15 13:04:15,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {8293#true} call ULTIMATE.init(); {8319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:04:15,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {8319#(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); {8293#true} is VALID [2022-04-15 13:04:15,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {8293#true} assume true; {8293#true} is VALID [2022-04-15 13:04:15,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8293#true} {8293#true} #52#return; {8293#true} is VALID [2022-04-15 13:04:15,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {8293#true} call #t~ret7 := main(); {8293#true} is VALID [2022-04-15 13:04:15,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {8293#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8298#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:04:15,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {8298#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* v_main_~y~0_In_14 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_28 (- 4))) (- 8)))) (and (<= (+ v_main_~x~0_In_15 (* .cse0 2)) v_main_~x~0_Out_30) (= (mod (+ .cse1 (* v_main_~y~0_Out_28 4)) 8) 0) (= (* |v_main_#t~post4_In_14| 8) (* 8 |v_main_#t~post4_Out_30|)) (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_30 50002)) (< v_main_~x~0_Out_30 1000002)) (< v_main_~x~0_Out_30 50001))))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= |v_main_#t~post4_In_14| |v_main_#t~post4_Out_30|) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_#t~post4=|v_main_#t~post4_In_14|, main_~y~0=v_main_~y~0_In_14, main_~x~0=v_main_~x~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_~y~0=v_main_~y~0_Out_28, main_~x~0=v_main_~x~0_Out_30} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8299#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} is VALID [2022-04-15 13:04:15,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {8299#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} [85] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8300#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:04:15,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {8300#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8301#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:04:15,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {8301#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8302#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:04:15,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {8302#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8303#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:04:15,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {8303#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8304#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:04:15,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {8304#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8305#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:04:15,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {8305#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8306#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:04:15,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {8306#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8307#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:04:15,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8308#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:04:15,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {8308#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8309#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:04:15,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {8309#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8310#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:04:15,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {8310#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8311#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:04:15,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {8311#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8312#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:04:15,654 INFO L290 TraceCheckUtils]: 20: Hoare triple {8312#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8313#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:04:15,655 INFO L290 TraceCheckUtils]: 21: Hoare triple {8313#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8314#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:04:15,657 INFO L290 TraceCheckUtils]: 22: Hoare triple {8314#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8315#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:04:15,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {8315#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8316#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:04:15,660 INFO L290 TraceCheckUtils]: 24: Hoare triple {8316#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8317#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:04:15,660 INFO L290 TraceCheckUtils]: 25: Hoare triple {8317#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8318#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:04:15,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {8318#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {8294#false} is VALID [2022-04-15 13:04:15,661 INFO L272 TraceCheckUtils]: 27: Hoare triple {8294#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8294#false} is VALID [2022-04-15 13:04:15,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {8294#false} ~cond := #in~cond; {8294#false} is VALID [2022-04-15 13:04:15,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {8294#false} assume 0 == ~cond; {8294#false} is VALID [2022-04-15 13:04:15,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {8294#false} assume !false; {8294#false} is VALID [2022-04-15 13:04:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:15,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:04:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799611285] [2022-04-15 13:04:15,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799611285] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:04:15,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259027219] [2022-04-15 13:04:15,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:04:15,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:15,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:04:15,664 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:04:15,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 13:04:15,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:04:15,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:04:15,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:04:26,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {8293#true} call ULTIMATE.init(); {8293#true} is VALID [2022-04-15 13:04:26,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {8293#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); {8293#true} is VALID [2022-04-15 13:04:26,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {8293#true} assume true; {8293#true} is VALID [2022-04-15 13:04:26,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8293#true} {8293#true} #52#return; {8293#true} is VALID [2022-04-15 13:04:26,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {8293#true} call #t~ret7 := main(); {8293#true} is VALID [2022-04-15 13:04:26,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {8293#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8338#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:04:26,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {8338#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [86] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* v_main_~y~0_In_14 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_28 (- 4))) (- 8)))) (and (<= (+ v_main_~x~0_In_15 (* .cse0 2)) v_main_~x~0_Out_30) (= (mod (+ .cse1 (* v_main_~y~0_Out_28 4)) 8) 0) (= (* |v_main_#t~post4_In_14| 8) (* 8 |v_main_#t~post4_Out_30|)) (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_30 50002)) (< v_main_~x~0_Out_30 1000002)) (< v_main_~x~0_Out_30 50001))))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= |v_main_#t~post4_In_14| |v_main_#t~post4_Out_30|) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_#t~post4=|v_main_#t~post4_In_14|, main_~y~0=v_main_~y~0_In_14, main_~x~0=v_main_~x~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_~y~0=v_main_~y~0_Out_28, main_~x~0=v_main_~x~0_Out_30} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8342#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_429 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (= (mod (+ (* v_main_~y~0_429 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_429))))} is VALID [2022-04-15 13:04:26,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {8342#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_429 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (= (mod (+ (* v_main_~y~0_429 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_429))))} [85] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8346#(and (<= main_~z~0 0) (exists ((v_main_~y~0_429 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (= (mod (+ (* v_main_~y~0_429 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_429))))} is VALID [2022-04-15 13:04:26,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {8346#(and (<= main_~z~0 0) (exists ((v_main_~y~0_429 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (= (mod (+ (* v_main_~y~0_429 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_429))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8350#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {8350#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8354#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,212 INFO L290 TraceCheckUtils]: 10: Hoare triple {8354#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8358#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 3)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {8358#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 3)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8362#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {8362#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8366#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {8366#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8370#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {8370#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8374#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ 7 main_~y~0)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {8374#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ 7 main_~y~0)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8378#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,260 INFO L290 TraceCheckUtils]: 16: Hoare triple {8378#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8382#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {8382#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8386#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {8386#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8390#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (<= v_main_~y~0_430 (+ main_~y~0 11)))))} is VALID [2022-04-15 13:04:26,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {8390#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))) (<= v_main_~y~0_430 (+ main_~y~0 11)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8394#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 12)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {8394#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 12)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8398#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,286 INFO L290 TraceCheckUtils]: 21: Hoare triple {8398#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8402#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 14)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {8402#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= 50000 v_main_~y~0_429) (<= v_main_~y~0_430 (+ main_~y~0 14)) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8406#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {8406#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8410#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {8410#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8414#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,331 INFO L290 TraceCheckUtils]: 25: Hoare triple {8414#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8418#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 18)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} is VALID [2022-04-15 13:04:26,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {8418#(and (<= main_~z~0 0) (exists ((v_main_~y~0_430 Int) (v_main_~y~0_429 Int)) (and (<= v_main_~y~0_430 (+ main_~y~0 18)) (<= 50000 v_main_~y~0_429) (= (mod (+ (* v_main_~y~0_430 4) (* v_main_~y~0_429 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_430 (- 4)) (* v_main_~y~0_429 4)) (- 8))))))} assume !(~y~0 > ~z~0); {8294#false} is VALID [2022-04-15 13:04:26,334 INFO L272 TraceCheckUtils]: 27: Hoare triple {8294#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8294#false} is VALID [2022-04-15 13:04:26,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {8294#false} ~cond := #in~cond; {8294#false} is VALID [2022-04-15 13:04:26,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {8294#false} assume 0 == ~cond; {8294#false} is VALID [2022-04-15 13:04:26,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {8294#false} assume !false; {8294#false} is VALID [2022-04-15 13:04:26,334 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:26,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:04:39,629 INFO L290 TraceCheckUtils]: 30: Hoare triple {8294#false} assume !false; {8294#false} is VALID [2022-04-15 13:04:39,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {8294#false} assume 0 == ~cond; {8294#false} is VALID [2022-04-15 13:04:39,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {8294#false} ~cond := #in~cond; {8294#false} is VALID [2022-04-15 13:04:39,630 INFO L272 TraceCheckUtils]: 27: Hoare triple {8294#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {8294#false} is VALID [2022-04-15 13:04:39,630 INFO L290 TraceCheckUtils]: 26: Hoare triple {8446#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {8294#false} is VALID [2022-04-15 13:04:39,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {8450#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8446#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:04:39,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {8454#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8450#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:04:39,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {8458#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8454#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:04:39,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {8462#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8458#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:04:39,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {8466#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8462#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:04:39,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {8470#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8466#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:04:39,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {8474#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8470#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:04:39,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {8478#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8474#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:04:39,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {8482#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8478#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:04:39,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {8486#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8482#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:04:39,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {8490#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8486#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:04:39,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {8494#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8490#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:04:39,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {8498#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8494#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:04:39,657 INFO L290 TraceCheckUtils]: 12: Hoare triple {8502#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8498#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:04:39,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {8506#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8502#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:04:39,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {8510#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8506#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:04:39,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {8514#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8510#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:04:39,664 INFO L290 TraceCheckUtils]: 8: Hoare triple {8518#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {8514#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:04:39,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {8522#(or (< main_~x~0 1000000) (< (+ main_~z~0 18) main_~y~0))} [85] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {8518#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:04:39,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {8518#(< (+ main_~z~0 18) main_~y~0)} [86] L10-2-->L17-1_primed: Formula: (or (let ((.cse1 (* v_main_~y~0_In_14 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_28 (- 4))) (- 8)))) (and (<= (+ v_main_~x~0_In_15 (* .cse0 2)) v_main_~x~0_Out_30) (= (mod (+ .cse1 (* v_main_~y~0_Out_28 4)) 8) 0) (= (* |v_main_#t~post4_In_14| 8) (* 8 |v_main_#t~post4_Out_30|)) (<= 0 .cse0) (or (and (not (< v_main_~x~0_Out_30 50002)) (< v_main_~x~0_Out_30 1000002)) (< v_main_~x~0_Out_30 50001))))) (and (= v_main_~y~0_In_14 v_main_~y~0_Out_28) (= |v_main_#t~post4_In_14| |v_main_#t~post4_Out_30|) (= v_main_~x~0_In_15 v_main_~x~0_Out_30))) InVars {main_#t~post4=|v_main_#t~post4_In_14|, main_~y~0=v_main_~y~0_In_14, main_~x~0=v_main_~x~0_In_15} OutVars{main_#t~post4=|v_main_#t~post4_Out_30|, main_~y~0=v_main_~y~0_Out_28, main_~x~0=v_main_~x~0_Out_30} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {8522#(or (< main_~x~0 1000000) (< (+ main_~z~0 18) main_~y~0))} is VALID [2022-04-15 13:04:39,667 INFO L290 TraceCheckUtils]: 5: Hoare triple {8293#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {8518#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:04:39,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {8293#true} call #t~ret7 := main(); {8293#true} is VALID [2022-04-15 13:04:39,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8293#true} {8293#true} #52#return; {8293#true} is VALID [2022-04-15 13:04:39,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {8293#true} assume true; {8293#true} is VALID [2022-04-15 13:04:39,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {8293#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); {8293#true} is VALID [2022-04-15 13:04:39,667 INFO L272 TraceCheckUtils]: 0: Hoare triple {8293#true} call ULTIMATE.init(); {8293#true} is VALID [2022-04-15 13:04:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:04:39,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259027219] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:04:39,668 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:04:39,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 22] total 65 [2022-04-15 13:04:43,630 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:04:43,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1263361510] [2022-04-15 13:04:43,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1263361510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:04:43,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:04:43,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 13:04:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460544516] [2022-04-15 13:04:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:04:43,631 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 13:04:43,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:04:43,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:43,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:43,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 13:04:43,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 13:04:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3122, Invalid=4360, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 13:04:43,963 INFO L87 Difference]: Start difference. First operand 71 states and 74 transitions. Second operand has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:45,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:45,944 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2022-04-15 13:04:45,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 13:04:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-15 13:04:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:04:45,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:45,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-15 13:04:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:45,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 86 transitions. [2022-04-15 13:04:45,948 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 86 transitions. [2022-04-15 13:04:46,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:46,276 INFO L225 Difference]: With dead ends: 135 [2022-04-15 13:04:46,276 INFO L226 Difference]: Without dead ends: 130 [2022-04-15 13:04:46,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3722 ImplicationChecksByTransitivity, 21.8s TimeCoverageRelationStatistics Valid=4095, Invalid=7035, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 13:04:46,278 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 13:04:46,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 86 Unchecked, 0.2s Time] [2022-04-15 13:04:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-15 13:04:46,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2022-04-15 13:04:46,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:04:46,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:46,762 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:46,763 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:46,765 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-15 13:04:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-15 13:04:46,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:46,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:46,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-15 13:04:46,766 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 130 states. [2022-04-15 13:04:46,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:04:46,768 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2022-04-15 13:04:46,768 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 137 transitions. [2022-04-15 13:04:46,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:04:46,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:04:46,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:04:46,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:04:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.074766355140187) internal successors, (115), 107 states have internal predecessors, (115), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2022-04-15 13:04:46,771 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 70 [2022-04-15 13:04:46,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:04:46,771 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2022-04-15 13:04:46,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5) internal successors, (66), 43 states have internal predecessors, (66), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:04:46,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 119 transitions. [2022-04-15 13:04:47,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:04:47,366 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-04-15 13:04:47,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 13:04:47,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:04:47,366 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:04:47,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 13:04:47,566 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:04:47,567 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:04:47,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:04:47,567 INFO L85 PathProgramCache]: Analyzing trace with hash -2130466870, now seen corresponding path program 15 times [2022-04-15 13:04:47,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:04:47,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437040078] [2022-04-15 13:05:02,425 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:05:02,427 INFO L85 PathProgramCache]: Analyzing trace with hash 155597603, now seen corresponding path program 1 times [2022-04-15 13:05:02,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:02,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358141010] [2022-04-15 13:05:02,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:02,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:02,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:03,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {9385#(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); {9360#true} is VALID [2022-04-15 13:05:03,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {9360#true} assume true; {9360#true} is VALID [2022-04-15 13:05:03,110 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9360#true} {9360#true} #52#return; {9360#true} is VALID [2022-04-15 13:05:03,111 INFO L272 TraceCheckUtils]: 0: Hoare triple {9360#true} call ULTIMATE.init(); {9385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:03,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {9385#(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); {9360#true} is VALID [2022-04-15 13:05:03,111 INFO L290 TraceCheckUtils]: 2: Hoare triple {9360#true} assume true; {9360#true} is VALID [2022-04-15 13:05:03,111 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9360#true} {9360#true} #52#return; {9360#true} is VALID [2022-04-15 13:05:03,111 INFO L272 TraceCheckUtils]: 4: Hoare triple {9360#true} call #t~ret7 := main(); {9360#true} is VALID [2022-04-15 13:05:03,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {9360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:03,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_15| |v_main_#t~post4_Out_32|))) (or (and .cse0 (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30)) (let ((.cse1 (div (+ v_main_~y~0_Out_30 (* (- 1) v_main_~y~0_In_15)) 2))) (and .cse0 (or (and (not (< v_main_~x~0_Out_32 50002)) (< v_main_~x~0_Out_32 1000002)) (< v_main_~x~0_Out_32 50001)) (<= 0 .cse1) (<= (+ v_main_~x~0_In_16 (* .cse1 2)) v_main_~x~0_Out_32) (= (mod (+ v_main_~y~0_Out_30 v_main_~y~0_In_15) 2) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_15|, main_~y~0=v_main_~y~0_In_15, main_~x~0=v_main_~x~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:03,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:03,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {9365#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9366#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:03,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {9366#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9367#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:03,133 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9368#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:05:03,134 INFO L290 TraceCheckUtils]: 11: Hoare triple {9368#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9369#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:05:03,135 INFO L290 TraceCheckUtils]: 12: Hoare triple {9369#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9370#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:05:03,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {9370#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9371#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:05:03,141 INFO L290 TraceCheckUtils]: 14: Hoare triple {9371#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9372#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:05:03,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {9372#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9373#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:05:03,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {9373#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9374#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:05:03,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {9374#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9375#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:03,149 INFO L290 TraceCheckUtils]: 18: Hoare triple {9375#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9376#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:05:03,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {9376#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9377#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:05:03,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {9377#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9378#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:05:03,154 INFO L290 TraceCheckUtils]: 21: Hoare triple {9378#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9379#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:05:03,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {9379#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9380#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:05:03,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {9380#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9381#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:05:03,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {9381#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9382#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:05:03,161 INFO L290 TraceCheckUtils]: 25: Hoare triple {9382#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9383#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:05:03,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {9383#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9384#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:03,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {9384#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !(~y~0 > ~z~0); {9361#false} is VALID [2022-04-15 13:05:03,164 INFO L272 TraceCheckUtils]: 28: Hoare triple {9361#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {9361#false} is VALID [2022-04-15 13:05:03,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {9361#false} ~cond := #in~cond; {9361#false} is VALID [2022-04-15 13:05:03,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {9361#false} assume 0 == ~cond; {9361#false} is VALID [2022-04-15 13:05:03,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {9361#false} assume !false; {9361#false} is VALID [2022-04-15 13:05:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358141010] [2022-04-15 13:05:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358141010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398705997] [2022-04-15 13:05:03,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:03,168 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:03,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 13:05:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 13:05:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:03,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:04,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {9360#true} call ULTIMATE.init(); {9360#true} is VALID [2022-04-15 13:05:04,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {9360#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); {9360#true} is VALID [2022-04-15 13:05:04,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {9360#true} assume true; {9360#true} is VALID [2022-04-15 13:05:04,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9360#true} {9360#true} #52#return; {9360#true} is VALID [2022-04-15 13:05:04,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {9360#true} call #t~ret7 := main(); {9360#true} is VALID [2022-04-15 13:05:04,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {9360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:04,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_15| |v_main_#t~post4_Out_32|))) (or (and .cse0 (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30)) (let ((.cse1 (div (+ v_main_~y~0_Out_30 (* (- 1) v_main_~y~0_In_15)) 2))) (and .cse0 (or (and (not (< v_main_~x~0_Out_32 50002)) (< v_main_~x~0_Out_32 1000002)) (< v_main_~x~0_Out_32 50001)) (<= 0 .cse1) (<= (+ v_main_~x~0_In_16 (* .cse1 2)) v_main_~x~0_Out_32) (= (mod (+ v_main_~y~0_Out_30 v_main_~y~0_In_15) 2) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_15|, main_~y~0=v_main_~y~0_In_15, main_~x~0=v_main_~x~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:04,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:04,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {9404#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9414#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:04,815 INFO L290 TraceCheckUtils]: 9: Hoare triple {9414#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9418#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:05:04,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {9418#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9422#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:05:04,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {9422#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9426#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:05:04,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {9426#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9430#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:05:04,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {9430#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9434#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:05:04,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {9434#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9438#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:05:04,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {9438#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9442#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:05:04,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {9442#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9446#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:05:04,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {9446#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9450#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:05:04,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {9450#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9454#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:05:04,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {9454#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9458#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:05:04,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {9458#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9462#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:05:04,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {9462#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9466#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:05:04,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {9466#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9470#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:05:04,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {9470#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9474#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:05:04,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {9474#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9478#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:05:04,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {9478#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9482#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:05:04,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9486#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-15 13:05:04,867 INFO L290 TraceCheckUtils]: 27: Hoare triple {9486#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !(~y~0 > ~z~0); {9361#false} is VALID [2022-04-15 13:05:04,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {9361#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {9361#false} is VALID [2022-04-15 13:05:04,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {9361#false} ~cond := #in~cond; {9361#false} is VALID [2022-04-15 13:05:04,868 INFO L290 TraceCheckUtils]: 30: Hoare triple {9361#false} assume 0 == ~cond; {9361#false} is VALID [2022-04-15 13:05:04,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {9361#false} assume !false; {9361#false} is VALID [2022-04-15 13:05:04,868 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:04,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:10,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {9361#false} assume !false; {9361#false} is VALID [2022-04-15 13:05:10,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {9361#false} assume 0 == ~cond; {9361#false} is VALID [2022-04-15 13:05:10,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {9361#false} ~cond := #in~cond; {9361#false} is VALID [2022-04-15 13:05:10,083 INFO L272 TraceCheckUtils]: 28: Hoare triple {9361#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {9361#false} is VALID [2022-04-15 13:05:10,083 INFO L290 TraceCheckUtils]: 27: Hoare triple {9514#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {9361#false} is VALID [2022-04-15 13:05:10,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {9518#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9514#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:10,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {9522#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9518#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:05:10,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {9526#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9522#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:05:10,095 INFO L290 TraceCheckUtils]: 23: Hoare triple {9530#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9526#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:05:10,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {9534#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9530#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:05:10,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {9538#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9534#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:10,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {9542#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9538#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:05:10,103 INFO L290 TraceCheckUtils]: 19: Hoare triple {9546#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9542#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:10,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {9550#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9546#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:05:10,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {9554#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9550#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:05:10,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {9558#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9554#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:05:10,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {9562#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9558#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:05:10,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {9566#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9562#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:05:10,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {9570#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9566#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:05:10,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {9574#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9570#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:05:10,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {9578#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9574#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:05:10,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {9582#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9578#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:05:10,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {9586#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9582#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:05:10,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {9590#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {9586#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:05:10,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {9590#(< (+ 19 main_~z~0) main_~y~0)} [87] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {9590#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:10,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {9590#(< (+ 19 main_~z~0) main_~y~0)} [88] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_15| |v_main_#t~post4_Out_32|))) (or (and .cse0 (= v_main_~x~0_In_16 v_main_~x~0_Out_32) (= v_main_~y~0_In_15 v_main_~y~0_Out_30)) (let ((.cse1 (div (+ v_main_~y~0_Out_30 (* (- 1) v_main_~y~0_In_15)) 2))) (and .cse0 (or (and (not (< v_main_~x~0_Out_32 50002)) (< v_main_~x~0_Out_32 1000002)) (< v_main_~x~0_Out_32 50001)) (<= 0 .cse1) (<= (+ v_main_~x~0_In_16 (* .cse1 2)) v_main_~x~0_Out_32) (= (mod (+ v_main_~y~0_Out_30 v_main_~y~0_In_15) 2) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_15|, main_~y~0=v_main_~y~0_In_15, main_~x~0=v_main_~x~0_In_16} OutVars{main_#t~post4=|v_main_#t~post4_Out_32|, main_~y~0=v_main_~y~0_Out_30, main_~x~0=v_main_~x~0_Out_32} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {9590#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:10,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {9360#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {9590#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:10,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {9360#true} call #t~ret7 := main(); {9360#true} is VALID [2022-04-15 13:05:10,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9360#true} {9360#true} #52#return; {9360#true} is VALID [2022-04-15 13:05:10,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {9360#true} assume true; {9360#true} is VALID [2022-04-15 13:05:10,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {9360#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); {9360#true} is VALID [2022-04-15 13:05:10,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {9360#true} call ULTIMATE.init(); {9360#true} is VALID [2022-04-15 13:05:10,130 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:10,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398705997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:10,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:10,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 63 [2022-04-15 13:05:11,517 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:11,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437040078] [2022-04-15 13:05:11,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437040078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:11,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:11,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 13:05:11,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747892091] [2022-04-15 13:05:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:11,518 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:11,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:11,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:11,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:11,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 13:05:11,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:11,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 13:05:11,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3025, Invalid=3947, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 13:05:11,675 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:21,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:21,909 INFO L93 Difference]: Finished difference Result 221 states and 241 transitions. [2022-04-15 13:05:21,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 13:05:21,910 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:21,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:21,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 94 transitions. [2022-04-15 13:05:21,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:21,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 94 transitions. [2022-04-15 13:05:21,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 94 transitions. [2022-04-15 13:05:22,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:22,320 INFO L225 Difference]: With dead ends: 221 [2022-04-15 13:05:22,320 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 13:05:22,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4084 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=5899, Invalid=9601, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 13:05:22,322 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 99 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:22,322 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 59 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-15 13:05:22,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 13:05:22,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 77. [2022-04-15 13:05:22,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:22,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:22,640 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:22,640 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:22,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:22,642 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 13:05:22,642 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 13:05:22,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:22,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:22,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 13:05:22,643 INFO L87 Difference]: Start difference. First operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 117 states. [2022-04-15 13:05:22,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:22,645 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2022-04-15 13:05:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 121 transitions. [2022-04-15 13:05:22,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:22,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:22,645 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:22,645 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:22,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 72 states have internal predecessors, (76), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2022-04-15 13:05:22,647 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 71 [2022-04-15 13:05:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:22,647 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2022-04-15 13:05:22,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 43 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-15 13:05:22,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 80 transitions. [2022-04-15 13:05:23,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:23,016 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2022-04-15 13:05:23,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-04-15 13:05:23,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:23,016 INFO L499 BasicCegarLoop]: trace histogram [22, 21, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:23,032 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 13:05:23,216 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 13:05:23,217 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:23,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1804202147, now seen corresponding path program 16 times [2022-04-15 13:05:23,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:23,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [9041785] [2022-04-15 13:05:25,053 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:05:25,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1745603488, now seen corresponding path program 1 times [2022-04-15 13:05:25,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:25,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072472614] [2022-04-15 13:05:25,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:25,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:25,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {10578#(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); {10550#true} is VALID [2022-04-15 13:05:25,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {10550#true} assume true; {10550#true} is VALID [2022-04-15 13:05:25,801 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10550#true} {10550#true} #52#return; {10550#true} is VALID [2022-04-15 13:05:25,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {10550#true} call ULTIMATE.init(); {10578#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:25,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {10578#(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); {10550#true} is VALID [2022-04-15 13:05:25,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {10550#true} assume true; {10550#true} is VALID [2022-04-15 13:05:25,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10550#true} {10550#true} #52#return; {10550#true} is VALID [2022-04-15 13:05:25,802 INFO L272 TraceCheckUtils]: 4: Hoare triple {10550#true} call #t~ret7 := main(); {10550#true} is VALID [2022-04-15 13:05:25,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {10550#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10555#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:25,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {10555#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [90] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_16| |v_main_#t~post4_Out_34|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_32) v_main_~y~0_In_16) (- 2)))) (and .cse0 (<= (+ v_main_~x~0_In_17 (* 2 .cse1)) v_main_~x~0_Out_34) (or (and (< v_main_~x~0_Out_34 1000002) (not (< v_main_~x~0_Out_34 50002))) (< v_main_~x~0_Out_34 50001)) (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_32 v_main_~y~0_In_16) 2) 0))) (and .cse0 (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)))) InVars {main_#t~post4=|v_main_#t~post4_In_16|, main_~y~0=v_main_~y~0_In_16, main_~x~0=v_main_~x~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_~y~0=v_main_~y~0_Out_32, main_~x~0=v_main_~x~0_Out_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {10556#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} is VALID [2022-04-15 13:05:25,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {10556#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} [89] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10557#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:25,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {10557#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10558#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:25,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {10558#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10559#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:05:25,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {10559#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10560#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:05:25,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {10560#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10561#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:05:25,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {10561#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10562#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:05:25,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {10562#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10563#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:05:25,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {10563#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10564#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:05:25,824 INFO L290 TraceCheckUtils]: 15: Hoare triple {10564#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10565#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:05:25,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {10565#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10566#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:25,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {10566#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10567#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:05:25,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {10567#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10568#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:05:25,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {10568#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10569#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:05:25,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {10569#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10570#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:05:25,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {10570#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10571#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:05:25,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {10571#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10572#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:05:25,841 INFO L290 TraceCheckUtils]: 23: Hoare triple {10572#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10573#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:05:25,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {10573#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10574#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:05:25,843 INFO L290 TraceCheckUtils]: 25: Hoare triple {10574#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10575#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:25,844 INFO L290 TraceCheckUtils]: 26: Hoare triple {10575#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10576#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:05:25,844 INFO L290 TraceCheckUtils]: 27: Hoare triple {10576#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10577#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:05:25,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {10577#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !(~y~0 > ~z~0); {10551#false} is VALID [2022-04-15 13:05:25,845 INFO L272 TraceCheckUtils]: 29: Hoare triple {10551#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {10551#false} is VALID [2022-04-15 13:05:25,845 INFO L290 TraceCheckUtils]: 30: Hoare triple {10551#false} ~cond := #in~cond; {10551#false} is VALID [2022-04-15 13:05:25,845 INFO L290 TraceCheckUtils]: 31: Hoare triple {10551#false} assume 0 == ~cond; {10551#false} is VALID [2022-04-15 13:05:25,845 INFO L290 TraceCheckUtils]: 32: Hoare triple {10551#false} assume !false; {10551#false} is VALID [2022-04-15 13:05:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:25,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:25,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072472614] [2022-04-15 13:05:25,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072472614] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:25,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492535647] [2022-04-15 13:05:25,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:25,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:25,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:25,854 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:25,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 13:05:25,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 13:05:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:25,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:05:27,832 INFO L272 TraceCheckUtils]: 0: Hoare triple {10550#true} call ULTIMATE.init(); {10550#true} is VALID [2022-04-15 13:05:27,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {10550#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); {10550#true} is VALID [2022-04-15 13:05:27,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {10550#true} assume true; {10550#true} is VALID [2022-04-15 13:05:27,833 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10550#true} {10550#true} #52#return; {10550#true} is VALID [2022-04-15 13:05:27,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {10550#true} call #t~ret7 := main(); {10550#true} is VALID [2022-04-15 13:05:27,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {10550#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:27,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [90] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_16| |v_main_#t~post4_Out_34|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_32) v_main_~y~0_In_16) (- 2)))) (and .cse0 (<= (+ v_main_~x~0_In_17 (* 2 .cse1)) v_main_~x~0_Out_34) (or (and (< v_main_~x~0_Out_34 1000002) (not (< v_main_~x~0_Out_34 50002))) (< v_main_~x~0_Out_34 50001)) (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_32 v_main_~y~0_In_16) 2) 0))) (and .cse0 (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)))) InVars {main_#t~post4=|v_main_#t~post4_In_16|, main_~y~0=v_main_~y~0_In_16, main_~x~0=v_main_~x~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_~y~0=v_main_~y~0_Out_32, main_~x~0=v_main_~x~0_Out_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:27,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [89] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:27,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {10597#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10607#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:27,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {10607#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10611#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:05:27,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {10611#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10615#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:05:27,851 INFO L290 TraceCheckUtils]: 11: Hoare triple {10615#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10619#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:05:27,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {10619#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10623#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:05:27,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {10623#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10627#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:05:27,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {10627#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10631#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:05:27,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {10631#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10635#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:05:27,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {10635#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10639#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:05:27,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {10639#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10643#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:05:27,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {10643#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10647#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:05:27,881 INFO L290 TraceCheckUtils]: 19: Hoare triple {10647#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10651#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:05:27,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {10651#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10655#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:05:27,892 INFO L290 TraceCheckUtils]: 21: Hoare triple {10655#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10659#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:05:27,894 INFO L290 TraceCheckUtils]: 22: Hoare triple {10659#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10663#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:05:27,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {10663#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10667#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:05:27,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {10667#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10671#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:05:27,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {10671#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10675#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:05:27,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {10675#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10679#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-15 13:05:27,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {10679#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10683#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:05:27,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {10683#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !(~y~0 > ~z~0); {10551#false} is VALID [2022-04-15 13:05:27,910 INFO L272 TraceCheckUtils]: 29: Hoare triple {10551#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {10551#false} is VALID [2022-04-15 13:05:27,910 INFO L290 TraceCheckUtils]: 30: Hoare triple {10551#false} ~cond := #in~cond; {10551#false} is VALID [2022-04-15 13:05:27,910 INFO L290 TraceCheckUtils]: 31: Hoare triple {10551#false} assume 0 == ~cond; {10551#false} is VALID [2022-04-15 13:05:27,910 INFO L290 TraceCheckUtils]: 32: Hoare triple {10551#false} assume !false; {10551#false} is VALID [2022-04-15 13:05:27,910 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:27,910 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:05:36,301 INFO L290 TraceCheckUtils]: 32: Hoare triple {10551#false} assume !false; {10551#false} is VALID [2022-04-15 13:05:36,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {10551#false} assume 0 == ~cond; {10551#false} is VALID [2022-04-15 13:05:36,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {10551#false} ~cond := #in~cond; {10551#false} is VALID [2022-04-15 13:05:36,301 INFO L272 TraceCheckUtils]: 29: Hoare triple {10551#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {10551#false} is VALID [2022-04-15 13:05:36,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {10711#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {10551#false} is VALID [2022-04-15 13:05:36,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {10715#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10711#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:05:36,309 INFO L290 TraceCheckUtils]: 26: Hoare triple {10719#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10715#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:05:36,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {10723#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10719#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:05:36,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {10727#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10723#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:05:36,316 INFO L290 TraceCheckUtils]: 23: Hoare triple {10731#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10727#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:05:36,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {10735#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10731#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:36,321 INFO L290 TraceCheckUtils]: 21: Hoare triple {10739#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10735#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:05:36,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {10743#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10739#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:36,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {10747#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10743#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:05:36,327 INFO L290 TraceCheckUtils]: 18: Hoare triple {10751#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10747#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:05:36,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {10755#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10751#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:05:36,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {10759#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10755#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:05:36,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {10763#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10759#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:05:36,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {10767#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10763#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:05:36,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {10771#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10767#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:05:36,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {10775#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10771#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:05:36,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {10779#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10775#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:05:36,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {10783#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10779#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:05:36,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {10787#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10783#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:05:36,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {10791#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {10787#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:05:36,348 INFO L290 TraceCheckUtils]: 7: Hoare triple {10791#(< (+ main_~z~0 20) main_~y~0)} [89] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {10791#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:05:36,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {10791#(< (+ main_~z~0 20) main_~y~0)} [90] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_16| |v_main_#t~post4_Out_34|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_32) v_main_~y~0_In_16) (- 2)))) (and .cse0 (<= (+ v_main_~x~0_In_17 (* 2 .cse1)) v_main_~x~0_Out_34) (or (and (< v_main_~x~0_Out_34 1000002) (not (< v_main_~x~0_Out_34 50002))) (< v_main_~x~0_Out_34 50001)) (<= 0 .cse1) (= (mod (+ v_main_~y~0_Out_32 v_main_~y~0_In_16) 2) 0))) (and .cse0 (= v_main_~y~0_In_16 v_main_~y~0_Out_32) (= v_main_~x~0_In_17 v_main_~x~0_Out_34)))) InVars {main_#t~post4=|v_main_#t~post4_In_16|, main_~y~0=v_main_~y~0_In_16, main_~x~0=v_main_~x~0_In_17} OutVars{main_#t~post4=|v_main_#t~post4_Out_34|, main_~y~0=v_main_~y~0_Out_32, main_~x~0=v_main_~x~0_Out_34} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {10791#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:05:36,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {10550#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {10791#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:05:36,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {10550#true} call #t~ret7 := main(); {10550#true} is VALID [2022-04-15 13:05:36,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10550#true} {10550#true} #52#return; {10550#true} is VALID [2022-04-15 13:05:36,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {10550#true} assume true; {10550#true} is VALID [2022-04-15 13:05:36,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {10550#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); {10550#true} is VALID [2022-04-15 13:05:36,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {10550#true} call ULTIMATE.init(); {10550#true} is VALID [2022-04-15 13:05:36,352 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:36,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492535647] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:05:36,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:05:36,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23, 23] total 68 [2022-04-15 13:05:38,761 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:05:38,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [9041785] [2022-04-15 13:05:38,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [9041785] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:05:38,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:05:38,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 13:05:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835866309] [2022-04-15 13:05:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:05:38,762 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 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 76 [2022-04-15 13:05:38,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:05:38,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:38,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:38,981 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 13:05:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:38,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 13:05:38,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3621, Invalid=4935, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 13:05:38,982 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:47,683 INFO L93 Difference]: Finished difference Result 148 states and 156 transitions. [2022-04-15 13:05:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 13:05:47,683 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 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 76 [2022-04-15 13:05:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:05:47,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:47,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-04-15 13:05:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 73 transitions. [2022-04-15 13:05:47,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 73 transitions. [2022-04-15 13:05:48,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:05:48,072 INFO L225 Difference]: With dead ends: 148 [2022-04-15 13:05:48,072 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 13:05:48,073 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=5109, Invalid=7773, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 13:05:48,074 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 13:05:48,075 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 405 Invalid, 0 Unknown, 93 Unchecked, 3.0s Time] [2022-04-15 13:05:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 13:05:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-04-15 13:05:48,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:05:48,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:48,755 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:48,755 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:48,757 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-04-15 13:05:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-04-15 13:05:48,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:48,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:48,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 13:05:48,758 INFO L87 Difference]: Start difference. First operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 122 states. [2022-04-15 13:05:48,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:05:48,760 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2022-04-15 13:05:48,760 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2022-04-15 13:05:48,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:05:48,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:05:48,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:05:48,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:05:48,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 116 states have (on average 1.0603448275862069) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:48,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2022-04-15 13:05:48,763 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 76 [2022-04-15 13:05:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:05:48,763 INFO L478 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2022-04-15 13:05:48,763 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.469387755102041) internal successors, (72), 48 states have internal predecessors, (72), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:05:48,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 121 states and 127 transitions. [2022-04-15 13:05:49,502 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-15 13:05:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2022-04-15 13:05:49,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 13:05:49,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:05:49,503 INFO L499 BasicCegarLoop]: trace histogram [23, 22, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:05:49,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-15 13:05:49,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:49,703 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:05:49,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:05:49,703 INFO L85 PathProgramCache]: Analyzing trace with hash 55368360, now seen corresponding path program 17 times [2022-04-15 13:05:49,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:05:49,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1119685460] [2022-04-15 13:05:51,047 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:05:51,049 INFO L85 PathProgramCache]: Analyzing trace with hash 239664160, now seen corresponding path program 1 times [2022-04-15 13:05:51,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:05:51,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996201326] [2022-04-15 13:05:51,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:05:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:51,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:05:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:51,890 INFO L290 TraceCheckUtils]: 0: Hoare triple {11694#(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); {11667#true} is VALID [2022-04-15 13:05:51,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 13:05:51,890 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11667#true} {11667#true} #52#return; {11667#true} is VALID [2022-04-15 13:05:51,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {11667#true} call ULTIMATE.init(); {11694#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:05:51,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {11694#(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); {11667#true} is VALID [2022-04-15 13:05:51,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 13:05:51,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #52#return; {11667#true} is VALID [2022-04-15 13:05:51,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret7 := main(); {11667#true} is VALID [2022-04-15 13:05:51,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11672#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:05:51,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {11672#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [92] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34) (= |v_main_#t~post4_In_17| |v_main_#t~post4_Out_36|)) (let ((.cse1 (* v_main_~y~0_In_17 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_34 (- 4))) (- 8)))) (and (<= 0 .cse0) (= (* |v_main_#t~post4_In_17| 8) (* 8 |v_main_#t~post4_Out_36|)) (<= (+ v_main_~x~0_In_18 (* .cse0 2)) v_main_~x~0_Out_36) (or (< v_main_~x~0_Out_36 50001) (and (< v_main_~x~0_Out_36 1000002) (not (< v_main_~x~0_Out_36 50002)))) (= (mod (+ (* v_main_~y~0_Out_34 4) .cse1) 8) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_17|, main_~y~0=v_main_~y~0_In_17, main_~x~0=v_main_~x~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_36} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {11673#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:51,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {11673#(and (= main_~z~0 0) (<= 49999 main_~y~0))} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11673#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:05:51,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {11673#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11674#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:51,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {11674#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11675#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:05:51,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {11675#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11676#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:05:51,909 INFO L290 TraceCheckUtils]: 11: Hoare triple {11676#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11677#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:05:51,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {11677#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11678#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:05:51,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {11678#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11679#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:05:51,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {11679#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11680#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:05:51,927 INFO L290 TraceCheckUtils]: 15: Hoare triple {11680#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11681#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:05:51,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {11681#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11682#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:51,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {11682#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11683#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:05:51,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {11683#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11684#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:05:51,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {11684#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11685#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:05:51,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {11685#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11686#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:05:51,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {11686#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11687#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:05:51,952 INFO L290 TraceCheckUtils]: 22: Hoare triple {11687#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11688#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:05:51,955 INFO L290 TraceCheckUtils]: 23: Hoare triple {11688#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11689#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:05:51,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {11689#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11690#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:05:51,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {11690#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11691#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:05:51,958 INFO L290 TraceCheckUtils]: 26: Hoare triple {11691#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11692#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:05:51,959 INFO L290 TraceCheckUtils]: 27: Hoare triple {11692#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11693#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:05:51,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {11693#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !(~y~0 > ~z~0); {11668#false} is VALID [2022-04-15 13:05:51,960 INFO L272 TraceCheckUtils]: 29: Hoare triple {11668#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {11668#false} is VALID [2022-04-15 13:05:51,960 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} ~cond := #in~cond; {11668#false} is VALID [2022-04-15 13:05:51,960 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume 0 == ~cond; {11668#false} is VALID [2022-04-15 13:05:51,960 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-15 13:05:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:05:51,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:05:51,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996201326] [2022-04-15 13:05:51,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996201326] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:05:51,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436357523] [2022-04-15 13:05:51,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:05:51,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:05:51,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:05:51,962 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:05:51,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 13:05:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:52,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 13:05:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:05:52,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:06:09,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {11667#true} call ULTIMATE.init(); {11667#true} is VALID [2022-04-15 13:06:09,937 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#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); {11667#true} is VALID [2022-04-15 13:06:09,937 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 13:06:09,937 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #52#return; {11667#true} is VALID [2022-04-15 13:06:09,937 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret7 := main(); {11667#true} is VALID [2022-04-15 13:06:09,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11713#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:06:09,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {11713#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [92] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34) (= |v_main_#t~post4_In_17| |v_main_#t~post4_Out_36|)) (let ((.cse1 (* v_main_~y~0_In_17 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_34 (- 4))) (- 8)))) (and (<= 0 .cse0) (= (* |v_main_#t~post4_In_17| 8) (* 8 |v_main_#t~post4_Out_36|)) (<= (+ v_main_~x~0_In_18 (* .cse0 2)) v_main_~x~0_Out_36) (or (< v_main_~x~0_Out_36 50001) (and (< v_main_~x~0_Out_36 1000002) (not (< v_main_~x~0_Out_36 50002)))) (= (mod (+ (* v_main_~y~0_Out_34 4) .cse1) 8) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_17|, main_~y~0=v_main_~y~0_In_17, main_~x~0=v_main_~x~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_36} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {11717#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_623 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_623 4)) (- 8))) (= 0 (mod (+ (* v_main_~y~0_623 4) (* main_~y~0 4)) 8)) (<= 50000 v_main_~y~0_623))))} is VALID [2022-04-15 13:06:09,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {11717#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_623 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_623 4)) (- 8))) (= 0 (mod (+ (* v_main_~y~0_623 4) (* main_~y~0 4)) 8)) (<= 50000 v_main_~y~0_623))))} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11721#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_623 4)) (- 8))) (= 0 (mod (+ (* v_main_~y~0_623 4) (* main_~y~0 4)) 8)) (<= 50000 v_main_~y~0_623))))} is VALID [2022-04-15 13:06:09,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {11721#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int)) (and (<= 0 (div (+ (* main_~y~0 (- 4)) (* v_main_~y~0_623 4)) (- 8))) (= 0 (mod (+ (* v_main_~y~0_623 4) (* main_~y~0 4)) 8)) (<= 50000 v_main_~y~0_623))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11725#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:09,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {11725#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11729#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {11729#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11733#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 3)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {11733#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 3)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11737#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {11737#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11741#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ 5 main_~y~0)))))} is VALID [2022-04-15 13:06:10,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {11741#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ 5 main_~y~0)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11745#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {11745#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 6)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11749#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ 7 main_~y~0)))))} is VALID [2022-04-15 13:06:10,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {11749#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ 7 main_~y~0)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11753#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {11753#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11757#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ main_~y~0 9)))))} is VALID [2022-04-15 13:06:10,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {11757#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ main_~y~0 9)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11761#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,114 INFO L290 TraceCheckUtils]: 18: Hoare triple {11761#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 10)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11765#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {11765#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11769#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {11769#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11773#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (<= v_main_~y~0_624 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {11773#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (<= v_main_~y~0_624 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11777#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ main_~y~0 14)))))} is VALID [2022-04-15 13:06:10,160 INFO L290 TraceCheckUtils]: 22: Hoare triple {11777#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))) (<= v_main_~y~0_624 (+ main_~y~0 14)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11781#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {11781#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11785#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {11785#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11789#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,204 INFO L290 TraceCheckUtils]: 25: Hoare triple {11789#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11793#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 18)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {11793#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= v_main_~y~0_624 (+ main_~y~0 18)) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11797#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ 19 main_~y~0)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,247 INFO L290 TraceCheckUtils]: 27: Hoare triple {11797#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ 19 main_~y~0)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11801#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 20)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} is VALID [2022-04-15 13:06:10,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {11801#(and (<= main_~z~0 0) (exists ((v_main_~y~0_623 Int) (v_main_~y~0_624 Int)) (and (<= v_main_~y~0_624 (+ main_~y~0 20)) (<= 50000 v_main_~y~0_623) (= (mod (+ (* v_main_~y~0_624 4) (* v_main_~y~0_623 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_623 4) (* v_main_~y~0_624 (- 4))) (- 8))))))} assume !(~y~0 > ~z~0); {11668#false} is VALID [2022-04-15 13:06:10,256 INFO L272 TraceCheckUtils]: 29: Hoare triple {11668#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {11668#false} is VALID [2022-04-15 13:06:10,256 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} ~cond := #in~cond; {11668#false} is VALID [2022-04-15 13:06:10,256 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume 0 == ~cond; {11668#false} is VALID [2022-04-15 13:06:10,256 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-15 13:06:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:10,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:06:27,565 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_main_~y~0_664 Int)) (or (and (not (= v_main_~y~0_664 c_main_~y~0)) (let ((.cse0 (* 4 c_main_~y~0))) (let ((.cse1 (div (+ (* v_main_~y~0_664 (- 4)) .cse0) (- 8)))) (or (not (= (mod (+ (* v_main_~y~0_664 4) .cse0) 8) 0)) (not (<= 0 .cse1)) (<= 1000002 (+ (* 2 .cse1) c_main_~x~0)))))) (< (+ 20 c_main_~z~0) v_main_~y~0_664))) is different from false [2022-04-15 13:06:27,675 INFO L290 TraceCheckUtils]: 32: Hoare triple {11668#false} assume !false; {11668#false} is VALID [2022-04-15 13:06:27,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {11668#false} assume 0 == ~cond; {11668#false} is VALID [2022-04-15 13:06:27,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {11668#false} ~cond := #in~cond; {11668#false} is VALID [2022-04-15 13:06:27,675 INFO L272 TraceCheckUtils]: 29: Hoare triple {11668#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {11668#false} is VALID [2022-04-15 13:06:27,676 INFO L290 TraceCheckUtils]: 28: Hoare triple {11829#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {11668#false} is VALID [2022-04-15 13:06:27,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {11833#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11829#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:06:27,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {11837#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11833#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:06:27,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {11841#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11837#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:06:27,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {11845#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11841#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:06:27,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {11849#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11845#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:06:27,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {11853#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11849#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:06:27,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {11857#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11853#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:06:27,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {11861#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11857#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:06:27,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {11865#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11861#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:06:27,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {11869#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11865#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:06:27,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {11873#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11869#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:06:27,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {11877#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11873#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:06:27,729 INFO L290 TraceCheckUtils]: 15: Hoare triple {11881#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11877#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:06:27,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {11885#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11881#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:06:27,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {11889#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11885#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:06:27,739 INFO L290 TraceCheckUtils]: 12: Hoare triple {11893#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11889#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:06:27,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {11897#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11893#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:06:27,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {11901#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11897#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:06:27,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {11905#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11901#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:06:27,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {11909#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {11905#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:06:27,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {11913#(or (< main_~x~0 1000000) (< (+ main_~z~0 20) main_~y~0))} [91] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {11909#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:06:27,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {11917#(forall ((v_main_~y~0_664 Int)) (or (and (or (<= 1000002 (+ (* (div (+ (* v_main_~y~0_664 (- 4)) (* main_~y~0 4)) (- 8)) 2) main_~x~0)) (not (<= 0 (div (+ (* v_main_~y~0_664 (- 4)) (* main_~y~0 4)) (- 8)))) (not (= (mod (+ (* v_main_~y~0_664 4) (* main_~y~0 4)) 8) 0))) (not (= v_main_~y~0_664 main_~y~0))) (< (+ main_~z~0 20) v_main_~y~0_664)))} [92] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_18 v_main_~x~0_Out_36) (= v_main_~y~0_In_17 v_main_~y~0_Out_34) (= |v_main_#t~post4_In_17| |v_main_#t~post4_Out_36|)) (let ((.cse1 (* v_main_~y~0_In_17 4))) (let ((.cse0 (div (+ .cse1 (* v_main_~y~0_Out_34 (- 4))) (- 8)))) (and (<= 0 .cse0) (= (* |v_main_#t~post4_In_17| 8) (* 8 |v_main_#t~post4_Out_36|)) (<= (+ v_main_~x~0_In_18 (* .cse0 2)) v_main_~x~0_Out_36) (or (< v_main_~x~0_Out_36 50001) (and (< v_main_~x~0_Out_36 1000002) (not (< v_main_~x~0_Out_36 50002)))) (= (mod (+ (* v_main_~y~0_Out_34 4) .cse1) 8) 0))))) InVars {main_#t~post4=|v_main_#t~post4_In_17|, main_~y~0=v_main_~y~0_In_17, main_~x~0=v_main_~x~0_In_18} OutVars{main_#t~post4=|v_main_#t~post4_Out_36|, main_~y~0=v_main_~y~0_Out_34, main_~x~0=v_main_~x~0_Out_36} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {11913#(or (< main_~x~0 1000000) (< (+ main_~z~0 20) main_~y~0))} is VALID [2022-04-15 13:06:27,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {11667#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {11917#(forall ((v_main_~y~0_664 Int)) (or (and (or (<= 1000002 (+ (* (div (+ (* v_main_~y~0_664 (- 4)) (* main_~y~0 4)) (- 8)) 2) main_~x~0)) (not (<= 0 (div (+ (* v_main_~y~0_664 (- 4)) (* main_~y~0 4)) (- 8)))) (not (= (mod (+ (* v_main_~y~0_664 4) (* main_~y~0 4)) 8) 0))) (not (= v_main_~y~0_664 main_~y~0))) (< (+ main_~z~0 20) v_main_~y~0_664)))} is VALID [2022-04-15 13:06:27,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {11667#true} call #t~ret7 := main(); {11667#true} is VALID [2022-04-15 13:06:27,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11667#true} {11667#true} #52#return; {11667#true} is VALID [2022-04-15 13:06:27,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {11667#true} assume true; {11667#true} is VALID [2022-04-15 13:06:27,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {11667#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); {11667#true} is VALID [2022-04-15 13:06:27,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {11667#true} call ULTIMATE.init(); {11667#true} is VALID [2022-04-15 13:06:27,761 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:06:27,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1436357523] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:06:27,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:06:27,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 71 [2022-04-15 13:06:29,415 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:06:29,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1119685460] [2022-04-15 13:06:29,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1119685460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:06:29,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:06:29,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 13:06:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587282791] [2022-04-15 13:06:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:06:29,416 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 13:06:29,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:06:29,417 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:29,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:29,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 13:06:29,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:29,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 13:06:29,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3709, Invalid=5036, Unknown=1, NotChecked=184, Total=8930 [2022-04-15 13:06:29,614 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:44,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:44,557 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2022-04-15 13:06:44,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 13:06:44,558 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 78 [2022-04-15 13:06:44,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:06:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 104 transitions. [2022-04-15 13:06:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:44,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 104 transitions. [2022-04-15 13:06:44,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 104 transitions. [2022-04-15 13:06:45,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:45,176 INFO L225 Difference]: With dead ends: 242 [2022-04-15 13:06:45,176 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 13:06:45,179 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 139 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5167 ImplicationChecksByTransitivity, 32.5s TimeCoverageRelationStatistics Valid=7227, Invalid=12236, Unknown=1, NotChecked=276, Total=19740 [2022-04-15 13:06:45,179 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 137 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1184 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 1184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:06:45,179 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 44 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 1184 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-04-15 13:06:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 13:06:45,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 85. [2022-04-15 13:06:45,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:06:45,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,561 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,561 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:45,563 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 13:06:45,563 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 13:06:45,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:45,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:45,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 13:06:45,563 INFO L87 Difference]: Start difference. First operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 129 states. [2022-04-15 13:06:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:06:45,565 INFO L93 Difference]: Finished difference Result 129 states and 133 transitions. [2022-04-15 13:06:45,565 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 133 transitions. [2022-04-15 13:06:45,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:06:45,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:06:45,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:06:45,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:06:45,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 80 states have (on average 1.05) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2022-04-15 13:06:45,567 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 78 [2022-04-15 13:06:45,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:06:45,567 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2022-04-15 13:06:45,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.510204081632653) internal successors, (74), 48 states have internal predecessors, (74), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:06:45,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 88 transitions. [2022-04-15 13:06:46,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:06:46,181 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2022-04-15 13:06:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 13:06:46,181 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:06:46,182 INFO L499 BasicCegarLoop]: trace histogram [25, 24, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:06:46,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 13:06:46,382 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:06:46,382 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:06:46,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:06:46,383 INFO L85 PathProgramCache]: Analyzing trace with hash 683159250, now seen corresponding path program 18 times [2022-04-15 13:06:46,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:06:46,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144483591] [2022-04-15 13:07:00,515 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:07:00,517 INFO L85 PathProgramCache]: Analyzing trace with hash 402962496, now seen corresponding path program 1 times [2022-04-15 13:07:00,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:07:00,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140378435] [2022-04-15 13:07:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:07:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:01,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:07:01,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:01,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {12994#(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); {12966#true} is VALID [2022-04-15 13:07:01,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {12966#true} assume true; {12966#true} is VALID [2022-04-15 13:07:01,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12966#true} {12966#true} #52#return; {12966#true} is VALID [2022-04-15 13:07:01,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {12966#true} call ULTIMATE.init(); {12994#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:07:01,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {12994#(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); {12966#true} is VALID [2022-04-15 13:07:01,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {12966#true} assume true; {12966#true} is VALID [2022-04-15 13:07:01,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12966#true} {12966#true} #52#return; {12966#true} is VALID [2022-04-15 13:07:01,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {12966#true} call #t~ret7 := main(); {12966#true} is VALID [2022-04-15 13:07:01,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {12966#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:07:01,306 INFO L290 TraceCheckUtils]: 6: Hoare triple {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [94] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= |v_main_#t~post4_In_18| |v_main_#t~post4_Out_38|) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (let ((.cse1 (* v_main_~y~0_Out_36 4))) (let ((.cse0 (div (+ .cse1 (* (- 4) v_main_~y~0_In_18)) 8))) (and (<= 0 .cse0) (= (mod (+ (* v_main_~y~0_In_18 4) .cse1) 8) 0) (or (and (not (< v_main_~x~0_Out_38 50002)) (< v_main_~x~0_Out_38 1000002)) (< v_main_~x~0_Out_38 50001)) (<= (+ v_main_~x~0_In_19 (* 2 .cse0)) v_main_~x~0_Out_38) (= (* 8 |v_main_#t~post4_Out_38|) (* |v_main_#t~post4_In_18| 8)))))) InVars {main_#t~post4=|v_main_#t~post4_In_18|, main_~y~0=v_main_~y~0_In_18, main_~x~0=v_main_~x~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_~y~0=v_main_~y~0_Out_36, main_~x~0=v_main_~x~0_Out_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:07:01,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [93] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:07:01,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {12971#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12972#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:07:01,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {12972#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12973#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:07:01,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {12973#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12974#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:07:01,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {12974#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12975#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:07:01,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {12975#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12976#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:07:01,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {12976#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12977#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:07:01,322 INFO L290 TraceCheckUtils]: 14: Hoare triple {12977#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12978#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:07:01,325 INFO L290 TraceCheckUtils]: 15: Hoare triple {12978#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12979#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:07:01,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {12979#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12980#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:07:01,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {12980#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12981#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:07:01,334 INFO L290 TraceCheckUtils]: 18: Hoare triple {12981#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12982#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:07:01,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {12982#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12983#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:07:01,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {12983#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12984#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:07:01,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {12984#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12985#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:07:01,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {12985#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12986#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:07:01,343 INFO L290 TraceCheckUtils]: 23: Hoare triple {12986#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12987#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:07:01,345 INFO L290 TraceCheckUtils]: 24: Hoare triple {12987#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12988#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:07:01,346 INFO L290 TraceCheckUtils]: 25: Hoare triple {12988#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12989#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:07:01,346 INFO L290 TraceCheckUtils]: 26: Hoare triple {12989#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12990#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:07:01,347 INFO L290 TraceCheckUtils]: 27: Hoare triple {12990#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12991#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:07:01,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {12991#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12992#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:07:01,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {12992#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {12993#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 13:07:01,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {12993#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !(~y~0 > ~z~0); {12967#false} is VALID [2022-04-15 13:07:01,356 INFO L272 TraceCheckUtils]: 31: Hoare triple {12967#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {12967#false} is VALID [2022-04-15 13:07:01,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {12967#false} ~cond := #in~cond; {12967#false} is VALID [2022-04-15 13:07:01,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {12967#false} assume 0 == ~cond; {12967#false} is VALID [2022-04-15 13:07:01,356 INFO L290 TraceCheckUtils]: 34: Hoare triple {12967#false} assume !false; {12967#false} is VALID [2022-04-15 13:07:01,356 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:01,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:07:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140378435] [2022-04-15 13:07:01,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140378435] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:07:01,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689816592] [2022-04-15 13:07:01,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:07:01,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:07:01,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:07:01,358 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:07:01,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 13:07:01,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:01,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 13:07:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:07:01,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:07:22,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {12966#true} call ULTIMATE.init(); {12966#true} is VALID [2022-04-15 13:07:22,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {12966#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); {12966#true} is VALID [2022-04-15 13:07:22,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {12966#true} assume true; {12966#true} is VALID [2022-04-15 13:07:22,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12966#true} {12966#true} #52#return; {12966#true} is VALID [2022-04-15 13:07:22,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {12966#true} call #t~ret7 := main(); {12966#true} is VALID [2022-04-15 13:07:22,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {12966#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13013#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:07:22,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {13013#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [94] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= |v_main_#t~post4_In_18| |v_main_#t~post4_Out_38|) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (let ((.cse1 (* v_main_~y~0_Out_36 4))) (let ((.cse0 (div (+ .cse1 (* (- 4) v_main_~y~0_In_18)) 8))) (and (<= 0 .cse0) (= (mod (+ (* v_main_~y~0_In_18 4) .cse1) 8) 0) (or (and (not (< v_main_~x~0_Out_38 50002)) (< v_main_~x~0_Out_38 1000002)) (< v_main_~x~0_Out_38 50001)) (<= (+ v_main_~x~0_In_19 (* 2 .cse0)) v_main_~x~0_Out_38) (= (* 8 |v_main_#t~post4_Out_38|) (* |v_main_#t~post4_In_18| 8)))))) InVars {main_#t~post4=|v_main_#t~post4_In_18|, main_~y~0=v_main_~y~0_In_18, main_~x~0=v_main_~x~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_~y~0=v_main_~y~0_Out_36, main_~x~0=v_main_~x~0_Out_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {13017#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_692 Int)) (and (<= 50000 v_main_~y~0_692) (= (mod (+ (* v_main_~y~0_692 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_692 (- 4)) (* main_~y~0 4)) 8)))))} is VALID [2022-04-15 13:07:22,507 INFO L290 TraceCheckUtils]: 7: Hoare triple {13017#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_692 Int)) (and (<= 50000 v_main_~y~0_692) (= (mod (+ (* v_main_~y~0_692 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_692 (- 4)) (* main_~y~0 4)) 8)))))} [93] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13021#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int)) (and (<= 50000 v_main_~y~0_692) (= (mod (+ (* v_main_~y~0_692 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_692 (- 4)) (* main_~y~0 4)) 8)))))} is VALID [2022-04-15 13:07:22,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {13021#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int)) (and (<= 50000 v_main_~y~0_692) (= (mod (+ (* v_main_~y~0_692 4) (* main_~y~0 4)) 8) 0) (<= 0 (div (+ (* v_main_~y~0_692 (- 4)) (* main_~y~0 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13025#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {13025#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 1)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13029#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {13029#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 2)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13033#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 3)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {13033#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 3)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13037#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 4)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {13037#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 4)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13041#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ 5 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {13041#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ 5 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13045#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 6)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {13045#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 6)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13049#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ 7 main_~y~0)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,595 INFO L290 TraceCheckUtils]: 15: Hoare triple {13049#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ 7 main_~y~0)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13053#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 8)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {13053#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 8)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13057#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,615 INFO L290 TraceCheckUtils]: 17: Hoare triple {13057#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 9)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13061#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 10)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,627 INFO L290 TraceCheckUtils]: 18: Hoare triple {13061#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 10)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13065#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {13065#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13069#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,665 INFO L290 TraceCheckUtils]: 20: Hoare triple {13069#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 12)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13073#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 13)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {13073#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 13)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13077#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 14)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,688 INFO L290 TraceCheckUtils]: 22: Hoare triple {13077#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 14)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13081#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 15)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {13081#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 15)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13085#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 16)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {13085#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 16)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13089#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 17)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {13089#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 17)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13093#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 18)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {13093#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (<= v_main_~y~0_693 (+ main_~y~0 18)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13097#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ 19 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {13097#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ 19 main_~y~0)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13101#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 20)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,741 INFO L290 TraceCheckUtils]: 28: Hoare triple {13101#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= 50000 v_main_~y~0_692) (<= v_main_~y~0_693 (+ main_~y~0 20)) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13105#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 21)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {13105#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 21)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13109#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 22)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} is VALID [2022-04-15 13:07:22,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {13109#(and (<= main_~z~0 0) (exists ((v_main_~y~0_692 Int) (v_main_~y~0_693 Int)) (and (<= v_main_~y~0_693 (+ main_~y~0 22)) (<= 50000 v_main_~y~0_692) (<= 0 (div (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 (- 4))) 8)) (= 0 (mod (+ (* v_main_~y~0_693 4) (* v_main_~y~0_692 4)) 8)))))} assume !(~y~0 > ~z~0); {12967#false} is VALID [2022-04-15 13:07:22,765 INFO L272 TraceCheckUtils]: 31: Hoare triple {12967#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {12967#false} is VALID [2022-04-15 13:07:22,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {12967#false} ~cond := #in~cond; {12967#false} is VALID [2022-04-15 13:07:22,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {12967#false} assume 0 == ~cond; {12967#false} is VALID [2022-04-15 13:07:22,765 INFO L290 TraceCheckUtils]: 34: Hoare triple {12967#false} assume !false; {12967#false} is VALID [2022-04-15 13:07:22,766 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:07:22,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:08:20,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {12967#false} assume !false; {12967#false} is VALID [2022-04-15 13:08:20,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {12967#false} assume 0 == ~cond; {12967#false} is VALID [2022-04-15 13:08:20,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {12967#false} ~cond := #in~cond; {12967#false} is VALID [2022-04-15 13:08:20,767 INFO L272 TraceCheckUtils]: 31: Hoare triple {12967#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {12967#false} is VALID [2022-04-15 13:08:20,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {13137#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {12967#false} is VALID [2022-04-15 13:08:20,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {13141#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13137#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:08:20,779 INFO L290 TraceCheckUtils]: 28: Hoare triple {13145#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13141#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:08:20,782 INFO L290 TraceCheckUtils]: 27: Hoare triple {13149#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13145#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:08:20,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {13153#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13149#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:08:20,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {13157#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13153#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:08:20,791 INFO L290 TraceCheckUtils]: 24: Hoare triple {13161#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13157#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:08:20,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {13165#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13161#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:08:20,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {13169#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13165#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:08:20,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {13173#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13169#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:08:20,802 INFO L290 TraceCheckUtils]: 20: Hoare triple {13177#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13173#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:08:20,806 INFO L290 TraceCheckUtils]: 19: Hoare triple {13181#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13177#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:08:20,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {13185#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13181#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:08:20,813 INFO L290 TraceCheckUtils]: 17: Hoare triple {13189#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13185#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:08:20,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {13193#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13189#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:08:20,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {13197#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13193#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:08:20,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {13201#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13197#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:08:20,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {13205#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13201#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:08:20,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {13209#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13205#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:08:20,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {13213#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13209#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:08:20,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {13217#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13213#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:08:20,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {13221#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13217#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:08:20,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {13225#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {13221#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 13:08:20,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {13229#(or (< (+ main_~z~0 22) main_~y~0) (< main_~x~0 1000000))} [93] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {13225#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 13:08:20,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {13225#(< (+ main_~z~0 22) main_~y~0)} [94] L10-2-->L17-1_primed: Formula: (or (and (= v_main_~x~0_In_19 v_main_~x~0_Out_38) (= |v_main_#t~post4_In_18| |v_main_#t~post4_Out_38|) (= v_main_~y~0_In_18 v_main_~y~0_Out_36)) (let ((.cse1 (* v_main_~y~0_Out_36 4))) (let ((.cse0 (div (+ .cse1 (* (- 4) v_main_~y~0_In_18)) 8))) (and (<= 0 .cse0) (= (mod (+ (* v_main_~y~0_In_18 4) .cse1) 8) 0) (or (and (not (< v_main_~x~0_Out_38 50002)) (< v_main_~x~0_Out_38 1000002)) (< v_main_~x~0_Out_38 50001)) (<= (+ v_main_~x~0_In_19 (* 2 .cse0)) v_main_~x~0_Out_38) (= (* 8 |v_main_#t~post4_Out_38|) (* |v_main_#t~post4_In_18| 8)))))) InVars {main_#t~post4=|v_main_#t~post4_In_18|, main_~y~0=v_main_~y~0_In_18, main_~x~0=v_main_~x~0_In_19} OutVars{main_#t~post4=|v_main_#t~post4_Out_38|, main_~y~0=v_main_~y~0_Out_36, main_~x~0=v_main_~x~0_Out_38} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {13229#(or (< (+ main_~z~0 22) main_~y~0) (< main_~x~0 1000000))} is VALID [2022-04-15 13:08:20,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {12966#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {13225#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 13:08:20,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {12966#true} call #t~ret7 := main(); {12966#true} is VALID [2022-04-15 13:08:20,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12966#true} {12966#true} #52#return; {12966#true} is VALID [2022-04-15 13:08:20,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {12966#true} assume true; {12966#true} is VALID [2022-04-15 13:08:20,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {12966#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); {12966#true} is VALID [2022-04-15 13:08:20,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {12966#true} call ULTIMATE.init(); {12966#true} is VALID [2022-04-15 13:08:20,845 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:20,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689816592] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:08:20,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:08:20,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 26] total 75 [2022-04-15 13:08:22,297 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:08:22,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144483591] [2022-04-15 13:08:22,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144483591] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:08:22,297 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:08:22,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 13:08:22,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377576463] [2022-04-15 13:08:22,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:08:22,298 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 13:08:22,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:08:22,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:22,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:22,498 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 13:08:22,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:22,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 13:08:22,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4304, Invalid=5796, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 13:08:22,500 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:42,032 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-04-15 13:08:42,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 13:08:42,032 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 13:08:42,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:08:42,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2022-04-15 13:08:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 106 transitions. [2022-04-15 13:08:42,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 106 transitions. [2022-04-15 13:08:42,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:42,586 INFO L225 Difference]: With dead ends: 167 [2022-04-15 13:08:42,586 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 13:08:42,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5960 ImplicationChecksByTransitivity, 75.7s TimeCoverageRelationStatistics Valid=8327, Invalid=14023, Unknown=0, NotChecked=0, Total=22350 [2022-04-15 13:08:42,589 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 259 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1408 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 1723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 1408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:08:42,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [259 Valid, 49 Invalid, 1723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 1408 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-04-15 13:08:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 13:08:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-04-15 13:08:42,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:08:42,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,942 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,942 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:42,943 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-04-15 13:08:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 13:08:42,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:42,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:42,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 13:08:42,944 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-15 13:08:42,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:08:42,945 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2022-04-15 13:08:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 13:08:42,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:08:42,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:08:42,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:08:42,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:08:42,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0470588235294118) internal successors, (89), 85 states have internal predecessors, (89), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 93 transitions. [2022-04-15 13:08:42,947 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 93 transitions. Word has length 84 [2022-04-15 13:08:42,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:08:42,947 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 93 transitions. [2022-04-15 13:08:42,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 51 states have internal predecessors, (80), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:08:42,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 93 transitions. [2022-04-15 13:08:43,586 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:08:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 93 transitions. [2022-04-15 13:08:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 13:08:43,587 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:08:43,587 INFO L499 BasicCegarLoop]: trace histogram [27, 26, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:08:43,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 13:08:43,802 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:43,802 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:08:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:08:43,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1134654649, now seen corresponding path program 19 times [2022-04-15 13:08:43,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:08:43,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [886686221] [2022-04-15 13:08:45,910 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:08:45,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1051308899, now seen corresponding path program 1 times [2022-04-15 13:08:45,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:08:45,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716494973] [2022-04-15 13:08:45,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:45,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:08:45,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:08:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:46,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {14102#(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); {14071#true} is VALID [2022-04-15 13:08:46,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {14071#true} assume true; {14071#true} is VALID [2022-04-15 13:08:46,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14071#true} {14071#true} #52#return; {14071#true} is VALID [2022-04-15 13:08:46,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {14071#true} call ULTIMATE.init(); {14102#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:08:46,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {14102#(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); {14071#true} is VALID [2022-04-15 13:08:46,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {14071#true} assume true; {14071#true} is VALID [2022-04-15 13:08:46,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14071#true} {14071#true} #52#return; {14071#true} is VALID [2022-04-15 13:08:46,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {14071#true} call #t~ret7 := main(); {14071#true} is VALID [2022-04-15 13:08:46,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {14071#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14076#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:08:46,938 INFO L290 TraceCheckUtils]: 6: Hoare triple {14076#(and (= main_~z~0 0) (= main_~x~0 0) (<= 50000 main_~y~0))} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_19| |v_main_#t~post4_Out_40|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_38) v_main_~y~0_In_19) (- 2)))) (and (or (and (< v_main_~x~0_Out_40 1000002) (not (< v_main_~x~0_Out_40 50002))) (< v_main_~x~0_Out_40 50001)) .cse0 (<= 0 .cse1) (<= (+ v_main_~x~0_In_20 (* 2 .cse1)) v_main_~x~0_Out_40) (= (mod (+ v_main_~y~0_Out_38 v_main_~y~0_In_19) 2) 0))) (and .cse0 (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)))) InVars {main_#t~post4=|v_main_#t~post4_In_19|, main_~y~0=v_main_~y~0_In_19, main_~x~0=v_main_~x~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_40} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {14077#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} is VALID [2022-04-15 13:08:46,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {14077#(or (and (= main_~z~0 0) (<= 49999 main_~y~0)) (<= main_~x~0 0))} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14078#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:08:46,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {14078#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14079#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:08:46,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {14079#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14080#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:08:46,952 INFO L290 TraceCheckUtils]: 10: Hoare triple {14080#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14081#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:08:46,953 INFO L290 TraceCheckUtils]: 11: Hoare triple {14081#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14082#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:08:46,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {14082#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14083#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:08:46,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {14083#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14084#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:08:46,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {14084#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14085#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:08:46,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {14085#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14086#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:08:46,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {14086#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14087#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:08:46,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {14087#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14088#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:08:46,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {14088#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14089#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:08:46,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {14089#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14090#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:08:46,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {14090#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14091#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:08:47,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {14091#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14092#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:08:47,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {14092#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14093#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:08:47,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {14093#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14094#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:08:47,013 INFO L290 TraceCheckUtils]: 24: Hoare triple {14094#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14095#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:08:47,014 INFO L290 TraceCheckUtils]: 25: Hoare triple {14095#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14096#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:08:47,015 INFO L290 TraceCheckUtils]: 26: Hoare triple {14096#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14097#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:08:47,016 INFO L290 TraceCheckUtils]: 27: Hoare triple {14097#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14098#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:08:47,017 INFO L290 TraceCheckUtils]: 28: Hoare triple {14098#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14099#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 13:08:47,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {14099#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14100#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 13:08:47,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {14100#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14101#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 13:08:47,029 INFO L290 TraceCheckUtils]: 31: Hoare triple {14101#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !(~y~0 > ~z~0); {14072#false} is VALID [2022-04-15 13:08:47,030 INFO L272 TraceCheckUtils]: 32: Hoare triple {14072#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {14072#false} is VALID [2022-04-15 13:08:47,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {14072#false} ~cond := #in~cond; {14072#false} is VALID [2022-04-15 13:08:47,030 INFO L290 TraceCheckUtils]: 34: Hoare triple {14072#false} assume 0 == ~cond; {14072#false} is VALID [2022-04-15 13:08:47,030 INFO L290 TraceCheckUtils]: 35: Hoare triple {14072#false} assume !false; {14072#false} is VALID [2022-04-15 13:08:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:47,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:08:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716494973] [2022-04-15 13:08:47,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716494973] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:08:47,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [346091791] [2022-04-15 13:08:47,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:08:47,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:08:47,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:08:47,032 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:08:47,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 13:08:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:47,078 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 13:08:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:08:47,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:08:48,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {14071#true} call ULTIMATE.init(); {14071#true} is VALID [2022-04-15 13:08:48,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {14071#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); {14071#true} is VALID [2022-04-15 13:08:48,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {14071#true} assume true; {14071#true} is VALID [2022-04-15 13:08:48,799 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14071#true} {14071#true} #52#return; {14071#true} is VALID [2022-04-15 13:08:48,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {14071#true} call #t~ret7 := main(); {14071#true} is VALID [2022-04-15 13:08:48,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {14071#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:08:48,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_19| |v_main_#t~post4_Out_40|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_38) v_main_~y~0_In_19) (- 2)))) (and (or (and (< v_main_~x~0_Out_40 1000002) (not (< v_main_~x~0_Out_40 50002))) (< v_main_~x~0_Out_40 50001)) .cse0 (<= 0 .cse1) (<= (+ v_main_~x~0_In_20 (* 2 .cse1)) v_main_~x~0_Out_40) (= (mod (+ v_main_~y~0_Out_38 v_main_~y~0_In_19) 2) 0))) (and .cse0 (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)))) InVars {main_#t~post4=|v_main_#t~post4_In_19|, main_~y~0=v_main_~y~0_In_19, main_~x~0=v_main_~x~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_40} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:08:48,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:08:48,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {14121#(and (<= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14131#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:08:48,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {14131#(and (<= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14135#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} is VALID [2022-04-15 13:08:48,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {14135#(and (<= main_~z~0 0) (<= 49998 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14139#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:08:48,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {14139#(and (<= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14143#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:08:48,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {14143#(and (<= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14147#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:08:48,846 INFO L290 TraceCheckUtils]: 13: Hoare triple {14147#(and (<= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14151#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:08:48,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {14151#(and (<= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14155#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:08:48,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {14155#(and (<= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14159#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:08:48,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {14159#(and (<= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14163#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:08:48,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {14163#(and (<= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14167#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} is VALID [2022-04-15 13:08:48,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {14167#(and (<= main_~z~0 0) (<= 49990 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14171#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:08:48,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {14171#(and (<= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14175#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:08:48,881 INFO L290 TraceCheckUtils]: 20: Hoare triple {14175#(and (<= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14179#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:08:48,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {14179#(and (<= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14183#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:08:48,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {14183#(and (<= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14187#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:08:48,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {14187#(and (<= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14191#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:08:48,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {14191#(and (<= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14195#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:08:48,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {14195#(and (<= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14199#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:08:48,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {14199#(and (<= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14203#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} is VALID [2022-04-15 13:08:48,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {14203#(and (<= main_~z~0 0) (<= 49981 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14207#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:08:48,909 INFO L290 TraceCheckUtils]: 28: Hoare triple {14207#(and (<= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14211#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:08:48,910 INFO L290 TraceCheckUtils]: 29: Hoare triple {14211#(and (<= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14215#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 13:08:48,921 INFO L290 TraceCheckUtils]: 30: Hoare triple {14215#(and (<= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14219#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 13:08:48,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {14219#(and (<= main_~z~0 0) (<= 49977 main_~y~0))} assume !(~y~0 > ~z~0); {14072#false} is VALID [2022-04-15 13:08:48,927 INFO L272 TraceCheckUtils]: 32: Hoare triple {14072#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {14072#false} is VALID [2022-04-15 13:08:48,927 INFO L290 TraceCheckUtils]: 33: Hoare triple {14072#false} ~cond := #in~cond; {14072#false} is VALID [2022-04-15 13:08:48,927 INFO L290 TraceCheckUtils]: 34: Hoare triple {14072#false} assume 0 == ~cond; {14072#false} is VALID [2022-04-15 13:08:48,927 INFO L290 TraceCheckUtils]: 35: Hoare triple {14072#false} assume !false; {14072#false} is VALID [2022-04-15 13:08:48,927 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:08:48,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:09:03,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {14072#false} assume !false; {14072#false} is VALID [2022-04-15 13:09:03,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {14072#false} assume 0 == ~cond; {14072#false} is VALID [2022-04-15 13:09:03,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {14072#false} ~cond := #in~cond; {14072#false} is VALID [2022-04-15 13:09:03,861 INFO L272 TraceCheckUtils]: 32: Hoare triple {14072#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {14072#false} is VALID [2022-04-15 13:09:03,862 INFO L290 TraceCheckUtils]: 31: Hoare triple {14247#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {14072#false} is VALID [2022-04-15 13:09:03,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {14251#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14247#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:09:03,879 INFO L290 TraceCheckUtils]: 29: Hoare triple {14255#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14251#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:09:03,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {14259#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14255#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:09:03,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {14263#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14259#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:09:03,894 INFO L290 TraceCheckUtils]: 26: Hoare triple {14267#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14263#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:09:03,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {14271#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14267#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,901 INFO L290 TraceCheckUtils]: 24: Hoare triple {14275#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14271#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:09:03,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {14279#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14275#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {14283#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14279#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:09:03,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {14287#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14283#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:09:03,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {14291#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14287#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:09:03,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {14295#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14291#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:09:03,925 INFO L290 TraceCheckUtils]: 18: Hoare triple {14299#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14295#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:09:03,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {14303#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14299#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:09:03,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {14307#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14303#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:09:03,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {14311#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14307#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:09:03,943 INFO L290 TraceCheckUtils]: 14: Hoare triple {14315#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14311#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:09:03,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {14319#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14315#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:09:03,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {14323#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14319#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:09:03,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {14327#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14323#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {14331#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14327#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:09:03,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {14335#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14331#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 13:09:03,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {14339#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {14335#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 13:09:03,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {14339#(< (+ 23 main_~z~0) main_~y~0)} [95] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {14339#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {14339#(< (+ 23 main_~z~0) main_~y~0)} [96] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_19| |v_main_#t~post4_Out_40|))) (or (let ((.cse1 (div (+ (* (- 1) v_main_~y~0_Out_38) v_main_~y~0_In_19) (- 2)))) (and (or (and (< v_main_~x~0_Out_40 1000002) (not (< v_main_~x~0_Out_40 50002))) (< v_main_~x~0_Out_40 50001)) .cse0 (<= 0 .cse1) (<= (+ v_main_~x~0_In_20 (* 2 .cse1)) v_main_~x~0_Out_40) (= (mod (+ v_main_~y~0_Out_38 v_main_~y~0_In_19) 2) 0))) (and .cse0 (= v_main_~y~0_In_19 v_main_~y~0_Out_38) (= v_main_~x~0_In_20 v_main_~x~0_Out_40)))) InVars {main_#t~post4=|v_main_#t~post4_In_19|, main_~y~0=v_main_~y~0_In_19, main_~x~0=v_main_~x~0_In_20} OutVars{main_#t~post4=|v_main_#t~post4_Out_40|, main_~y~0=v_main_~y~0_Out_38, main_~x~0=v_main_~x~0_Out_40} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {14339#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {14071#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {14339#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:03,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {14071#true} call #t~ret7 := main(); {14071#true} is VALID [2022-04-15 13:09:03,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14071#true} {14071#true} #52#return; {14071#true} is VALID [2022-04-15 13:09:03,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {14071#true} assume true; {14071#true} is VALID [2022-04-15 13:09:03,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {14071#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); {14071#true} is VALID [2022-04-15 13:09:03,972 INFO L272 TraceCheckUtils]: 0: Hoare triple {14071#true} call ULTIMATE.init(); {14071#true} is VALID [2022-04-15 13:09:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:03,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [346091791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:09:03,973 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:09:03,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 26, 26] total 77 [2022-04-15 13:09:07,029 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [886686221] [2022-04-15 13:09:07,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [886686221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:07,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:07,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 13:09:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348339613] [2022-04-15 13:09:07,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:07,030 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 13:09:07,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:07,031 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:07,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:07,528 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 13:09:07,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:07,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 13:09:07,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4792, Invalid=6550, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 13:09:07,530 INFO L87 Difference]: Start difference. First operand 90 states and 93 transitions. Second operand has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:23,734 INFO L93 Difference]: Finished difference Result 174 states and 182 transitions. [2022-04-15 13:09:23,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 13:09:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2022-04-15 13:09:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:09:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2022-04-15 13:09:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2022-04-15 13:09:23,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 83 transitions. [2022-04-15 13:09:24,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:24,151 INFO L225 Difference]: With dead ends: 174 [2022-04-15 13:09:24,151 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 13:09:24,152 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 5117 ImplicationChecksByTransitivity, 19.6s TimeCoverageRelationStatistics Valid=6869, Invalid=10687, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 13:09:24,152 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-04-15 13:09:24,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 70 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 757 Invalid, 0 Unknown, 105 Unchecked, 6.8s Time] [2022-04-15 13:09:24,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 13:09:24,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-04-15 13:09:24,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:09:24,846 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:24,847 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:24,847 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:24,849 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-04-15 13:09:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-04-15 13:09:24,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:24,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:24,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 13:09:24,850 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 145 states. [2022-04-15 13:09:24,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:09:24,852 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-04-15 13:09:24,852 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-04-15 13:09:24,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:09:24,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:09:24,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:09:24,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:09:24,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0503597122302157) internal successors, (146), 139 states have internal predecessors, (146), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:24,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 150 transitions. [2022-04-15 13:09:24,855 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 150 transitions. Word has length 89 [2022-04-15 13:09:24,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:09:24,855 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 150 transitions. [2022-04-15 13:09:24,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 56 states have internal predecessors, (85), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:24,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 150 transitions. [2022-04-15 13:09:26,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:26,131 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 150 transitions. [2022-04-15 13:09:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 13:09:26,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:09:26,132 INFO L499 BasicCegarLoop]: trace histogram [28, 27, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:09:26,148 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 13:09:26,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:26,335 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:09:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:09:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1937559906, now seen corresponding path program 20 times [2022-04-15 13:09:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1193261153] [2022-04-15 13:09:27,760 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:09:27,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1834822749, now seen corresponding path program 1 times [2022-04-15 13:09:27,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:09:27,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101244212] [2022-04-15 13:09:27,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:09:27,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:09:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:28,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {15403#(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); {15374#true} is VALID [2022-04-15 13:09:28,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-15 13:09:28,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15374#true} {15374#true} #52#return; {15374#true} is VALID [2022-04-15 13:09:28,613 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:09:28,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {15403#(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); {15374#true} is VALID [2022-04-15 13:09:28,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-15 13:09:28,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #52#return; {15374#true} is VALID [2022-04-15 13:09:28,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret7 := main(); {15374#true} is VALID [2022-04-15 13:09:28,613 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:09:28,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [98] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_20| |v_main_#t~post4_Out_42|))) (or (and .cse0 (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (let ((.cse1 (div (+ v_main_~y~0_Out_40 (* (- 1) v_main_~y~0_In_20)) 2))) (and .cse0 (= (mod (+ v_main_~y~0_Out_40 v_main_~y~0_In_20) 2) 0) (<= (+ v_main_~x~0_In_21 (* 2 .cse1)) v_main_~x~0_Out_42) (<= 0 .cse1) (or (< v_main_~x~0_Out_42 50001) (and (not (< v_main_~x~0_Out_42 50002)) (< v_main_~x~0_Out_42 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_20|, main_~y~0=v_main_~y~0_In_20, main_~x~0=v_main_~x~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_~y~0=v_main_~y~0_Out_40, main_~x~0=v_main_~x~0_Out_42} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:09:28,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [97] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:09:28,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {15379#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15380#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:09:28,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {15380#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15381#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:09:28,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {15381#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15382#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:09:28,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {15382#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15383#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:09:28,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {15383#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15384#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:09:28,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {15384#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15385#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:09:28,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {15385#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15386#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:09:28,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {15386#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15387#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:09:28,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {15387#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15388#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:09:28,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {15388#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15389#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:09:28,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {15389#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15390#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:09:28,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {15390#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15391#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:09:28,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {15391#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15392#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:09:28,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {15392#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15393#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:09:28,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {15393#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15394#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:09:28,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {15394#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15395#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:09:28,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {15395#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15396#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:09:28,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {15396#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15397#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:09:28,763 INFO L290 TraceCheckUtils]: 26: Hoare triple {15397#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15398#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:09:28,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15399#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:09:28,765 INFO L290 TraceCheckUtils]: 28: Hoare triple {15399#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15400#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:09:28,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {15400#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15401#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 13:09:28,779 INFO L290 TraceCheckUtils]: 30: Hoare triple {15401#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15402#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 13:09:28,780 INFO L290 TraceCheckUtils]: 31: Hoare triple {15402#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !(~y~0 > ~z~0); {15375#false} is VALID [2022-04-15 13:09:28,780 INFO L272 TraceCheckUtils]: 32: Hoare triple {15375#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {15375#false} is VALID [2022-04-15 13:09:28,780 INFO L290 TraceCheckUtils]: 33: Hoare triple {15375#false} ~cond := #in~cond; {15375#false} is VALID [2022-04-15 13:09:28,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {15375#false} assume 0 == ~cond; {15375#false} is VALID [2022-04-15 13:09:28,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-15 13:09:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:28,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:09:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101244212] [2022-04-15 13:09:28,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101244212] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:09:28,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137427591] [2022-04-15 13:09:28,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:09:28,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:09:28,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:09:28,782 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:09:28,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 13:09:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:28,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 13:09:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:09:28,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:09:34,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-15 13:09:34,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#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); {15374#true} is VALID [2022-04-15 13:09:34,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-15 13:09:34,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #52#return; {15374#true} is VALID [2022-04-15 13:09:34,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret7 := main(); {15374#true} is VALID [2022-04-15 13:09:34,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15422#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:09:34,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {15422#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [98] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_20| |v_main_#t~post4_Out_42|))) (or (and .cse0 (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (let ((.cse1 (div (+ v_main_~y~0_Out_40 (* (- 1) v_main_~y~0_In_20)) 2))) (and .cse0 (= (mod (+ v_main_~y~0_Out_40 v_main_~y~0_In_20) 2) 0) (<= (+ v_main_~x~0_In_21 (* 2 .cse1)) v_main_~x~0_Out_42) (<= 0 .cse1) (or (< v_main_~x~0_Out_42 50001) (and (not (< v_main_~x~0_Out_42 50002)) (< v_main_~x~0_Out_42 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_20|, main_~y~0=v_main_~y~0_In_20, main_~x~0=v_main_~x~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_~y~0=v_main_~y~0_Out_40, main_~x~0=v_main_~x~0_Out_42} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {15426#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} is VALID [2022-04-15 13:09:34,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {15426#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} [97] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15430#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} is VALID [2022-04-15 13:09:34,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {15430#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 50000)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15434#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49999) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {15434#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49999) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15438#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49998)) 2)))} is VALID [2022-04-15 13:09:34,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {15438#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49998)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15442#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49997)) 2)))} is VALID [2022-04-15 13:09:34,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {15442#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49997)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15446#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49996)) 2)))} is VALID [2022-04-15 13:09:34,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {15446#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49996)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15450#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49995) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {15450#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49995) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15454#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49994) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {15454#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49994) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15458#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49993)) 2)))} is VALID [2022-04-15 13:09:34,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {15458#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49993)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15462#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49992)) 2)))} is VALID [2022-04-15 13:09:34,937 INFO L290 TraceCheckUtils]: 16: Hoare triple {15462#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49992)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15466#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49991)) 2)))} is VALID [2022-04-15 13:09:34,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {15466#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49991)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15470#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49990)) 2)))} is VALID [2022-04-15 13:09:34,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {15470#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49990)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15474#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49989) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,952 INFO L290 TraceCheckUtils]: 19: Hoare triple {15474#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49989) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15478#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49988)) 2)))} is VALID [2022-04-15 13:09:34,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {15478#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49988)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15482#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49987)) 2)))} is VALID [2022-04-15 13:09:34,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {15482#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49987)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15486#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49986)) 2)))} is VALID [2022-04-15 13:09:34,955 INFO L290 TraceCheckUtils]: 22: Hoare triple {15486#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49986)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15490#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49985) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {15490#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49985) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15494#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49984)) 2)))} is VALID [2022-04-15 13:09:34,957 INFO L290 TraceCheckUtils]: 24: Hoare triple {15494#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49984)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15498#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49983)) 2)))} is VALID [2022-04-15 13:09:34,958 INFO L290 TraceCheckUtils]: 25: Hoare triple {15498#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49983)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15502#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49982)) 2)))} is VALID [2022-04-15 13:09:34,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {15502#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49982)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15506#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49981) main_~y~0) 2)))} is VALID [2022-04-15 13:09:34,960 INFO L290 TraceCheckUtils]: 27: Hoare triple {15506#(and (<= main_~z~0 0) (<= 0 (div (+ (- 49981) main_~y~0) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15510#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49980)) 2)))} is VALID [2022-04-15 13:09:34,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {15510#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49980)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15514#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49979)) 2)))} is VALID [2022-04-15 13:09:34,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {15514#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49979)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15518#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49978)) 2)))} is VALID [2022-04-15 13:09:34,985 INFO L290 TraceCheckUtils]: 30: Hoare triple {15518#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49978)) 2)))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15522#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49977)) 2)))} is VALID [2022-04-15 13:09:34,997 INFO L290 TraceCheckUtils]: 31: Hoare triple {15522#(and (<= main_~z~0 0) (<= 0 (div (+ main_~y~0 (- 49977)) 2)))} assume !(~y~0 > ~z~0); {15375#false} is VALID [2022-04-15 13:09:34,997 INFO L272 TraceCheckUtils]: 32: Hoare triple {15375#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {15375#false} is VALID [2022-04-15 13:09:34,997 INFO L290 TraceCheckUtils]: 33: Hoare triple {15375#false} ~cond := #in~cond; {15375#false} is VALID [2022-04-15 13:09:34,997 INFO L290 TraceCheckUtils]: 34: Hoare triple {15375#false} assume 0 == ~cond; {15375#false} is VALID [2022-04-15 13:09:34,997 INFO L290 TraceCheckUtils]: 35: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-15 13:09:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:34,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:09:54,360 INFO L290 TraceCheckUtils]: 35: Hoare triple {15375#false} assume !false; {15375#false} is VALID [2022-04-15 13:09:54,361 INFO L290 TraceCheckUtils]: 34: Hoare triple {15375#false} assume 0 == ~cond; {15375#false} is VALID [2022-04-15 13:09:54,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {15375#false} ~cond := #in~cond; {15375#false} is VALID [2022-04-15 13:09:54,361 INFO L272 TraceCheckUtils]: 32: Hoare triple {15375#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {15375#false} is VALID [2022-04-15 13:09:54,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {15550#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {15375#false} is VALID [2022-04-15 13:09:54,374 INFO L290 TraceCheckUtils]: 30: Hoare triple {15554#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15550#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:09:54,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {15558#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15554#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:09:54,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {15562#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15558#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:09:54,389 INFO L290 TraceCheckUtils]: 27: Hoare triple {15566#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15562#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:09:54,393 INFO L290 TraceCheckUtils]: 26: Hoare triple {15570#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15566#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:09:54,398 INFO L290 TraceCheckUtils]: 25: Hoare triple {15574#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15570#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:54,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {15578#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15574#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:09:54,407 INFO L290 TraceCheckUtils]: 23: Hoare triple {15582#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15578#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:54,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {15586#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15582#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:09:54,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {15590#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15586#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:09:54,422 INFO L290 TraceCheckUtils]: 20: Hoare triple {15594#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15590#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:09:54,429 INFO L290 TraceCheckUtils]: 19: Hoare triple {15598#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15594#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:09:54,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {15602#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15598#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:09:54,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {15606#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15602#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:09:54,444 INFO L290 TraceCheckUtils]: 16: Hoare triple {15610#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15606#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:09:54,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {15614#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15610#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:09:54,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {15618#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15614#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:09:54,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {15622#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15618#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:09:54,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {15626#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15622#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:09:54,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {15630#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15626#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:54,477 INFO L290 TraceCheckUtils]: 10: Hoare triple {15634#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15630#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:09:54,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {15638#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15634#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 13:09:54,484 INFO L290 TraceCheckUtils]: 8: Hoare triple {15642#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {15638#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 13:09:54,485 INFO L290 TraceCheckUtils]: 7: Hoare triple {15646#(or (< main_~x~0 1000000) (< (+ 23 main_~z~0) main_~y~0))} [97] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {15642#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:54,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {15642#(< (+ 23 main_~z~0) main_~y~0)} [98] L10-2-->L17-1_primed: Formula: (let ((.cse0 (= |v_main_#t~post4_In_20| |v_main_#t~post4_Out_42|))) (or (and .cse0 (= v_main_~y~0_In_20 v_main_~y~0_Out_40) (= v_main_~x~0_In_21 v_main_~x~0_Out_42)) (let ((.cse1 (div (+ v_main_~y~0_Out_40 (* (- 1) v_main_~y~0_In_20)) 2))) (and .cse0 (= (mod (+ v_main_~y~0_Out_40 v_main_~y~0_In_20) 2) 0) (<= (+ v_main_~x~0_In_21 (* 2 .cse1)) v_main_~x~0_Out_42) (<= 0 .cse1) (or (< v_main_~x~0_Out_42 50001) (and (not (< v_main_~x~0_Out_42 50002)) (< v_main_~x~0_Out_42 1000002))))))) InVars {main_#t~post4=|v_main_#t~post4_In_20|, main_~y~0=v_main_~y~0_In_20, main_~x~0=v_main_~x~0_In_21} OutVars{main_#t~post4=|v_main_#t~post4_Out_42|, main_~y~0=v_main_~y~0_Out_40, main_~x~0=v_main_~x~0_Out_42} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {15646#(or (< main_~x~0 1000000) (< (+ 23 main_~z~0) main_~y~0))} is VALID [2022-04-15 13:09:54,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {15374#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {15642#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:09:54,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {15374#true} call #t~ret7 := main(); {15374#true} is VALID [2022-04-15 13:09:54,492 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15374#true} {15374#true} #52#return; {15374#true} is VALID [2022-04-15 13:09:54,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {15374#true} assume true; {15374#true} is VALID [2022-04-15 13:09:54,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {15374#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); {15374#true} is VALID [2022-04-15 13:09:54,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {15374#true} call ULTIMATE.init(); {15374#true} is VALID [2022-04-15 13:09:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:09:54,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137427591] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:09:54,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:09:54,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 27] total 78 [2022-04-15 13:09:56,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:09:56,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1193261153] [2022-04-15 13:09:56,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1193261153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:09:56,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:09:56,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 13:09:56,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883164470] [2022-04-15 13:09:56,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:09:56,158 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 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 91 [2022-04-15 13:09:56,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:09:56,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:09:56,876 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:09:56,876 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 13:09:56,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:09:56,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 13:09:56,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4812, Invalid=6530, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 13:09:56,878 INFO L87 Difference]: Start difference. First operand 144 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:29,972 INFO L93 Difference]: Finished difference Result 287 states and 306 transitions. [2022-04-15 13:10:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 13:10:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 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 91 [2022-04-15 13:10:29,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:10:29,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:29,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 115 transitions. [2022-04-15 13:10:29,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 115 transitions. [2022-04-15 13:10:29,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 115 transitions. [2022-04-15 13:10:30,727 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-15 13:10:30,729 INFO L225 Difference]: With dead ends: 287 [2022-04-15 13:10:30,729 INFO L226 Difference]: Without dead ends: 151 [2022-04-15 13:10:30,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6868 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=9373, Invalid=16067, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 13:10:30,731 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 224 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 1703 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2022-04-15 13:10:30,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 29 Invalid, 1988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1703 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2022-04-15 13:10:30,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-04-15 13:10:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 97. [2022-04-15 13:10:31,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:10:31,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:31,116 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:31,116 INFO L87 Difference]: Start difference. First operand 151 states. Second operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:31,118 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2022-04-15 13:10:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2022-04-15 13:10:31,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:31,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:31,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-15 13:10:31,118 INFO L87 Difference]: Start difference. First operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 151 states. [2022-04-15 13:10:31,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:10:31,120 INFO L93 Difference]: Finished difference Result 151 states and 155 transitions. [2022-04-15 13:10:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 155 transitions. [2022-04-15 13:10:31,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:10:31,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:10:31,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:10:31,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:10:31,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 92 states have (on average 1.0434782608695652) internal successors, (96), 92 states have internal predecessors, (96), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2022-04-15 13:10:31,122 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 91 [2022-04-15 13:10:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:10:31,122 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2022-04-15 13:10:31,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 1.5535714285714286) internal successors, (87), 55 states have internal predecessors, (87), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:10:31,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 100 transitions. [2022-04-15 13:10:32,012 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-15 13:10:32,012 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2022-04-15 13:10:32,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 13:10:32,012 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:10:32,012 INFO L499 BasicCegarLoop]: trace histogram [30, 29, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:10:32,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 13:10:32,213 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 13:10:32,213 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:10:32,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:10:32,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1462513931, now seen corresponding path program 21 times [2022-04-15 13:10:32,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:10:32,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [686716529] [2022-04-15 13:10:34,626 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation OVERAPPROXIMATION [2022-04-15 13:10:34,628 INFO L85 PathProgramCache]: Analyzing trace with hash -285160480, now seen corresponding path program 1 times [2022-04-15 13:10:34,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 13:10:34,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16413613] [2022-04-15 13:10:34,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:34,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 13:10:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:35,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 13:10:35,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:35,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {16905#(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); {16875#true} is VALID [2022-04-15 13:10:35,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {16875#true} assume true; {16875#true} is VALID [2022-04-15 13:10:35,501 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16875#true} {16875#true} #52#return; {16875#true} is VALID [2022-04-15 13:10:35,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {16875#true} call ULTIMATE.init(); {16905#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 13:10:35,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {16905#(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); {16875#true} is VALID [2022-04-15 13:10:35,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {16875#true} assume true; {16875#true} is VALID [2022-04-15 13:10:35,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16875#true} {16875#true} #52#return; {16875#true} is VALID [2022-04-15 13:10:35,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {16875#true} call #t~ret7 := main(); {16875#true} is VALID [2022-04-15 13:10:35,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {16875#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:10:35,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [100] L10-2-->L17-1_primed: Formula: (or (and (= |v_main_#t~post4_In_21| |v_main_#t~post4_Out_44|) (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (let ((.cse1 (* v_main_~y~0_Out_42 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_In_21) .cse1) 8))) (and (<= (+ v_main_~x~0_In_22 (* 2 .cse0)) v_main_~x~0_Out_44) (= (mod (+ .cse1 (* v_main_~y~0_In_21 4)) 8) 0) (or (< v_main_~x~0_Out_44 50001) (and (not (< v_main_~x~0_Out_44 50002)) (< v_main_~x~0_Out_44 1000002))) (<= 0 .cse0) (= (* |v_main_#t~post4_In_21| 8) (* 8 |v_main_#t~post4_Out_44|)))))) InVars {main_#t~post4=|v_main_#t~post4_In_21|, main_~y~0=v_main_~y~0_In_21, main_~x~0=v_main_~x~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_44|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:10:35,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:10:35,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {16880#(and (= main_~z~0 0) (<= 50000 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16881#(and (= main_~z~0 0) (<= 49999 main_~y~0))} is VALID [2022-04-15 13:10:35,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {16881#(and (= main_~z~0 0) (<= 49999 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16882#(and (<= 49998 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:10:35,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {16882#(and (<= 49998 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16883#(and (= main_~z~0 0) (<= 49997 main_~y~0))} is VALID [2022-04-15 13:10:35,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {16883#(and (= main_~z~0 0) (<= 49997 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16884#(and (= main_~z~0 0) (<= 49996 main_~y~0))} is VALID [2022-04-15 13:10:35,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {16884#(and (= main_~z~0 0) (<= 49996 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16885#(and (= main_~z~0 0) (<= 49995 main_~y~0))} is VALID [2022-04-15 13:10:35,567 INFO L290 TraceCheckUtils]: 13: Hoare triple {16885#(and (= main_~z~0 0) (<= 49995 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16886#(and (= main_~z~0 0) (<= 49994 main_~y~0))} is VALID [2022-04-15 13:10:35,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {16886#(and (= main_~z~0 0) (<= 49994 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16887#(and (= main_~z~0 0) (<= 49993 main_~y~0))} is VALID [2022-04-15 13:10:35,582 INFO L290 TraceCheckUtils]: 15: Hoare triple {16887#(and (= main_~z~0 0) (<= 49993 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16888#(and (= main_~z~0 0) (<= 49992 main_~y~0))} is VALID [2022-04-15 13:10:35,595 INFO L290 TraceCheckUtils]: 16: Hoare triple {16888#(and (= main_~z~0 0) (<= 49992 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16889#(and (= main_~z~0 0) (<= 49991 main_~y~0))} is VALID [2022-04-15 13:10:35,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {16889#(and (= main_~z~0 0) (<= 49991 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16890#(and (<= 49990 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:10:35,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {16890#(and (<= 49990 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16891#(and (= main_~z~0 0) (<= 49989 main_~y~0))} is VALID [2022-04-15 13:10:35,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {16891#(and (= main_~z~0 0) (<= 49989 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16892#(and (= main_~z~0 0) (<= 49988 main_~y~0))} is VALID [2022-04-15 13:10:35,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {16892#(and (= main_~z~0 0) (<= 49988 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16893#(and (= main_~z~0 0) (<= 49987 main_~y~0))} is VALID [2022-04-15 13:10:35,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {16893#(and (= main_~z~0 0) (<= 49987 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16894#(and (= main_~z~0 0) (<= 49986 main_~y~0))} is VALID [2022-04-15 13:10:35,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {16894#(and (= main_~z~0 0) (<= 49986 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16895#(and (= main_~z~0 0) (<= 49985 main_~y~0))} is VALID [2022-04-15 13:10:35,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {16895#(and (= main_~z~0 0) (<= 49985 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16896#(and (= main_~z~0 0) (<= 49984 main_~y~0))} is VALID [2022-04-15 13:10:35,664 INFO L290 TraceCheckUtils]: 24: Hoare triple {16896#(and (= main_~z~0 0) (<= 49984 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16897#(and (= main_~z~0 0) (<= 49983 main_~y~0))} is VALID [2022-04-15 13:10:35,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {16897#(and (= main_~z~0 0) (<= 49983 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16898#(and (= main_~z~0 0) (<= 49982 main_~y~0))} is VALID [2022-04-15 13:10:35,667 INFO L290 TraceCheckUtils]: 26: Hoare triple {16898#(and (= main_~z~0 0) (<= 49982 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16899#(and (<= 49981 main_~y~0) (= main_~z~0 0))} is VALID [2022-04-15 13:10:35,668 INFO L290 TraceCheckUtils]: 27: Hoare triple {16899#(and (<= 49981 main_~y~0) (= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16900#(and (= main_~z~0 0) (<= 49980 main_~y~0))} is VALID [2022-04-15 13:10:35,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {16900#(and (= main_~z~0 0) (<= 49980 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16901#(and (= main_~z~0 0) (<= 49979 main_~y~0))} is VALID [2022-04-15 13:10:35,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {16901#(and (= main_~z~0 0) (<= 49979 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16902#(and (= main_~z~0 0) (<= 49978 main_~y~0))} is VALID [2022-04-15 13:10:35,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {16902#(and (= main_~z~0 0) (<= 49978 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16903#(and (= main_~z~0 0) (<= 49977 main_~y~0))} is VALID [2022-04-15 13:10:35,695 INFO L290 TraceCheckUtils]: 31: Hoare triple {16903#(and (= main_~z~0 0) (<= 49977 main_~y~0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16904#(and (= main_~z~0 0) (<= 49976 main_~y~0))} is VALID [2022-04-15 13:10:35,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {16904#(and (= main_~z~0 0) (<= 49976 main_~y~0))} assume !(~y~0 > ~z~0); {16876#false} is VALID [2022-04-15 13:10:35,696 INFO L272 TraceCheckUtils]: 33: Hoare triple {16876#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {16876#false} is VALID [2022-04-15 13:10:35,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {16876#false} ~cond := #in~cond; {16876#false} is VALID [2022-04-15 13:10:35,696 INFO L290 TraceCheckUtils]: 35: Hoare triple {16876#false} assume 0 == ~cond; {16876#false} is VALID [2022-04-15 13:10:35,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {16876#false} assume !false; {16876#false} is VALID [2022-04-15 13:10:35,697 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:10:35,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 13:10:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16413613] [2022-04-15 13:10:35,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16413613] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 13:10:35,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742457176] [2022-04-15 13:10:35,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 13:10:35,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 13:10:35,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 13:10:35,698 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 13:10:35,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 13:10:35,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:35,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 13:10:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 13:10:35,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 13:11:13,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {16875#true} call ULTIMATE.init(); {16875#true} is VALID [2022-04-15 13:11:13,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {16875#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); {16875#true} is VALID [2022-04-15 13:11:13,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {16875#true} assume true; {16875#true} is VALID [2022-04-15 13:11:13,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16875#true} {16875#true} #52#return; {16875#true} is VALID [2022-04-15 13:11:13,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {16875#true} call #t~ret7 := main(); {16875#true} is VALID [2022-04-15 13:11:13,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {16875#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {16924#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} is VALID [2022-04-15 13:11:13,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {16924#(and (<= main_~z~0 0) (<= main_~x~0 0) (<= 50000 main_~y~0))} [100] L10-2-->L17-1_primed: Formula: (or (and (= |v_main_#t~post4_In_21| |v_main_#t~post4_Out_44|) (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (let ((.cse1 (* v_main_~y~0_Out_42 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_In_21) .cse1) 8))) (and (<= (+ v_main_~x~0_In_22 (* 2 .cse0)) v_main_~x~0_Out_44) (= (mod (+ .cse1 (* v_main_~y~0_In_21 4)) 8) 0) (or (< v_main_~x~0_Out_44 50001) (and (not (< v_main_~x~0_Out_44 50002)) (< v_main_~x~0_Out_44 1000002))) (<= 0 .cse0) (= (* |v_main_#t~post4_In_21| 8) (* 8 |v_main_#t~post4_Out_44|)))))) InVars {main_#t~post4=|v_main_#t~post4_In_21|, main_~y~0=v_main_~y~0_In_21, main_~x~0=v_main_~x~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_44|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {16928#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_926 Int)) (and (<= 0 (div (+ (* v_main_~y~0_926 (- 4)) (* main_~y~0 4)) 8)) (= (mod (+ (* v_main_~y~0_926 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_926))))} is VALID [2022-04-15 13:11:13,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {16928#(and (<= main_~z~0 0) (or (< main_~x~0 50001) (and (< main_~x~0 1000002) (not (< main_~x~0 50002)))) (exists ((v_main_~y~0_926 Int)) (and (<= 0 (div (+ (* v_main_~y~0_926 (- 4)) (* main_~y~0 4)) 8)) (= (mod (+ (* v_main_~y~0_926 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_926))))} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {16932#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int)) (and (<= 0 (div (+ (* v_main_~y~0_926 (- 4)) (* main_~y~0 4)) 8)) (= (mod (+ (* v_main_~y~0_926 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_926))))} is VALID [2022-04-15 13:11:13,517 INFO L290 TraceCheckUtils]: 8: Hoare triple {16932#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int)) (and (<= 0 (div (+ (* v_main_~y~0_926 (- 4)) (* main_~y~0 4)) 8)) (= (mod (+ (* v_main_~y~0_926 4) (* main_~y~0 4)) 8) 0) (<= 50000 v_main_~y~0_926))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16936#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {16936#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 1)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16940#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {16940#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 2)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16944#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 3)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {16944#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 3)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16948#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,598 INFO L290 TraceCheckUtils]: 12: Hoare triple {16948#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 4)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16952#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {16952#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ 5 main_~y~0)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16956#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 6)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,655 INFO L290 TraceCheckUtils]: 14: Hoare triple {16956#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 6)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16960#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 7 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {16960#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 7 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16964#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {16964#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 8)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16968#(and (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 9)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))) (<= main_~z~0 0))} is VALID [2022-04-15 13:11:13,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {16968#(and (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 9)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))) (<= main_~z~0 0))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16972#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 10)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {16972#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 10)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16976#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {16976#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 11)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16980#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 12)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {16980#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 12)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16984#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {16984#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 13)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16988#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 14)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {16988#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 14)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16992#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {16992#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 15)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {16996#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {16996#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 16)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17000#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {17000#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 17)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17004#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 18)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {17004#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 18)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17008#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 19 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,933 INFO L290 TraceCheckUtils]: 27: Hoare triple {17008#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 19 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17012#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 20)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {17012#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ main_~y~0 20)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17016#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 21)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:13,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {17016#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 21)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17020#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= v_main_~y~0_927 (+ main_~y~0 22)) (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:14,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {17020#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= v_main_~y~0_927 (+ main_~y~0 22)) (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17024#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 23 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:14,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {17024#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= 50000 v_main_~y~0_926) (<= v_main_~y~0_927 (+ 23 main_~y~0)) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17028#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 24)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} is VALID [2022-04-15 13:11:14,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {17028#(and (<= main_~z~0 0) (exists ((v_main_~y~0_926 Int) (v_main_~y~0_927 Int)) (and (<= 0 (div (+ (* v_main_~y~0_927 4) (* v_main_~y~0_926 (- 4))) 8)) (<= v_main_~y~0_927 (+ main_~y~0 24)) (<= 50000 v_main_~y~0_926) (= (mod (+ (* v_main_~y~0_926 4) (* v_main_~y~0_927 4)) 8) 0))))} assume !(~y~0 > ~z~0); {16876#false} is VALID [2022-04-15 13:11:14,052 INFO L272 TraceCheckUtils]: 33: Hoare triple {16876#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {16876#false} is VALID [2022-04-15 13:11:14,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {16876#false} ~cond := #in~cond; {16876#false} is VALID [2022-04-15 13:11:14,053 INFO L290 TraceCheckUtils]: 35: Hoare triple {16876#false} assume 0 == ~cond; {16876#false} is VALID [2022-04-15 13:11:14,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {16876#false} assume !false; {16876#false} is VALID [2022-04-15 13:11:14,053 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:11:14,053 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 13:12:39,489 INFO L290 TraceCheckUtils]: 36: Hoare triple {16876#false} assume !false; {16876#false} is VALID [2022-04-15 13:12:39,490 INFO L290 TraceCheckUtils]: 35: Hoare triple {16876#false} assume 0 == ~cond; {16876#false} is VALID [2022-04-15 13:12:39,490 INFO L290 TraceCheckUtils]: 34: Hoare triple {16876#false} ~cond := #in~cond; {16876#false} is VALID [2022-04-15 13:12:39,490 INFO L272 TraceCheckUtils]: 33: Hoare triple {16876#false} call __VERIFIER_assert((if 0 == (if ~x~0 < 0 && 0 != ~x~0 % 2 then ~x~0 % 2 - 2 else ~x~0 % 2) then 1 else 0)); {16876#false} is VALID [2022-04-15 13:12:39,490 INFO L290 TraceCheckUtils]: 32: Hoare triple {17056#(< main_~z~0 main_~y~0)} assume !(~y~0 > ~z~0); {16876#false} is VALID [2022-04-15 13:12:39,507 INFO L290 TraceCheckUtils]: 31: Hoare triple {17060#(< (+ main_~z~0 1) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17056#(< main_~z~0 main_~y~0)} is VALID [2022-04-15 13:12:39,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {17064#(< (+ main_~z~0 2) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17060#(< (+ main_~z~0 1) main_~y~0)} is VALID [2022-04-15 13:12:39,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {17068#(< (+ main_~z~0 3) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17064#(< (+ main_~z~0 2) main_~y~0)} is VALID [2022-04-15 13:12:39,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {17072#(< (+ main_~z~0 4) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17068#(< (+ main_~z~0 3) main_~y~0)} is VALID [2022-04-15 13:12:39,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {17076#(< (+ 5 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17072#(< (+ main_~z~0 4) main_~y~0)} is VALID [2022-04-15 13:12:39,585 INFO L290 TraceCheckUtils]: 26: Hoare triple {17080#(< (+ main_~z~0 6) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17076#(< (+ 5 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:12:39,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {17084#(< (+ 7 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17080#(< (+ main_~z~0 6) main_~y~0)} is VALID [2022-04-15 13:12:39,617 INFO L290 TraceCheckUtils]: 24: Hoare triple {17088#(< (+ main_~z~0 8) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17084#(< (+ 7 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:12:39,634 INFO L290 TraceCheckUtils]: 23: Hoare triple {17092#(< (+ main_~z~0 9) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17088#(< (+ main_~z~0 8) main_~y~0)} is VALID [2022-04-15 13:12:39,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {17096#(< (+ main_~z~0 10) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17092#(< (+ main_~z~0 9) main_~y~0)} is VALID [2022-04-15 13:12:39,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {17100#(< (+ main_~z~0 11) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17096#(< (+ main_~z~0 10) main_~y~0)} is VALID [2022-04-15 13:12:39,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {17104#(< (+ main_~z~0 12) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17100#(< (+ main_~z~0 11) main_~y~0)} is VALID [2022-04-15 13:12:39,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {17108#(< (+ main_~z~0 13) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17104#(< (+ main_~z~0 12) main_~y~0)} is VALID [2022-04-15 13:12:39,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {17112#(< (+ main_~z~0 14) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17108#(< (+ main_~z~0 13) main_~y~0)} is VALID [2022-04-15 13:12:39,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {17116#(< (+ main_~z~0 15) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17112#(< (+ main_~z~0 14) main_~y~0)} is VALID [2022-04-15 13:12:39,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {17120#(< (+ main_~z~0 16) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17116#(< (+ main_~z~0 15) main_~y~0)} is VALID [2022-04-15 13:12:39,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {17124#(< (+ main_~z~0 17) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17120#(< (+ main_~z~0 16) main_~y~0)} is VALID [2022-04-15 13:12:39,786 INFO L290 TraceCheckUtils]: 14: Hoare triple {17128#(< (+ main_~z~0 18) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17124#(< (+ main_~z~0 17) main_~y~0)} is VALID [2022-04-15 13:12:39,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {17132#(< (+ 19 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17128#(< (+ main_~z~0 18) main_~y~0)} is VALID [2022-04-15 13:12:39,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {17136#(< (+ main_~z~0 20) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17132#(< (+ 19 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:12:39,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {17140#(< (+ main_~z~0 21) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17136#(< (+ main_~z~0 20) main_~y~0)} is VALID [2022-04-15 13:12:39,851 INFO L290 TraceCheckUtils]: 10: Hoare triple {17144#(< (+ main_~z~0 22) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17140#(< (+ main_~z~0 21) main_~y~0)} is VALID [2022-04-15 13:12:39,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {17148#(< (+ 23 main_~z~0) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17144#(< (+ main_~z~0 22) main_~y~0)} is VALID [2022-04-15 13:12:39,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {17152#(< (+ main_~z~0 24) main_~y~0)} assume !!(~y~0 > ~z~0);#t~post5 := ~y~0;~y~0 := #t~post5 - 1;havoc #t~post5;#t~post6 := ~x~0;~x~0 := #t~post6 - 1;havoc #t~post6; {17148#(< (+ 23 main_~z~0) main_~y~0)} is VALID [2022-04-15 13:12:39,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {17156#(or (< main_~x~0 1000000) (< (+ main_~z~0 24) main_~y~0))} [99] L17-1_primed-->L17-1: Formula: (not (< v_main_~x~0_11 1000000)) InVars {main_~x~0=v_main_~x~0_11} OutVars{main_~x~0=v_main_~x~0_11} AuxVars[] AssignedVars[] {17152#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-15 13:12:39,888 INFO L290 TraceCheckUtils]: 6: Hoare triple {17152#(< (+ main_~z~0 24) main_~y~0)} [100] L10-2-->L17-1_primed: Formula: (or (and (= |v_main_#t~post4_In_21| |v_main_#t~post4_Out_44|) (= v_main_~y~0_In_21 v_main_~y~0_Out_42) (= v_main_~x~0_In_22 v_main_~x~0_Out_44)) (let ((.cse1 (* v_main_~y~0_Out_42 4))) (let ((.cse0 (div (+ (* (- 4) v_main_~y~0_In_21) .cse1) 8))) (and (<= (+ v_main_~x~0_In_22 (* 2 .cse0)) v_main_~x~0_Out_44) (= (mod (+ .cse1 (* v_main_~y~0_In_21 4)) 8) 0) (or (< v_main_~x~0_Out_44 50001) (and (not (< v_main_~x~0_Out_44 50002)) (< v_main_~x~0_Out_44 1000002))) (<= 0 .cse0) (= (* |v_main_#t~post4_In_21| 8) (* 8 |v_main_#t~post4_Out_44|)))))) InVars {main_#t~post4=|v_main_#t~post4_In_21|, main_~y~0=v_main_~y~0_In_21, main_~x~0=v_main_~x~0_In_22} OutVars{main_#t~post4=|v_main_#t~post4_Out_44|, main_~y~0=v_main_~y~0_Out_42, main_~x~0=v_main_~x~0_Out_44} AuxVars[] AssignedVars[main_~x~0, main_#t~post4, main_~y~0] {17156#(or (< main_~x~0 1000000) (< (+ main_~z~0 24) main_~y~0))} is VALID [2022-04-15 13:12:39,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {16875#true} ~x~0 := 0;~y~0 := 50000;~z~0 := 0;~x~0 := 0; {17152#(< (+ main_~z~0 24) main_~y~0)} is VALID [2022-04-15 13:12:39,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {16875#true} call #t~ret7 := main(); {16875#true} is VALID [2022-04-15 13:12:39,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16875#true} {16875#true} #52#return; {16875#true} is VALID [2022-04-15 13:12:39,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {16875#true} assume true; {16875#true} is VALID [2022-04-15 13:12:39,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {16875#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); {16875#true} is VALID [2022-04-15 13:12:39,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {16875#true} call ULTIMATE.init(); {16875#true} is VALID [2022-04-15 13:12:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 13:12:39,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742457176] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 13:12:39,889 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 13:12:39,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 28] total 81 [2022-04-15 13:12:41,893 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 13:12:41,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [686716529] [2022-04-15 13:12:41,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [686716529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 13:12:41,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 13:12:41,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 13:12:41,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794754928] [2022-04-15 13:12:41,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 13:12:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 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 96 [2022-04-15 13:12:41,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 13:12:41,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:12:42,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:12:42,758 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 13:12:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 13:12:42,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 13:12:42,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5266, Invalid=7166, Unknown=0, NotChecked=0, Total=12432 [2022-04-15 13:12:42,760 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:24,220 INFO L93 Difference]: Finished difference Result 191 states and 202 transitions. [2022-04-15 13:13:24,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 13:13:24,221 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 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 96 [2022-04-15 13:13:24,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 13:13:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 118 transitions. [2022-04-15 13:13:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:24,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 118 transitions. [2022-04-15 13:13:24,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 118 transitions. [2022-04-15 13:13:25,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:25,311 INFO L225 Difference]: With dead ends: 191 [2022-04-15 13:13:25,311 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 13:13:25,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7637 ImplicationChecksByTransitivity, 119.7s TimeCoverageRelationStatistics Valid=10286, Invalid=17770, Unknown=0, NotChecked=0, Total=28056 [2022-04-15 13:13:25,313 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 138 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-04-15 13:13:25,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [138 Valid, 34 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2022-04-15 13:13:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 13:13:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-04-15 13:13:25,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 13:13:25,722 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,722 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,722 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:25,723 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 13:13:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 13:13:25,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:25,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:25,724 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 13:13:25,724 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 102 states. [2022-04-15 13:13:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 13:13:25,725 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2022-04-15 13:13:25,725 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 13:13:25,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 13:13:25,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 13:13:25,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 13:13:25,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 13:13:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.041237113402062) internal successors, (101), 97 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2022-04-15 13:13:25,727 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 96 [2022-04-15 13:13:25,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 13:13:25,727 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2022-04-15 13:13:25,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 58 states have internal predecessors, (92), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 13:13:25,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 105 transitions. [2022-04-15 13:13:26,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 13:13:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2022-04-15 13:13:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 13:13:26,799 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 13:13:26,799 INFO L499 BasicCegarLoop]: trace histogram [32, 31, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 13:13:26,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 13:13:27,000 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-04-15 13:13:27,000 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 13:13:27,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 13:13:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash -909783250, now seen corresponding path program 22 times [2022-04-15 13:13:27,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 13:13:27,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1041654004]